./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/systemc/token_ring.05.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml', '-i', '../sv-benchmarks/c/systemc/token_ring.05.cil-1.c', '-s', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf', '--cacsl2boogietranslator.entry.function', 'main', '--witnessprinter.witness.directory', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux', '--witnessprinter.witness.filename', 'witness', '--witnessprinter.write.witness.besides.input.file', 'false', '--witnessprinter.graph.data.specification', 'CHECK( init(main()), LTL(G ! call(reach_error())) )\n\n', '--witnessprinter.graph.data.producer', 'Automizer', '--witnessprinter.graph.data.architecture', '32bit', '--witnessprinter.graph.data.programhash', 'a75784c0f203c4a6f14019aef9d9a89ba63a0efbe594dc5cdecfb5d06e7619f2'] Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/systemc/token_ring.05.cil-1.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a75784c0f203c4a6f14019aef9d9a89ba63a0efbe594dc5cdecfb5d06e7619f2 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-06 23:57:49,251 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-06 23:57:49,355 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-06 23:57:49,363 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-06 23:57:49,363 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-06 23:57:49,387 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-06 23:57:49,388 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-06 23:57:49,388 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-06 23:57:49,388 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-06 23:57:49,389 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-06 23:57:49,389 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-06 23:57:49,389 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-06 23:57:49,389 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-06 23:57:49,389 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-06 23:57:49,389 INFO L153 SettingsManager]: * Use SBE=true [2024-11-06 23:57:49,390 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-06 23:57:49,390 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-06 23:57:49,390 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-06 23:57:49,390 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-06 23:57:49,390 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-06 23:57:49,390 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-06 23:57:49,390 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-06 23:57:49,390 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-06 23:57:49,390 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-06 23:57:49,390 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-06 23:57:49,390 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-06 23:57:49,390 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-06 23:57:49,390 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-06 23:57:49,390 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-06 23:57:49,391 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-06 23:57:49,391 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-06 23:57:49,391 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-06 23:57:49,391 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 23:57:49,391 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-06 23:57:49,391 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-06 23:57:49,391 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-06 23:57:49,391 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-06 23:57:49,391 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-06 23:57:49,391 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-06 23:57:49,391 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-06 23:57:49,391 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-06 23:57:49,391 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-06 23:57:49,391 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a75784c0f203c4a6f14019aef9d9a89ba63a0efbe594dc5cdecfb5d06e7619f2 [2024-11-06 23:57:49,637 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-06 23:57:49,644 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-06 23:57:49,646 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-06 23:57:49,647 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-06 23:57:49,647 INFO L274 PluginConnector]: CDTParser initialized [2024-11-06 23:57:49,648 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/token_ring.05.cil-1.c [2024-11-06 23:57:51,009 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-06 23:57:51,217 INFO L384 CDTParser]: Found 1 translation units. [2024-11-06 23:57:51,218 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.05.cil-1.c [2024-11-06 23:57:51,232 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f715ec9c3/785a42be64e94b949b4cc5de7031abc5/FLAGcdd0b49a3 [2024-11-06 23:57:51,247 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f715ec9c3/785a42be64e94b949b4cc5de7031abc5 [2024-11-06 23:57:51,249 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-06 23:57:51,250 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-06 23:57:51,252 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-06 23:57:51,252 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-06 23:57:51,261 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-06 23:57:51,261 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 11:57:51" (1/1) ... [2024-11-06 23:57:51,262 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a0748b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:57:51, skipping insertion in model container [2024-11-06 23:57:51,262 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 11:57:51" (1/1) ... [2024-11-06 23:57:51,296 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-06 23:57:51,423 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.05.cil-1.c[671,684] [2024-11-06 23:57:51,523 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 23:57:51,539 INFO L200 MainTranslator]: Completed pre-run [2024-11-06 23:57:51,548 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/systemc/token_ring.05.cil-1.c[671,684] [2024-11-06 23:57:51,592 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 23:57:51,607 INFO L204 MainTranslator]: Completed translation [2024-11-06 23:57:51,609 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:57:51 WrapperNode [2024-11-06 23:57:51,610 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-06 23:57:51,611 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-06 23:57:51,611 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-06 23:57:51,611 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-06 23:57:51,617 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:57:51" (1/1) ... [2024-11-06 23:57:51,624 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:57:51" (1/1) ... [2024-11-06 23:57:51,649 INFO L138 Inliner]: procedures = 38, calls = 46, calls flagged for inlining = 22, calls inlined = 22, statements flattened = 459 [2024-11-06 23:57:51,649 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-06 23:57:51,649 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-06 23:57:51,650 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-06 23:57:51,650 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-06 23:57:51,660 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:57:51" (1/1) ... [2024-11-06 23:57:51,660 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:57:51" (1/1) ... [2024-11-06 23:57:51,666 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:57:51" (1/1) ... [2024-11-06 23:57:51,677 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-06 23:57:51,678 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:57:51" (1/1) ... [2024-11-06 23:57:51,678 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:57:51" (1/1) ... [2024-11-06 23:57:51,687 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:57:51" (1/1) ... [2024-11-06 23:57:51,693 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:57:51" (1/1) ... [2024-11-06 23:57:51,697 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:57:51" (1/1) ... [2024-11-06 23:57:51,698 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:57:51" (1/1) ... [2024-11-06 23:57:51,700 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-06 23:57:51,702 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-06 23:57:51,702 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-06 23:57:51,702 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-06 23:57:51,703 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:57:51" (1/1) ... [2024-11-06 23:57:51,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 23:57:51,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 23:57:51,732 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-06 23:57:51,739 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-06 23:57:51,758 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-06 23:57:51,758 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2024-11-06 23:57:51,759 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2024-11-06 23:57:51,759 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2024-11-06 23:57:51,759 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2024-11-06 23:57:51,759 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-11-06 23:57:51,759 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-11-06 23:57:51,760 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2024-11-06 23:57:51,760 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2024-11-06 23:57:51,760 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2024-11-06 23:57:51,760 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2024-11-06 23:57:51,760 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-06 23:57:51,760 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2024-11-06 23:57:51,761 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2024-11-06 23:57:51,761 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-06 23:57:51,761 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-06 23:57:51,837 INFO L238 CfgBuilder]: Building ICFG [2024-11-06 23:57:51,839 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-06 23:57:52,320 INFO L? ?]: Removed 55 outVars from TransFormulas that were not future-live. [2024-11-06 23:57:52,320 INFO L287 CfgBuilder]: Performing block encoding [2024-11-06 23:57:52,336 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-06 23:57:52,339 INFO L316 CfgBuilder]: Removed 8 assume(true) statements. [2024-11-06 23:57:52,339 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 11:57:52 BoogieIcfgContainer [2024-11-06 23:57:52,340 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-06 23:57:52,343 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-06 23:57:52,343 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-06 23:57:52,346 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-06 23:57:52,347 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 11:57:51" (1/3) ... [2024-11-06 23:57:52,347 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@557742b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 11:57:52, skipping insertion in model container [2024-11-06 23:57:52,347 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:57:51" (2/3) ... [2024-11-06 23:57:52,347 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@557742b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 11:57:52, skipping insertion in model container [2024-11-06 23:57:52,348 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 11:57:52" (3/3) ... [2024-11-06 23:57:52,348 INFO L112 eAbstractionObserver]: Analyzing ICFG token_ring.05.cil-1.c [2024-11-06 23:57:52,358 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-06 23:57:52,358 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-06 23:57:52,410 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-06 23:57:52,422 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7b895339, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-06 23:57:52,422 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-06 23:57:52,429 INFO L276 IsEmpty]: Start isEmpty. Operand has 213 states, 186 states have (on average 1.6021505376344085) internal successors, (298), 188 states have internal predecessors, (298), 19 states have call successors, (19), 6 states have call predecessors, (19), 6 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-06 23:57:52,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-06 23:57:52,439 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 23:57:52,440 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 23:57:52,441 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 23:57:52,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 23:57:52,446 INFO L85 PathProgramCache]: Analyzing trace with hash -331575046, now seen corresponding path program 1 times [2024-11-06 23:57:52,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 23:57:52,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006459110] [2024-11-06 23:57:52,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 23:57:52,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 23:57:52,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:57:52,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-06 23:57:52,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:57:52,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-06 23:57:52,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:57:53,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-06 23:57:53,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:57:53,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-06 23:57:53,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:57:53,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-06 23:57:53,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:57:53,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 23:57:53,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 23:57:53,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006459110] [2024-11-06 23:57:53,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006459110] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 23:57:53,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 23:57:53,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-06 23:57:53,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538386955] [2024-11-06 23:57:53,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 23:57:53,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-06 23:57:53,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 23:57:53,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-06 23:57:53,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-06 23:57:53,089 INFO L87 Difference]: Start difference. First operand has 213 states, 186 states have (on average 1.6021505376344085) internal successors, (298), 188 states have internal predecessors, (298), 19 states have call successors, (19), 6 states have call predecessors, (19), 6 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 6 states, 6 states have (on average 15.0) internal successors, (90), 4 states have internal predecessors, (90), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-06 23:57:54,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 23:57:54,645 INFO L93 Difference]: Finished difference Result 745 states and 1197 transitions. [2024-11-06 23:57:54,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-06 23:57:54,648 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.0) internal successors, (90), 4 states have internal predecessors, (90), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 100 [2024-11-06 23:57:54,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 23:57:54,664 INFO L225 Difference]: With dead ends: 745 [2024-11-06 23:57:54,664 INFO L226 Difference]: Without dead ends: 537 [2024-11-06 23:57:54,669 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-06 23:57:54,673 INFO L432 NwaCegarLoop]: 188 mSDtfsCounter, 767 mSDsluCounter, 557 mSDsCounter, 0 mSdLazyCounter, 1090 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 779 SdHoareTripleChecker+Valid, 745 SdHoareTripleChecker+Invalid, 1170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 1090 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-06 23:57:54,674 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [779 Valid, 745 Invalid, 1170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 1090 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-06 23:57:54,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2024-11-06 23:57:54,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 408. [2024-11-06 23:57:54,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 408 states, 361 states have (on average 1.5263157894736843) internal successors, (551), 363 states have internal predecessors, (551), 33 states have call successors, (33), 12 states have call predecessors, (33), 13 states have return successors, (36), 33 states have call predecessors, (36), 33 states have call successors, (36) [2024-11-06 23:57:54,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 620 transitions. [2024-11-06 23:57:54,766 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 620 transitions. Word has length 100 [2024-11-06 23:57:54,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 23:57:54,766 INFO L471 AbstractCegarLoop]: Abstraction has 408 states and 620 transitions. [2024-11-06 23:57:54,767 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.0) internal successors, (90), 4 states have internal predecessors, (90), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-06 23:57:54,767 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 620 transitions. [2024-11-06 23:57:54,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-06 23:57:54,770 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 23:57:54,770 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 23:57:54,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-06 23:57:54,771 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 23:57:54,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 23:57:54,771 INFO L85 PathProgramCache]: Analyzing trace with hash -2048459650, now seen corresponding path program 1 times [2024-11-06 23:57:54,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 23:57:54,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790613708] [2024-11-06 23:57:54,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 23:57:54,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 23:57:54,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:57:54,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-06 23:57:54,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:57:54,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-06 23:57:54,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:57:55,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-06 23:57:55,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:57:55,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-06 23:57:55,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:57:55,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-06 23:57:55,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:57:55,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 23:57:55,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 23:57:55,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790613708] [2024-11-06 23:57:55,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [790613708] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 23:57:55,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 23:57:55,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-06 23:57:55,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935885849] [2024-11-06 23:57:55,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 23:57:55,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-06 23:57:55,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 23:57:55,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-06 23:57:55,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-06 23:57:55,072 INFO L87 Difference]: Start difference. First operand 408 states and 620 transitions. Second operand has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 5 states have internal predecessors, (90), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-06 23:57:56,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 23:57:56,855 INFO L93 Difference]: Finished difference Result 1202 states and 1856 transitions. [2024-11-06 23:57:56,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-06 23:57:56,855 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 5 states have internal predecessors, (90), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 100 [2024-11-06 23:57:56,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 23:57:56,865 INFO L225 Difference]: With dead ends: 1202 [2024-11-06 23:57:56,865 INFO L226 Difference]: Without dead ends: 807 [2024-11-06 23:57:56,870 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-06 23:57:56,871 INFO L432 NwaCegarLoop]: 312 mSDtfsCounter, 768 mSDsluCounter, 1033 mSDsCounter, 0 mSdLazyCounter, 1750 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 780 SdHoareTripleChecker+Valid, 1345 SdHoareTripleChecker+Invalid, 1797 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 1750 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-06 23:57:56,872 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [780 Valid, 1345 Invalid, 1797 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 1750 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-06 23:57:56,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 807 states. [2024-11-06 23:57:56,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 807 to 595. [2024-11-06 23:57:56,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 595 states, 527 states have (on average 1.5180265654648957) internal successors, (800), 530 states have internal predecessors, (800), 47 states have call successors, (47), 18 states have call predecessors, (47), 20 states have return successors, (52), 48 states have call predecessors, (52), 47 states have call successors, (52) [2024-11-06 23:57:56,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 899 transitions. [2024-11-06 23:57:56,950 INFO L78 Accepts]: Start accepts. Automaton has 595 states and 899 transitions. Word has length 100 [2024-11-06 23:57:56,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 23:57:56,951 INFO L471 AbstractCegarLoop]: Abstraction has 595 states and 899 transitions. [2024-11-06 23:57:56,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 5 states have internal predecessors, (90), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-06 23:57:56,951 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 899 transitions. [2024-11-06 23:57:56,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-06 23:57:56,954 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 23:57:56,955 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 23:57:56,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-06 23:57:56,955 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 23:57:56,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 23:57:56,955 INFO L85 PathProgramCache]: Analyzing trace with hash 367376700, now seen corresponding path program 1 times [2024-11-06 23:57:56,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 23:57:56,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245062527] [2024-11-06 23:57:56,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 23:57:56,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 23:57:56,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:57:57,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-06 23:57:57,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:57:57,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-06 23:57:57,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:57:57,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-06 23:57:57,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:57:57,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-06 23:57:57,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:57:57,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-06 23:57:57,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:57:57,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 23:57:57,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 23:57:57,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245062527] [2024-11-06 23:57:57,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245062527] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 23:57:57,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 23:57:57,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-06 23:57:57,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861378543] [2024-11-06 23:57:57,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 23:57:57,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-06 23:57:57,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 23:57:57,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-06 23:57:57,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-06 23:57:57,187 INFO L87 Difference]: Start difference. First operand 595 states and 899 transitions. Second operand has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 5 states have internal predecessors, (90), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-06 23:57:58,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 23:57:58,881 INFO L93 Difference]: Finished difference Result 1894 states and 2915 transitions. [2024-11-06 23:57:58,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-06 23:57:58,882 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 5 states have internal predecessors, (90), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 100 [2024-11-06 23:57:58,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 23:57:58,889 INFO L225 Difference]: With dead ends: 1894 [2024-11-06 23:57:58,890 INFO L226 Difference]: Without dead ends: 1312 [2024-11-06 23:57:58,891 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-06 23:57:58,892 INFO L432 NwaCegarLoop]: 310 mSDtfsCounter, 766 mSDsluCounter, 1033 mSDsCounter, 0 mSdLazyCounter, 1746 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 778 SdHoareTripleChecker+Valid, 1343 SdHoareTripleChecker+Invalid, 1795 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 1746 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-06 23:57:58,892 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [778 Valid, 1343 Invalid, 1795 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 1746 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-06 23:57:58,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1312 states. [2024-11-06 23:57:58,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1312 to 970. [2024-11-06 23:57:58,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 970 states, 860 states have (on average 1.5104651162790699) internal successors, (1299), 865 states have internal predecessors, (1299), 75 states have call successors, (75), 30 states have call predecessors, (75), 34 states have return successors, (88), 78 states have call predecessors, (88), 75 states have call successors, (88) [2024-11-06 23:57:58,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 970 states to 970 states and 1462 transitions. [2024-11-06 23:57:58,967 INFO L78 Accepts]: Start accepts. Automaton has 970 states and 1462 transitions. Word has length 100 [2024-11-06 23:57:58,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 23:57:58,967 INFO L471 AbstractCegarLoop]: Abstraction has 970 states and 1462 transitions. [2024-11-06 23:57:58,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 5 states have internal predecessors, (90), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-06 23:57:58,968 INFO L276 IsEmpty]: Start isEmpty. Operand 970 states and 1462 transitions. [2024-11-06 23:57:58,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-06 23:57:58,970 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 23:57:58,970 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 23:57:58,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-06 23:57:58,970 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 23:57:58,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 23:57:58,970 INFO L85 PathProgramCache]: Analyzing trace with hash 1692232894, now seen corresponding path program 1 times [2024-11-06 23:57:58,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 23:57:58,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062995735] [2024-11-06 23:57:58,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 23:57:58,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 23:57:58,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:57:59,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-06 23:57:59,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:57:59,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-06 23:57:59,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:57:59,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-06 23:57:59,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:57:59,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-06 23:57:59,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:57:59,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-06 23:57:59,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:57:59,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 23:57:59,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 23:57:59,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062995735] [2024-11-06 23:57:59,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062995735] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 23:57:59,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 23:57:59,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-06 23:57:59,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226042905] [2024-11-06 23:57:59,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 23:57:59,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-06 23:57:59,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 23:57:59,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-06 23:57:59,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-06 23:57:59,203 INFO L87 Difference]: Start difference. First operand 970 states and 1462 transitions. Second operand has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 5 states have internal predecessors, (90), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-06 23:58:00,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 23:58:00,898 INFO L93 Difference]: Finished difference Result 3229 states and 4950 transitions. [2024-11-06 23:58:00,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-06 23:58:00,899 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 5 states have internal predecessors, (90), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 100 [2024-11-06 23:58:00,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 23:58:00,909 INFO L225 Difference]: With dead ends: 3229 [2024-11-06 23:58:00,909 INFO L226 Difference]: Without dead ends: 2272 [2024-11-06 23:58:00,912 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-06 23:58:00,912 INFO L432 NwaCegarLoop]: 310 mSDtfsCounter, 762 mSDsluCounter, 1033 mSDsCounter, 0 mSdLazyCounter, 1737 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 774 SdHoareTripleChecker+Valid, 1343 SdHoareTripleChecker+Invalid, 1786 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 1737 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-06 23:58:00,913 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [774 Valid, 1343 Invalid, 1786 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 1737 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-06 23:58:00,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2272 states. [2024-11-06 23:58:01,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2272 to 1721. [2024-11-06 23:58:01,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1721 states, 1527 states have (on average 1.504256712508186) internal successors, (2297), 1536 states have internal predecessors, (2297), 131 states have call successors, (131), 54 states have call predecessors, (131), 62 states have return successors, (166), 138 states have call predecessors, (166), 131 states have call successors, (166) [2024-11-06 23:58:01,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1721 states to 1721 states and 2594 transitions. [2024-11-06 23:58:01,034 INFO L78 Accepts]: Start accepts. Automaton has 1721 states and 2594 transitions. Word has length 100 [2024-11-06 23:58:01,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 23:58:01,034 INFO L471 AbstractCegarLoop]: Abstraction has 1721 states and 2594 transitions. [2024-11-06 23:58:01,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 5 states have internal predecessors, (90), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-06 23:58:01,035 INFO L276 IsEmpty]: Start isEmpty. Operand 1721 states and 2594 transitions. [2024-11-06 23:58:01,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-06 23:58:01,037 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 23:58:01,037 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 23:58:01,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-06 23:58:01,037 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 23:58:01,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 23:58:01,038 INFO L85 PathProgramCache]: Analyzing trace with hash -1035976452, now seen corresponding path program 1 times [2024-11-06 23:58:01,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 23:58:01,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435750133] [2024-11-06 23:58:01,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 23:58:01,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 23:58:01,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:58:01,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-06 23:58:01,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:58:01,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-06 23:58:01,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:58:01,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-06 23:58:01,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:58:01,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-06 23:58:01,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:58:01,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-06 23:58:01,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:58:01,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 23:58:01,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 23:58:01,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435750133] [2024-11-06 23:58:01,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435750133] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 23:58:01,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 23:58:01,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-06 23:58:01,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940674744] [2024-11-06 23:58:01,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 23:58:01,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-06 23:58:01,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 23:58:01,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-06 23:58:01,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-06 23:58:01,223 INFO L87 Difference]: Start difference. First operand 1721 states and 2594 transitions. Second operand has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 5 states have internal predecessors, (90), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-06 23:58:02,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 23:58:02,847 INFO L93 Difference]: Finished difference Result 5898 states and 9036 transitions. [2024-11-06 23:58:02,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-06 23:58:02,848 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 5 states have internal predecessors, (90), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 100 [2024-11-06 23:58:02,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 23:58:02,867 INFO L225 Difference]: With dead ends: 5898 [2024-11-06 23:58:02,867 INFO L226 Difference]: Without dead ends: 4190 [2024-11-06 23:58:02,873 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-06 23:58:02,874 INFO L432 NwaCegarLoop]: 310 mSDtfsCounter, 764 mSDsluCounter, 1033 mSDsCounter, 0 mSdLazyCounter, 1723 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 776 SdHoareTripleChecker+Valid, 1343 SdHoareTripleChecker+Invalid, 1772 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 1723 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-06 23:58:02,874 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [776 Valid, 1343 Invalid, 1772 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 1723 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-06 23:58:02,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4190 states. [2024-11-06 23:58:03,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4190 to 3228. [2024-11-06 23:58:03,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3228 states, 2866 states have (on average 1.5) internal successors, (4299), 2883 states have internal predecessors, (4299), 243 states have call successors, (243), 102 states have call predecessors, (243), 118 states have return successors, (340), 258 states have call predecessors, (340), 243 states have call successors, (340) [2024-11-06 23:58:03,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3228 states to 3228 states and 4882 transitions. [2024-11-06 23:58:03,086 INFO L78 Accepts]: Start accepts. Automaton has 3228 states and 4882 transitions. Word has length 100 [2024-11-06 23:58:03,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 23:58:03,086 INFO L471 AbstractCegarLoop]: Abstraction has 3228 states and 4882 transitions. [2024-11-06 23:58:03,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 5 states have internal predecessors, (90), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-06 23:58:03,087 INFO L276 IsEmpty]: Start isEmpty. Operand 3228 states and 4882 transitions. [2024-11-06 23:58:03,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-06 23:58:03,090 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 23:58:03,090 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 23:58:03,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-06 23:58:03,091 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 23:58:03,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 23:58:03,091 INFO L85 PathProgramCache]: Analyzing trace with hash -2093814530, now seen corresponding path program 1 times [2024-11-06 23:58:03,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 23:58:03,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302057546] [2024-11-06 23:58:03,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 23:58:03,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 23:58:03,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:58:03,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-06 23:58:03,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:58:03,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-06 23:58:03,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:58:03,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-06 23:58:03,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:58:03,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-06 23:58:03,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:58:03,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-06 23:58:03,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:58:03,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 23:58:03,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 23:58:03,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302057546] [2024-11-06 23:58:03,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302057546] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 23:58:03,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 23:58:03,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-06 23:58:03,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627986108] [2024-11-06 23:58:03,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 23:58:03,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-06 23:58:03,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 23:58:03,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-06 23:58:03,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-06 23:58:03,256 INFO L87 Difference]: Start difference. First operand 3228 states and 4882 transitions. Second operand has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 5 states have internal predecessors, (90), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-06 23:58:04,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 23:58:04,752 INFO L93 Difference]: Finished difference Result 12484 states and 19128 transitions. [2024-11-06 23:58:04,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-06 23:58:04,753 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 5 states have internal predecessors, (90), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 100 [2024-11-06 23:58:04,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 23:58:04,798 INFO L225 Difference]: With dead ends: 12484 [2024-11-06 23:58:04,798 INFO L226 Difference]: Without dead ends: 9269 [2024-11-06 23:58:04,811 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-11-06 23:58:04,812 INFO L432 NwaCegarLoop]: 192 mSDtfsCounter, 1032 mSDsluCounter, 689 mSDsCounter, 0 mSdLazyCounter, 1444 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1050 SdHoareTripleChecker+Valid, 881 SdHoareTripleChecker+Invalid, 1518 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 1444 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-06 23:58:04,813 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1050 Valid, 881 Invalid, 1518 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 1444 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-06 23:58:04,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9269 states. [2024-11-06 23:58:05,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9269 to 6224. [2024-11-06 23:58:05,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6224 states, 5542 states have (on average 1.5018044027426922) internal successors, (8323), 5575 states have internal predecessors, (8323), 451 states have call successors, (451), 198 states have call predecessors, (451), 230 states have return successors, (726), 482 states have call predecessors, (726), 451 states have call successors, (726) [2024-11-06 23:58:05,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6224 states to 6224 states and 9500 transitions. [2024-11-06 23:58:05,238 INFO L78 Accepts]: Start accepts. Automaton has 6224 states and 9500 transitions. Word has length 100 [2024-11-06 23:58:05,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 23:58:05,238 INFO L471 AbstractCegarLoop]: Abstraction has 6224 states and 9500 transitions. [2024-11-06 23:58:05,238 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 5 states have internal predecessors, (90), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-06 23:58:05,238 INFO L276 IsEmpty]: Start isEmpty. Operand 6224 states and 9500 transitions. [2024-11-06 23:58:05,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-06 23:58:05,245 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 23:58:05,245 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 23:58:05,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-06 23:58:05,246 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 23:58:05,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 23:58:05,246 INFO L85 PathProgramCache]: Analyzing trace with hash -1853574784, now seen corresponding path program 1 times [2024-11-06 23:58:05,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 23:58:05,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984377170] [2024-11-06 23:58:05,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 23:58:05,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 23:58:05,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:58:05,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-06 23:58:05,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:58:05,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-06 23:58:05,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:58:05,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-06 23:58:05,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:58:05,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-06 23:58:05,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:58:05,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-06 23:58:05,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:58:05,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 23:58:05,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 23:58:05,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984377170] [2024-11-06 23:58:05,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984377170] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 23:58:05,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 23:58:05,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-06 23:58:05,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291816090] [2024-11-06 23:58:05,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 23:58:05,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-06 23:58:05,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 23:58:05,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-06 23:58:05,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-06 23:58:05,412 INFO L87 Difference]: Start difference. First operand 6224 states and 9500 transitions. Second operand has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 5 states have internal predecessors, (90), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-06 23:58:07,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 23:58:07,739 INFO L93 Difference]: Finished difference Result 23898 states and 36876 transitions. [2024-11-06 23:58:07,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-06 23:58:07,740 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 5 states have internal predecessors, (90), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 100 [2024-11-06 23:58:07,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 23:58:07,820 INFO L225 Difference]: With dead ends: 23898 [2024-11-06 23:58:07,820 INFO L226 Difference]: Without dead ends: 17687 [2024-11-06 23:58:07,844 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-11-06 23:58:07,845 INFO L432 NwaCegarLoop]: 307 mSDtfsCounter, 801 mSDsluCounter, 1022 mSDsCounter, 0 mSdLazyCounter, 1984 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 812 SdHoareTripleChecker+Valid, 1329 SdHoareTripleChecker+Invalid, 2035 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 1984 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-06 23:58:07,846 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [812 Valid, 1329 Invalid, 2035 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 1984 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-06 23:58:07,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17687 states. [2024-11-06 23:58:08,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17687 to 12037. [2024-11-06 23:58:08,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12037 states, 10731 states have (on average 1.5026558568632933) internal successors, (16125), 10796 states have internal predecessors, (16125), 851 states have call successors, (851), 390 states have call predecessors, (851), 454 states have return successors, (1644), 914 states have call predecessors, (1644), 851 states have call successors, (1644) [2024-11-06 23:58:08,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12037 states to 12037 states and 18620 transitions. [2024-11-06 23:58:08,756 INFO L78 Accepts]: Start accepts. Automaton has 12037 states and 18620 transitions. Word has length 100 [2024-11-06 23:58:08,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 23:58:08,756 INFO L471 AbstractCegarLoop]: Abstraction has 12037 states and 18620 transitions. [2024-11-06 23:58:08,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 5 states have internal predecessors, (90), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-06 23:58:08,757 INFO L276 IsEmpty]: Start isEmpty. Operand 12037 states and 18620 transitions. [2024-11-06 23:58:08,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-06 23:58:08,774 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 23:58:08,774 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 23:58:08,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-06 23:58:08,774 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 23:58:08,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 23:58:08,775 INFO L85 PathProgramCache]: Analyzing trace with hash -1014541122, now seen corresponding path program 1 times [2024-11-06 23:58:08,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 23:58:08,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582132887] [2024-11-06 23:58:08,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 23:58:08,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 23:58:08,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:58:08,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-06 23:58:08,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:58:08,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-06 23:58:08,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:58:08,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-06 23:58:08,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:58:08,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-06 23:58:08,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:58:08,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-06 23:58:08,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:58:08,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 23:58:08,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 23:58:08,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582132887] [2024-11-06 23:58:08,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582132887] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 23:58:08,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 23:58:08,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-06 23:58:08,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842185491] [2024-11-06 23:58:08,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 23:58:08,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-06 23:58:08,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 23:58:08,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-06 23:58:08,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-06 23:58:08,968 INFO L87 Difference]: Start difference. First operand 12037 states and 18620 transitions. Second operand has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 5 states have internal predecessors, (90), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-06 23:58:11,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 23:58:11,447 INFO L93 Difference]: Finished difference Result 45653 states and 71274 transitions. [2024-11-06 23:58:11,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-06 23:58:11,448 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 5 states have internal predecessors, (90), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 100 [2024-11-06 23:58:11,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 23:58:11,594 INFO L225 Difference]: With dead ends: 45653 [2024-11-06 23:58:11,595 INFO L226 Difference]: Without dead ends: 33629 [2024-11-06 23:58:11,644 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-11-06 23:58:11,645 INFO L432 NwaCegarLoop]: 308 mSDtfsCounter, 893 mSDsluCounter, 1025 mSDsCounter, 0 mSdLazyCounter, 1662 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 911 SdHoareTripleChecker+Valid, 1333 SdHoareTripleChecker+Invalid, 1714 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 1662 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-06 23:58:11,645 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [911 Valid, 1333 Invalid, 1714 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 1662 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-06 23:58:11,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33629 states. [2024-11-06 23:58:13,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33629 to 23790. [2024-11-06 23:58:13,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23790 states, 21268 states have (on average 1.5053131465111904) internal successors, (32015), 21397 states have internal predecessors, (32015), 1619 states have call successors, (1619), 774 states have call predecessors, (1619), 902 states have return successors, (3934), 1746 states have call predecessors, (3934), 1619 states have call successors, (3934) [2024-11-06 23:58:13,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23790 states to 23790 states and 37568 transitions. [2024-11-06 23:58:13,544 INFO L78 Accepts]: Start accepts. Automaton has 23790 states and 37568 transitions. Word has length 100 [2024-11-06 23:58:13,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 23:58:13,545 INFO L471 AbstractCegarLoop]: Abstraction has 23790 states and 37568 transitions. [2024-11-06 23:58:13,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 5 states have internal predecessors, (90), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-06 23:58:13,545 INFO L276 IsEmpty]: Start isEmpty. Operand 23790 states and 37568 transitions. [2024-11-06 23:58:13,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-06 23:58:13,563 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 23:58:13,563 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 23:58:13,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-06 23:58:13,564 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 23:58:13,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 23:58:13,564 INFO L85 PathProgramCache]: Analyzing trace with hash -987475520, now seen corresponding path program 1 times [2024-11-06 23:58:13,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 23:58:13,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351519091] [2024-11-06 23:58:13,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 23:58:13,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 23:58:13,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:58:13,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-06 23:58:13,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:58:13,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-06 23:58:13,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:58:13,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-06 23:58:13,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:58:13,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-06 23:58:13,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:58:13,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-06 23:58:13,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:58:13,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 23:58:13,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 23:58:13,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351519091] [2024-11-06 23:58:13,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351519091] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 23:58:13,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 23:58:13,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-06 23:58:13,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689536551] [2024-11-06 23:58:13,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 23:58:13,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-06 23:58:13,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 23:58:13,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-06 23:58:13,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-06 23:58:13,701 INFO L87 Difference]: Start difference. First operand 23790 states and 37568 transitions. Second operand has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 5 states have internal predecessors, (90), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-06 23:58:17,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 23:58:17,358 INFO L93 Difference]: Finished difference Result 88396 states and 140832 transitions. [2024-11-06 23:58:17,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-06 23:58:17,359 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 5 states have internal predecessors, (90), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 100 [2024-11-06 23:58:17,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 23:58:17,648 INFO L225 Difference]: With dead ends: 88396 [2024-11-06 23:58:17,649 INFO L226 Difference]: Without dead ends: 64619 [2024-11-06 23:58:17,757 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-11-06 23:58:17,759 INFO L432 NwaCegarLoop]: 308 mSDtfsCounter, 853 mSDsluCounter, 1025 mSDsCounter, 0 mSdLazyCounter, 1649 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 871 SdHoareTripleChecker+Valid, 1333 SdHoareTripleChecker+Invalid, 1701 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 1649 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-06 23:58:17,759 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [871 Valid, 1333 Invalid, 1701 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 1649 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-06 23:58:17,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64619 states. [2024-11-06 23:58:20,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64619 to 47231. [2024-11-06 23:58:20,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47231 states, 42341 states have (on average 1.5081599395385088) internal successors, (63857), 42598 states have internal predecessors, (63857), 3091 states have call successors, (3091), 1542 states have call predecessors, (3091), 1798 states have return successors, (9908), 3346 states have call predecessors, (9908), 3091 states have call successors, (9908) [2024-11-06 23:58:20,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47231 states to 47231 states and 76856 transitions. [2024-11-06 23:58:20,822 INFO L78 Accepts]: Start accepts. Automaton has 47231 states and 76856 transitions. Word has length 100 [2024-11-06 23:58:20,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 23:58:20,822 INFO L471 AbstractCegarLoop]: Abstraction has 47231 states and 76856 transitions. [2024-11-06 23:58:20,822 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 5 states have internal predecessors, (90), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-06 23:58:20,823 INFO L276 IsEmpty]: Start isEmpty. Operand 47231 states and 76856 transitions. [2024-11-06 23:58:20,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-06 23:58:20,854 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 23:58:20,854 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 23:58:20,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-06 23:58:20,855 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 23:58:20,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 23:58:20,855 INFO L85 PathProgramCache]: Analyzing trace with hash 1230154878, now seen corresponding path program 1 times [2024-11-06 23:58:20,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 23:58:20,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661348839] [2024-11-06 23:58:20,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 23:58:20,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 23:58:20,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:58:20,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-06 23:58:20,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:58:20,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-06 23:58:20,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:58:20,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-06 23:58:20,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:58:20,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-06 23:58:20,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:58:21,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-06 23:58:21,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:58:21,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 23:58:21,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 23:58:21,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661348839] [2024-11-06 23:58:21,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661348839] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 23:58:21,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 23:58:21,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-06 23:58:21,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282366234] [2024-11-06 23:58:21,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 23:58:21,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-06 23:58:21,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 23:58:21,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-06 23:58:21,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-06 23:58:21,004 INFO L87 Difference]: Start difference. First operand 47231 states and 76856 transitions. Second operand has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 5 states have internal predecessors, (90), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-06 23:58:27,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 23:58:27,833 INFO L93 Difference]: Finished difference Result 171515 states and 282006 transitions. [2024-11-06 23:58:27,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-06 23:58:27,834 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 5 states have internal predecessors, (90), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 100 [2024-11-06 23:58:27,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 23:58:28,273 INFO L225 Difference]: With dead ends: 171515 [2024-11-06 23:58:28,273 INFO L226 Difference]: Without dead ends: 124297 [2024-11-06 23:58:28,391 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-11-06 23:58:28,392 INFO L432 NwaCegarLoop]: 308 mSDtfsCounter, 769 mSDsluCounter, 1025 mSDsCounter, 0 mSdLazyCounter, 1793 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 780 SdHoareTripleChecker+Valid, 1333 SdHoareTripleChecker+Invalid, 1844 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 1793 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-06 23:58:28,392 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [780 Valid, 1333 Invalid, 1844 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 1793 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-06 23:58:28,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124297 states. [2024-11-06 23:58:33,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124297 to 93984. [2024-11-06 23:58:33,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93984 states, 84486 states have (on average 1.5111024311720285) internal successors, (127667), 84999 states have internal predecessors, (127667), 5907 states have call successors, (5907), 3078 states have call predecessors, (5907), 3590 states have return successors, (26102), 6418 states have call predecessors, (26102), 5907 states have call successors, (26102) [2024-11-06 23:58:33,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93984 states to 93984 states and 159676 transitions. [2024-11-06 23:58:33,740 INFO L78 Accepts]: Start accepts. Automaton has 93984 states and 159676 transitions. Word has length 100 [2024-11-06 23:58:33,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 23:58:33,740 INFO L471 AbstractCegarLoop]: Abstraction has 93984 states and 159676 transitions. [2024-11-06 23:58:33,741 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 5 states have internal predecessors, (90), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-06 23:58:33,741 INFO L276 IsEmpty]: Start isEmpty. Operand 93984 states and 159676 transitions. [2024-11-06 23:58:33,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-06 23:58:33,810 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 23:58:33,810 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 23:58:33,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-06 23:58:33,812 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 23:58:33,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 23:58:33,813 INFO L85 PathProgramCache]: Analyzing trace with hash -1330707968, now seen corresponding path program 1 times [2024-11-06 23:58:33,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 23:58:33,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562407462] [2024-11-06 23:58:33,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 23:58:33,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 23:58:33,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:58:33,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-06 23:58:33,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:58:33,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-06 23:58:33,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:58:33,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-06 23:58:33,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:58:33,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-06 23:58:33,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:58:33,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-06 23:58:33,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 23:58:33,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 23:58:33,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 23:58:33,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562407462] [2024-11-06 23:58:33,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562407462] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 23:58:33,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 23:58:33,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-06 23:58:33,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999837033] [2024-11-06 23:58:33,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 23:58:33,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-06 23:58:33,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 23:58:33,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-06 23:58:33,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-06 23:58:33,958 INFO L87 Difference]: Start difference. First operand 93984 states and 159676 transitions. Second operand has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 5 states have internal predecessors, (90), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5)