./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/Problem05_label45+token_ring.07.cil-2.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_label45+token_ring.07.cil-2.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', 'ea2a15ada4a316287b701d4046ee75147e37e2af1b0a94d8406d231cafa83990'] 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_label45+token_ring.07.cil-2.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 ea2a15ada4a316287b701d4046ee75147e37e2af1b0a94d8406d231cafa83990 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 01:03:24,196 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 01:03:24,261 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:03:24,268 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 01:03:24,268 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 01:03:24,299 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 01:03:24,300 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 01:03:24,300 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 01:03:24,300 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 01:03:24,301 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 01:03:24,301 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 01:03:24,301 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 01:03:24,301 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 01:03:24,301 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 01:03:24,301 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 01:03:24,301 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 01:03:24,301 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 01:03:24,301 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 01:03:24,302 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 01:03:24,302 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 01:03:24,302 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 01:03:24,302 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 01:03:24,302 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 01:03:24,302 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 01:03:24,302 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 01:03:24,304 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 01:03:24,304 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 01:03:24,304 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 01:03:24,305 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 01:03:24,305 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 01:03:24,305 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 01:03:24,305 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 01:03:24,305 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 01:03:24,305 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 01:03:24,306 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 01:03:24,306 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 01:03:24,306 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 01:03:24,306 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 01:03:24,306 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 01:03:24,306 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 01:03:24,306 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 01:03:24,306 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 01:03:24,306 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 -> ea2a15ada4a316287b701d4046ee75147e37e2af1b0a94d8406d231cafa83990 [2024-11-07 01:03:24,603 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 01:03:24,612 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 01:03:24,614 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 01:03:24,615 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 01:03:24,615 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 01:03:24,618 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/Problem05_label45+token_ring.07.cil-2.c [2024-11-07 01:03:25,981 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 01:03:26,703 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 01:03:26,704 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label45+token_ring.07.cil-2.c [2024-11-07 01:03:26,762 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4d97ebbbe/292cf7225eba431abd23063f5c691811/FLAG829a5d088 [2024-11-07 01:03:27,045 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4d97ebbbe/292cf7225eba431abd23063f5c691811 [2024-11-07 01:03:27,049 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 01:03:27,050 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 01:03:27,051 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 01:03:27,051 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 01:03:27,055 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 01:03:27,055 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:03:27" (1/1) ... [2024-11-07 01:03:27,056 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23f9971f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:03:27, skipping insertion in model container [2024-11-07 01:03:27,056 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:03:27" (1/1) ... [2024-11-07 01:03:27,220 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 01:03:28,584 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_label45+token_ring.07.cil-2.c[380323,380336] [2024-11-07 01:03:28,618 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_label45+token_ring.07.cil-2.c[383339,383352] [2024-11-07 01:03:28,824 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 01:03:28,834 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 01:03:29,450 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_label45+token_ring.07.cil-2.c[380323,380336] [2024-11-07 01:03:29,455 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_label45+token_ring.07.cil-2.c[383339,383352] [2024-11-07 01:03:29,472 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 01:03:29,534 INFO L204 MainTranslator]: Completed translation [2024-11-07 01:03:29,537 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:03:29 WrapperNode [2024-11-07 01:03:29,537 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 01:03:29,539 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 01:03:29,539 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 01:03:29,539 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 01:03:29,545 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:03:29" (1/1) ... [2024-11-07 01:03:29,690 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:03:29" (1/1) ... [2024-11-07 01:03:30,128 INFO L138 Inliner]: procedures = 58, calls = 63, calls flagged for inlining = 35, calls inlined = 35, statements flattened = 12939 [2024-11-07 01:03:30,129 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 01:03:30,130 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 01:03:30,130 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 01:03:30,130 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 01:03:30,139 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:03:29" (1/1) ... [2024-11-07 01:03:30,140 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:03:29" (1/1) ... [2024-11-07 01:03:30,179 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:03:29" (1/1) ... [2024-11-07 01:03:30,255 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:03:30,255 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:03:29" (1/1) ... [2024-11-07 01:03:30,256 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:03:29" (1/1) ... [2024-11-07 01:03:30,490 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:03:29" (1/1) ... [2024-11-07 01:03:30,595 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:03:29" (1/1) ... [2024-11-07 01:03:30,625 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:03:29" (1/1) ... [2024-11-07 01:03:30,675 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:03:29" (1/1) ... [2024-11-07 01:03:30,752 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 01:03:30,754 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 01:03:30,754 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 01:03:30,754 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 01:03:30,755 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:03:29" (1/1) ... [2024-11-07 01:03:30,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 01:03:30,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 01:03:30,788 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:03:30,829 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:03:30,847 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 01:03:30,848 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2024-11-07 01:03:30,848 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2024-11-07 01:03:30,848 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-11-07 01:03:30,848 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-11-07 01:03:30,848 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2024-11-07 01:03:30,848 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2024-11-07 01:03:30,848 INFO L130 BoogieDeclarations]: Found specification of procedure error [2024-11-07 01:03:30,848 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2024-11-07 01:03:30,848 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2024-11-07 01:03:30,848 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2024-11-07 01:03:30,849 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2024-11-07 01:03:30,849 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2024-11-07 01:03:30,849 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2024-11-07 01:03:30,849 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2024-11-07 01:03:30,849 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 01:03:30,849 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 01:03:30,849 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 01:03:30,992 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 01:03:30,994 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 01:03:39,131 INFO L? ?]: Removed 1729 outVars from TransFormulas that were not future-live. [2024-11-07 01:03:39,131 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 01:03:39,198 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 01:03:39,198 INFO L316 CfgBuilder]: Removed 11 assume(true) statements. [2024-11-07 01:03:39,199 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:03:39 BoogieIcfgContainer [2024-11-07 01:03:39,199 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 01:03:39,202 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 01:03:39,203 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 01:03:39,207 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 01:03:39,207 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 01:03:27" (1/3) ... [2024-11-07 01:03:39,208 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e2e4a9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:03:39, skipping insertion in model container [2024-11-07 01:03:39,208 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:03:29" (2/3) ... [2024-11-07 01:03:39,208 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e2e4a9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:03:39, skipping insertion in model container [2024-11-07 01:03:39,209 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:03:39" (3/3) ... [2024-11-07 01:03:39,210 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem05_label45+token_ring.07.cil-2.c [2024-11-07 01:03:39,223 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 01:03:39,224 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-07 01:03:39,335 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 01:03:39,347 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;@42fc0a6b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 01:03:39,347 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-07 01:03:39,364 INFO L276 IsEmpty]: Start isEmpty. Operand has 2456 states, 2423 states have (on average 1.8472967395790343) internal successors, (4476), 2428 states have internal predecessors, (4476), 23 states have call successors, (23), 7 states have call predecessors, (23), 7 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2024-11-07 01:03:39,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-07 01:03:39,379 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:03:39,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] [2024-11-07 01:03:39,381 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:03:39,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:03:39,388 INFO L85 PathProgramCache]: Analyzing trace with hash -165382437, now seen corresponding path program 1 times [2024-11-07 01:03:39,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:03:39,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10338467] [2024-11-07 01:03:39,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:03:39,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:03:39,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:03:39,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:03:39,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:03:39,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 01:03:39,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:03:39,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-07 01:03:39,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:03:39,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 01:03:39,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:03:39,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-07 01:03:39,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:03:39,940 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:03:39,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:03:39,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10338467] [2024-11-07 01:03:39,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10338467] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:03:39,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:03:39,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 01:03:39,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931578114] [2024-11-07 01:03:39,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:03:39,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 01:03:39,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:03:39,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 01:03:39,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 01:03:39,982 INFO L87 Difference]: Start difference. First operand has 2456 states, 2423 states have (on average 1.8472967395790343) internal successors, (4476), 2428 states have internal predecessors, (4476), 23 states have call successors, (23), 7 states have call predecessors, (23), 7 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 5 states, 5 states have (on average 22.6) internal successors, (113), 3 states have internal predecessors, (113), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:03:41,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:03:41,431 INFO L93 Difference]: Finished difference Result 4986 states and 9171 transitions. [2024-11-07 01:03:41,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 01:03:41,434 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.6) internal successors, (113), 3 states have internal predecessors, (113), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 124 [2024-11-07 01:03:41,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:03:41,466 INFO L225 Difference]: With dead ends: 4986 [2024-11-07 01:03:41,466 INFO L226 Difference]: Without dead ends: 2475 [2024-11-07 01:03:41,480 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-07 01:03:41,484 INFO L432 NwaCegarLoop]: 4279 mSDtfsCounter, 679 mSDsluCounter, 12369 mSDsCounter, 0 mSdLazyCounter, 652 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 698 SdHoareTripleChecker+Valid, 16648 SdHoareTripleChecker+Invalid, 702 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 652 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-07 01:03:41,485 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [698 Valid, 16648 Invalid, 702 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [50 Valid, 652 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-07 01:03:41,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2475 states. [2024-11-07 01:03:41,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2475 to 2388. [2024-11-07 01:03:41,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2388 states, 2357 states have (on average 1.8341111582520153) internal successors, (4323), 2360 states have internal predecessors, (4323), 23 states have call successors, (23), 7 states have call predecessors, (23), 6 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-07 01:03:41,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2388 states to 2388 states and 4367 transitions. [2024-11-07 01:03:41,671 INFO L78 Accepts]: Start accepts. Automaton has 2388 states and 4367 transitions. Word has length 124 [2024-11-07 01:03:41,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:03:41,672 INFO L471 AbstractCegarLoop]: Abstraction has 2388 states and 4367 transitions. [2024-11-07 01:03:41,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.6) internal successors, (113), 3 states have internal predecessors, (113), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:03:41,672 INFO L276 IsEmpty]: Start isEmpty. Operand 2388 states and 4367 transitions. [2024-11-07 01:03:41,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-07 01:03:41,681 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:03:41,681 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] [2024-11-07 01:03:41,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 01:03:41,681 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:03:41,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:03:41,682 INFO L85 PathProgramCache]: Analyzing trace with hash 873202137, now seen corresponding path program 1 times [2024-11-07 01:03:41,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:03:41,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675556350] [2024-11-07 01:03:41,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:03:41,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:03:41,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:03:41,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:03:41,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:03:41,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 01:03:41,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:03:42,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-07 01:03:42,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:03:42,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 01:03:42,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:03:42,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-07 01:03:42,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:03:42,105 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:03:42,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:03:42,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675556350] [2024-11-07 01:03:42,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675556350] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:03:42,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:03:42,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 01:03:42,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166670619] [2024-11-07 01:03:42,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:03:42,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 01:03:42,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:03:42,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 01:03:42,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 01:03:42,110 INFO L87 Difference]: Start difference. First operand 2388 states and 4367 transitions. Second operand has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 4 states have internal predecessors, (113), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:03:43,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:03:43,979 INFO L93 Difference]: Finished difference Result 3074 states and 5454 transitions. [2024-11-07 01:03:43,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 01:03:43,980 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 4 states have internal predecessors, (113), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 124 [2024-11-07 01:03:43,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:03:43,997 INFO L225 Difference]: With dead ends: 3074 [2024-11-07 01:03:43,998 INFO L226 Difference]: Without dead ends: 2822 [2024-11-07 01:03:44,000 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-07 01:03:44,001 INFO L432 NwaCegarLoop]: 4190 mSDtfsCounter, 4967 mSDsluCounter, 12573 mSDsCounter, 0 mSdLazyCounter, 1430 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4981 SdHoareTripleChecker+Valid, 16763 SdHoareTripleChecker+Invalid, 1526 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 1430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-07 01:03:44,001 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4981 Valid, 16763 Invalid, 1526 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [96 Valid, 1430 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-07 01:03:44,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2822 states. [2024-11-07 01:03:44,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2822 to 2647. [2024-11-07 01:03:44,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2647 states, 2593 states have (on average 1.8094870806016197) internal successors, (4692), 2597 states have internal predecessors, (4692), 39 states have call successors, (39), 13 states have call predecessors, (39), 13 states have return successors, (40), 37 states have call predecessors, (40), 37 states have call successors, (40) [2024-11-07 01:03:44,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2647 states to 2647 states and 4771 transitions. [2024-11-07 01:03:44,097 INFO L78 Accepts]: Start accepts. Automaton has 2647 states and 4771 transitions. Word has length 124 [2024-11-07 01:03:44,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:03:44,099 INFO L471 AbstractCegarLoop]: Abstraction has 2647 states and 4771 transitions. [2024-11-07 01:03:44,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 4 states have internal predecessors, (113), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:03:44,099 INFO L276 IsEmpty]: Start isEmpty. Operand 2647 states and 4771 transitions. [2024-11-07 01:03:44,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-07 01:03:44,101 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:03:44,101 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] [2024-11-07 01:03:44,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 01:03:44,101 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:03:44,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:03:44,101 INFO L85 PathProgramCache]: Analyzing trace with hash -144446251, now seen corresponding path program 1 times [2024-11-07 01:03:44,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:03:44,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062211258] [2024-11-07 01:03:44,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:03:44,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:03:44,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:03:44,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:03:44,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:03:44,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 01:03:44,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:03:44,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-07 01:03:44,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:03:44,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 01:03:44,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:03:44,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-07 01:03:44,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:03:44,403 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:03:44,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:03:44,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062211258] [2024-11-07 01:03:44,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062211258] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:03:44,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:03:44,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:03:44,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508851339] [2024-11-07 01:03:44,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:03:44,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:03:44,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:03:44,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:03:44,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:03:44,406 INFO L87 Difference]: Start difference. First operand 2647 states and 4771 transitions. Second operand has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 5 states have internal predecessors, (113), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:03:46,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:03:46,733 INFO L93 Difference]: Finished difference Result 3688 states and 6419 transitions. [2024-11-07 01:03:46,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 01:03:46,734 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 5 states have internal predecessors, (113), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 124 [2024-11-07 01:03:46,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:03:46,749 INFO L225 Difference]: With dead ends: 3688 [2024-11-07 01:03:46,750 INFO L226 Difference]: Without dead ends: 3177 [2024-11-07 01:03:46,753 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:03:46,754 INFO L432 NwaCegarLoop]: 4367 mSDtfsCounter, 4978 mSDsluCounter, 17219 mSDsCounter, 0 mSdLazyCounter, 2290 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4992 SdHoareTripleChecker+Valid, 21586 SdHoareTripleChecker+Invalid, 2345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 2290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-07 01:03:46,754 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4992 Valid, 21586 Invalid, 2345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 2290 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-07 01:03:46,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3177 states. [2024-11-07 01:03:46,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3177 to 2889. [2024-11-07 01:03:46,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2889 states, 2812 states have (on average 1.7876955903271692) internal successors, (5027), 2817 states have internal predecessors, (5027), 55 states have call successors, (55), 19 states have call predecessors, (55), 20 states have return successors, (58), 54 states have call predecessors, (58), 53 states have call successors, (58) [2024-11-07 01:03:46,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2889 states to 2889 states and 5140 transitions. [2024-11-07 01:03:46,858 INFO L78 Accepts]: Start accepts. Automaton has 2889 states and 5140 transitions. Word has length 124 [2024-11-07 01:03:46,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:03:46,858 INFO L471 AbstractCegarLoop]: Abstraction has 2889 states and 5140 transitions. [2024-11-07 01:03:46,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 5 states have internal predecessors, (113), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:03:46,859 INFO L276 IsEmpty]: Start isEmpty. Operand 2889 states and 5140 transitions. [2024-11-07 01:03:46,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-07 01:03:46,861 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:03:46,861 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] [2024-11-07 01:03:46,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 01:03:46,861 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:03:46,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:03:46,862 INFO L85 PathProgramCache]: Analyzing trace with hash -26004777, now seen corresponding path program 1 times [2024-11-07 01:03:46,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:03:46,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655739017] [2024-11-07 01:03:46,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:03:46,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:03:46,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:03:46,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:03:46,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:03:46,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 01:03:46,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:03:47,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-07 01:03:47,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:03:47,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 01:03:47,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:03:47,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-07 01:03:47,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:03:47,078 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:03:47,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:03:47,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655739017] [2024-11-07 01:03:47,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655739017] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:03:47,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:03:47,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:03:47,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34755527] [2024-11-07 01:03:47,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:03:47,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:03:47,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:03:47,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:03:47,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:03:47,081 INFO L87 Difference]: Start difference. First operand 2889 states and 5140 transitions. Second operand has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 5 states have internal predecessors, (113), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:03:49,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:03:49,021 INFO L93 Difference]: Finished difference Result 4593 states and 7832 transitions. [2024-11-07 01:03:49,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 01:03:49,021 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 5 states have internal predecessors, (113), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 124 [2024-11-07 01:03:49,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:03:49,037 INFO L225 Difference]: With dead ends: 4593 [2024-11-07 01:03:49,037 INFO L226 Difference]: Without dead ends: 3840 [2024-11-07 01:03:49,041 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-07 01:03:49,042 INFO L432 NwaCegarLoop]: 4365 mSDtfsCounter, 4976 mSDsluCounter, 17219 mSDsCounter, 0 mSdLazyCounter, 2286 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4990 SdHoareTripleChecker+Valid, 21584 SdHoareTripleChecker+Invalid, 2343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 2286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-07 01:03:49,042 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4990 Valid, 21584 Invalid, 2343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 2286 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-07 01:03:49,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3840 states. [2024-11-07 01:03:49,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3840 to 3374. [2024-11-07 01:03:49,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3374 states, 3251 states have (on average 1.7526914795447555) internal successors, (5698), 3258 states have internal predecessors, (5698), 87 states have call successors, (87), 31 states have call predecessors, (87), 34 states have return successors, (98), 88 states have call predecessors, (98), 85 states have call successors, (98) [2024-11-07 01:03:49,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3374 states to 3374 states and 5883 transitions. [2024-11-07 01:03:49,169 INFO L78 Accepts]: Start accepts. Automaton has 3374 states and 5883 transitions. Word has length 124 [2024-11-07 01:03:49,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:03:49,170 INFO L471 AbstractCegarLoop]: Abstraction has 3374 states and 5883 transitions. [2024-11-07 01:03:49,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 5 states have internal predecessors, (113), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:03:49,170 INFO L276 IsEmpty]: Start isEmpty. Operand 3374 states and 5883 transitions. [2024-11-07 01:03:49,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-07 01:03:49,174 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:03:49,175 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] [2024-11-07 01:03:49,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 01:03:49,175 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:03:49,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:03:49,176 INFO L85 PathProgramCache]: Analyzing trace with hash 1363289237, now seen corresponding path program 1 times [2024-11-07 01:03:49,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:03:49,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372708152] [2024-11-07 01:03:49,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:03:49,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:03:49,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:03:49,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:03:49,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:03:49,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 01:03:49,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:03:49,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-07 01:03:49,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:03:49,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 01:03:49,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:03:49,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-07 01:03:49,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:03:49,406 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:03:49,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:03:49,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372708152] [2024-11-07 01:03:49,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372708152] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:03:49,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:03:49,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:03:49,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603810185] [2024-11-07 01:03:49,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:03:49,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:03:49,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:03:49,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:03:49,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:03:49,411 INFO L87 Difference]: Start difference. First operand 3374 states and 5883 transitions. Second operand has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 5 states have internal predecessors, (113), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:03:51,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:03:51,383 INFO L93 Difference]: Finished difference Result 6338 states and 10543 transitions. [2024-11-07 01:03:51,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 01:03:51,383 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 5 states have internal predecessors, (113), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 124 [2024-11-07 01:03:51,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:03:51,403 INFO L225 Difference]: With dead ends: 6338 [2024-11-07 01:03:51,403 INFO L226 Difference]: Without dead ends: 5100 [2024-11-07 01:03:51,408 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-07 01:03:51,409 INFO L432 NwaCegarLoop]: 4365 mSDtfsCounter, 4972 mSDsluCounter, 17219 mSDsCounter, 0 mSdLazyCounter, 2277 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4986 SdHoareTripleChecker+Valid, 21584 SdHoareTripleChecker+Invalid, 2334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 2277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-07 01:03:51,409 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4986 Valid, 21584 Invalid, 2334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 2277 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-07 01:03:51,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5100 states. [2024-11-07 01:03:51,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5100 to 4345. [2024-11-07 01:03:51,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4345 states, 4130 states have (on average 1.7046004842615012) internal successors, (7040), 4141 states have internal predecessors, (7040), 151 states have call successors, (151), 55 states have call predecessors, (151), 62 states have return successors, (184), 156 states have call predecessors, (184), 149 states have call successors, (184) [2024-11-07 01:03:51,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4345 states to 4345 states and 7375 transitions. [2024-11-07 01:03:51,568 INFO L78 Accepts]: Start accepts. Automaton has 4345 states and 7375 transitions. Word has length 124 [2024-11-07 01:03:51,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:03:51,569 INFO L471 AbstractCegarLoop]: Abstraction has 4345 states and 7375 transitions. [2024-11-07 01:03:51,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 5 states have internal predecessors, (113), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:03:51,569 INFO L276 IsEmpty]: Start isEmpty. Operand 4345 states and 7375 transitions. [2024-11-07 01:03:51,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-07 01:03:51,572 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:03:51,572 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] [2024-11-07 01:03:51,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 01:03:51,572 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:03:51,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:03:51,573 INFO L85 PathProgramCache]: Analyzing trace with hash -670104809, now seen corresponding path program 1 times [2024-11-07 01:03:51,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:03:51,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839866748] [2024-11-07 01:03:51,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:03:51,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:03:51,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:03:51,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:03:51,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:03:51,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 01:03:51,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:03:51,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-07 01:03:51,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:03:51,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 01:03:51,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:03:51,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-07 01:03:51,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:03:51,767 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:03:51,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:03:51,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839866748] [2024-11-07 01:03:51,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839866748] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:03:51,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:03:51,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:03:51,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550024178] [2024-11-07 01:03:51,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:03:51,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:03:51,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:03:51,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:03:51,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:03:51,769 INFO L87 Difference]: Start difference. First operand 4345 states and 7375 transitions. Second operand has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 5 states have internal predecessors, (113), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:03:53,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:03:53,817 INFO L93 Difference]: Finished difference Result 9827 states and 15981 transitions. [2024-11-07 01:03:53,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 01:03:53,818 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 5 states have internal predecessors, (113), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 124 [2024-11-07 01:03:53,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:03:53,852 INFO L225 Difference]: With dead ends: 9827 [2024-11-07 01:03:53,852 INFO L226 Difference]: Without dead ends: 7618 [2024-11-07 01:03:53,862 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-07 01:03:53,864 INFO L432 NwaCegarLoop]: 4365 mSDtfsCounter, 4968 mSDsluCounter, 17219 mSDsCounter, 0 mSdLazyCounter, 2268 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4982 SdHoareTripleChecker+Valid, 21584 SdHoareTripleChecker+Invalid, 2325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 2268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-07 01:03:53,864 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4982 Valid, 21584 Invalid, 2325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 2268 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-07 01:03:53,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7618 states. [2024-11-07 01:03:54,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7618 to 6292. [2024-11-07 01:03:54,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6292 states, 5893 states have (on average 1.6511114882063465) internal successors, (9730), 5912 states have internal predecessors, (9730), 279 states have call successors, (279), 103 states have call predecessors, (279), 118 states have return successors, (374), 292 states have call predecessors, (374), 277 states have call successors, (374) [2024-11-07 01:03:54,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6292 states to 6292 states and 10383 transitions. [2024-11-07 01:03:54,168 INFO L78 Accepts]: Start accepts. Automaton has 6292 states and 10383 transitions. Word has length 124 [2024-11-07 01:03:54,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:03:54,169 INFO L471 AbstractCegarLoop]: Abstraction has 6292 states and 10383 transitions. [2024-11-07 01:03:54,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 5 states have internal predecessors, (113), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:03:54,170 INFO L276 IsEmpty]: Start isEmpty. Operand 6292 states and 10383 transitions. [2024-11-07 01:03:54,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-07 01:03:54,175 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:03:54,175 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] [2024-11-07 01:03:54,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 01:03:54,175 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:03:54,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:03:54,176 INFO L85 PathProgramCache]: Analyzing trace with hash 1758153813, now seen corresponding path program 1 times [2024-11-07 01:03:54,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:03:54,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179526274] [2024-11-07 01:03:54,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:03:54,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:03:54,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:03:54,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:03:54,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:03:54,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 01:03:54,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:03:54,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-07 01:03:54,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:03:54,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 01:03:54,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:03:54,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-07 01:03:54,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:03:54,368 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:03:54,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:03:54,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179526274] [2024-11-07 01:03:54,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179526274] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:03:54,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:03:54,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:03:54,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568429760] [2024-11-07 01:03:54,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:03:54,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:03:54,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:03:54,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:03:54,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:03:54,370 INFO L87 Difference]: Start difference. First operand 6292 states and 10383 transitions. Second operand has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 5 states have internal predecessors, (113), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:03:56,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:03:56,615 INFO L93 Difference]: Finished difference Result 16804 states and 26915 transitions. [2024-11-07 01:03:56,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 01:03:56,615 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 5 states have internal predecessors, (113), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 124 [2024-11-07 01:03:56,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:03:56,666 INFO L225 Difference]: With dead ends: 16804 [2024-11-07 01:03:56,667 INFO L226 Difference]: Without dead ends: 12648 [2024-11-07 01:03:56,684 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-07 01:03:56,685 INFO L432 NwaCegarLoop]: 4365 mSDtfsCounter, 4970 mSDsluCounter, 17219 mSDsCounter, 0 mSdLazyCounter, 2254 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4984 SdHoareTripleChecker+Valid, 21584 SdHoareTripleChecker+Invalid, 2311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 2254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-07 01:03:56,686 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4984 Valid, 21584 Invalid, 2311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 2254 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-07 01:03:56,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12648 states. [2024-11-07 01:03:57,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12648 to 10199. [2024-11-07 01:03:57,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10199 states, 9432 states have (on average 1.6039016115351994) internal successors, (15128), 9467 states have internal predecessors, (15128), 535 states have call successors, (535), 199 states have call predecessors, (535), 230 states have return successors, (808), 564 states have call predecessors, (808), 533 states have call successors, (808) [2024-11-07 01:03:57,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10199 states to 10199 states and 16471 transitions. [2024-11-07 01:03:57,243 INFO L78 Accepts]: Start accepts. Automaton has 10199 states and 16471 transitions. Word has length 124 [2024-11-07 01:03:57,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:03:57,244 INFO L471 AbstractCegarLoop]: Abstraction has 10199 states and 16471 transitions. [2024-11-07 01:03:57,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 5 states have internal predecessors, (113), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:03:57,245 INFO L276 IsEmpty]: Start isEmpty. Operand 10199 states and 16471 transitions. [2024-11-07 01:03:57,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-07 01:03:57,252 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:03:57,253 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] [2024-11-07 01:03:57,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 01:03:57,253 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:03:57,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:03:57,254 INFO L85 PathProgramCache]: Analyzing trace with hash 451011415, now seen corresponding path program 1 times [2024-11-07 01:03:57,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:03:57,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068653986] [2024-11-07 01:03:57,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:03:57,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:03:57,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:03:57,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:03:57,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:03:57,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 01:03:57,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:03:57,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-07 01:03:57,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:03:57,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 01:03:57,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:03:57,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-07 01:03:57,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:03:57,474 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:03:57,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:03:57,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068653986] [2024-11-07 01:03:57,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068653986] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:03:57,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:03:57,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:03:57,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77820673] [2024-11-07 01:03:57,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:03:57,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:03:57,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:03:57,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:03:57,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:03:57,479 INFO L87 Difference]: Start difference. First operand 10199 states and 16471 transitions. Second operand has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 5 states have internal predecessors, (113), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:03:58,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:03:58,826 INFO L93 Difference]: Finished difference Result 20804 states and 33396 transitions. [2024-11-07 01:03:58,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 01:03:58,827 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 5 states have internal predecessors, (113), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 124 [2024-11-07 01:03:58,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:03:58,872 INFO L225 Difference]: With dead ends: 20804 [2024-11-07 01:03:58,872 INFO L226 Difference]: Without dead ends: 12741 [2024-11-07 01:03:58,891 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-11-07 01:03:58,892 INFO L432 NwaCegarLoop]: 4175 mSDtfsCounter, 4818 mSDsluCounter, 12407 mSDsCounter, 0 mSdLazyCounter, 1020 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4833 SdHoareTripleChecker+Valid, 16582 SdHoareTripleChecker+Invalid, 1102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 1020 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-07 01:03:58,892 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4833 Valid, 16582 Invalid, 1102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 1020 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-07 01:03:58,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12741 states. [2024-11-07 01:03:59,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12741 to 10199. [2024-11-07 01:03:59,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10199 states, 9432 states have (on average 1.6004028837998303) internal successors, (15095), 9467 states have internal predecessors, (15095), 535 states have call successors, (535), 199 states have call predecessors, (535), 230 states have return successors, (808), 564 states have call predecessors, (808), 533 states have call successors, (808) [2024-11-07 01:03:59,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10199 states to 10199 states and 16438 transitions. [2024-11-07 01:03:59,281 INFO L78 Accepts]: Start accepts. Automaton has 10199 states and 16438 transitions. Word has length 124 [2024-11-07 01:03:59,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:03:59,281 INFO L471 AbstractCegarLoop]: Abstraction has 10199 states and 16438 transitions. [2024-11-07 01:03:59,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 5 states have internal predecessors, (113), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:03:59,282 INFO L276 IsEmpty]: Start isEmpty. Operand 10199 states and 16438 transitions. [2024-11-07 01:03:59,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-07 01:03:59,288 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:03:59,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] [2024-11-07 01:03:59,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 01:03:59,289 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:03:59,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:03:59,289 INFO L85 PathProgramCache]: Analyzing trace with hash 1482052313, now seen corresponding path program 1 times [2024-11-07 01:03:59,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:03:59,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880082585] [2024-11-07 01:03:59,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:03:59,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:03:59,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:03:59,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:03:59,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:03:59,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 01:03:59,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:03:59,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-07 01:03:59,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:03:59,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 01:03:59,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:03:59,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-07 01:03:59,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:03:59,470 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:03:59,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:03:59,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880082585] [2024-11-07 01:03:59,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880082585] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:03:59,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:03:59,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:03:59,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929067091] [2024-11-07 01:03:59,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:03:59,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:03:59,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:03:59,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:03:59,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:03:59,471 INFO L87 Difference]: Start difference. First operand 10199 states and 16438 transitions. Second operand has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 5 states have internal predecessors, (113), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:04:02,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:04:02,599 INFO L93 Difference]: Finished difference Result 34116 states and 53867 transitions. [2024-11-07 01:04:02,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-07 01:04:02,600 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 5 states have internal predecessors, (113), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 124 [2024-11-07 01:04:02,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:04:02,687 INFO L225 Difference]: With dead ends: 34116 [2024-11-07 01:04:02,687 INFO L226 Difference]: Without dead ends: 26053 [2024-11-07 01:04:02,712 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-11-07 01:04:02,714 INFO L432 NwaCegarLoop]: 4363 mSDtfsCounter, 5250 mSDsluCounter, 17211 mSDsCounter, 0 mSdLazyCounter, 2194 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5272 SdHoareTripleChecker+Valid, 21574 SdHoareTripleChecker+Invalid, 2254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 2194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-07 01:04:02,714 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5272 Valid, 21574 Invalid, 2254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 2194 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-07 01:04:02,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26053 states. [2024-11-07 01:04:03,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26053 to 18012. [2024-11-07 01:04:03,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18012 states, 16541 states have (on average 1.568043044555952) internal successors, (25937), 16608 states have internal predecessors, (25937), 1015 states have call successors, (1015), 391 states have call predecessors, (1015), 454 states have return successors, (1806), 1076 states have call predecessors, (1806), 1013 states have call successors, (1806) [2024-11-07 01:04:03,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18012 states to 18012 states and 28758 transitions. [2024-11-07 01:04:03,599 INFO L78 Accepts]: Start accepts. Automaton has 18012 states and 28758 transitions. Word has length 124 [2024-11-07 01:04:03,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:04:03,600 INFO L471 AbstractCegarLoop]: Abstraction has 18012 states and 28758 transitions. [2024-11-07 01:04:03,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 5 states have internal predecessors, (113), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:04:03,600 INFO L276 IsEmpty]: Start isEmpty. Operand 18012 states and 28758 transitions. [2024-11-07 01:04:03,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-07 01:04:03,612 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:04:03,612 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] [2024-11-07 01:04:03,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-07 01:04:03,612 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:04:03,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:04:03,613 INFO L85 PathProgramCache]: Analyzing trace with hash -424350953, now seen corresponding path program 1 times [2024-11-07 01:04:03,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:04:03,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982223044] [2024-11-07 01:04:03,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:04:03,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:04:03,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:04:03,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:04:03,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:04:03,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 01:04:03,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:04:03,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-07 01:04:03,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:04:03,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 01:04:03,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:04:03,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-07 01:04:03,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:04:03,818 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:04:03,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:04:03,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982223044] [2024-11-07 01:04:03,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982223044] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:04:03,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:04:03,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:04:03,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761567317] [2024-11-07 01:04:03,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:04:03,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:04:03,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:04:03,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:04:03,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:04:03,820 INFO L87 Difference]: Start difference. First operand 18012 states and 28758 transitions. Second operand has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 5 states have internal predecessors, (113), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:04:07,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:04:07,577 INFO L93 Difference]: Finished difference Result 64395 states and 101985 transitions. [2024-11-07 01:04:07,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-07 01:04:07,578 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 5 states have internal predecessors, (113), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 124 [2024-11-07 01:04:07,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:04:07,750 INFO L225 Difference]: With dead ends: 64395 [2024-11-07 01:04:07,751 INFO L226 Difference]: Without dead ends: 48519 [2024-11-07 01:04:07,796 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-11-07 01:04:07,799 INFO L432 NwaCegarLoop]: 4362 mSDtfsCounter, 5020 mSDsluCounter, 17208 mSDsCounter, 0 mSdLazyCounter, 2612 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5033 SdHoareTripleChecker+Valid, 21570 SdHoareTripleChecker+Invalid, 2671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 2612 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-07 01:04:07,799 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5033 Valid, 21570 Invalid, 2671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 2612 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-07 01:04:07,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48519 states. [2024-11-07 01:04:09,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48519 to 32961. [2024-11-07 01:04:09,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32961 states, 30114 states have (on average 1.5438334329547718) internal successors, (46491), 30245 states have internal predecessors, (46491), 1943 states have call successors, (1943), 775 states have call predecessors, (1943), 902 states have return successors, (4256), 2068 states have call predecessors, (4256), 1941 states have call successors, (4256) [2024-11-07 01:04:09,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32961 states to 32961 states and 52690 transitions. [2024-11-07 01:04:09,866 INFO L78 Accepts]: Start accepts. Automaton has 32961 states and 52690 transitions. Word has length 124 [2024-11-07 01:04:09,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:04:09,867 INFO L471 AbstractCegarLoop]: Abstraction has 32961 states and 52690 transitions. [2024-11-07 01:04:09,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 5 states have internal predecessors, (113), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:04:09,867 INFO L276 IsEmpty]: Start isEmpty. Operand 32961 states and 52690 transitions. [2024-11-07 01:04:09,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-07 01:04:09,886 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:04:09,886 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] [2024-11-07 01:04:09,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-07 01:04:09,886 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:04:09,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:04:09,887 INFO L85 PathProgramCache]: Analyzing trace with hash 1176720153, now seen corresponding path program 1 times [2024-11-07 01:04:09,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:04:09,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340259044] [2024-11-07 01:04:09,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:04:09,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:04:09,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:04:09,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:04:09,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:04:10,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 01:04:10,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:04:10,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-07 01:04:10,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:04:10,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 01:04:10,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:04:10,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-07 01:04:10,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:04:10,077 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:04:10,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:04:10,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340259044] [2024-11-07 01:04:10,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340259044] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:04:10,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:04:10,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:04:10,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960450332] [2024-11-07 01:04:10,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:04:10,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:04:10,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:04:10,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:04:10,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:04:10,079 INFO L87 Difference]: Start difference. First operand 32961 states and 52690 transitions. Second operand has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 5 states have internal predecessors, (113), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:04:15,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:04:15,196 INFO L93 Difference]: Finished difference Result 121846 states and 194751 transitions. [2024-11-07 01:04:15,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-07 01:04:15,197 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 5 states have internal predecessors, (113), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 124 [2024-11-07 01:04:15,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:04:15,594 INFO L225 Difference]: With dead ends: 121846 [2024-11-07 01:04:15,594 INFO L226 Difference]: Without dead ends: 91021 [2024-11-07 01:04:15,716 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-11-07 01:04:15,717 INFO L432 NwaCegarLoop]: 4363 mSDtfsCounter, 5170 mSDsluCounter, 17211 mSDsCounter, 0 mSdLazyCounter, 2168 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5192 SdHoareTripleChecker+Valid, 21574 SdHoareTripleChecker+Invalid, 2228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 2168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-07 01:04:15,717 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5192 Valid, 21574 Invalid, 2228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 2168 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-07 01:04:15,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91021 states. [2024-11-07 01:04:19,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91021 to 63434. [2024-11-07 01:04:19,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63434 states, 57899 states have (on average 1.533929774262077) internal successors, (88813), 58158 states have internal predecessors, (88813), 3735 states have call successors, (3735), 1543 states have call predecessors, (3735), 1798 states have return successors, (10550), 3988 states have call predecessors, (10550), 3733 states have call successors, (10550) [2024-11-07 01:04:19,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63434 states to 63434 states and 103098 transitions. [2024-11-07 01:04:19,675 INFO L78 Accepts]: Start accepts. Automaton has 63434 states and 103098 transitions. Word has length 124 [2024-11-07 01:04:19,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:04:19,676 INFO L471 AbstractCegarLoop]: Abstraction has 63434 states and 103098 transitions. [2024-11-07 01:04:19,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 5 states have internal predecessors, (113), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:04:19,676 INFO L276 IsEmpty]: Start isEmpty. Operand 63434 states and 103098 transitions. [2024-11-07 01:04:19,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-07 01:04:19,713 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:04:19,713 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] [2024-11-07 01:04:19,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-07 01:04:19,713 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:04:19,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:04:19,714 INFO L85 PathProgramCache]: Analyzing trace with hash 119988951, now seen corresponding path program 1 times [2024-11-07 01:04:19,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:04:19,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777802502] [2024-11-07 01:04:19,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:04:19,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:04:19,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:04:19,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:04:19,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:04:19,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 01:04:19,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:04:19,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-07 01:04:19,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:04:19,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 01:04:19,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:04:19,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-07 01:04:19,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:04:19,886 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:04:19,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:04:19,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777802502] [2024-11-07 01:04:19,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777802502] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:04:19,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:04:19,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:04:19,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852855437] [2024-11-07 01:04:19,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:04:19,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:04:19,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:04:19,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:04:19,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:04:19,888 INFO L87 Difference]: Start difference. First operand 63434 states and 103098 transitions. Second operand has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 5 states have internal predecessors, (113), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:04:28,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:04:28,806 INFO L93 Difference]: Finished difference Result 236173 states and 385669 transitions. [2024-11-07 01:04:28,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-07 01:04:28,806 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 5 states have internal predecessors, (113), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 124 [2024-11-07 01:04:28,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:04:29,507 INFO L225 Difference]: With dead ends: 236173 [2024-11-07 01:04:29,507 INFO L226 Difference]: Without dead ends: 174875 [2024-11-07 01:04:29,718 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-11-07 01:04:29,718 INFO L432 NwaCegarLoop]: 4363 mSDtfsCounter, 5130 mSDsluCounter, 17211 mSDsCounter, 0 mSdLazyCounter, 2155 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5152 SdHoareTripleChecker+Valid, 21574 SdHoareTripleChecker+Invalid, 2215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 2155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-07 01:04:29,718 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5152 Valid, 21574 Invalid, 2215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 2155 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-07 01:04:29,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174875 states. [2024-11-07 01:04:35,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174875 to 124251. [2024-11-07 01:04:35,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124251 states, 113468 states have (on average 1.5297969471569077) internal successors, (173583), 113983 states have internal predecessors, (173583), 7191 states have call successors, (7191), 3079 states have call predecessors, (7191), 3590 states have return successors, (27384), 7700 states have call predecessors, (27384), 7189 states have call successors, (27384) [2024-11-07 01:04:35,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124251 states to 124251 states and 208158 transitions. [2024-11-07 01:04:35,950 INFO L78 Accepts]: Start accepts. Automaton has 124251 states and 208158 transitions. Word has length 124 [2024-11-07 01:04:35,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:04:35,950 INFO L471 AbstractCegarLoop]: Abstraction has 124251 states and 208158 transitions. [2024-11-07 01:04:35,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 5 states have internal predecessors, (113), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:04:35,950 INFO L276 IsEmpty]: Start isEmpty. Operand 124251 states and 208158 transitions. [2024-11-07 01:04:36,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-07 01:04:36,022 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:04:36,022 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] [2024-11-07 01:04:36,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-07 01:04:36,023 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:04:36,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:04:36,023 INFO L85 PathProgramCache]: Analyzing trace with hash 1471374169, now seen corresponding path program 1 times [2024-11-07 01:04:36,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:04:36,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876100867] [2024-11-07 01:04:36,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:04:36,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:04:36,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:04:36,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:04:36,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:04:36,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 01:04:36,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:04:36,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-07 01:04:36,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:04:36,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-07 01:04:36,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:04:36,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-07 01:04:36,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:04:36,198 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:04:36,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:04:36,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876100867] [2024-11-07 01:04:36,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876100867] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:04:36,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:04:36,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:04:36,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172299103] [2024-11-07 01:04:36,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:04:36,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:04:36,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:04:36,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:04:36,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:04:36,201 INFO L87 Difference]: Start difference. First operand 124251 states and 208158 transitions. Second operand has 7 states, 7 states have (on average 16.142857142857142) internal successors, (113), 5 states have internal predecessors, (113), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5)