./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/Problem05_label49+token_ring.09.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/combinations/Problem05_label49+token_ring.09.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', '9c44d114d56c1766d1cbfa8e225f5145dcce7e8e615df451e987409645be250c'] 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/combinations/Problem05_label49+token_ring.09.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 9c44d114d56c1766d1cbfa8e225f5145dcce7e8e615df451e987409645be250c --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 01:10:22,579 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 01:10:22,692 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-07 01:10:22,698 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 01:10:22,699 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 01:10:22,727 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 01:10:22,728 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 01:10:22,728 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 01:10:22,729 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 01:10:22,729 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 01:10:22,730 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 01:10:22,730 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 01:10:22,730 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 01:10:22,731 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 01:10:22,731 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 01:10:22,731 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 01:10:22,732 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 01:10:22,732 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 01:10:22,732 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 01:10:22,732 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 01:10:22,732 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 01:10:22,732 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 01:10:22,733 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 01:10:22,733 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 01:10:22,733 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 01:10:22,733 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 01:10:22,733 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 01:10:22,733 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 01:10:22,733 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 01:10:22,734 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 01:10:22,734 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 01:10:22,734 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 01:10:22,734 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 01:10:22,734 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 01:10:22,735 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 01:10:22,735 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 01:10:22,735 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 01:10:22,735 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 01:10:22,735 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 01:10:22,735 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 01:10:22,735 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 01:10:22,735 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 01:10:22,735 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 -> 9c44d114d56c1766d1cbfa8e225f5145dcce7e8e615df451e987409645be250c [2024-11-07 01:10:23,027 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 01:10:23,034 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 01:10:23,036 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 01:10:23,037 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 01:10:23,037 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 01:10:23,039 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/Problem05_label49+token_ring.09.cil-1.c [2024-11-07 01:10:24,343 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 01:10:24,917 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 01:10:24,918 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label49+token_ring.09.cil-1.c [2024-11-07 01:10:24,973 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/271114640/5381dbea7cc244f2b194e847762cafb4/FLAG306cd03ae [2024-11-07 01:10:24,990 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/271114640/5381dbea7cc244f2b194e847762cafb4 [2024-11-07 01:10:24,993 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 01:10:24,994 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 01:10:24,996 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 01:10:24,997 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 01:10:25,001 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 01:10:25,002 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:10:24" (1/1) ... [2024-11-07 01:10:25,002 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8677f45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:10:25, skipping insertion in model container [2024-11-07 01:10:25,003 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:10:24" (1/1) ... [2024-11-07 01:10:25,173 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 01:10:26,522 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/combinations/Problem05_label49+token_ring.09.cil-1.c[380593,380606] [2024-11-07 01:10:26,554 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/combinations/Problem05_label49+token_ring.09.cil-1.c[383339,383352] [2024-11-07 01:10:26,757 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 01:10:26,769 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 01:10:27,428 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/combinations/Problem05_label49+token_ring.09.cil-1.c[380593,380606] [2024-11-07 01:10:27,436 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/combinations/Problem05_label49+token_ring.09.cil-1.c[383339,383352] [2024-11-07 01:10:27,482 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 01:10:27,550 INFO L204 MainTranslator]: Completed translation [2024-11-07 01:10:27,551 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:10:27 WrapperNode [2024-11-07 01:10:27,551 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 01:10:27,552 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 01:10:27,552 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 01:10:27,552 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 01:10:27,558 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:10:27" (1/1) ... [2024-11-07 01:10:27,625 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:10:27" (1/1) ... [2024-11-07 01:10:28,072 INFO L138 Inliner]: procedures = 62, calls = 68, calls flagged for inlining = 40, calls inlined = 40, statements flattened = 13053 [2024-11-07 01:10:28,073 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 01:10:28,074 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 01:10:28,074 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 01:10:28,074 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 01:10:28,094 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:10:27" (1/1) ... [2024-11-07 01:10:28,094 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:10:27" (1/1) ... [2024-11-07 01:10:28,166 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:10:27" (1/1) ... [2024-11-07 01:10:28,303 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-07 01:10:28,305 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:10:27" (1/1) ... [2024-11-07 01:10:28,306 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:10:27" (1/1) ... [2024-11-07 01:10:28,488 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:10:27" (1/1) ... [2024-11-07 01:10:28,573 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:10:27" (1/1) ... [2024-11-07 01:10:28,610 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:10:27" (1/1) ... [2024-11-07 01:10:28,637 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:10:27" (1/1) ... [2024-11-07 01:10:28,693 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 01:10:28,695 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 01:10:28,695 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 01:10:28,695 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 01:10:28,696 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:10:27" (1/1) ... [2024-11-07 01:10:28,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 01:10:28,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 01:10:28,731 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-07 01:10:28,735 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-07 01:10:28,762 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 01:10:28,762 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2024-11-07 01:10:28,762 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2024-11-07 01:10:28,762 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-11-07 01:10:28,762 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-11-07 01:10:28,762 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2024-11-07 01:10:28,762 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2024-11-07 01:10:28,763 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2024-11-07 01:10:28,763 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2024-11-07 01:10:28,763 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2024-11-07 01:10:28,763 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2024-11-07 01:10:28,763 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2024-11-07 01:10:28,763 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2024-11-07 01:10:28,763 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 01:10:28,763 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 01:10:28,763 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 01:10:28,915 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 01:10:28,917 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 01:10:36,581 INFO L? ?]: Removed 1737 outVars from TransFormulas that were not future-live. [2024-11-07 01:10:36,581 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 01:10:36,646 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 01:10:36,647 INFO L316 CfgBuilder]: Removed 13 assume(true) statements. [2024-11-07 01:10:36,647 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:10:36 BoogieIcfgContainer [2024-11-07 01:10:36,647 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 01:10:36,649 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 01:10:36,653 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 01:10:36,658 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 01:10:36,659 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 01:10:24" (1/3) ... [2024-11-07 01:10:36,659 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49eaf63d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:10:36, skipping insertion in model container [2024-11-07 01:10:36,660 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:10:27" (2/3) ... [2024-11-07 01:10:36,660 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49eaf63d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:10:36, skipping insertion in model container [2024-11-07 01:10:36,660 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:10:36" (3/3) ... [2024-11-07 01:10:36,661 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem05_label49+token_ring.09.cil-1.c [2024-11-07 01:10:36,673 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 01:10:36,674 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-07 01:10:36,787 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 01:10:36,797 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;@6045a4e4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 01:10:36,798 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-07 01:10:36,809 INFO L276 IsEmpty]: Start isEmpty. Operand has 2500 states, 2468 states have (on average 1.8435980551053484) internal successors, (4550), 2471 states have internal predecessors, (4550), 23 states have call successors, (23), 6 states have call predecessors, (23), 6 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-07 01:10:36,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-07 01:10:36,826 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:10:36,827 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 01:10:36,827 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:10:36,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:10:36,832 INFO L85 PathProgramCache]: Analyzing trace with hash 2141989661, now seen corresponding path program 1 times [2024-11-07 01:10:36,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:10:36,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071608587] [2024-11-07 01:10:36,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:10:36,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:10:36,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:37,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:10:37,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:37,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-07 01:10:37,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:37,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-07 01:10:37,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:37,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 01:10:37,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:37,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-07 01:10:37,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:37,412 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-07 01:10:37,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:10:37,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071608587] [2024-11-07 01:10:37,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071608587] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:10:37,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:10:37,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 01:10:37,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159563529] [2024-11-07 01:10:37,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:10:37,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 01:10:37,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:10:37,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 01:10:37,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 01:10:37,452 INFO L87 Difference]: Start difference. First operand has 2500 states, 2468 states have (on average 1.8435980551053484) internal successors, (4550), 2471 states have internal predecessors, (4550), 23 states have call successors, (23), 6 states have call predecessors, (23), 6 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 5 states, 5 states have (on average 27.0) internal successors, (135), 3 states have internal predecessors, (135), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:10:38,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:10:38,977 INFO L93 Difference]: Finished difference Result 5101 states and 9365 transitions. [2024-11-07 01:10:38,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 01:10:38,980 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 27.0) internal successors, (135), 3 states have internal predecessors, (135), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 145 [2024-11-07 01:10:38,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:10:39,012 INFO L225 Difference]: With dead ends: 5101 [2024-11-07 01:10:39,012 INFO L226 Difference]: Without dead ends: 2542 [2024-11-07 01:10:39,023 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-07 01:10:39,027 INFO L432 NwaCegarLoop]: 4314 mSDtfsCounter, 821 mSDsluCounter, 12407 mSDsCounter, 0 mSdLazyCounter, 805 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 842 SdHoareTripleChecker+Valid, 16721 SdHoareTripleChecker+Invalid, 855 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 805 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-07 01:10:39,028 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [842 Valid, 16721 Invalid, 855 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [50 Valid, 805 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-07 01:10:39,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2542 states. [2024-11-07 01:10:39,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2542 to 2433. [2024-11-07 01:10:39,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2433 states, 2402 states have (on average 1.8288925895087427) internal successors, (4393), 2404 states have internal predecessors, (4393), 23 states have call successors, (23), 6 states have call predecessors, (23), 6 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-07 01:10:39,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2433 states to 2433 states and 4439 transitions. [2024-11-07 01:10:39,185 INFO L78 Accepts]: Start accepts. Automaton has 2433 states and 4439 transitions. Word has length 145 [2024-11-07 01:10:39,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:10:39,186 INFO L471 AbstractCegarLoop]: Abstraction has 2433 states and 4439 transitions. [2024-11-07 01:10:39,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.0) internal successors, (135), 3 states have internal predecessors, (135), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:10:39,187 INFO L276 IsEmpty]: Start isEmpty. Operand 2433 states and 4439 transitions. [2024-11-07 01:10:39,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-07 01:10:39,193 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:10:39,193 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 01:10:39,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 01:10:39,194 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:10:39,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:10:39,194 INFO L85 PathProgramCache]: Analyzing trace with hash -535537185, now seen corresponding path program 1 times [2024-11-07 01:10:39,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:10:39,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456160530] [2024-11-07 01:10:39,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:10:39,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:10:39,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:39,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:10:39,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:39,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-07 01:10:39,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:39,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-07 01:10:39,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:39,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 01:10:39,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:39,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-07 01:10:39,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:39,591 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-07 01:10:39,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:10:39,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456160530] [2024-11-07 01:10:39,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456160530] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:10:39,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:10:39,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 01:10:39,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392044592] [2024-11-07 01:10:39,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:10:39,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 01:10:39,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:10:39,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 01:10:39,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 01:10:39,596 INFO L87 Difference]: Start difference. First operand 2433 states and 4439 transitions. Second operand has 6 states, 6 states have (on average 22.5) internal successors, (135), 4 states have internal predecessors, (135), 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-07 01:10:42,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:10:42,246 INFO L93 Difference]: Finished difference Result 3253 states and 5746 transitions. [2024-11-07 01:10:42,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 01:10:42,247 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.5) internal successors, (135), 4 states have internal predecessors, (135), 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 145 [2024-11-07 01:10:42,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:10:42,264 INFO L225 Difference]: With dead ends: 3253 [2024-11-07 01:10:42,264 INFO L226 Difference]: Without dead ends: 2958 [2024-11-07 01:10:42,268 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-07 01:10:42,269 INFO L432 NwaCegarLoop]: 4221 mSDtfsCounter, 5183 mSDsluCounter, 12669 mSDsCounter, 0 mSdLazyCounter, 1761 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5199 SdHoareTripleChecker+Valid, 16890 SdHoareTripleChecker+Invalid, 1857 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 1761 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-07 01:10:42,270 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5199 Valid, 16890 Invalid, 1857 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [96 Valid, 1761 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-07 01:10:42,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2958 states. [2024-11-07 01:10:42,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2958 to 2741. [2024-11-07 01:10:42,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2741 states, 2685 states have (on average 1.8011173184357543) internal successors, (4836), 2688 states have internal predecessors, (4836), 41 states have call successors, (41), 12 states have call predecessors, (41), 13 states have return successors, (44), 41 states have call predecessors, (44), 41 states have call successors, (44) [2024-11-07 01:10:42,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2741 states to 2741 states and 4921 transitions. [2024-11-07 01:10:42,378 INFO L78 Accepts]: Start accepts. Automaton has 2741 states and 4921 transitions. Word has length 145 [2024-11-07 01:10:42,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:10:42,378 INFO L471 AbstractCegarLoop]: Abstraction has 2741 states and 4921 transitions. [2024-11-07 01:10:42,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.5) internal successors, (135), 4 states have internal predecessors, (135), 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-07 01:10:42,379 INFO L276 IsEmpty]: Start isEmpty. Operand 2741 states and 4921 transitions. [2024-11-07 01:10:42,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-07 01:10:42,380 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:10:42,381 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 01:10:42,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 01:10:42,381 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:10:42,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:10:42,384 INFO L85 PathProgramCache]: Analyzing trace with hash 1207466339, now seen corresponding path program 1 times [2024-11-07 01:10:42,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:10:42,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330487903] [2024-11-07 01:10:42,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:10:42,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:10:42,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:42,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:10:42,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:42,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-07 01:10:42,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:42,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-07 01:10:42,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:42,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 01:10:42,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:42,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-07 01:10:42,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:42,777 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-07 01:10:42,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:10:42,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330487903] [2024-11-07 01:10:42,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330487903] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:10:42,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:10:42,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:10:42,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644644761] [2024-11-07 01:10:42,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:10:42,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:10:42,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:10:42,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:10:42,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:10:42,780 INFO L87 Difference]: Start difference. First operand 2741 states and 4921 transitions. Second operand has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 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-07 01:10:45,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:10:45,600 INFO L93 Difference]: Finished difference Result 3991 states and 6913 transitions. [2024-11-07 01:10:45,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 01:10:45,601 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 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 145 [2024-11-07 01:10:45,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:10:45,617 INFO L225 Difference]: With dead ends: 3991 [2024-11-07 01:10:45,617 INFO L226 Difference]: Without dead ends: 3388 [2024-11-07 01:10:45,621 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-07 01:10:45,621 INFO L432 NwaCegarLoop]: 4421 mSDtfsCounter, 5214 mSDsluCounter, 17410 mSDsCounter, 0 mSdLazyCounter, 2794 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5230 SdHoareTripleChecker+Valid, 21831 SdHoareTripleChecker+Invalid, 2849 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 2794 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-07 01:10:45,622 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5230 Valid, 21831 Invalid, 2849 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 2794 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-07 01:10:45,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3388 states. [2024-11-07 01:10:45,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3388 to 3028. [2024-11-07 01:10:45,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3028 states, 2947 states have (on average 1.7770614183915847) internal successors, (5237), 2951 states have internal predecessors, (5237), 59 states have call successors, (59), 18 states have call predecessors, (59), 20 states have return successors, (64), 60 states have call predecessors, (64), 59 states have call successors, (64) [2024-11-07 01:10:45,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3028 states to 3028 states and 5360 transitions. [2024-11-07 01:10:45,718 INFO L78 Accepts]: Start accepts. Automaton has 3028 states and 5360 transitions. Word has length 145 [2024-11-07 01:10:45,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:10:45,718 INFO L471 AbstractCegarLoop]: Abstraction has 3028 states and 5360 transitions. [2024-11-07 01:10:45,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 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-07 01:10:45,719 INFO L276 IsEmpty]: Start isEmpty. Operand 3028 states and 5360 transitions. [2024-11-07 01:10:45,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-07 01:10:45,720 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:10:45,721 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 01:10:45,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 01:10:45,721 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:10:45,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:10:45,721 INFO L85 PathProgramCache]: Analyzing trace with hash -2140463071, now seen corresponding path program 1 times [2024-11-07 01:10:45,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:10:45,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189632291] [2024-11-07 01:10:45,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:10:45,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:10:45,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:45,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:10:45,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:45,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-07 01:10:45,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:45,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-07 01:10:45,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:45,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 01:10:45,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:46,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-07 01:10:46,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:46,004 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-07 01:10:46,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:10:46,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189632291] [2024-11-07 01:10:46,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189632291] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:10:46,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:10:46,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:10:46,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870157378] [2024-11-07 01:10:46,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:10:46,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:10:46,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:10:46,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:10:46,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:10:46,007 INFO L87 Difference]: Start difference. First operand 3028 states and 5360 transitions. Second operand has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 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-07 01:10:48,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:10:48,758 INFO L93 Difference]: Finished difference Result 5078 states and 8620 transitions. [2024-11-07 01:10:48,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 01:10:48,759 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 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 145 [2024-11-07 01:10:48,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:10:48,774 INFO L225 Difference]: With dead ends: 5078 [2024-11-07 01:10:48,774 INFO L226 Difference]: Without dead ends: 4188 [2024-11-07 01:10:48,777 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-07 01:10:48,778 INFO L432 NwaCegarLoop]: 4419 mSDtfsCounter, 5208 mSDsluCounter, 17410 mSDsCounter, 0 mSdLazyCounter, 2773 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5224 SdHoareTripleChecker+Valid, 21829 SdHoareTripleChecker+Invalid, 2830 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 2773 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-07 01:10:48,778 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5224 Valid, 21829 Invalid, 2830 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 2773 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-07 01:10:48,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4188 states. [2024-11-07 01:10:48,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4188 to 3606. [2024-11-07 01:10:48,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3606 states, 3475 states have (on average 1.7398561151079137) internal successors, (6046), 3481 states have internal predecessors, (6046), 95 states have call successors, (95), 30 states have call predecessors, (95), 34 states have return successors, (108), 98 states have call predecessors, (108), 95 states have call successors, (108) [2024-11-07 01:10:48,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3606 states to 3606 states and 6249 transitions. [2024-11-07 01:10:48,906 INFO L78 Accepts]: Start accepts. Automaton has 3606 states and 6249 transitions. Word has length 145 [2024-11-07 01:10:48,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:10:48,907 INFO L471 AbstractCegarLoop]: Abstraction has 3606 states and 6249 transitions. [2024-11-07 01:10:48,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 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-07 01:10:48,907 INFO L276 IsEmpty]: Start isEmpty. Operand 3606 states and 6249 transitions. [2024-11-07 01:10:48,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-07 01:10:48,909 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:10:48,909 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 01:10:48,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 01:10:48,910 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:10:48,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:10:48,910 INFO L85 PathProgramCache]: Analyzing trace with hash 104095327, now seen corresponding path program 1 times [2024-11-07 01:10:48,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:10:48,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802752929] [2024-11-07 01:10:48,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:10:48,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:10:48,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:49,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:10:49,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:49,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-07 01:10:49,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:49,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-07 01:10:49,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:49,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 01:10:49,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:49,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-07 01:10:49,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:49,139 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-07 01:10:49,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:10:49,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802752929] [2024-11-07 01:10:49,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802752929] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:10:49,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:10:49,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:10:49,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771081795] [2024-11-07 01:10:49,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:10:49,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:10:49,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:10:49,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:10:49,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:10:49,141 INFO L87 Difference]: Start difference. First operand 3606 states and 6249 transitions. Second operand has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 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-07 01:10:51,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:10:51,784 INFO L93 Difference]: Finished difference Result 7178 states and 11897 transitions. [2024-11-07 01:10:51,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 01:10:51,784 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 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 145 [2024-11-07 01:10:51,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:10:51,806 INFO L225 Difference]: With dead ends: 7178 [2024-11-07 01:10:51,807 INFO L226 Difference]: Without dead ends: 5710 [2024-11-07 01:10:51,811 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-07 01:10:51,812 INFO L432 NwaCegarLoop]: 4419 mSDtfsCounter, 5207 mSDsluCounter, 17410 mSDsCounter, 0 mSdLazyCounter, 2760 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5223 SdHoareTripleChecker+Valid, 21829 SdHoareTripleChecker+Invalid, 2817 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 2760 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-07 01:10:51,812 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5223 Valid, 21829 Invalid, 2817 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 2760 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-07 01:10:51,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5710 states. [2024-11-07 01:10:51,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5710 to 4763. [2024-11-07 01:10:51,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4763 states, 4532 states have (on average 1.6910856134157104) internal successors, (7664), 4542 states have internal predecessors, (7664), 167 states have call successors, (167), 54 states have call predecessors, (167), 62 states have return successors, (202), 174 states have call predecessors, (202), 167 states have call successors, (202) [2024-11-07 01:10:52,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4763 states to 4763 states and 8033 transitions. [2024-11-07 01:10:52,010 INFO L78 Accepts]: Start accepts. Automaton has 4763 states and 8033 transitions. Word has length 145 [2024-11-07 01:10:52,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:10:52,010 INFO L471 AbstractCegarLoop]: Abstraction has 4763 states and 8033 transitions. [2024-11-07 01:10:52,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 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-07 01:10:52,011 INFO L276 IsEmpty]: Start isEmpty. Operand 4763 states and 8033 transitions. [2024-11-07 01:10:52,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-07 01:10:52,016 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:10:52,016 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 01:10:52,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 01:10:52,016 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:10:52,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:10:52,017 INFO L85 PathProgramCache]: Analyzing trace with hash 592142433, now seen corresponding path program 1 times [2024-11-07 01:10:52,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:10:52,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743814075] [2024-11-07 01:10:52,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:10:52,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:10:52,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:52,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:10:52,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:52,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-07 01:10:52,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:52,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-07 01:10:52,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:52,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 01:10:52,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:52,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-07 01:10:52,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:52,256 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-07 01:10:52,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:10:52,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743814075] [2024-11-07 01:10:52,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743814075] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:10:52,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:10:52,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:10:52,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330733858] [2024-11-07 01:10:52,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:10:52,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:10:52,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:10:52,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:10:52,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:10:52,259 INFO L87 Difference]: Start difference. First operand 4763 states and 8033 transitions. Second operand has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 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-07 01:10:55,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:10:55,087 INFO L93 Difference]: Finished difference Result 11377 states and 18467 transitions. [2024-11-07 01:10:55,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 01:10:55,088 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 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 145 [2024-11-07 01:10:55,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:10:55,130 INFO L225 Difference]: With dead ends: 11377 [2024-11-07 01:10:55,130 INFO L226 Difference]: Without dead ends: 8752 [2024-11-07 01:10:55,140 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-07 01:10:55,142 INFO L432 NwaCegarLoop]: 4419 mSDtfsCounter, 5206 mSDsluCounter, 17410 mSDsCounter, 0 mSdLazyCounter, 2747 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5222 SdHoareTripleChecker+Valid, 21829 SdHoareTripleChecker+Invalid, 2804 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 2747 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-07 01:10:55,142 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5222 Valid, 21829 Invalid, 2804 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 2747 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-07 01:10:55,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8752 states. [2024-11-07 01:10:55,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8752 to 7084. [2024-11-07 01:10:55,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7084 states, 6653 states have (on average 1.6398617165188636) internal successors, (10910), 6671 states have internal predecessors, (10910), 311 states have call successors, (311), 102 states have call predecessors, (311), 118 states have return successors, (408), 326 states have call predecessors, (408), 311 states have call successors, (408) [2024-11-07 01:10:55,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7084 states to 7084 states and 11629 transitions. [2024-11-07 01:10:55,620 INFO L78 Accepts]: Start accepts. Automaton has 7084 states and 11629 transitions. Word has length 145 [2024-11-07 01:10:55,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:10:55,620 INFO L471 AbstractCegarLoop]: Abstraction has 7084 states and 11629 transitions. [2024-11-07 01:10:55,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 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-07 01:10:55,622 INFO L276 IsEmpty]: Start isEmpty. Operand 7084 states and 11629 transitions. [2024-11-07 01:10:55,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-07 01:10:55,626 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:10:55,626 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 01:10:55,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 01:10:55,628 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:10:55,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:10:55,628 INFO L85 PathProgramCache]: Analyzing trace with hash -500492769, now seen corresponding path program 1 times [2024-11-07 01:10:55,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:10:55,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283528031] [2024-11-07 01:10:55,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:10:55,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:10:55,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:55,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:10:55,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:55,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-07 01:10:55,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:55,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-07 01:10:55,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:56,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 01:10:56,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:56,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-07 01:10:56,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:56,016 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-07 01:10:56,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:10:56,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283528031] [2024-11-07 01:10:56,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283528031] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:10:56,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:10:56,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:10:56,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848612513] [2024-11-07 01:10:56,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:10:56,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:10:56,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:10:56,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:10:56,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:10:56,018 INFO L87 Difference]: Start difference. First operand 7084 states and 11629 transitions. Second operand has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 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-07 01:10:58,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:10:58,586 INFO L93 Difference]: Finished difference Result 19776 states and 31669 transitions. [2024-11-07 01:10:58,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 01:10:58,587 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 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 145 [2024-11-07 01:10:58,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:10:58,642 INFO L225 Difference]: With dead ends: 19776 [2024-11-07 01:10:58,643 INFO L226 Difference]: Without dead ends: 14830 [2024-11-07 01:10:58,661 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-07 01:10:58,662 INFO L432 NwaCegarLoop]: 4231 mSDtfsCounter, 5285 mSDsluCounter, 16870 mSDsCounter, 0 mSdLazyCounter, 2341 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5301 SdHoareTripleChecker+Valid, 21101 SdHoareTripleChecker+Invalid, 2428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 2341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-07 01:10:58,662 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5301 Valid, 21101 Invalid, 2428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 2341 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-07 01:10:58,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14830 states. [2024-11-07 01:10:59,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14830 to 11741. [2024-11-07 01:10:59,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11741 states, 10910 states have (on average 1.5970669110907425) internal successors, (17424), 10944 states have internal predecessors, (17424), 599 states have call successors, (599), 198 states have call predecessors, (599), 230 states have return successors, (874), 630 states have call predecessors, (874), 599 states have call successors, (874) [2024-11-07 01:10:59,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11741 states to 11741 states and 18897 transitions. [2024-11-07 01:10:59,622 INFO L78 Accepts]: Start accepts. Automaton has 11741 states and 18897 transitions. Word has length 145 [2024-11-07 01:10:59,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:10:59,622 INFO L471 AbstractCegarLoop]: Abstraction has 11741 states and 18897 transitions. [2024-11-07 01:10:59,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 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-07 01:10:59,622 INFO L276 IsEmpty]: Start isEmpty. Operand 11741 states and 18897 transitions. [2024-11-07 01:10:59,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-07 01:10:59,630 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:10:59,630 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 01:10:59,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 01:10:59,631 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:10:59,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:10:59,632 INFO L85 PathProgramCache]: Analyzing trace with hash -1782665055, now seen corresponding path program 1 times [2024-11-07 01:10:59,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:10:59,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802012567] [2024-11-07 01:10:59,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:10:59,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:10:59,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:59,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:10:59,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:59,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-07 01:10:59,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:59,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-07 01:10:59,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:59,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 01:10:59,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:59,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-07 01:10:59,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:10:59,862 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-07 01:10:59,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:10:59,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802012567] [2024-11-07 01:10:59,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802012567] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:10:59,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:10:59,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:10:59,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554511117] [2024-11-07 01:10:59,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:10:59,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:10:59,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:10:59,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:10:59,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:10:59,865 INFO L87 Difference]: Start difference. First operand 11741 states and 18897 transitions. Second operand has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 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-07 01:11:01,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:11:01,564 INFO L93 Difference]: Finished difference Result 24602 states and 39478 transitions. [2024-11-07 01:11:01,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 01:11:01,564 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 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 145 [2024-11-07 01:11:01,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:11:01,680 INFO L225 Difference]: With dead ends: 24602 [2024-11-07 01:11:01,680 INFO L226 Difference]: Without dead ends: 14999 [2024-11-07 01:11:01,742 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-11-07 01:11:01,747 INFO L432 NwaCegarLoop]: 4206 mSDtfsCounter, 4993 mSDsluCounter, 12488 mSDsCounter, 0 mSdLazyCounter, 1268 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5010 SdHoareTripleChecker+Valid, 16694 SdHoareTripleChecker+Invalid, 1350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 1268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-07 01:11:01,747 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5010 Valid, 16694 Invalid, 1350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 1268 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-07 01:11:01,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14999 states. [2024-11-07 01:11:02,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14999 to 11741. [2024-11-07 01:11:02,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11741 states, 10910 states have (on average 1.5940421631530706) internal successors, (17391), 10944 states have internal predecessors, (17391), 599 states have call successors, (599), 198 states have call predecessors, (599), 230 states have return successors, (874), 630 states have call predecessors, (874), 599 states have call successors, (874) [2024-11-07 01:11:02,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11741 states to 11741 states and 18864 transitions. [2024-11-07 01:11:02,418 INFO L78 Accepts]: Start accepts. Automaton has 11741 states and 18864 transitions. Word has length 145 [2024-11-07 01:11:02,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:11:02,418 INFO L471 AbstractCegarLoop]: Abstraction has 11741 states and 18864 transitions. [2024-11-07 01:11:02,419 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 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-07 01:11:02,420 INFO L276 IsEmpty]: Start isEmpty. Operand 11741 states and 18864 transitions. [2024-11-07 01:11:02,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-07 01:11:02,429 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:11:02,429 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 01:11:02,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 01:11:02,430 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:11:02,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:11:02,431 INFO L85 PathProgramCache]: Analyzing trace with hash 669826527, now seen corresponding path program 1 times [2024-11-07 01:11:02,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:11:02,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694778654] [2024-11-07 01:11:02,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:11:02,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:11:02,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:11:02,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:11:02,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:11:02,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-07 01:11:02,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:11:02,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-07 01:11:02,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:11:02,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 01:11:02,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:11:02,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-07 01:11:02,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:11:02,663 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-07 01:11:02,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:11:02,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694778654] [2024-11-07 01:11:02,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694778654] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:11:02,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:11:02,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:11:02,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808681212] [2024-11-07 01:11:02,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:11:02,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:11:02,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:11:02,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:11:02,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:11:02,665 INFO L87 Difference]: Start difference. First operand 11741 states and 18864 transitions. Second operand has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 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-07 01:11:06,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:11:06,144 INFO L93 Difference]: Finished difference Result 36541 states and 58035 transitions. [2024-11-07 01:11:06,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 01:11:06,145 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 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 145 [2024-11-07 01:11:06,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:11:06,238 INFO L225 Difference]: With dead ends: 36541 [2024-11-07 01:11:06,238 INFO L226 Difference]: Without dead ends: 26938 [2024-11-07 01:11:06,271 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-07 01:11:06,272 INFO L432 NwaCegarLoop]: 4419 mSDtfsCounter, 5197 mSDsluCounter, 17410 mSDsCounter, 0 mSdLazyCounter, 2696 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5213 SdHoareTripleChecker+Valid, 21829 SdHoareTripleChecker+Invalid, 2753 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 2696 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-07 01:11:06,272 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5213 Valid, 21829 Invalid, 2753 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 2696 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-07 01:11:06,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26938 states. [2024-11-07 01:11:07,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26938 to 21119. [2024-11-07 01:11:07,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21119 states, 19488 states have (on average 1.5633723316912973) internal successors, (30467), 19554 states have internal predecessors, (30467), 1175 states have call successors, (1175), 390 states have call predecessors, (1175), 454 states have return successors, (1968), 1238 states have call predecessors, (1968), 1175 states have call successors, (1968) [2024-11-07 01:11:07,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21119 states to 21119 states and 33610 transitions. [2024-11-07 01:11:07,273 INFO L78 Accepts]: Start accepts. Automaton has 21119 states and 33610 transitions. Word has length 145 [2024-11-07 01:11:07,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:11:07,273 INFO L471 AbstractCegarLoop]: Abstraction has 21119 states and 33610 transitions. [2024-11-07 01:11:07,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 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-07 01:11:07,274 INFO L276 IsEmpty]: Start isEmpty. Operand 21119 states and 33610 transitions. [2024-11-07 01:11:07,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-07 01:11:07,289 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:11:07,289 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 01:11:07,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-07 01:11:07,290 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:11:07,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:11:07,290 INFO L85 PathProgramCache]: Analyzing trace with hash -1052176159, now seen corresponding path program 1 times [2024-11-07 01:11:07,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:11:07,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807130201] [2024-11-07 01:11:07,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:11:07,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:11:07,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:11:07,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:11:07,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:11:07,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-07 01:11:07,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:11:07,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-07 01:11:07,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:11:07,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 01:11:07,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:11:07,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-07 01:11:07,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:11:07,509 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-07 01:11:07,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:11:07,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807130201] [2024-11-07 01:11:07,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807130201] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:11:07,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:11:07,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:11:07,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356663772] [2024-11-07 01:11:07,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:11:07,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:11:07,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:11:07,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:11:07,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:11:07,511 INFO L87 Difference]: Start difference. First operand 21119 states and 33610 transitions. Second operand has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 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-07 01:11:11,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:11:11,598 INFO L93 Difference]: Finished difference Result 70141 states and 111643 transitions. [2024-11-07 01:11:11,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 01:11:11,598 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 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 145 [2024-11-07 01:11:11,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:11:11,826 INFO L225 Difference]: With dead ends: 70141 [2024-11-07 01:11:11,826 INFO L226 Difference]: Without dead ends: 51160 [2024-11-07 01:11:11,889 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-07 01:11:11,890 INFO L432 NwaCegarLoop]: 4419 mSDtfsCounter, 5202 mSDsluCounter, 17410 mSDsCounter, 0 mSdLazyCounter, 2678 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5218 SdHoareTripleChecker+Valid, 21829 SdHoareTripleChecker+Invalid, 2735 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 2678 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-07 01:11:11,890 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5218 Valid, 21829 Invalid, 2735 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [57 Valid, 2678 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-07 01:11:11,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51160 states. [2024-11-07 01:11:13,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51160 to 39936. [2024-11-07 01:11:13,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39936 states, 36705 states have (on average 1.544993870044953) internal successors, (56709), 36835 states have internal predecessors, (56709), 2327 states have call successors, (2327), 774 states have call predecessors, (2327), 902 states have return successors, (4642), 2454 states have call predecessors, (4642), 2327 states have call successors, (4642) [2024-11-07 01:11:13,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39936 states to 39936 states and 63678 transitions. [2024-11-07 01:11:13,802 INFO L78 Accepts]: Start accepts. Automaton has 39936 states and 63678 transitions. Word has length 145 [2024-11-07 01:11:13,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:11:13,802 INFO L471 AbstractCegarLoop]: Abstraction has 39936 states and 63678 transitions. [2024-11-07 01:11:13,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 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-07 01:11:13,803 INFO L276 IsEmpty]: Start isEmpty. Operand 39936 states and 63678 transitions. [2024-11-07 01:11:13,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-07 01:11:13,824 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:11:13,825 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 01:11:13,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-07 01:11:13,825 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:11:13,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:11:13,826 INFO L85 PathProgramCache]: Analyzing trace with hash -1384819297, now seen corresponding path program 1 times [2024-11-07 01:11:13,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:11:13,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697763232] [2024-11-07 01:11:13,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:11:13,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:11:13,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:11:13,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:11:13,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:11:13,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-07 01:11:13,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:11:14,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-07 01:11:14,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:11:14,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 01:11:14,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:11:14,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-07 01:11:14,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:11:14,024 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-07 01:11:14,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:11:14,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697763232] [2024-11-07 01:11:14,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697763232] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:11:14,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:11:14,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:11:14,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808005262] [2024-11-07 01:11:14,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:11:14,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:11:14,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:11:14,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:11:14,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:11:14,025 INFO L87 Difference]: Start difference. First operand 39936 states and 63678 transitions. Second operand has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 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-07 01:11:21,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:11:21,526 INFO L93 Difference]: Finished difference Result 152954 states and 244639 transitions. [2024-11-07 01:11:21,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-07 01:11:21,527 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 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 145 [2024-11-07 01:11:21,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:11:22,026 INFO L225 Difference]: With dead ends: 152954 [2024-11-07 01:11:22,027 INFO L226 Difference]: Without dead ends: 115156 [2024-11-07 01:11:22,150 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-11-07 01:11:22,151 INFO L432 NwaCegarLoop]: 4416 mSDtfsCounter, 5279 mSDsluCounter, 17399 mSDsCounter, 0 mSdLazyCounter, 3197 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5294 SdHoareTripleChecker+Valid, 21815 SdHoareTripleChecker+Invalid, 3256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 3197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-07 01:11:22,152 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5294 Valid, 21815 Invalid, 3256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 3197 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-07 01:11:22,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115156 states. [2024-11-07 01:11:26,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115156 to 76802. [2024-11-07 01:11:26,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76802 states, 70499 states have (on average 1.537057263223592) internal successors, (108361), 70757 states have internal predecessors, (108361), 4503 states have call successors, (4503), 1542 states have call predecessors, (4503), 1798 states have return successors, (11320), 4758 states have call predecessors, (11320), 4503 states have call successors, (11320) [2024-11-07 01:11:27,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76802 states to 76802 states and 124184 transitions. [2024-11-07 01:11:27,242 INFO L78 Accepts]: Start accepts. Automaton has 76802 states and 124184 transitions. Word has length 145 [2024-11-07 01:11:27,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:11:27,243 INFO L471 AbstractCegarLoop]: Abstraction has 76802 states and 124184 transitions. [2024-11-07 01:11:27,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 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-07 01:11:27,243 INFO L276 IsEmpty]: Start isEmpty. Operand 76802 states and 124184 transitions. [2024-11-07 01:11:27,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-07 01:11:27,283 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:11:27,283 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07 01:11:27,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-07 01:11:27,284 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:11:27,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:11:27,284 INFO L85 PathProgramCache]: Analyzing trace with hash 617066973, now seen corresponding path program 1 times [2024-11-07 01:11:27,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:11:27,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148470280] [2024-11-07 01:11:27,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:11:27,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:11:27,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:11:27,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:11:27,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:11:27,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-11-07 01:11:27,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:11:27,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-07 01:11:27,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:11:27,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-07 01:11:27,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:11:27,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-07 01:11:27,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:11:27,482 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-07 01:11:27,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:11:27,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148470280] [2024-11-07 01:11:27,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148470280] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:11:27,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:11:27,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:11:27,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140218725] [2024-11-07 01:11:27,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:11:27,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:11:27,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:11:27,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:11:27,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:11:27,484 INFO L87 Difference]: Start difference. First operand 76802 states and 124184 transitions. Second operand has 7 states, 7 states have (on average 19.285714285714285) internal successors, (135), 5 states have internal predecessors, (135), 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)