./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.14.cil.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/pc_sfifo_3.cil+token_ring.14.cil.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', '5519dfe0be74dafaa274c71ed936f0e7133f32a3aa7e45c032b5d5b905afa484'] 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/pc_sfifo_3.cil+token_ring.14.cil.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 5519dfe0be74dafaa274c71ed936f0e7133f32a3aa7e45c032b5d5b905afa484 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 01:49:11,076 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 01:49:11,162 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:49:11,168 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 01:49:11,168 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 01:49:11,188 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 01:49:11,190 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 01:49:11,190 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 01:49:11,190 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 01:49:11,191 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 01:49:11,191 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 01:49:11,191 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 01:49:11,192 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 01:49:11,192 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 01:49:11,192 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 01:49:11,192 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 01:49:11,192 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 01:49:11,192 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 01:49:11,192 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 01:49:11,193 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 01:49:11,193 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 01:49:11,193 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 01:49:11,193 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 01:49:11,193 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 01:49:11,193 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 01:49:11,193 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 01:49:11,193 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 01:49:11,193 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 01:49:11,194 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 01:49:11,194 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 01:49:11,194 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 01:49:11,194 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 01:49:11,194 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 01:49:11,194 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 01:49:11,194 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 01:49:11,195 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 01:49:11,195 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 01:49:11,195 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 01:49:11,195 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 01:49:11,195 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 01:49:11,195 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 01:49:11,195 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 01:49:11,195 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 -> 5519dfe0be74dafaa274c71ed936f0e7133f32a3aa7e45c032b5d5b905afa484 [2024-11-07 01:49:11,375 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 01:49:11,383 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 01:49:11,385 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 01:49:11,385 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 01:49:11,385 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 01:49:11,386 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.14.cil.c [2024-11-07 01:49:12,592 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 01:49:12,898 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 01:49:12,899 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.14.cil.c [2024-11-07 01:49:12,917 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4a3ebb35e/e68d97fd0f8e4a87b35df21955155955/FLAG521a65bb2 [2024-11-07 01:49:13,202 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4a3ebb35e/e68d97fd0f8e4a87b35df21955155955 [2024-11-07 01:49:13,204 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 01:49:13,205 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 01:49:13,205 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 01:49:13,207 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 01:49:13,210 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 01:49:13,211 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:49:13" (1/1) ... [2024-11-07 01:49:13,212 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9e100bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:49:13, skipping insertion in model container [2024-11-07 01:49:13,212 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:49:13" (1/1) ... [2024-11-07 01:49:13,248 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 01:49:13,343 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/pc_sfifo_3.cil+token_ring.14.cil.c[911,924] [2024-11-07 01:49:13,378 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/pc_sfifo_3.cil+token_ring.14.cil.c[8416,8429] [2024-11-07 01:49:13,435 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 01:49:13,443 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 01:49:13,451 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/pc_sfifo_3.cil+token_ring.14.cil.c[911,924] [2024-11-07 01:49:13,467 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/pc_sfifo_3.cil+token_ring.14.cil.c[8416,8429] [2024-11-07 01:49:13,500 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 01:49:13,518 INFO L204 MainTranslator]: Completed translation [2024-11-07 01:49:13,518 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:49:13 WrapperNode [2024-11-07 01:49:13,518 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 01:49:13,519 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 01:49:13,519 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 01:49:13,519 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 01:49:13,523 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:49:13" (1/1) ... [2024-11-07 01:49:13,531 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:49:13" (1/1) ... [2024-11-07 01:49:13,564 INFO L138 Inliner]: procedures = 79, calls = 98, calls flagged for inlining = 47, calls inlined = 47, statements flattened = 1110 [2024-11-07 01:49:13,564 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 01:49:13,565 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 01:49:13,565 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 01:49:13,565 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 01:49:13,571 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:49:13" (1/1) ... [2024-11-07 01:49:13,571 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:49:13" (1/1) ... [2024-11-07 01:49:13,574 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:49:13" (1/1) ... [2024-11-07 01:49:13,584 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:49:13,584 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:49:13" (1/1) ... [2024-11-07 01:49:13,584 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:49:13" (1/1) ... [2024-11-07 01:49:13,592 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:49:13" (1/1) ... [2024-11-07 01:49:13,601 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:49:13" (1/1) ... [2024-11-07 01:49:13,602 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:49:13" (1/1) ... [2024-11-07 01:49:13,604 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:49:13" (1/1) ... [2024-11-07 01:49:13,607 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 01:49:13,608 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 01:49:13,608 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 01:49:13,608 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 01:49:13,609 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:49:13" (1/1) ... [2024-11-07 01:49:13,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 01:49:13,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 01:49:13,630 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:49:13,632 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:49:13,649 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 01:49:13,649 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-11-07 01:49:13,649 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-11-07 01:49:13,649 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2024-11-07 01:49:13,649 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2024-11-07 01:49:13,649 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2024-11-07 01:49:13,649 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2024-11-07 01:49:13,650 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2024-11-07 01:49:13,650 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2024-11-07 01:49:13,650 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2024-11-07 01:49:13,650 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2024-11-07 01:49:13,650 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2024-11-07 01:49:13,650 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2024-11-07 01:49:13,650 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2024-11-07 01:49:13,650 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2024-11-07 01:49:13,650 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2024-11-07 01:49:13,650 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2024-11-07 01:49:13,650 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2024-11-07 01:49:13,650 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2024-11-07 01:49:13,650 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2024-11-07 01:49:13,650 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2024-11-07 01:49:13,650 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2024-11-07 01:49:13,650 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2024-11-07 01:49:13,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 01:49:13,650 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2024-11-07 01:49:13,650 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2024-11-07 01:49:13,651 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2024-11-07 01:49:13,651 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2024-11-07 01:49:13,651 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 01:49:13,651 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 01:49:13,651 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2024-11-07 01:49:13,651 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2024-11-07 01:49:13,651 INFO L130 BoogieDeclarations]: Found specification of procedure error2 [2024-11-07 01:49:13,651 INFO L138 BoogieDeclarations]: Found implementation of procedure error2 [2024-11-07 01:49:13,781 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 01:49:13,786 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 01:49:14,356 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##56: assume !(1 == ~q_free~0); [2024-11-07 01:49:14,356 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##55: assume 1 == ~q_free~0;~c_dr_st~0 := 2;~c_dr_pc~0 := 2;~a_t~0 := do_read_c_~a~0#1; [2024-11-07 01:49:14,514 INFO L? ?]: Removed 134 outVars from TransFormulas that were not future-live. [2024-11-07 01:49:14,515 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 01:49:14,528 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 01:49:14,528 INFO L316 CfgBuilder]: Removed 19 assume(true) statements. [2024-11-07 01:49:14,529 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:49:14 BoogieIcfgContainer [2024-11-07 01:49:14,529 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 01:49:14,530 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 01:49:14,530 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 01:49:14,534 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 01:49:14,534 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 01:49:13" (1/3) ... [2024-11-07 01:49:14,534 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c7bb951 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:49:14, skipping insertion in model container [2024-11-07 01:49:14,534 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:49:13" (2/3) ... [2024-11-07 01:49:14,534 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c7bb951 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:49:14, skipping insertion in model container [2024-11-07 01:49:14,535 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:49:14" (3/3) ... [2024-11-07 01:49:14,535 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_3.cil+token_ring.14.cil.c [2024-11-07 01:49:14,545 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 01:49:14,545 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-07 01:49:14,617 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 01:49:14,630 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;@d26d4c5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 01:49:14,630 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-07 01:49:14,639 INFO L276 IsEmpty]: Start isEmpty. Operand has 518 states, 456 states have (on average 1.6228070175438596) internal successors, (740), 464 states have internal predecessors, (740), 44 states have call successors, (44), 15 states have call predecessors, (44), 15 states have return successors, (44), 42 states have call predecessors, (44), 44 states have call successors, (44) [2024-11-07 01:49:14,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-07 01:49:14,650 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:49:14,651 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] [2024-11-07 01:49:14,653 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:49:14,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:49:14,656 INFO L85 PathProgramCache]: Analyzing trace with hash -1702090679, now seen corresponding path program 1 times [2024-11-07 01:49:14,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:49:14,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841527559] [2024-11-07 01:49:14,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:49:14,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:49:14,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:14,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:49:14,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:14,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-07 01:49:14,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:14,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 01:49:14,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:14,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 01:49:14,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:14,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 01:49:14,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:14,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 01:49:14,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:14,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 01:49:14,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:14,943 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:49:14,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:49:14,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841527559] [2024-11-07 01:49:14,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841527559] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:49:14,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:49:14,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 01:49:14,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314549006] [2024-11-07 01:49:14,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:49:14,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 01:49:14,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:49:14,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 01:49:14,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 01:49:14,962 INFO L87 Difference]: Start difference. First operand has 518 states, 456 states have (on average 1.6228070175438596) internal successors, (740), 464 states have internal predecessors, (740), 44 states have call successors, (44), 15 states have call predecessors, (44), 15 states have return successors, (44), 42 states have call predecessors, (44), 44 states have call successors, (44) Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-07 01:49:15,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:49:15,786 INFO L93 Difference]: Finished difference Result 1025 states and 1636 transitions. [2024-11-07 01:49:15,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 01:49:15,788 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2024-11-07 01:49:15,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:49:15,796 INFO L225 Difference]: With dead ends: 1025 [2024-11-07 01:49:15,797 INFO L226 Difference]: Without dead ends: 525 [2024-11-07 01:49:15,801 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-07 01:49:15,803 INFO L432 NwaCegarLoop]: 453 mSDtfsCounter, 792 mSDsluCounter, 1411 mSDsCounter, 0 mSdLazyCounter, 845 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 804 SdHoareTripleChecker+Valid, 1864 SdHoareTripleChecker+Invalid, 942 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 845 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-07 01:49:15,803 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [804 Valid, 1864 Invalid, 942 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 845 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-07 01:49:15,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2024-11-07 01:49:15,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 507. [2024-11-07 01:49:15,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 507 states, 448 states have (on average 1.5379464285714286) internal successors, (689), 453 states have internal predecessors, (689), 44 states have call successors, (44), 15 states have call predecessors, (44), 13 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-07 01:49:15,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 773 transitions. [2024-11-07 01:49:15,865 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 773 transitions. Word has length 65 [2024-11-07 01:49:15,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:49:15,866 INFO L471 AbstractCegarLoop]: Abstraction has 507 states and 773 transitions. [2024-11-07 01:49:15,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 3 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-07 01:49:15,866 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 773 transitions. [2024-11-07 01:49:15,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-07 01:49:15,868 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:49:15,868 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] [2024-11-07 01:49:15,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 01:49:15,869 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:49:15,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:49:15,869 INFO L85 PathProgramCache]: Analyzing trace with hash 1206091207, now seen corresponding path program 1 times [2024-11-07 01:49:15,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:49:15,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825624400] [2024-11-07 01:49:15,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:49:15,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:49:15,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:16,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:49:16,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:16,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-07 01:49:16,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:16,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 01:49:16,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:16,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 01:49:16,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:16,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 01:49:16,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:16,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 01:49:16,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:16,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 01:49:16,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:16,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:49:16,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:49:16,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825624400] [2024-11-07 01:49:16,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825624400] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:49:16,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:49:16,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 01:49:16,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959062057] [2024-11-07 01:49:16,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:49:16,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 01:49:16,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:49:16,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 01:49:16,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-07 01:49:16,080 INFO L87 Difference]: Start difference. First operand 507 states and 773 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-07 01:49:17,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:49:17,158 INFO L93 Difference]: Finished difference Result 762 states and 1142 transitions. [2024-11-07 01:49:17,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 01:49:17,159 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2024-11-07 01:49:17,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:49:17,166 INFO L225 Difference]: With dead ends: 762 [2024-11-07 01:49:17,166 INFO L226 Difference]: Without dead ends: 658 [2024-11-07 01:49:17,167 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2024-11-07 01:49:17,167 INFO L432 NwaCegarLoop]: 441 mSDtfsCounter, 912 mSDsluCounter, 1827 mSDsCounter, 0 mSdLazyCounter, 1447 mSolverCounterSat, 134 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 919 SdHoareTripleChecker+Valid, 2268 SdHoareTripleChecker+Invalid, 1581 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 134 IncrementalHoareTripleChecker+Valid, 1447 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-07 01:49:17,168 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [919 Valid, 2268 Invalid, 1581 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [134 Valid, 1447 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-07 01:49:17,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 658 states. [2024-11-07 01:49:17,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 658 to 619. [2024-11-07 01:49:17,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 619 states, 538 states have (on average 1.5148698884758365) internal successors, (815), 545 states have internal predecessors, (815), 57 states have call successors, (57), 22 states have call predecessors, (57), 22 states have return successors, (58), 54 states have call predecessors, (58), 53 states have call successors, (58) [2024-11-07 01:49:17,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 619 states to 619 states and 930 transitions. [2024-11-07 01:49:17,213 INFO L78 Accepts]: Start accepts. Automaton has 619 states and 930 transitions. Word has length 65 [2024-11-07 01:49:17,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:49:17,217 INFO L471 AbstractCegarLoop]: Abstraction has 619 states and 930 transitions. [2024-11-07 01:49:17,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-07 01:49:17,218 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 930 transitions. [2024-11-07 01:49:17,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-07 01:49:17,219 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:49:17,219 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] [2024-11-07 01:49:17,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 01:49:17,220 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:49:17,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:49:17,220 INFO L85 PathProgramCache]: Analyzing trace with hash -1409987449, now seen corresponding path program 1 times [2024-11-07 01:49:17,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:49:17,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773146988] [2024-11-07 01:49:17,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:49:17,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:49:17,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:17,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:49:17,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:17,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-07 01:49:17,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:17,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 01:49:17,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:17,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 01:49:17,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:17,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 01:49:17,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:17,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 01:49:17,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:17,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 01:49:17,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:17,397 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:49:17,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:49:17,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773146988] [2024-11-07 01:49:17,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773146988] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:49:17,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:49:17,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 01:49:17,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786655311] [2024-11-07 01:49:17,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:49:17,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 01:49:17,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:49:17,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 01:49:17,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-07 01:49:17,398 INFO L87 Difference]: Start difference. First operand 619 states and 930 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-07 01:49:18,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:49:18,718 INFO L93 Difference]: Finished difference Result 1016 states and 1495 transitions. [2024-11-07 01:49:18,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-07 01:49:18,719 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2024-11-07 01:49:18,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:49:18,725 INFO L225 Difference]: With dead ends: 1016 [2024-11-07 01:49:18,725 INFO L226 Difference]: Without dead ends: 807 [2024-11-07 01:49:18,726 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2024-11-07 01:49:18,727 INFO L432 NwaCegarLoop]: 493 mSDtfsCounter, 1488 mSDsluCounter, 2151 mSDsCounter, 0 mSdLazyCounter, 1820 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1522 SdHoareTripleChecker+Valid, 2644 SdHoareTripleChecker+Invalid, 1947 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 1820 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-07 01:49:18,729 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1522 Valid, 2644 Invalid, 1947 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 1820 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-07 01:49:18,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 807 states. [2024-11-07 01:49:18,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 807 to 731. [2024-11-07 01:49:18,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 731 states, 628 states have (on average 1.4968152866242037) internal successors, (940), 637 states have internal predecessors, (940), 70 states have call successors, (70), 29 states have call predecessors, (70), 31 states have return successors, (79), 68 states have call predecessors, (79), 66 states have call successors, (79) [2024-11-07 01:49:18,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 731 states to 731 states and 1089 transitions. [2024-11-07 01:49:18,804 INFO L78 Accepts]: Start accepts. Automaton has 731 states and 1089 transitions. Word has length 65 [2024-11-07 01:49:18,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:49:18,804 INFO L471 AbstractCegarLoop]: Abstraction has 731 states and 1089 transitions. [2024-11-07 01:49:18,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 6 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-07 01:49:18,804 INFO L276 IsEmpty]: Start isEmpty. Operand 731 states and 1089 transitions. [2024-11-07 01:49:18,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-07 01:49:18,808 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:49:18,808 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] [2024-11-07 01:49:18,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 01:49:18,809 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:49:18,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:49:18,809 INFO L85 PathProgramCache]: Analyzing trace with hash 856393737, now seen corresponding path program 1 times [2024-11-07 01:49:18,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:49:18,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215595931] [2024-11-07 01:49:18,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:49:18,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:49:18,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:18,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:49:18,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:18,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-07 01:49:18,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:18,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 01:49:18,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:18,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 01:49:18,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:18,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 01:49:18,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:18,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 01:49:18,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:18,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 01:49:18,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:18,945 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:49:18,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:49:18,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215595931] [2024-11-07 01:49:18,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215595931] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:49:18,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:49:18,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:49:18,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700699193] [2024-11-07 01:49:18,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:49:18,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:49:18,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:49:18,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:49:18,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:49:18,950 INFO L87 Difference]: Start difference. First operand 731 states and 1089 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-07 01:49:19,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:49:19,828 INFO L93 Difference]: Finished difference Result 1403 states and 2031 transitions. [2024-11-07 01:49:19,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 01:49:19,829 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) Word has length 65 [2024-11-07 01:49:19,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:49:19,833 INFO L225 Difference]: With dead ends: 1403 [2024-11-07 01:49:19,834 INFO L226 Difference]: Without dead ends: 1088 [2024-11-07 01:49:19,834 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2024-11-07 01:49:19,835 INFO L432 NwaCegarLoop]: 511 mSDtfsCounter, 1598 mSDsluCounter, 1587 mSDsCounter, 0 mSdLazyCounter, 1237 mSolverCounterSat, 138 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1644 SdHoareTripleChecker+Valid, 2098 SdHoareTripleChecker+Invalid, 1375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 1237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-07 01:49:19,835 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1644 Valid, 2098 Invalid, 1375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 1237 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-07 01:49:19,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1088 states. [2024-11-07 01:49:19,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1088 to 1012. [2024-11-07 01:49:19,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1012 states, 854 states have (on average 1.4601873536299765) internal successors, (1247), 867 states have internal predecessors, (1247), 100 states have call successors, (100), 50 states have call predecessors, (100), 56 states have return successors, (117), 98 states have call predecessors, (117), 96 states have call successors, (117) [2024-11-07 01:49:19,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1012 states to 1012 states and 1464 transitions. [2024-11-07 01:49:19,879 INFO L78 Accepts]: Start accepts. Automaton has 1012 states and 1464 transitions. Word has length 65 [2024-11-07 01:49:19,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:49:19,879 INFO L471 AbstractCegarLoop]: Abstraction has 1012 states and 1464 transitions. [2024-11-07 01:49:19,879 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (8), 5 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-07 01:49:19,879 INFO L276 IsEmpty]: Start isEmpty. Operand 1012 states and 1464 transitions. [2024-11-07 01:49:19,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-07 01:49:19,893 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:49:19,893 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] [2024-11-07 01:49:19,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 01:49:19,893 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:49:19,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:49:19,894 INFO L85 PathProgramCache]: Analyzing trace with hash 323657818, now seen corresponding path program 1 times [2024-11-07 01:49:19,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:49:19,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134989035] [2024-11-07 01:49:19,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:49:19,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:49:19,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:19,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:49:19,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:19,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-07 01:49:19,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:19,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 01:49:19,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:19,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 01:49:19,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:19,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 01:49:19,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:19,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-07 01:49:19,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:19,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 01:49:19,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:19,998 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:49:19,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:49:19,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134989035] [2024-11-07 01:49:19,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134989035] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:49:19,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:49:19,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 01:49:19,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128236766] [2024-11-07 01:49:19,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:49:19,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 01:49:19,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:49:19,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 01:49:19,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-07 01:49:19,999 INFO L87 Difference]: Start difference. First operand 1012 states and 1464 transitions. Second operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-07 01:49:21,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:49:21,103 INFO L93 Difference]: Finished difference Result 1680 states and 2391 transitions. [2024-11-07 01:49:21,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 01:49:21,104 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 66 [2024-11-07 01:49:21,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:49:21,108 INFO L225 Difference]: With dead ends: 1680 [2024-11-07 01:49:21,108 INFO L226 Difference]: Without dead ends: 1084 [2024-11-07 01:49:21,109 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2024-11-07 01:49:21,110 INFO L432 NwaCegarLoop]: 445 mSDtfsCounter, 666 mSDsluCounter, 2672 mSDsCounter, 0 mSdLazyCounter, 2065 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 667 SdHoareTripleChecker+Valid, 3117 SdHoareTripleChecker+Invalid, 2160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 2065 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-07 01:49:21,110 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [667 Valid, 3117 Invalid, 2160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 2065 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-07 01:49:21,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1084 states. [2024-11-07 01:49:21,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1084 to 1027. [2024-11-07 01:49:21,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1027 states, 866 states have (on average 1.4503464203233256) internal successors, (1256), 879 states have internal predecessors, (1256), 100 states have call successors, (100), 50 states have call predecessors, (100), 59 states have return successors, (120), 101 states have call predecessors, (120), 96 states have call successors, (120) [2024-11-07 01:49:21,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1027 states to 1027 states and 1476 transitions. [2024-11-07 01:49:21,150 INFO L78 Accepts]: Start accepts. Automaton has 1027 states and 1476 transitions. Word has length 66 [2024-11-07 01:49:21,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:49:21,150 INFO L471 AbstractCegarLoop]: Abstraction has 1027 states and 1476 transitions. [2024-11-07 01:49:21,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-07 01:49:21,150 INFO L276 IsEmpty]: Start isEmpty. Operand 1027 states and 1476 transitions. [2024-11-07 01:49:21,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-07 01:49:21,151 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:49:21,151 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] [2024-11-07 01:49:21,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 01:49:21,151 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:49:21,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:49:21,152 INFO L85 PathProgramCache]: Analyzing trace with hash -705701480, now seen corresponding path program 1 times [2024-11-07 01:49:21,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:49:21,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803851842] [2024-11-07 01:49:21,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:49:21,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:49:21,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:21,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:49:21,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:21,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-07 01:49:21,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:21,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 01:49:21,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:21,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 01:49:21,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:21,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 01:49:21,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:21,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-07 01:49:21,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:21,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 01:49:21,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:21,278 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:49:21,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:49:21,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803851842] [2024-11-07 01:49:21,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803851842] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:49:21,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:49:21,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 01:49:21,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732015495] [2024-11-07 01:49:21,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:49:21,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 01:49:21,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:49:21,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 01:49:21,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-07 01:49:21,279 INFO L87 Difference]: Start difference. First operand 1027 states and 1476 transitions. Second operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 6 states have internal predecessors, (51), 4 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-07 01:49:23,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:49:23,062 INFO L93 Difference]: Finished difference Result 3232 states and 4597 transitions. [2024-11-07 01:49:23,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-11-07 01:49:23,063 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 6 states have internal predecessors, (51), 4 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 66 [2024-11-07 01:49:23,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:49:23,068 INFO L225 Difference]: With dead ends: 3232 [2024-11-07 01:49:23,069 INFO L226 Difference]: Without dead ends: 1390 [2024-11-07 01:49:23,072 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 292 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=235, Invalid=887, Unknown=0, NotChecked=0, Total=1122 [2024-11-07 01:49:23,073 INFO L432 NwaCegarLoop]: 604 mSDtfsCounter, 2975 mSDsluCounter, 1930 mSDsCounter, 0 mSdLazyCounter, 2336 mSolverCounterSat, 448 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2994 SdHoareTripleChecker+Valid, 2534 SdHoareTripleChecker+Invalid, 2784 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 448 IncrementalHoareTripleChecker+Valid, 2336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-07 01:49:23,073 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2994 Valid, 2534 Invalid, 2784 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [448 Valid, 2336 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-07 01:49:23,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1390 states. [2024-11-07 01:49:23,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1390 to 1235. [2024-11-07 01:49:23,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1235 states, 1018 states have (on average 1.4145383104125737) internal successors, (1440), 1035 states have internal predecessors, (1440), 130 states have call successors, (130), 71 states have call predecessors, (130), 85 states have return successors, (169), 132 states have call predecessors, (169), 126 states have call successors, (169) [2024-11-07 01:49:23,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1235 states to 1235 states and 1739 transitions. [2024-11-07 01:49:23,147 INFO L78 Accepts]: Start accepts. Automaton has 1235 states and 1739 transitions. Word has length 66 [2024-11-07 01:49:23,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:49:23,148 INFO L471 AbstractCegarLoop]: Abstraction has 1235 states and 1739 transitions. [2024-11-07 01:49:23,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 6 states have internal predecessors, (51), 4 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2024-11-07 01:49:23,148 INFO L276 IsEmpty]: Start isEmpty. Operand 1235 states and 1739 transitions. [2024-11-07 01:49:23,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-07 01:49:23,149 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:49:23,149 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] [2024-11-07 01:49:23,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 01:49:23,149 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:49:23,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:49:23,150 INFO L85 PathProgramCache]: Analyzing trace with hash 1833819556, now seen corresponding path program 1 times [2024-11-07 01:49:23,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:49:23,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839260160] [2024-11-07 01:49:23,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:49:23,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:49:23,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:23,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:49:23,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:23,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-07 01:49:23,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:23,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 01:49:23,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:23,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 01:49:23,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:23,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 01:49:23,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:23,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 01:49:23,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:23,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 01:49:23,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:23,265 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:49:23,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:49:23,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839260160] [2024-11-07 01:49:23,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839260160] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:49:23,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:49:23,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 01:49:23,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478167357] [2024-11-07 01:49:23,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:49:23,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 01:49:23,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:49:23,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 01:49:23,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-07 01:49:23,267 INFO L87 Difference]: Start difference. First operand 1235 states and 1739 transitions. Second operand has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 5 states have internal predecessors, (52), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-07 01:49:24,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:49:24,253 INFO L93 Difference]: Finished difference Result 2191 states and 3045 transitions. [2024-11-07 01:49:24,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 01:49:24,254 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 5 states have internal predecessors, (52), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 67 [2024-11-07 01:49:24,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:49:24,259 INFO L225 Difference]: With dead ends: 2191 [2024-11-07 01:49:24,259 INFO L226 Difference]: Without dead ends: 1372 [2024-11-07 01:49:24,261 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=202, Unknown=0, NotChecked=0, Total=272 [2024-11-07 01:49:24,261 INFO L432 NwaCegarLoop]: 437 mSDtfsCounter, 990 mSDsluCounter, 2280 mSDsCounter, 0 mSdLazyCounter, 1969 mSolverCounterSat, 144 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 992 SdHoareTripleChecker+Valid, 2717 SdHoareTripleChecker+Invalid, 2113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 144 IncrementalHoareTripleChecker+Valid, 1969 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-07 01:49:24,261 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [992 Valid, 2717 Invalid, 2113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [144 Valid, 1969 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-07 01:49:24,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1372 states. [2024-11-07 01:49:24,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1372 to 1280. [2024-11-07 01:49:24,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1280 states, 1054 states have (on average 1.4003795066413662) internal successors, (1476), 1071 states have internal predecessors, (1476), 130 states have call successors, (130), 71 states have call predecessors, (130), 94 states have return successors, (178), 141 states have call predecessors, (178), 126 states have call successors, (178) [2024-11-07 01:49:24,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1280 states to 1280 states and 1784 transitions. [2024-11-07 01:49:24,307 INFO L78 Accepts]: Start accepts. Automaton has 1280 states and 1784 transitions. Word has length 67 [2024-11-07 01:49:24,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:49:24,307 INFO L471 AbstractCegarLoop]: Abstraction has 1280 states and 1784 transitions. [2024-11-07 01:49:24,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 5 states have internal predecessors, (52), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-07 01:49:24,307 INFO L276 IsEmpty]: Start isEmpty. Operand 1280 states and 1784 transitions. [2024-11-07 01:49:24,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-07 01:49:24,312 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:49:24,312 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] [2024-11-07 01:49:24,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 01:49:24,312 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:49:24,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:49:24,313 INFO L85 PathProgramCache]: Analyzing trace with hash -1074944346, now seen corresponding path program 1 times [2024-11-07 01:49:24,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:49:24,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833718582] [2024-11-07 01:49:24,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:49:24,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:49:24,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:24,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:49:24,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:24,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-07 01:49:24,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:24,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 01:49:24,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:24,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 01:49:24,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:24,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 01:49:24,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:24,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 01:49:24,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:24,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 01:49:24,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:24,492 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:49:24,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:49:24,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833718582] [2024-11-07 01:49:24,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833718582] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:49:24,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:49:24,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 01:49:24,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119420977] [2024-11-07 01:49:24,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:49:24,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 01:49:24,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:49:24,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 01:49:24,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-07 01:49:24,493 INFO L87 Difference]: Start difference. First operand 1280 states and 1784 transitions. Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 6 states have internal predecessors, (52), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-07 01:49:25,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:49:25,666 INFO L93 Difference]: Finished difference Result 2260 states and 3087 transitions. [2024-11-07 01:49:25,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-07 01:49:25,666 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 6 states have internal predecessors, (52), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 67 [2024-11-07 01:49:25,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:49:25,675 INFO L225 Difference]: With dead ends: 2260 [2024-11-07 01:49:25,675 INFO L226 Difference]: Without dead ends: 1483 [2024-11-07 01:49:25,678 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=277, Unknown=0, NotChecked=0, Total=380 [2024-11-07 01:49:25,679 INFO L432 NwaCegarLoop]: 407 mSDtfsCounter, 1508 mSDsluCounter, 1832 mSDsCounter, 0 mSdLazyCounter, 1644 mSolverCounterSat, 157 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1540 SdHoareTripleChecker+Valid, 2239 SdHoareTripleChecker+Invalid, 1801 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 157 IncrementalHoareTripleChecker+Valid, 1644 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-07 01:49:25,679 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1540 Valid, 2239 Invalid, 1801 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [157 Valid, 1644 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-07 01:49:25,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1483 states. [2024-11-07 01:49:25,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1483 to 1289. [2024-11-07 01:49:25,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1289 states, 1063 states have (on average 1.3951081843838193) internal successors, (1483), 1078 states have internal predecessors, (1483), 131 states have call successors, (131), 72 states have call predecessors, (131), 93 states have return successors, (174), 142 states have call predecessors, (174), 127 states have call successors, (174) [2024-11-07 01:49:25,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1289 states to 1289 states and 1788 transitions. [2024-11-07 01:49:25,761 INFO L78 Accepts]: Start accepts. Automaton has 1289 states and 1788 transitions. Word has length 67 [2024-11-07 01:49:25,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:49:25,761 INFO L471 AbstractCegarLoop]: Abstraction has 1289 states and 1788 transitions. [2024-11-07 01:49:25,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 6 states have internal predecessors, (52), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-07 01:49:25,761 INFO L276 IsEmpty]: Start isEmpty. Operand 1289 states and 1788 transitions. [2024-11-07 01:49:25,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-07 01:49:25,763 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:49:25,763 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] [2024-11-07 01:49:25,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 01:49:25,764 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:49:25,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:49:25,765 INFO L85 PathProgramCache]: Analyzing trace with hash -1208957852, now seen corresponding path program 1 times [2024-11-07 01:49:25,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:49:25,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129171064] [2024-11-07 01:49:25,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:49:25,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:49:25,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:25,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:49:25,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:25,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-07 01:49:25,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:25,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 01:49:25,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:25,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 01:49:25,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:25,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 01:49:25,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:25,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 01:49:25,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:25,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 01:49:25,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:25,876 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:49:25,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:49:25,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129171064] [2024-11-07 01:49:25,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129171064] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:49:25,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:49:25,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:49:25,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562456034] [2024-11-07 01:49:25,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:49:25,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:49:25,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:49:25,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:49:25,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:49:25,878 INFO L87 Difference]: Start difference. First operand 1289 states and 1788 transitions. Second operand has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 4 states have internal predecessors, (52), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-07 01:49:26,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:49:26,633 INFO L93 Difference]: Finished difference Result 3174 states and 4307 transitions. [2024-11-07 01:49:26,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 01:49:26,634 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 4 states have internal predecessors, (52), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 67 [2024-11-07 01:49:26,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:49:26,642 INFO L225 Difference]: With dead ends: 3174 [2024-11-07 01:49:26,643 INFO L226 Difference]: Without dead ends: 2304 [2024-11-07 01:49:26,645 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2024-11-07 01:49:26,646 INFO L432 NwaCegarLoop]: 398 mSDtfsCounter, 1832 mSDsluCounter, 1115 mSDsCounter, 0 mSdLazyCounter, 630 mSolverCounterSat, 210 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1868 SdHoareTripleChecker+Valid, 1513 SdHoareTripleChecker+Invalid, 840 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 210 IncrementalHoareTripleChecker+Valid, 630 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-07 01:49:26,646 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1868 Valid, 1513 Invalid, 840 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [210 Valid, 630 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-07 01:49:26,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2304 states. [2024-11-07 01:49:26,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2304 to 2138. [2024-11-07 01:49:26,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2138 states, 1717 states have (on average 1.3447874199184624) internal successors, (2309), 1745 states have internal predecessors, (2309), 235 states have call successors, (235), 136 states have call predecessors, (235), 184 states have return successors, (364), 263 states have call predecessors, (364), 231 states have call successors, (364) [2024-11-07 01:49:26,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2138 states to 2138 states and 2908 transitions. [2024-11-07 01:49:26,806 INFO L78 Accepts]: Start accepts. Automaton has 2138 states and 2908 transitions. Word has length 67 [2024-11-07 01:49:26,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:49:26,806 INFO L471 AbstractCegarLoop]: Abstraction has 2138 states and 2908 transitions. [2024-11-07 01:49:26,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.428571428571429) internal successors, (52), 4 states have internal predecessors, (52), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-07 01:49:26,806 INFO L276 IsEmpty]: Start isEmpty. Operand 2138 states and 2908 transitions. [2024-11-07 01:49:26,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-07 01:49:26,808 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:49:26,808 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] [2024-11-07 01:49:26,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-07 01:49:26,809 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:49:26,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:49:26,809 INFO L85 PathProgramCache]: Analyzing trace with hash 755715187, now seen corresponding path program 1 times [2024-11-07 01:49:26,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:49:26,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959797407] [2024-11-07 01:49:26,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:49:26,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:49:26,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:26,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:49:26,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:26,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-07 01:49:26,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:26,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 01:49:26,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:26,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 01:49:26,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:26,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 01:49:26,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:26,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 01:49:26,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:26,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 01:49:26,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:26,871 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:49:26,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:49:26,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959797407] [2024-11-07 01:49:26,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959797407] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:49:26,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:49:26,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 01:49:26,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156571674] [2024-11-07 01:49:26,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:49:26,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 01:49:26,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:49:26,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 01:49:26,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 01:49:26,873 INFO L87 Difference]: Start difference. First operand 2138 states and 2908 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 3 states have internal predecessors, (53), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-07 01:49:27,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:49:27,459 INFO L93 Difference]: Finished difference Result 3861 states and 5264 transitions. [2024-11-07 01:49:27,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 01:49:27,460 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 3 states have internal predecessors, (53), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 68 [2024-11-07 01:49:27,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:49:27,462 INFO L225 Difference]: With dead ends: 3861 [2024-11-07 01:49:27,462 INFO L226 Difference]: Without dead ends: 396 [2024-11-07 01:49:27,468 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2024-11-07 01:49:27,469 INFO L432 NwaCegarLoop]: 424 mSDtfsCounter, 1341 mSDsluCounter, 1027 mSDsCounter, 0 mSdLazyCounter, 502 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1378 SdHoareTripleChecker+Valid, 1451 SdHoareTripleChecker+Invalid, 603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 502 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 01:49:27,469 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1378 Valid, 1451 Invalid, 603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 502 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 01:49:27,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2024-11-07 01:49:27,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 396. [2024-11-07 01:49:27,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 361 states have (on average 1.559556786703601) internal successors, (563), 363 states have internal predecessors, (563), 28 states have call successors, (28), 7 states have call predecessors, (28), 6 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-07 01:49:27,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 617 transitions. [2024-11-07 01:49:27,478 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 617 transitions. Word has length 68 [2024-11-07 01:49:27,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:49:27,478 INFO L471 AbstractCegarLoop]: Abstraction has 396 states and 617 transitions. [2024-11-07 01:49:27,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 3 states have internal predecessors, (53), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-07 01:49:27,479 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 617 transitions. [2024-11-07 01:49:27,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-07 01:49:27,480 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:49:27,480 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:27,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-07 01:49:27,480 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:49:27,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:49:27,481 INFO L85 PathProgramCache]: Analyzing trace with hash 892122814, now seen corresponding path program 1 times [2024-11-07 01:49:27,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:49:27,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56763348] [2024-11-07 01:49:27,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:49:27,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:49:27,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:27,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:49:27,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:27,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 01:49:27,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:27,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-07 01:49:27,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:27,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-07 01:49:27,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:27,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-07 01:49:27,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:27,643 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:49:27,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:49:27,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56763348] [2024-11-07 01:49:27,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56763348] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:49:27,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:49:27,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 01:49:27,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110628781] [2024-11-07 01:49:27,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:49:27,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 01:49:27,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:49:27,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 01:49:27,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 01:49:27,645 INFO L87 Difference]: Start difference. First operand 396 states and 617 transitions. Second operand has 5 states, 5 states have (on average 33.6) internal successors, (168), 3 states have internal predecessors, (168), 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:49:28,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:49:28,893 INFO L93 Difference]: Finished difference Result 927 states and 1470 transitions. [2024-11-07 01:49:28,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 01:49:28,893 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 3 states have internal predecessors, (168), 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 179 [2024-11-07 01:49:28,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:49:28,896 INFO L225 Difference]: With dead ends: 927 [2024-11-07 01:49:28,896 INFO L226 Difference]: Without dead ends: 538 [2024-11-07 01:49:28,896 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-07 01:49:28,897 INFO L432 NwaCegarLoop]: 364 mSDtfsCounter, 1057 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 1037 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1081 SdHoareTripleChecker+Valid, 792 SdHoareTripleChecker+Invalid, 1097 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 1037 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-07 01:49:28,897 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1081 Valid, 792 Invalid, 1097 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 1037 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-07 01:49:28,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2024-11-07 01:49:28,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 396. [2024-11-07 01:49:28,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 361 states have (on average 1.556786703601108) internal successors, (562), 363 states have internal predecessors, (562), 28 states have call successors, (28), 7 states have call predecessors, (28), 6 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-07 01:49:28,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 616 transitions. [2024-11-07 01:49:28,910 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 616 transitions. Word has length 179 [2024-11-07 01:49:28,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:49:28,910 INFO L471 AbstractCegarLoop]: Abstraction has 396 states and 616 transitions. [2024-11-07 01:49:28,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 3 states have internal predecessors, (168), 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:49:28,910 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 616 transitions. [2024-11-07 01:49:28,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-07 01:49:28,911 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:49:28,911 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:28,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-07 01:49:28,911 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:49:28,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:49:28,912 INFO L85 PathProgramCache]: Analyzing trace with hash 243530044, now seen corresponding path program 1 times [2024-11-07 01:49:28,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:49:28,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104260486] [2024-11-07 01:49:28,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:49:28,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:49:28,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:28,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:49:28,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:28,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 01:49:28,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:29,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-07 01:49:29,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:29,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-07 01:49:29,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:29,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-07 01:49:29,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:29,042 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:49:29,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:49:29,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104260486] [2024-11-07 01:49:29,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104260486] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:49:29,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:49:29,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 01:49:29,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158310818] [2024-11-07 01:49:29,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:49:29,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 01:49:29,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:49:29,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 01:49:29,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 01:49:29,043 INFO L87 Difference]: Start difference. First operand 396 states and 616 transitions. Second operand has 5 states, 5 states have (on average 33.6) internal successors, (168), 3 states have internal predecessors, (168), 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:49:30,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:49:30,402 INFO L93 Difference]: Finished difference Result 919 states and 1453 transitions. [2024-11-07 01:49:30,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 01:49:30,403 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 3 states have internal predecessors, (168), 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 179 [2024-11-07 01:49:30,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:49:30,405 INFO L225 Difference]: With dead ends: 919 [2024-11-07 01:49:30,406 INFO L226 Difference]: Without dead ends: 538 [2024-11-07 01:49:30,406 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-07 01:49:30,407 INFO L432 NwaCegarLoop]: 363 mSDtfsCounter, 1048 mSDsluCounter, 427 mSDsCounter, 0 mSdLazyCounter, 1036 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1072 SdHoareTripleChecker+Valid, 790 SdHoareTripleChecker+Invalid, 1096 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 1036 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-07 01:49:30,407 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1072 Valid, 790 Invalid, 1096 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 1036 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-07 01:49:30,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2024-11-07 01:49:30,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 396. [2024-11-07 01:49:30,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 361 states have (on average 1.554016620498615) internal successors, (561), 363 states have internal predecessors, (561), 28 states have call successors, (28), 7 states have call predecessors, (28), 6 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-07 01:49:30,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 615 transitions. [2024-11-07 01:49:30,435 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 615 transitions. Word has length 179 [2024-11-07 01:49:30,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:49:30,435 INFO L471 AbstractCegarLoop]: Abstraction has 396 states and 615 transitions. [2024-11-07 01:49:30,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 3 states have internal predecessors, (168), 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:49:30,435 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 615 transitions. [2024-11-07 01:49:30,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-07 01:49:30,437 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:49:30,437 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:30,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-07 01:49:30,437 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:49:30,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:49:30,441 INFO L85 PathProgramCache]: Analyzing trace with hash -255026758, now seen corresponding path program 1 times [2024-11-07 01:49:30,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:49:30,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105060244] [2024-11-07 01:49:30,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:49:30,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:49:30,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:30,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:49:30,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:30,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 01:49:30,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:30,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-07 01:49:30,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:30,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-07 01:49:30,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:30,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-07 01:49:30,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:30,703 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:49:30,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:49:30,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105060244] [2024-11-07 01:49:30,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105060244] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:49:30,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:49:30,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 01:49:30,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201413248] [2024-11-07 01:49:30,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:49:30,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 01:49:30,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:49:30,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 01:49:30,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 01:49:30,705 INFO L87 Difference]: Start difference. First operand 396 states and 615 transitions. Second operand has 6 states, 6 states have (on average 28.0) internal successors, (168), 4 states have internal predecessors, (168), 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:49:32,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:49:32,996 INFO L93 Difference]: Finished difference Result 1448 states and 2304 transitions. [2024-11-07 01:49:32,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 01:49:32,997 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 4 states have internal predecessors, (168), 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 179 [2024-11-07 01:49:32,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:49:33,007 INFO L225 Difference]: With dead ends: 1448 [2024-11-07 01:49:33,010 INFO L226 Difference]: Without dead ends: 1073 [2024-11-07 01:49:33,011 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-07 01:49:33,012 INFO L432 NwaCegarLoop]: 333 mSDtfsCounter, 1591 mSDsluCounter, 1019 mSDsCounter, 0 mSdLazyCounter, 2264 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1610 SdHoareTripleChecker+Valid, 1352 SdHoareTripleChecker+Invalid, 2380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 2264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-07 01:49:33,012 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1610 Valid, 1352 Invalid, 2380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 2264 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-07 01:49:33,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1073 states. [2024-11-07 01:49:33,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1073 to 788. [2024-11-07 01:49:33,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 788 states, 725 states have (on average 1.566896551724138) internal successors, (1136), 728 states have internal predecessors, (1136), 49 states have call successors, (49), 13 states have call predecessors, (49), 13 states have return successors, (50), 47 states have call predecessors, (50), 47 states have call successors, (50) [2024-11-07 01:49:33,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 1235 transitions. [2024-11-07 01:49:33,060 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 1235 transitions. Word has length 179 [2024-11-07 01:49:33,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:49:33,060 INFO L471 AbstractCegarLoop]: Abstraction has 788 states and 1235 transitions. [2024-11-07 01:49:33,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.0) internal successors, (168), 4 states have internal predecessors, (168), 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:49:33,061 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 1235 transitions. [2024-11-07 01:49:33,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-07 01:49:33,062 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:49:33,062 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:33,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-07 01:49:33,062 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:49:33,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:49:33,062 INFO L85 PathProgramCache]: Analyzing trace with hash -1640766538, now seen corresponding path program 1 times [2024-11-07 01:49:33,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:49:33,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690399754] [2024-11-07 01:49:33,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:49:33,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:49:33,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:33,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:49:33,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:33,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 01:49:33,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:33,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-07 01:49:33,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:33,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-07 01:49:33,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:33,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-07 01:49:33,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:33,326 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:49:33,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:49:33,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690399754] [2024-11-07 01:49:33,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690399754] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:49:33,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:49:33,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:49:33,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084543225] [2024-11-07 01:49:33,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:49:33,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:49:33,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:49:33,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:49:33,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:49:33,328 INFO L87 Difference]: Start difference. First operand 788 states and 1235 transitions. Second operand has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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:49:36,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:49:36,508 INFO L93 Difference]: Finished difference Result 2395 states and 3822 transitions. [2024-11-07 01:49:36,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 01:49:36,508 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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 179 [2024-11-07 01:49:36,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:49:36,515 INFO L225 Difference]: With dead ends: 2395 [2024-11-07 01:49:36,515 INFO L226 Difference]: Without dead ends: 1628 [2024-11-07 01:49:36,520 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-07 01:49:36,521 INFO L432 NwaCegarLoop]: 389 mSDtfsCounter, 1737 mSDsluCounter, 1373 mSDsCounter, 0 mSdLazyCounter, 3205 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1756 SdHoareTripleChecker+Valid, 1762 SdHoareTripleChecker+Invalid, 3307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 3205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-07 01:49:36,521 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1756 Valid, 1762 Invalid, 3307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 3205 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-07 01:49:36,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1628 states. [2024-11-07 01:49:36,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1628 to 1154. [2024-11-07 01:49:36,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1154 states, 1063 states have (on average 1.5606773283160866) internal successors, (1659), 1067 states have internal predecessors, (1659), 70 states have call successors, (70), 19 states have call predecessors, (70), 20 states have return successors, (73), 69 states have call predecessors, (73), 68 states have call successors, (73) [2024-11-07 01:49:36,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1154 states to 1154 states and 1802 transitions. [2024-11-07 01:49:36,598 INFO L78 Accepts]: Start accepts. Automaton has 1154 states and 1802 transitions. Word has length 179 [2024-11-07 01:49:36,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:49:36,599 INFO L471 AbstractCegarLoop]: Abstraction has 1154 states and 1802 transitions. [2024-11-07 01:49:36,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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:49:36,599 INFO L276 IsEmpty]: Start isEmpty. Operand 1154 states and 1802 transitions. [2024-11-07 01:49:36,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-07 01:49:36,601 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:49:36,601 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:36,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-07 01:49:36,601 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:49:36,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:49:36,601 INFO L85 PathProgramCache]: Analyzing trace with hash 2042931700, now seen corresponding path program 1 times [2024-11-07 01:49:36,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:49:36,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919182589] [2024-11-07 01:49:36,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:49:36,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:49:36,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:36,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:49:36,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:36,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 01:49:36,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:36,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-07 01:49:36,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:36,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-07 01:49:36,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:36,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-07 01:49:36,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:36,868 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:49:36,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:49:36,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919182589] [2024-11-07 01:49:36,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919182589] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:49:36,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:49:36,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:49:36,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750050166] [2024-11-07 01:49:36,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:49:36,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:49:36,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:49:36,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:49:36,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:49:36,869 INFO L87 Difference]: Start difference. First operand 1154 states and 1802 transitions. Second operand has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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:49:38,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:49:38,505 INFO L93 Difference]: Finished difference Result 2777 states and 4427 transitions. [2024-11-07 01:49:38,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 01:49:38,505 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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 179 [2024-11-07 01:49:38,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:49:38,511 INFO L225 Difference]: With dead ends: 2777 [2024-11-07 01:49:38,511 INFO L226 Difference]: Without dead ends: 1644 [2024-11-07 01:49:38,512 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-11-07 01:49:38,513 INFO L432 NwaCegarLoop]: 318 mSDtfsCounter, 1157 mSDsluCounter, 1004 mSDsCounter, 0 mSdLazyCounter, 1851 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1177 SdHoareTripleChecker+Valid, 1322 SdHoareTripleChecker+Invalid, 1921 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 1851 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-07 01:49:38,513 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1177 Valid, 1322 Invalid, 1921 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 1851 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-07 01:49:38,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1644 states. [2024-11-07 01:49:38,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1644 to 1154. [2024-11-07 01:49:38,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1154 states, 1063 states have (on average 1.5578551269990593) internal successors, (1656), 1067 states have internal predecessors, (1656), 70 states have call successors, (70), 19 states have call predecessors, (70), 20 states have return successors, (73), 69 states have call predecessors, (73), 68 states have call successors, (73) [2024-11-07 01:49:38,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1154 states to 1154 states and 1799 transitions. [2024-11-07 01:49:38,556 INFO L78 Accepts]: Start accepts. Automaton has 1154 states and 1799 transitions. Word has length 179 [2024-11-07 01:49:38,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:49:38,556 INFO L471 AbstractCegarLoop]: Abstraction has 1154 states and 1799 transitions. [2024-11-07 01:49:38,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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:49:38,556 INFO L276 IsEmpty]: Start isEmpty. Operand 1154 states and 1799 transitions. [2024-11-07 01:49:38,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-07 01:49:38,557 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:49:38,557 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:38,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-07 01:49:38,557 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:49:38,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:49:38,557 INFO L85 PathProgramCache]: Analyzing trace with hash 637740022, now seen corresponding path program 1 times [2024-11-07 01:49:38,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:49:38,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192084001] [2024-11-07 01:49:38,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:49:38,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:49:38,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:38,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:49:38,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:38,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 01:49:38,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:38,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-07 01:49:38,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:38,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-07 01:49:38,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:38,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-07 01:49:38,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:38,753 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:49:38,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:49:38,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192084001] [2024-11-07 01:49:38,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192084001] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:49:38,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:49:38,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:49:38,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494127935] [2024-11-07 01:49:38,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:49:38,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:49:38,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:49:38,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:49:38,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:49:38,754 INFO L87 Difference]: Start difference. First operand 1154 states and 1799 transitions. Second operand has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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:49:40,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:49:40,340 INFO L93 Difference]: Finished difference Result 2773 states and 4410 transitions. [2024-11-07 01:49:40,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 01:49:40,341 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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 179 [2024-11-07 01:49:40,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:49:40,346 INFO L225 Difference]: With dead ends: 2773 [2024-11-07 01:49:40,346 INFO L226 Difference]: Without dead ends: 1640 [2024-11-07 01:49:40,348 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-11-07 01:49:40,350 INFO L432 NwaCegarLoop]: 318 mSDtfsCounter, 1155 mSDsluCounter, 1004 mSDsCounter, 0 mSdLazyCounter, 1835 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1175 SdHoareTripleChecker+Valid, 1322 SdHoareTripleChecker+Invalid, 1905 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 1835 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-07 01:49:40,350 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1175 Valid, 1322 Invalid, 1905 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 1835 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-07 01:49:40,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1640 states. [2024-11-07 01:49:40,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1640 to 1154. [2024-11-07 01:49:40,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1154 states, 1063 states have (on average 1.5550329256820319) internal successors, (1653), 1067 states have internal predecessors, (1653), 70 states have call successors, (70), 19 states have call predecessors, (70), 20 states have return successors, (73), 69 states have call predecessors, (73), 68 states have call successors, (73) [2024-11-07 01:49:40,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1154 states to 1154 states and 1796 transitions. [2024-11-07 01:49:40,396 INFO L78 Accepts]: Start accepts. Automaton has 1154 states and 1796 transitions. Word has length 179 [2024-11-07 01:49:40,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:49:40,397 INFO L471 AbstractCegarLoop]: Abstraction has 1154 states and 1796 transitions. [2024-11-07 01:49:40,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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:49:40,397 INFO L276 IsEmpty]: Start isEmpty. Operand 1154 states and 1796 transitions. [2024-11-07 01:49:40,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-07 01:49:40,398 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:49:40,398 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:40,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-07 01:49:40,399 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:49:40,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:49:40,399 INFO L85 PathProgramCache]: Analyzing trace with hash -1762893388, now seen corresponding path program 1 times [2024-11-07 01:49:40,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:49:40,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606970288] [2024-11-07 01:49:40,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:49:40,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:49:40,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:40,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:49:40,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:40,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 01:49:40,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:40,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-07 01:49:40,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:40,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-07 01:49:40,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:40,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-07 01:49:40,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:40,589 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:49:40,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:49:40,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606970288] [2024-11-07 01:49:40,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606970288] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:49:40,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:49:40,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:49:40,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327115618] [2024-11-07 01:49:40,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:49:40,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:49:40,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:49:40,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:49:40,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:49:40,591 INFO L87 Difference]: Start difference. First operand 1154 states and 1796 transitions. Second operand has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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:49:44,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:49:44,073 INFO L93 Difference]: Finished difference Result 3782 states and 5991 transitions. [2024-11-07 01:49:44,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 01:49:44,073 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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 179 [2024-11-07 01:49:44,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:49:44,081 INFO L225 Difference]: With dead ends: 3782 [2024-11-07 01:49:44,082 INFO L226 Difference]: Without dead ends: 2649 [2024-11-07 01:49:44,084 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-07 01:49:44,084 INFO L432 NwaCegarLoop]: 589 mSDtfsCounter, 1618 mSDsluCounter, 2037 mSDsCounter, 0 mSdLazyCounter, 3517 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1637 SdHoareTripleChecker+Valid, 2626 SdHoareTripleChecker+Invalid, 3585 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 3517 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-07 01:49:44,084 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1637 Valid, 2626 Invalid, 3585 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 3517 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-11-07 01:49:44,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2649 states. [2024-11-07 01:49:44,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2649 to 1895. [2024-11-07 01:49:44,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1895 states, 1748 states have (on average 1.5491990846681922) internal successors, (2708), 1754 states have internal predecessors, (2708), 112 states have call successors, (112), 31 states have call predecessors, (112), 34 states have return successors, (123), 113 states have call predecessors, (123), 110 states have call successors, (123) [2024-11-07 01:49:44,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1895 states to 1895 states and 2943 transitions. [2024-11-07 01:49:44,176 INFO L78 Accepts]: Start accepts. Automaton has 1895 states and 2943 transitions. Word has length 179 [2024-11-07 01:49:44,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:49:44,176 INFO L471 AbstractCegarLoop]: Abstraction has 1895 states and 2943 transitions. [2024-11-07 01:49:44,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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:49:44,176 INFO L276 IsEmpty]: Start isEmpty. Operand 1895 states and 2943 transitions. [2024-11-07 01:49:44,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-07 01:49:44,178 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:49:44,178 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:44,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-07 01:49:44,178 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:49:44,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:49:44,178 INFO L85 PathProgramCache]: Analyzing trace with hash -316312522, now seen corresponding path program 1 times [2024-11-07 01:49:44,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:49:44,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286277795] [2024-11-07 01:49:44,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:49:44,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:49:44,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:44,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:49:44,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:44,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 01:49:44,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:44,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-07 01:49:44,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:44,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-07 01:49:44,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:44,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-07 01:49:44,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:44,398 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:49:44,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:49:44,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286277795] [2024-11-07 01:49:44,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286277795] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:49:44,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:49:44,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:49:44,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430336929] [2024-11-07 01:49:44,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:49:44,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:49:44,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:49:44,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:49:44,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:49:44,401 INFO L87 Difference]: Start difference. First operand 1895 states and 2943 transitions. Second operand has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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:49:45,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:49:45,802 INFO L93 Difference]: Finished difference Result 4509 states and 7125 transitions. [2024-11-07 01:49:45,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 01:49:45,802 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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 179 [2024-11-07 01:49:45,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:49:45,811 INFO L225 Difference]: With dead ends: 4509 [2024-11-07 01:49:45,811 INFO L226 Difference]: Without dead ends: 2635 [2024-11-07 01:49:45,815 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-11-07 01:49:45,816 INFO L432 NwaCegarLoop]: 318 mSDtfsCounter, 1321 mSDsluCounter, 792 mSDsCounter, 0 mSdLazyCounter, 1644 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1341 SdHoareTripleChecker+Valid, 1110 SdHoareTripleChecker+Invalid, 1742 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 1644 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-07 01:49:45,816 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1341 Valid, 1110 Invalid, 1742 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 1644 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-07 01:49:45,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2635 states. [2024-11-07 01:49:45,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2635 to 1895. [2024-11-07 01:49:45,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1895 states, 1748 states have (on average 1.5463386727688788) internal successors, (2703), 1754 states have internal predecessors, (2703), 112 states have call successors, (112), 31 states have call predecessors, (112), 34 states have return successors, (123), 113 states have call predecessors, (123), 110 states have call successors, (123) [2024-11-07 01:49:45,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1895 states to 1895 states and 2938 transitions. [2024-11-07 01:49:45,919 INFO L78 Accepts]: Start accepts. Automaton has 1895 states and 2938 transitions. Word has length 179 [2024-11-07 01:49:45,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:49:45,919 INFO L471 AbstractCegarLoop]: Abstraction has 1895 states and 2938 transitions. [2024-11-07 01:49:45,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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:49:45,920 INFO L276 IsEmpty]: Start isEmpty. Operand 1895 states and 2938 transitions. [2024-11-07 01:49:45,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-07 01:49:45,921 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:49:45,922 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:45,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-07 01:49:45,922 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:49:45,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:49:45,922 INFO L85 PathProgramCache]: Analyzing trace with hash -1239479948, now seen corresponding path program 1 times [2024-11-07 01:49:45,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:49:45,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376979236] [2024-11-07 01:49:45,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:49:45,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:49:45,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:45,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:49:45,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:46,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 01:49:46,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:46,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-07 01:49:46,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:46,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-07 01:49:46,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:46,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-07 01:49:46,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:46,118 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:49:46,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:49:46,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376979236] [2024-11-07 01:49:46,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376979236] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:49:46,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:49:46,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:49:46,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137092197] [2024-11-07 01:49:46,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:49:46,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:49:46,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:49:46,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:49:46,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:49:46,120 INFO L87 Difference]: Start difference. First operand 1895 states and 2938 transitions. Second operand has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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:49:49,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:49:49,113 INFO L93 Difference]: Finished difference Result 6471 states and 10182 transitions. [2024-11-07 01:49:49,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 01:49:49,115 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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 179 [2024-11-07 01:49:49,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:49:49,136 INFO L225 Difference]: With dead ends: 6471 [2024-11-07 01:49:49,137 INFO L226 Difference]: Without dead ends: 4597 [2024-11-07 01:49:49,140 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-07 01:49:49,141 INFO L432 NwaCegarLoop]: 589 mSDtfsCounter, 1606 mSDsluCounter, 2037 mSDsCounter, 0 mSdLazyCounter, 3480 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1625 SdHoareTripleChecker+Valid, 2626 SdHoareTripleChecker+Invalid, 3548 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 3480 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-07 01:49:49,141 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1625 Valid, 2626 Invalid, 3548 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 3480 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-07 01:49:49,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4597 states. [2024-11-07 01:49:49,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4597 to 3381. [2024-11-07 01:49:49,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3381 states, 3122 states have (on average 1.5409993593850095) internal successors, (4811), 3132 states have internal predecessors, (4811), 196 states have call successors, (196), 55 states have call predecessors, (196), 62 states have return successors, (229), 201 states have call predecessors, (229), 194 states have call successors, (229) [2024-11-07 01:49:49,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3381 states to 3381 states and 5236 transitions. [2024-11-07 01:49:49,304 INFO L78 Accepts]: Start accepts. Automaton has 3381 states and 5236 transitions. Word has length 179 [2024-11-07 01:49:49,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:49:49,304 INFO L471 AbstractCegarLoop]: Abstraction has 3381 states and 5236 transitions. [2024-11-07 01:49:49,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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:49:49,304 INFO L276 IsEmpty]: Start isEmpty. Operand 3381 states and 5236 transitions. [2024-11-07 01:49:49,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-07 01:49:49,306 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:49:49,307 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:49,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-07 01:49:49,307 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:49:49,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:49:49,308 INFO L85 PathProgramCache]: Analyzing trace with hash -853617546, now seen corresponding path program 1 times [2024-11-07 01:49:49,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:49:49,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691174878] [2024-11-07 01:49:49,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:49:49,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:49:49,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:49,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:49:49,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:49,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 01:49:49,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:49,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-07 01:49:49,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:49,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-07 01:49:49,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:49,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-07 01:49:49,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:49,475 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:49:49,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:49:49,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691174878] [2024-11-07 01:49:49,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691174878] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:49:49,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:49:49,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:49:49,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048430680] [2024-11-07 01:49:49,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:49:49,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:49:49,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:49:49,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:49:49,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:49:49,477 INFO L87 Difference]: Start difference. First operand 3381 states and 5236 transitions. Second operand has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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:49:51,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:49:51,090 INFO L93 Difference]: Finished difference Result 7977 states and 12548 transitions. [2024-11-07 01:49:51,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 01:49:51,090 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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 179 [2024-11-07 01:49:51,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:49:51,108 INFO L225 Difference]: With dead ends: 7977 [2024-11-07 01:49:51,108 INFO L226 Difference]: Without dead ends: 4617 [2024-11-07 01:49:51,113 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-11-07 01:49:51,113 INFO L432 NwaCegarLoop]: 318 mSDtfsCounter, 1158 mSDsluCounter, 1004 mSDsCounter, 0 mSdLazyCounter, 1778 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1178 SdHoareTripleChecker+Valid, 1322 SdHoareTripleChecker+Invalid, 1848 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 1778 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-07 01:49:51,113 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1178 Valid, 1322 Invalid, 1848 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 1778 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-07 01:49:51,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4617 states. [2024-11-07 01:49:51,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4617 to 3381. [2024-11-07 01:49:51,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3381 states, 3122 states have (on average 1.5381165919282511) internal successors, (4802), 3132 states have internal predecessors, (4802), 196 states have call successors, (196), 55 states have call predecessors, (196), 62 states have return successors, (229), 201 states have call predecessors, (229), 194 states have call successors, (229) [2024-11-07 01:49:51,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3381 states to 3381 states and 5227 transitions. [2024-11-07 01:49:51,259 INFO L78 Accepts]: Start accepts. Automaton has 3381 states and 5227 transitions. Word has length 179 [2024-11-07 01:49:51,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:49:51,259 INFO L471 AbstractCegarLoop]: Abstraction has 3381 states and 5227 transitions. [2024-11-07 01:49:51,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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:49:51,260 INFO L276 IsEmpty]: Start isEmpty. Operand 3381 states and 5227 transitions. [2024-11-07 01:49:51,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-07 01:49:51,262 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:49:51,262 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:51,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-07 01:49:51,262 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:49:51,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:49:51,262 INFO L85 PathProgramCache]: Analyzing trace with hash -1118265036, now seen corresponding path program 1 times [2024-11-07 01:49:51,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:49:51,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388183436] [2024-11-07 01:49:51,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:49:51,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:49:51,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:51,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:49:51,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:51,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 01:49:51,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:51,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-07 01:49:51,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:51,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-07 01:49:51,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:51,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-07 01:49:51,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:51,480 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:49:51,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:49:51,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388183436] [2024-11-07 01:49:51,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388183436] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:49:51,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:49:51,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:49:51,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858803008] [2024-11-07 01:49:51,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:49:51,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:49:51,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:49:51,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:49:51,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:49:51,481 INFO L87 Difference]: Start difference. First operand 3381 states and 5227 transitions. Second operand has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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:49:52,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:49:52,971 INFO L93 Difference]: Finished difference Result 7957 states and 12481 transitions. [2024-11-07 01:49:52,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 01:49:52,972 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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 179 [2024-11-07 01:49:52,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:49:52,984 INFO L225 Difference]: With dead ends: 7957 [2024-11-07 01:49:52,984 INFO L226 Difference]: Without dead ends: 4597 [2024-11-07 01:49:52,991 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-11-07 01:49:52,993 INFO L432 NwaCegarLoop]: 317 mSDtfsCounter, 1384 mSDsluCounter, 792 mSDsCounter, 0 mSdLazyCounter, 1532 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1404 SdHoareTripleChecker+Valid, 1109 SdHoareTripleChecker+Invalid, 1631 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 1532 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-07 01:49:52,993 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1404 Valid, 1109 Invalid, 1631 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 1532 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-07 01:49:52,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4597 states. [2024-11-07 01:49:53,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4597 to 3381. [2024-11-07 01:49:53,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3381 states, 3122 states have (on average 1.5352338244714927) internal successors, (4793), 3132 states have internal predecessors, (4793), 196 states have call successors, (196), 55 states have call predecessors, (196), 62 states have return successors, (229), 201 states have call predecessors, (229), 194 states have call successors, (229) [2024-11-07 01:49:53,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3381 states to 3381 states and 5218 transitions. [2024-11-07 01:49:53,173 INFO L78 Accepts]: Start accepts. Automaton has 3381 states and 5218 transitions. Word has length 179 [2024-11-07 01:49:53,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:49:53,174 INFO L471 AbstractCegarLoop]: Abstraction has 3381 states and 5218 transitions. [2024-11-07 01:49:53,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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:49:53,174 INFO L276 IsEmpty]: Start isEmpty. Operand 3381 states and 5218 transitions. [2024-11-07 01:49:53,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-07 01:49:53,176 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:49:53,177 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:53,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-07 01:49:53,177 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:49:53,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:49:53,178 INFO L85 PathProgramCache]: Analyzing trace with hash 1853523314, now seen corresponding path program 1 times [2024-11-07 01:49:53,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:49:53,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272323832] [2024-11-07 01:49:53,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:49:53,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:49:53,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:53,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:49:53,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:53,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 01:49:53,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:53,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-07 01:49:53,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:53,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-07 01:49:53,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:53,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-07 01:49:53,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:53,355 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:49:53,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:49:53,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272323832] [2024-11-07 01:49:53,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272323832] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:49:53,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:49:53,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:49:53,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055098773] [2024-11-07 01:49:53,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:49:53,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:49:53,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:49:53,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:49:53,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:49:53,357 INFO L87 Difference]: Start difference. First operand 3381 states and 5218 transitions. Second operand has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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:49:56,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:49:56,561 INFO L93 Difference]: Finished difference Result 11829 states and 18478 transitions. [2024-11-07 01:49:56,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 01:49:56,565 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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 179 [2024-11-07 01:49:56,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:49:56,588 INFO L225 Difference]: With dead ends: 11829 [2024-11-07 01:49:56,589 INFO L226 Difference]: Without dead ends: 8469 [2024-11-07 01:49:56,596 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-07 01:49:56,597 INFO L432 NwaCegarLoop]: 589 mSDtfsCounter, 1593 mSDsluCounter, 2037 mSDsCounter, 0 mSdLazyCounter, 3398 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1612 SdHoareTripleChecker+Valid, 2626 SdHoareTripleChecker+Invalid, 3466 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 3398 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-07 01:49:56,597 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1612 Valid, 2626 Invalid, 3466 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 3398 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-07 01:49:56,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8469 states. [2024-11-07 01:49:56,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8469 to 6385. [2024-11-07 01:49:56,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6385 states, 5902 states have (on average 1.5311758725855642) internal successors, (9037), 5920 states have internal predecessors, (9037), 364 states have call successors, (364), 103 states have call predecessors, (364), 118 states have return successors, (459), 377 states have call predecessors, (459), 362 states have call successors, (459) [2024-11-07 01:49:56,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6385 states to 6385 states and 9860 transitions. [2024-11-07 01:49:56,952 INFO L78 Accepts]: Start accepts. Automaton has 6385 states and 9860 transitions. Word has length 179 [2024-11-07 01:49:56,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:49:56,952 INFO L471 AbstractCegarLoop]: Abstraction has 6385 states and 9860 transitions. [2024-11-07 01:49:56,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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:49:56,952 INFO L276 IsEmpty]: Start isEmpty. Operand 6385 states and 9860 transitions. [2024-11-07 01:49:56,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-07 01:49:56,956 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:49:56,956 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:56,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-07 01:49:56,956 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:49:56,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:49:56,957 INFO L85 PathProgramCache]: Analyzing trace with hash -544464524, now seen corresponding path program 1 times [2024-11-07 01:49:56,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:49:56,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445044285] [2024-11-07 01:49:56,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:49:56,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:49:56,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:57,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:49:57,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:57,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 01:49:57,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:57,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-07 01:49:57,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:57,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-07 01:49:57,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:57,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-07 01:49:57,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:57,226 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:49:57,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:49:57,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445044285] [2024-11-07 01:49:57,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445044285] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:49:57,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:49:57,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:49:57,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785672706] [2024-11-07 01:49:57,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:49:57,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:49:57,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:49:57,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:49:57,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:49:57,228 INFO L87 Difference]: Start difference. First operand 6385 states and 9860 transitions. Second operand has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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:50:01,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:50:01,325 INFO L93 Difference]: Finished difference Result 22607 states and 35334 transitions. [2024-11-07 01:50:01,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 01:50:01,325 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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 179 [2024-11-07 01:50:01,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:50:01,376 INFO L225 Difference]: With dead ends: 22607 [2024-11-07 01:50:01,376 INFO L226 Difference]: Without dead ends: 16243 [2024-11-07 01:50:01,397 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2024-11-07 01:50:01,398 INFO L432 NwaCegarLoop]: 589 mSDtfsCounter, 1592 mSDsluCounter, 2037 mSDsCounter, 0 mSdLazyCounter, 3385 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1611 SdHoareTripleChecker+Valid, 2626 SdHoareTripleChecker+Invalid, 3453 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 3385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-07 01:50:01,398 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1611 Valid, 2626 Invalid, 3453 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 3385 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-07 01:50:01,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16243 states. [2024-11-07 01:50:02,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16243 to 12402. [2024-11-07 01:50:02,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12402 states, 11471 states have (on average 1.5286374335280273) internal successors, (17535), 11505 states have internal predecessors, (17535), 700 states have call successors, (700), 199 states have call predecessors, (700), 230 states have return successors, (973), 729 states have call predecessors, (973), 698 states have call successors, (973) [2024-11-07 01:50:02,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12402 states to 12402 states and 19208 transitions. [2024-11-07 01:50:02,284 INFO L78 Accepts]: Start accepts. Automaton has 12402 states and 19208 transitions. Word has length 179 [2024-11-07 01:50:02,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:50:02,284 INFO L471 AbstractCegarLoop]: Abstraction has 12402 states and 19208 transitions. [2024-11-07 01:50:02,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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:50:02,285 INFO L276 IsEmpty]: Start isEmpty. Operand 12402 states and 19208 transitions. [2024-11-07 01:50:02,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-07 01:50:02,293 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:50:02,294 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:02,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-07 01:50:02,294 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:50:02,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:50:02,294 INFO L85 PathProgramCache]: Analyzing trace with hash -206176974, now seen corresponding path program 1 times [2024-11-07 01:50:02,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:50:02,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491677754] [2024-11-07 01:50:02,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:50:02,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:50:02,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:50:02,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:50:02,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:50:02,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 01:50:02,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:50:02,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-07 01:50:02,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:50:02,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-07 01:50:02,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:50:02,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-07 01:50:02,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:50:02,495 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:50:02,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:50:02,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491677754] [2024-11-07 01:50:02,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491677754] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:50:02,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:50:02,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:50:02,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480036201] [2024-11-07 01:50:02,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:50:02,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:50:02,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:50:02,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:50:02,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:50:02,496 INFO L87 Difference]: Start difference. First operand 12402 states and 19208 transitions. Second operand has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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:50:04,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:50:04,773 INFO L93 Difference]: Finished difference Result 28785 states and 45214 transitions. [2024-11-07 01:50:04,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 01:50:04,774 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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 179 [2024-11-07 01:50:04,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:50:04,816 INFO L225 Difference]: With dead ends: 28785 [2024-11-07 01:50:04,817 INFO L226 Difference]: Without dead ends: 16404 [2024-11-07 01:50:04,837 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-11-07 01:50:04,838 INFO L432 NwaCegarLoop]: 318 mSDtfsCounter, 1153 mSDsluCounter, 1002 mSDsCounter, 0 mSdLazyCounter, 1720 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1173 SdHoareTripleChecker+Valid, 1320 SdHoareTripleChecker+Invalid, 1792 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 1720 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-07 01:50:04,838 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1173 Valid, 1320 Invalid, 1792 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 1720 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-07 01:50:04,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16404 states. [2024-11-07 01:50:05,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16404 to 12402. [2024-11-07 01:50:05,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12402 states, 11471 states have (on average 1.5257606137215587) internal successors, (17502), 11505 states have internal predecessors, (17502), 700 states have call successors, (700), 199 states have call predecessors, (700), 230 states have return successors, (973), 729 states have call predecessors, (973), 698 states have call successors, (973) [2024-11-07 01:50:05,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12402 states to 12402 states and 19175 transitions. [2024-11-07 01:50:05,526 INFO L78 Accepts]: Start accepts. Automaton has 12402 states and 19175 transitions. Word has length 179 [2024-11-07 01:50:05,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:50:05,526 INFO L471 AbstractCegarLoop]: Abstraction has 12402 states and 19175 transitions. [2024-11-07 01:50:05,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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:50:05,527 INFO L276 IsEmpty]: Start isEmpty. Operand 12402 states and 19175 transitions. [2024-11-07 01:50:05,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-07 01:50:05,534 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:50:05,534 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:05,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-07 01:50:05,534 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:50:05,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:50:05,535 INFO L85 PathProgramCache]: Analyzing trace with hash 220377524, now seen corresponding path program 1 times [2024-11-07 01:50:05,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:50:05,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363536235] [2024-11-07 01:50:05,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:50:05,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:50:05,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:50:05,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:50:05,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:50:05,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 01:50:05,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:50:05,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-07 01:50:05,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:50:05,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-07 01:50:05,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:50:05,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-07 01:50:05,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:50:05,939 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:50:05,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:50:05,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363536235] [2024-11-07 01:50:05,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363536235] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:50:05,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:50:05,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:50:05,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24737933] [2024-11-07 01:50:05,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:50:05,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:50:05,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:50:05,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:50:05,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:50:05,941 INFO L87 Difference]: Start difference. First operand 12402 states and 19175 transitions. Second operand has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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:50:11,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:50:11,409 INFO L93 Difference]: Finished difference Result 49404 states and 77158 transitions. [2024-11-07 01:50:11,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-07 01:50:11,410 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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 179 [2024-11-07 01:50:11,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:50:11,576 INFO L225 Difference]: With dead ends: 49404 [2024-11-07 01:50:11,576 INFO L226 Difference]: Without dead ends: 37023 [2024-11-07 01:50:11,641 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-11-07 01:50:11,645 INFO L432 NwaCegarLoop]: 586 mSDtfsCounter, 2030 mSDsluCounter, 2026 mSDsCounter, 0 mSdLazyCounter, 3339 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2062 SdHoareTripleChecker+Valid, 2612 SdHoareTripleChecker+Invalid, 3410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 3339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-07 01:50:11,646 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2062 Valid, 2612 Invalid, 3410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 3339 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-11-07 01:50:11,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37023 states. [2024-11-07 01:50:13,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37023 to 24148. [2024-11-07 01:50:13,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24148 states, 22353 states have (on average 1.5225696774482171) internal successors, (34034), 22419 states have internal predecessors, (34034), 1340 states have call successors, (1340), 391 states have call predecessors, (1340), 454 states have return successors, (2131), 1401 states have call predecessors, (2131), 1338 states have call successors, (2131) [2024-11-07 01:50:13,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24148 states to 24148 states and 37505 transitions. [2024-11-07 01:50:13,491 INFO L78 Accepts]: Start accepts. Automaton has 24148 states and 37505 transitions. Word has length 179 [2024-11-07 01:50:13,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:50:13,492 INFO L471 AbstractCegarLoop]: Abstraction has 24148 states and 37505 transitions. [2024-11-07 01:50:13,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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:50:13,492 INFO L276 IsEmpty]: Start isEmpty. Operand 24148 states and 37505 transitions. [2024-11-07 01:50:13,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-07 01:50:13,513 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:50:13,513 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:13,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-07 01:50:13,513 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:50:13,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:50:13,514 INFO L85 PathProgramCache]: Analyzing trace with hash -320051982, now seen corresponding path program 1 times [2024-11-07 01:50:13,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:50:13,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185186972] [2024-11-07 01:50:13,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:50:13,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:50:13,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:50:13,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:50:13,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:50:13,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 01:50:13,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:50:13,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-07 01:50:13,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:50:13,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-07 01:50:13,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:50:13,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-07 01:50:13,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:50:13,694 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:50:13,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:50:13,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185186972] [2024-11-07 01:50:13,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185186972] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:50:13,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:50:13,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:50:13,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101427085] [2024-11-07 01:50:13,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:50:13,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:50:13,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:50:13,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:50:13,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:50:13,696 INFO L87 Difference]: Start difference. First operand 24148 states and 37505 transitions. Second operand has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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:50:21,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:50:21,230 INFO L93 Difference]: Finished difference Result 95900 states and 150446 transitions. [2024-11-07 01:50:21,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-07 01:50:21,231 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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 179 [2024-11-07 01:50:21,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:50:21,476 INFO L225 Difference]: With dead ends: 95900 [2024-11-07 01:50:21,476 INFO L226 Difference]: Without dead ends: 71773 [2024-11-07 01:50:21,538 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-11-07 01:50:21,538 INFO L432 NwaCegarLoop]: 587 mSDtfsCounter, 1686 mSDsluCounter, 2029 mSDsCounter, 0 mSdLazyCounter, 4013 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1704 SdHoareTripleChecker+Valid, 2616 SdHoareTripleChecker+Invalid, 4083 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 4013 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-11-07 01:50:21,539 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1704 Valid, 2616 Invalid, 4083 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 4013 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-11-07 01:50:21,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71773 states. [2024-11-07 01:50:24,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71773 to 47861. [2024-11-07 01:50:24,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47861 states, 44370 states have (on average 1.522920892494929) internal successors, (67572), 44500 states have internal predecessors, (67572), 2588 states have call successors, (2588), 775 states have call predecessors, (2588), 902 states have return successors, (4901), 2713 states have call predecessors, (4901), 2586 states have call successors, (4901) [2024-11-07 01:50:24,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47861 states to 47861 states and 75061 transitions. [2024-11-07 01:50:24,699 INFO L78 Accepts]: Start accepts. Automaton has 47861 states and 75061 transitions. Word has length 179 [2024-11-07 01:50:24,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:50:24,700 INFO L471 AbstractCegarLoop]: Abstraction has 47861 states and 75061 transitions. [2024-11-07 01:50:24,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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:50:24,700 INFO L276 IsEmpty]: Start isEmpty. Operand 47861 states and 75061 transitions. [2024-11-07 01:50:24,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-07 01:50:24,714 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:50:24,714 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:24,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-07 01:50:24,714 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:50:24,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:50:24,715 INFO L85 PathProgramCache]: Analyzing trace with hash -476032524, now seen corresponding path program 1 times [2024-11-07 01:50:24,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:50:24,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482327367] [2024-11-07 01:50:24,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:50:24,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:50:24,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:50:24,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:50:24,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:50:24,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-07 01:50:24,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:50:24,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-07 01:50:24,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:50:24,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-07 01:50:24,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:50:24,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-07 01:50:24,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:50:24,880 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:50:24,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:50:24,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482327367] [2024-11-07 01:50:24,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482327367] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:50:24,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:50:24,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:50:24,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265067486] [2024-11-07 01:50:24,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:50:24,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:50:24,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:50:24,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:50:24,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:50:24,881 INFO L87 Difference]: Start difference. First operand 47861 states and 75061 transitions. Second operand has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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:50:36,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:50:36,454 INFO L93 Difference]: Finished difference Result 188411 states and 298356 transitions. [2024-11-07 01:50:36,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-07 01:50:36,455 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 5 states have internal predecessors, (168), 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 179 [2024-11-07 01:50:36,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:50:36,914 INFO L225 Difference]: With dead ends: 188411 [2024-11-07 01:50:36,914 INFO L226 Difference]: Without dead ends: 140571 [2024-11-07 01:50:37,067 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2024-11-07 01:50:37,067 INFO L432 NwaCegarLoop]: 587 mSDtfsCounter, 1957 mSDsluCounter, 2029 mSDsCounter, 0 mSdLazyCounter, 3309 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1989 SdHoareTripleChecker+Valid, 2616 SdHoareTripleChecker+Invalid, 3380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 3309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-07 01:50:37,067 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1989 Valid, 2616 Invalid, 3380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 3309 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-07 01:50:37,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140571 states.