./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.11.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml', '-i', '../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.11.cil-2.c', '-s', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf', '--cacsl2boogietranslator.entry.function', 'main', '--witnessprinter.witness.directory', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux', '--witnessprinter.witness.filename', 'witness', '--witnessprinter.write.witness.besides.input.file', 'false', '--witnessprinter.graph.data.specification', 'CHECK( init(main()), LTL(G ! call(reach_error())) )\n\n', '--witnessprinter.graph.data.producer', 'Automizer', '--witnessprinter.graph.data.architecture', '32bit', '--witnessprinter.graph.data.programhash', 'c8331ae1a542eb033e77244b050255025a53bdff6172fe7667dd71867965088c'] 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.11.cil-2.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c8331ae1a542eb033e77244b050255025a53bdff6172fe7667dd71867965088c --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 01:48:57,075 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 01:48:57,149 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:48:57,154 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 01:48:57,154 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 01:48:57,182 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 01:48:57,182 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 01:48:57,182 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 01:48:57,183 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 01:48:57,183 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 01:48:57,183 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 01:48:57,183 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 01:48:57,184 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 01:48:57,184 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 01:48:57,184 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 01:48:57,184 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 01:48:57,184 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 01:48:57,185 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-07 01:48:57,185 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 01:48:57,185 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-07 01:48:57,185 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 01:48:57,185 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 01:48:57,185 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 01:48:57,185 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 01:48:57,185 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 01:48:57,186 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-07 01:48:57,186 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 01:48:57,186 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 01:48:57,186 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 01:48:57,186 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 01:48:57,186 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 01:48:57,186 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 01:48:57,186 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 01:48:57,187 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 01:48:57,187 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 01:48:57,187 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 01:48:57,187 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 01:48:57,187 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 01:48:57,187 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 01:48:57,187 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 01:48:57,187 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 01:48:57,187 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 01:48:57,187 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 -> c8331ae1a542eb033e77244b050255025a53bdff6172fe7667dd71867965088c [2024-11-07 01:48:57,469 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 01:48:57,479 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 01:48:57,481 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 01:48:57,482 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 01:48:57,483 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 01:48:57,484 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.11.cil-2.c [2024-11-07 01:48:58,783 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 01:48:59,065 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 01:48:59,066 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.11.cil-2.c [2024-11-07 01:48:59,086 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/423b71b4b/98afbf6760f440ca9905cb9caac4f3df/FLAG2f86ef044 [2024-11-07 01:48:59,349 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/423b71b4b/98afbf6760f440ca9905cb9caac4f3df [2024-11-07 01:48:59,351 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 01:48:59,353 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 01:48:59,354 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 01:48:59,354 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 01:48:59,357 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 01:48:59,357 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:48:59" (1/1) ... [2024-11-07 01:48:59,358 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@606d61e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:48:59, skipping insertion in model container [2024-11-07 01:48:59,358 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:48:59" (1/1) ... [2024-11-07 01:48:59,401 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 01:48:59,556 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.11.cil-2.c[911,924] [2024-11-07 01:48:59,638 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.11.cil-2.c[8416,8429] [2024-11-07 01:48:59,764 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 01:48:59,780 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 01:48:59,792 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.11.cil-2.c[911,924] [2024-11-07 01:48:59,818 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.11.cil-2.c[8416,8429] [2024-11-07 01:48:59,854 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 01:48:59,885 INFO L204 MainTranslator]: Completed translation [2024-11-07 01:48:59,886 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:48:59 WrapperNode [2024-11-07 01:48:59,886 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 01:48:59,887 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 01:48:59,887 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 01:48:59,887 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 01:48:59,894 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:48:59" (1/1) ... [2024-11-07 01:48:59,913 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:48:59" (1/1) ... [2024-11-07 01:48:59,959 INFO L138 Inliner]: procedures = 77, calls = 94, calls flagged for inlining = 46, calls inlined = 46, statements flattened = 1046 [2024-11-07 01:48:59,960 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 01:48:59,960 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 01:48:59,960 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 01:48:59,961 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 01:48:59,968 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:48:59" (1/1) ... [2024-11-07 01:48:59,969 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:48:59" (1/1) ... [2024-11-07 01:48:59,973 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:48:59" (1/1) ... [2024-11-07 01:48:59,994 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:48:59,995 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:48:59" (1/1) ... [2024-11-07 01:48:59,995 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:48:59" (1/1) ... [2024-11-07 01:49:00,010 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:48:59" (1/1) ... [2024-11-07 01:49:00,026 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:48:59" (1/1) ... [2024-11-07 01:49:00,029 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:48:59" (1/1) ... [2024-11-07 01:49:00,031 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:48:59" (1/1) ... [2024-11-07 01:49:00,036 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 01:49:00,037 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 01:49:00,038 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 01:49:00,038 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 01:49:00,039 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:48:59" (1/1) ... [2024-11-07 01:49:00,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 01:49:00,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 01:49:00,076 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:00,091 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:00,115 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 01:49:00,115 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2024-11-07 01:49:00,115 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2024-11-07 01:49:00,115 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2024-11-07 01:49:00,115 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2024-11-07 01:49:00,115 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2024-11-07 01:49:00,115 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2024-11-07 01:49:00,116 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2024-11-07 01:49:00,116 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2024-11-07 01:49:00,116 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2024-11-07 01:49:00,116 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2024-11-07 01:49:00,116 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2024-11-07 01:49:00,116 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2024-11-07 01:49:00,116 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2024-11-07 01:49:00,116 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2024-11-07 01:49:00,116 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2024-11-07 01:49:00,116 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2024-11-07 01:49:00,117 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2024-11-07 01:49:00,117 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2024-11-07 01:49:00,117 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2024-11-07 01:49:00,117 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2024-11-07 01:49:00,117 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2024-11-07 01:49:00,117 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2024-11-07 01:49:00,117 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 01:49:00,117 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2024-11-07 01:49:00,117 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2024-11-07 01:49:00,118 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2024-11-07 01:49:00,118 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2024-11-07 01:49:00,118 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 01:49:00,118 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 01:49:00,118 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2024-11-07 01:49:00,118 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2024-11-07 01:49:00,238 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 01:49:00,239 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 01:49:01,022 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##56: assume !(1 == ~q_free~0); [2024-11-07 01:49:01,023 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:01,246 INFO L? ?]: Removed 124 outVars from TransFormulas that were not future-live. [2024-11-07 01:49:01,247 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 01:49:01,273 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 01:49:01,274 INFO L316 CfgBuilder]: Removed 18 assume(true) statements. [2024-11-07 01:49:01,275 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:49:01 BoogieIcfgContainer [2024-11-07 01:49:01,275 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 01:49:01,277 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 01:49:01,277 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 01:49:01,281 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 01:49:01,282 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 01:48:59" (1/3) ... [2024-11-07 01:49:01,282 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1146bac6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:49:01, skipping insertion in model container [2024-11-07 01:49:01,283 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:48:59" (2/3) ... [2024-11-07 01:49:01,283 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1146bac6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:49:01, skipping insertion in model container [2024-11-07 01:49:01,283 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:49:01" (3/3) ... [2024-11-07 01:49:01,284 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_3.cil+token_ring.11.cil-2.c [2024-11-07 01:49:01,298 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 01:49:01,299 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-07 01:49:01,369 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 01:49:01,380 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;@723fa220, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 01:49:01,381 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-07 01:49:01,388 INFO L276 IsEmpty]: Start isEmpty. Operand has 486 states, 428 states have (on average 1.6168224299065421) internal successors, (692), 434 states have internal predecessors, (692), 41 states have call successors, (41), 14 states have call predecessors, (41), 14 states have return successors, (41), 40 states have call predecessors, (41), 41 states have call successors, (41) [2024-11-07 01:49:01,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-07 01:49:01,400 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:49:01,400 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:01,401 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:49:01,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:49:01,404 INFO L85 PathProgramCache]: Analyzing trace with hash -1267420675, now seen corresponding path program 1 times [2024-11-07 01:49:01,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:49:01,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782681010] [2024-11-07 01:49:01,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:49:01,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:49:01,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:01,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:49:01,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:01,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-07 01:49:01,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:01,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 01:49:02,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:02,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 01:49:02,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:02,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 01:49:02,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:02,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 01:49:02,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:02,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 01:49:02,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:02,050 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:02,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:49:02,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782681010] [2024-11-07 01:49:02,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782681010] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:49:02,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:49:02,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 01:49:02,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385671358] [2024-11-07 01:49:02,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:49:02,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 01:49:02,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:49:02,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 01:49:02,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-07 01:49:02,087 INFO L87 Difference]: Start difference. First operand has 486 states, 428 states have (on average 1.6168224299065421) internal successors, (692), 434 states have internal predecessors, (692), 41 states have call successors, (41), 14 states have call predecessors, (41), 14 states have return successors, (41), 40 states have call predecessors, (41), 41 states have call successors, (41) 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:03,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:49:03,637 INFO L93 Difference]: Finished difference Result 1096 states and 1737 transitions. [2024-11-07 01:49:03,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 01:49:03,641 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:03,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:49:03,657 INFO L225 Difference]: With dead ends: 1096 [2024-11-07 01:49:03,658 INFO L226 Difference]: Without dead ends: 627 [2024-11-07 01:49:03,667 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2024-11-07 01:49:03,670 INFO L432 NwaCegarLoop]: 421 mSDtfsCounter, 1225 mSDsluCounter, 1745 mSDsCounter, 0 mSdLazyCounter, 1366 mSolverCounterSat, 184 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1232 SdHoareTripleChecker+Valid, 2166 SdHoareTripleChecker+Invalid, 1550 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 184 IncrementalHoareTripleChecker+Valid, 1366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-07 01:49:03,671 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1232 Valid, 2166 Invalid, 1550 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [184 Valid, 1366 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-07 01:49:03,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states. [2024-11-07 01:49:03,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 588. [2024-11-07 01:49:03,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 588 states, 510 states have (on average 1.511764705882353) internal successors, (771), 516 states have internal predecessors, (771), 54 states have call successors, (54), 21 states have call predecessors, (54), 22 states have return successors, (57), 53 states have call predecessors, (57), 52 states have call successors, (57) [2024-11-07 01:49:03,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 882 transitions. [2024-11-07 01:49:03,790 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 882 transitions. Word has length 65 [2024-11-07 01:49:03,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:49:03,791 INFO L471 AbstractCegarLoop]: Abstraction has 588 states and 882 transitions. [2024-11-07 01:49:03,791 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:03,791 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 882 transitions. [2024-11-07 01:49:03,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-07 01:49:03,795 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:49:03,795 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:03,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 01:49:03,796 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:49:03,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:49:03,797 INFO L85 PathProgramCache]: Analyzing trace with hash 411467965, now seen corresponding path program 1 times [2024-11-07 01:49:03,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:49:03,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345519884] [2024-11-07 01:49:03,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:49:03,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:49:03,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:03,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:49:03,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:03,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-07 01:49:03,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:04,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 01:49:04,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:04,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 01:49:04,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:04,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 01:49:04,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:04,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 01:49:04,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:04,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 01:49:04,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:04,048 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:04,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:49:04,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345519884] [2024-11-07 01:49:04,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345519884] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:49:04,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:49:04,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 01:49:04,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826090811] [2024-11-07 01:49:04,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:49:04,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 01:49:04,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:49:04,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 01:49:04,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-07 01:49:04,051 INFO L87 Difference]: Start difference. First operand 588 states and 882 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:05,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:49:05,542 INFO L93 Difference]: Finished difference Result 985 states and 1448 transitions. [2024-11-07 01:49:05,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-07 01:49:05,544 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:05,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:49:05,553 INFO L225 Difference]: With dead ends: 985 [2024-11-07 01:49:05,554 INFO L226 Difference]: Without dead ends: 776 [2024-11-07 01:49:05,555 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2024-11-07 01:49:05,556 INFO L432 NwaCegarLoop]: 466 mSDtfsCounter, 1398 mSDsluCounter, 2031 mSDsCounter, 0 mSdLazyCounter, 1752 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1431 SdHoareTripleChecker+Valid, 2497 SdHoareTripleChecker+Invalid, 1873 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 1752 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-07 01:49:05,557 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1431 Valid, 2497 Invalid, 1873 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 1752 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-07 01:49:05,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 776 states. [2024-11-07 01:49:05,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 776 to 700. [2024-11-07 01:49:05,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 700 states, 600 states have (on average 1.495) internal successors, (897), 608 states have internal predecessors, (897), 67 states have call successors, (67), 28 states have call predecessors, (67), 31 states have return successors, (78), 67 states have call predecessors, (78), 65 states have call successors, (78) [2024-11-07 01:49:05,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 700 states to 700 states and 1042 transitions. [2024-11-07 01:49:05,628 INFO L78 Accepts]: Start accepts. Automaton has 700 states and 1042 transitions. Word has length 65 [2024-11-07 01:49:05,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:49:05,629 INFO L471 AbstractCegarLoop]: Abstraction has 700 states and 1042 transitions. [2024-11-07 01:49:05,629 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:05,629 INFO L276 IsEmpty]: Start isEmpty. Operand 700 states and 1042 transitions. [2024-11-07 01:49:05,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-07 01:49:05,635 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:49:05,635 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:05,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 01:49:05,636 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:49:05,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:49:05,636 INFO L85 PathProgramCache]: Analyzing trace with hash -1617118145, now seen corresponding path program 1 times [2024-11-07 01:49:05,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:49:05,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868291930] [2024-11-07 01:49:05,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:49:05,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:49:05,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:05,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:49:05,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:05,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-07 01:49:05,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:05,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 01:49:05,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:05,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 01:49:05,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:05,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-07 01:49:05,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:05,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-07 01:49:05,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:05,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-07 01:49:05,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:05,805 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:05,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:49:05,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868291930] [2024-11-07 01:49:05,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868291930] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:49:05,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:49:05,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:49:05,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515112510] [2024-11-07 01:49:05,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:49:05,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:49:05,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:49:05,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:49:05,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:49:05,809 INFO L87 Difference]: Start difference. First operand 700 states and 1042 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:06,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:49:06,957 INFO L93 Difference]: Finished difference Result 1372 states and 1984 transitions. [2024-11-07 01:49:06,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 01:49:06,958 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:06,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:49:06,966 INFO L225 Difference]: With dead ends: 1372 [2024-11-07 01:49:06,967 INFO L226 Difference]: Without dead ends: 1057 [2024-11-07 01:49:06,968 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:06,972 INFO L432 NwaCegarLoop]: 483 mSDtfsCounter, 1506 mSDsluCounter, 1490 mSDsCounter, 0 mSdLazyCounter, 1189 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1551 SdHoareTripleChecker+Valid, 1973 SdHoareTripleChecker+Invalid, 1320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 1189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-07 01:49:06,972 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1551 Valid, 1973 Invalid, 1320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 1189 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-07 01:49:06,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1057 states. [2024-11-07 01:49:07,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1057 to 981. [2024-11-07 01:49:07,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 981 states, 826 states have (on average 1.4576271186440677) internal successors, (1204), 838 states have internal predecessors, (1204), 97 states have call successors, (97), 49 states have call predecessors, (97), 56 states have return successors, (116), 97 states have call predecessors, (116), 95 states have call successors, (116) [2024-11-07 01:49:07,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 981 states to 981 states and 1417 transitions. [2024-11-07 01:49:07,068 INFO L78 Accepts]: Start accepts. Automaton has 981 states and 1417 transitions. Word has length 65 [2024-11-07 01:49:07,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:49:07,069 INFO L471 AbstractCegarLoop]: Abstraction has 981 states and 1417 transitions. [2024-11-07 01:49:07,069 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:07,069 INFO L276 IsEmpty]: Start isEmpty. Operand 981 states and 1417 transitions. [2024-11-07 01:49:07,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-07 01:49:07,071 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:49:07,071 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:07,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 01:49:07,072 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:49:07,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:49:07,073 INFO L85 PathProgramCache]: Analyzing trace with hash 221241382, now seen corresponding path program 1 times [2024-11-07 01:49:07,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:49:07,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338303421] [2024-11-07 01:49:07,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:49:07,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:49:07,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:07,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:49:07,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:07,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-07 01:49:07,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:07,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 01:49:07,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:07,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 01:49:07,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:07,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 01:49:07,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:07,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-07 01:49:07,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:07,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 01:49:07,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:07,263 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:07,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:49:07,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338303421] [2024-11-07 01:49:07,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338303421] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:49:07,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:49:07,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 01:49:07,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325357103] [2024-11-07 01:49:07,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:49:07,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 01:49:07,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:49:07,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 01:49:07,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-07 01:49:07,267 INFO L87 Difference]: Start difference. First operand 981 states and 1417 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:08,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:49:08,569 INFO L93 Difference]: Finished difference Result 1649 states and 2344 transitions. [2024-11-07 01:49:08,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 01:49:08,571 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:08,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:49:08,580 INFO L225 Difference]: With dead ends: 1649 [2024-11-07 01:49:08,580 INFO L226 Difference]: Without dead ends: 1053 [2024-11-07 01:49:08,582 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:08,583 INFO L432 NwaCegarLoop]: 417 mSDtfsCounter, 624 mSDsluCounter, 2491 mSDsCounter, 0 mSdLazyCounter, 1954 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 625 SdHoareTripleChecker+Valid, 2908 SdHoareTripleChecker+Invalid, 2043 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 1954 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-07 01:49:08,584 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [625 Valid, 2908 Invalid, 2043 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 1954 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-07 01:49:08,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1053 states. [2024-11-07 01:49:08,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1053 to 996. [2024-11-07 01:49:08,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 996 states, 838 states have (on average 1.4474940334128878) internal successors, (1213), 850 states have internal predecessors, (1213), 97 states have call successors, (97), 49 states have call predecessors, (97), 59 states have return successors, (119), 100 states have call predecessors, (119), 95 states have call successors, (119) [2024-11-07 01:49:08,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 996 states to 996 states and 1429 transitions. [2024-11-07 01:49:08,653 INFO L78 Accepts]: Start accepts. Automaton has 996 states and 1429 transitions. Word has length 66 [2024-11-07 01:49:08,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:49:08,654 INFO L471 AbstractCegarLoop]: Abstraction has 996 states and 1429 transitions. [2024-11-07 01:49:08,654 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:08,654 INFO L276 IsEmpty]: Start isEmpty. Operand 996 states and 1429 transitions. [2024-11-07 01:49:08,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-07 01:49:08,655 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:49:08,655 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:08,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 01:49:08,655 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:49:08,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:49:08,656 INFO L85 PathProgramCache]: Analyzing trace with hash -808117916, now seen corresponding path program 1 times [2024-11-07 01:49:08,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:49:08,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067066895] [2024-11-07 01:49:08,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:49:08,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:49:08,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:08,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:49:08,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:08,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-07 01:49:08,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:08,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 01:49:08,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:08,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 01:49:08,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:08,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 01:49:08,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:08,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-07 01:49:08,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:08,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 01:49:08,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:08,832 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:08,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:49:08,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067066895] [2024-11-07 01:49:08,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067066895] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:49:08,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:49:08,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 01:49:08,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435660177] [2024-11-07 01:49:08,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:49:08,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 01:49:08,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:49:08,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 01:49:08,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-07 01:49:08,834 INFO L87 Difference]: Start difference. First operand 996 states and 1429 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:11,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:49:11,019 INFO L93 Difference]: Finished difference Result 3201 states and 4550 transitions. [2024-11-07 01:49:11,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-11-07 01:49:11,020 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:11,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:49:11,029 INFO L225 Difference]: With dead ends: 3201 [2024-11-07 01:49:11,029 INFO L226 Difference]: Without dead ends: 1359 [2024-11-07 01:49:11,035 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:11,035 INFO L432 NwaCegarLoop]: 577 mSDtfsCounter, 2539 mSDsluCounter, 2187 mSDsCounter, 0 mSdLazyCounter, 2269 mSolverCounterSat, 389 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2559 SdHoareTripleChecker+Valid, 2764 SdHoareTripleChecker+Invalid, 2658 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 389 IncrementalHoareTripleChecker+Valid, 2269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-07 01:49:11,036 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2559 Valid, 2764 Invalid, 2658 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [389 Valid, 2269 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-07 01:49:11,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1359 states. [2024-11-07 01:49:11,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1359 to 1204. [2024-11-07 01:49:11,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1204 states, 990 states have (on average 1.4111111111111112) internal successors, (1397), 1006 states have internal predecessors, (1397), 127 states have call successors, (127), 70 states have call predecessors, (127), 85 states have return successors, (168), 131 states have call predecessors, (168), 125 states have call successors, (168) [2024-11-07 01:49:11,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1204 states to 1204 states and 1692 transitions. [2024-11-07 01:49:11,148 INFO L78 Accepts]: Start accepts. Automaton has 1204 states and 1692 transitions. Word has length 66 [2024-11-07 01:49:11,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:49:11,148 INFO L471 AbstractCegarLoop]: Abstraction has 1204 states and 1692 transitions. [2024-11-07 01:49:11,149 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:11,149 INFO L276 IsEmpty]: Start isEmpty. Operand 1204 states and 1692 transitions. [2024-11-07 01:49:11,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-07 01:49:11,150 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:49:11,150 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:11,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 01:49:11,151 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:49:11,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:49:11,151 INFO L85 PathProgramCache]: Analyzing trace with hash -1893671899, now seen corresponding path program 1 times [2024-11-07 01:49:11,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:49:11,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759280219] [2024-11-07 01:49:11,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:49:11,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:49:11,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:11,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:49:11,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:11,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-07 01:49:11,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:11,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 01:49:11,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:11,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 01:49:11,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:11,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 01:49:11,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:11,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 01:49:11,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:11,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 01:49:11,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:11,327 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:11,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:49:11,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759280219] [2024-11-07 01:49:11,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759280219] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:49:11,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:49:11,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 01:49:11,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113204070] [2024-11-07 01:49:11,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:49:11,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 01:49:11,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:49:11,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 01:49:11,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-07 01:49:11,329 INFO L87 Difference]: Start difference. First operand 1204 states and 1692 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:12,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:49:12,409 INFO L93 Difference]: Finished difference Result 2160 states and 2998 transitions. [2024-11-07 01:49:12,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 01:49:12,410 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:12,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:49:12,417 INFO L225 Difference]: With dead ends: 2160 [2024-11-07 01:49:12,431 INFO L226 Difference]: Without dead ends: 1341 [2024-11-07 01:49:12,434 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:12,435 INFO L432 NwaCegarLoop]: 410 mSDtfsCounter, 621 mSDsluCounter, 2450 mSDsCounter, 0 mSdLazyCounter, 1926 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 623 SdHoareTripleChecker+Valid, 2860 SdHoareTripleChecker+Invalid, 2015 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 1926 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-07 01:49:12,435 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [623 Valid, 2860 Invalid, 2015 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 1926 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-07 01:49:12,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1341 states. [2024-11-07 01:49:12,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1341 to 1249. [2024-11-07 01:49:12,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1249 states, 1026 states have (on average 1.3966861598440545) internal successors, (1433), 1042 states have internal predecessors, (1433), 127 states have call successors, (127), 70 states have call predecessors, (127), 94 states have return successors, (177), 140 states have call predecessors, (177), 125 states have call successors, (177) [2024-11-07 01:49:12,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1249 states to 1249 states and 1737 transitions. [2024-11-07 01:49:12,501 INFO L78 Accepts]: Start accepts. Automaton has 1249 states and 1737 transitions. Word has length 67 [2024-11-07 01:49:12,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:49:12,501 INFO L471 AbstractCegarLoop]: Abstraction has 1249 states and 1737 transitions. [2024-11-07 01:49:12,502 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:12,502 INFO L276 IsEmpty]: Start isEmpty. Operand 1249 states and 1737 transitions. [2024-11-07 01:49:12,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-07 01:49:12,503 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:49:12,503 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:12,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 01:49:12,504 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:49:12,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:49:12,504 INFO L85 PathProgramCache]: Analyzing trace with hash -507468505, now seen corresponding path program 1 times [2024-11-07 01:49:12,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:49:12,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124780463] [2024-11-07 01:49:12,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:49:12,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:49:12,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:12,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:49:12,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:12,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-07 01:49:12,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:12,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 01:49:12,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:12,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 01:49:12,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:12,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 01:49:12,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:12,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 01:49:12,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:12,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 01:49:12,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:12,678 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:12,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:49:12,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124780463] [2024-11-07 01:49:12,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124780463] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:49:12,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:49:12,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 01:49:12,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746669594] [2024-11-07 01:49:12,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:49:12,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 01:49:12,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:49:12,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 01:49:12,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-07 01:49:12,680 INFO L87 Difference]: Start difference. First operand 1249 states and 1737 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:13,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:49:13,761 INFO L93 Difference]: Finished difference Result 2229 states and 3040 transitions. [2024-11-07 01:49:13,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-07 01:49:13,761 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:13,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:49:13,769 INFO L225 Difference]: With dead ends: 2229 [2024-11-07 01:49:13,769 INFO L226 Difference]: Without dead ends: 1452 [2024-11-07 01:49:13,771 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:13,772 INFO L432 NwaCegarLoop]: 380 mSDtfsCounter, 1418 mSDsluCounter, 1712 mSDsCounter, 0 mSdLazyCounter, 1558 mSolverCounterSat, 151 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1450 SdHoareTripleChecker+Valid, 2092 SdHoareTripleChecker+Invalid, 1709 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 151 IncrementalHoareTripleChecker+Valid, 1558 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-07 01:49:13,772 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1450 Valid, 2092 Invalid, 1709 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [151 Valid, 1558 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-07 01:49:13,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1452 states. [2024-11-07 01:49:13,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1452 to 1258. [2024-11-07 01:49:13,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1258 states, 1035 states have (on average 1.391304347826087) internal successors, (1440), 1049 states have internal predecessors, (1440), 128 states have call successors, (128), 71 states have call predecessors, (128), 93 states have return successors, (173), 141 states have call predecessors, (173), 126 states have call successors, (173) [2024-11-07 01:49:13,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1258 states to 1258 states and 1741 transitions. [2024-11-07 01:49:13,856 INFO L78 Accepts]: Start accepts. Automaton has 1258 states and 1741 transitions. Word has length 67 [2024-11-07 01:49:13,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:49:13,857 INFO L471 AbstractCegarLoop]: Abstraction has 1258 states and 1741 transitions. [2024-11-07 01:49:13,857 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:13,857 INFO L276 IsEmpty]: Start isEmpty. Operand 1258 states and 1741 transitions. [2024-11-07 01:49:13,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-07 01:49:13,860 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:49:13,861 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 01:49:13,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-07 01:49:13,861 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:49:13,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:49:13,861 INFO L85 PathProgramCache]: Analyzing trace with hash -641482011, now seen corresponding path program 1 times [2024-11-07 01:49:13,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:49:13,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005676440] [2024-11-07 01:49:13,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:49:13,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:49:13,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:13,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:49:13,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:13,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-07 01:49:13,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:13,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-07 01:49:13,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:13,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 01:49:13,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:13,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 01:49:13,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:13,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 01:49:13,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:13,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 01:49:13,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:13,976 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:13,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:49:13,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005676440] [2024-11-07 01:49:13,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005676440] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:49:13,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:49:13,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:49:13,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878832862] [2024-11-07 01:49:13,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:49:13,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:49:13,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:49:13,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:49:13,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:49:13,978 INFO L87 Difference]: Start difference. First operand 1258 states and 1741 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:14,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:49:14,709 INFO L93 Difference]: Finished difference Result 3143 states and 4263 transitions. [2024-11-07 01:49:14,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-07 01:49:14,709 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:14,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:49:14,720 INFO L225 Difference]: With dead ends: 3143 [2024-11-07 01:49:14,720 INFO L226 Difference]: Without dead ends: 2273 [2024-11-07 01:49:14,722 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:14,723 INFO L432 NwaCegarLoop]: 371 mSDtfsCounter, 2068 mSDsluCounter, 717 mSDsCounter, 0 mSdLazyCounter, 549 mSolverCounterSat, 259 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2103 SdHoareTripleChecker+Valid, 1088 SdHoareTripleChecker+Invalid, 808 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 259 IncrementalHoareTripleChecker+Valid, 549 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-07 01:49:14,723 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2103 Valid, 1088 Invalid, 808 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [259 Valid, 549 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-07 01:49:14,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2273 states. [2024-11-07 01:49:14,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2273 to 2107. [2024-11-07 01:49:14,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2107 states, 1689 states have (on average 1.3433984606275904) internal successors, (2269), 1716 states have internal predecessors, (2269), 232 states have call successors, (232), 135 states have call predecessors, (232), 184 states have return successors, (363), 262 states have call predecessors, (363), 230 states have call successors, (363) [2024-11-07 01:49:14,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2107 states to 2107 states and 2864 transitions. [2024-11-07 01:49:14,862 INFO L78 Accepts]: Start accepts. Automaton has 2107 states and 2864 transitions. Word has length 67 [2024-11-07 01:49:14,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:49:14,863 INFO L471 AbstractCegarLoop]: Abstraction has 2107 states and 2864 transitions. [2024-11-07 01:49:14,863 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:14,863 INFO L276 IsEmpty]: Start isEmpty. Operand 2107 states and 2864 transitions. [2024-11-07 01:49:14,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-07 01:49:14,865 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:49:14,866 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:14,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-07 01:49:14,866 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:49:14,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:49:14,866 INFO L85 PathProgramCache]: Analyzing trace with hash 1167687639, now seen corresponding path program 1 times [2024-11-07 01:49:14,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:49:14,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502399416] [2024-11-07 01:49:14,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:49:14,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:49:14,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:14,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:49:14,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:14,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-07 01:49:14,929 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 17 [2024-11-07 01:49:14,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:14,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-07 01:49:14,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:14,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-07 01:49:14,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:14,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-07 01:49:14,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:14,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-07 01:49:14,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:14,954 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,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:49:14,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502399416] [2024-11-07 01:49:14,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502399416] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:49:14,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:49:14,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 01:49:14,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759348206] [2024-11-07 01:49:14,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:49:14,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 01:49:14,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:49:14,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 01:49:14,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-07 01:49:14,957 INFO L87 Difference]: Start difference. First operand 2107 states and 2864 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:15,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:49:15,519 INFO L93 Difference]: Finished difference Result 3830 states and 5220 transitions. [2024-11-07 01:49:15,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 01:49:15,519 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:15,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:49:15,523 INFO L225 Difference]: With dead ends: 3830 [2024-11-07 01:49:15,523 INFO L226 Difference]: Without dead ends: 365 [2024-11-07 01:49:15,530 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:15,531 INFO L432 NwaCegarLoop]: 396 mSDtfsCounter, 1545 mSDsluCounter, 633 mSDsCounter, 0 mSdLazyCounter, 423 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1581 SdHoareTripleChecker+Valid, 1029 SdHoareTripleChecker+Invalid, 559 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 01:49:15,531 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1581 Valid, 1029 Invalid, 559 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 423 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 01:49:15,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2024-11-07 01:49:15,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 365. [2024-11-07 01:49:15,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 333 states have (on average 1.5525525525525525) internal successors, (517), 334 states have internal predecessors, (517), 25 states have call successors, (25), 6 states have call predecessors, (25), 6 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-07 01:49:15,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 567 transitions. [2024-11-07 01:49:15,545 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 567 transitions. Word has length 68 [2024-11-07 01:49:15,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:49:15,545 INFO L471 AbstractCegarLoop]: Abstraction has 365 states and 567 transitions. [2024-11-07 01:49:15,545 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:15,546 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 567 transitions. [2024-11-07 01:49:15,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-07 01:49:15,547 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:49:15,547 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] [2024-11-07 01:49:15,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-07 01:49:15,547 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:49:15,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:49:15,548 INFO L85 PathProgramCache]: Analyzing trace with hash -1288529305, now seen corresponding path program 1 times [2024-11-07 01:49:15,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:49:15,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719840041] [2024-11-07 01:49:15,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:49:15,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:49:15,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:15,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:49:15,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:15,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 01:49:15,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:15,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 01:49:15,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:15,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-07 01:49:15,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:15,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-07 01:49:15,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:15,737 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:15,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:49:15,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719840041] [2024-11-07 01:49:15,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719840041] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:49:15,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:49:15,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 01:49:15,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620873866] [2024-11-07 01:49:15,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:49:15,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 01:49:15,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:49:15,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 01:49:15,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-07 01:49:15,740 INFO L87 Difference]: Start difference. First operand 365 states and 567 transitions. Second operand has 5 states, 5 states have (on average 31.4) internal successors, (157), 3 states have internal predecessors, (157), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:49:17,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:49:17,070 INFO L93 Difference]: Finished difference Result 848 states and 1339 transitions. [2024-11-07 01:49:17,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 01:49:17,071 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 3 states have internal predecessors, (157), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 167 [2024-11-07 01:49:17,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:49:17,074 INFO L225 Difference]: With dead ends: 848 [2024-11-07 01:49:17,074 INFO L226 Difference]: Without dead ends: 496 [2024-11-07 01:49:17,075 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-07 01:49:17,075 INFO L432 NwaCegarLoop]: 334 mSDtfsCounter, 969 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 956 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 992 SdHoareTripleChecker+Valid, 724 SdHoareTripleChecker+Invalid, 1010 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 956 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-07 01:49:17,076 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [992 Valid, 724 Invalid, 1010 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 956 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-07 01:49:17,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2024-11-07 01:49:17,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 365. [2024-11-07 01:49:17,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 333 states have (on average 1.5495495495495495) internal successors, (516), 334 states have internal predecessors, (516), 25 states have call successors, (25), 6 states have call predecessors, (25), 6 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-07 01:49:17,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 566 transitions. [2024-11-07 01:49:17,097 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 566 transitions. Word has length 167 [2024-11-07 01:49:17,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:49:17,097 INFO L471 AbstractCegarLoop]: Abstraction has 365 states and 566 transitions. [2024-11-07 01:49:17,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 3 states have internal predecessors, (157), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:49:17,097 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 566 transitions. [2024-11-07 01:49:17,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-07 01:49:17,099 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:49:17,099 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] [2024-11-07 01:49:17,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-07 01:49:17,099 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:49:17,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:49:17,100 INFO L85 PathProgramCache]: Analyzing trace with hash 116662373, now seen corresponding path program 1 times [2024-11-07 01:49:17,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:49:17,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286515410] [2024-11-07 01:49:17,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:49:17,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:49:17,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:17,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:49:17,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:17,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 01:49:17,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:17,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 01:49:17,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:17,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-07 01:49:17,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:17,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-07 01:49:17,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:17,343 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,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:49:17,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286515410] [2024-11-07 01:49:17,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286515410] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:49:17,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:49:17,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 01:49:17,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693906220] [2024-11-07 01:49:17,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:49:17,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 01:49:17,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:49:17,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 01:49:17,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 01:49:17,347 INFO L87 Difference]: Start difference. First operand 365 states and 566 transitions. Second operand has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 4 states have internal predecessors, (157), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:49:19,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:49:19,600 INFO L93 Difference]: Finished difference Result 1333 states and 2117 transitions. [2024-11-07 01:49:19,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-07 01:49:19,600 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 4 states have internal predecessors, (157), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 167 [2024-11-07 01:49:19,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:49:19,604 INFO L225 Difference]: With dead ends: 1333 [2024-11-07 01:49:19,604 INFO L226 Difference]: Without dead ends: 988 [2024-11-07 01:49:19,605 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:19,605 INFO L432 NwaCegarLoop]: 306 mSDtfsCounter, 1458 mSDsluCounter, 932 mSDsCounter, 0 mSdLazyCounter, 2097 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1476 SdHoareTripleChecker+Valid, 1238 SdHoareTripleChecker+Invalid, 2201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 2097 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-07 01:49:19,606 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1476 Valid, 1238 Invalid, 2201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 2097 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-07 01:49:19,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 988 states. [2024-11-07 01:49:19,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 988 to 727. [2024-11-07 01:49:19,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 727 states, 668 states have (on average 1.561377245508982) internal successors, (1043), 670 states have internal predecessors, (1043), 45 states have call successors, (45), 12 states have call predecessors, (45), 13 states have return successors, (48), 45 states have call predecessors, (48), 45 states have call successors, (48) [2024-11-07 01:49:19,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 727 states to 727 states and 1136 transitions. [2024-11-07 01:49:19,645 INFO L78 Accepts]: Start accepts. Automaton has 727 states and 1136 transitions. Word has length 167 [2024-11-07 01:49:19,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:49:19,646 INFO L471 AbstractCegarLoop]: Abstraction has 727 states and 1136 transitions. [2024-11-07 01:49:19,646 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.166666666666668) internal successors, (157), 4 states have internal predecessors, (157), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:49:19,646 INFO L276 IsEmpty]: Start isEmpty. Operand 727 states and 1136 transitions. [2024-11-07 01:49:19,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-07 01:49:19,647 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:49:19,648 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] [2024-11-07 01:49:19,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-07 01:49:19,648 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:49:19,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:49:19,648 INFO L85 PathProgramCache]: Analyzing trace with hash 2013641831, now seen corresponding path program 1 times [2024-11-07 01:49:19,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:49:19,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497816287] [2024-11-07 01:49:19,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:49:19,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:49:19,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:19,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:49:19,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:19,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 01:49:19,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:19,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 01:49:19,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:19,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-07 01:49:19,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:19,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-07 01:49:19,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:19,895 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,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:49:19,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497816287] [2024-11-07 01:49:19,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497816287] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:49:19,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:49:19,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:49:19,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291263219] [2024-11-07 01:49:19,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:49:19,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:49:19,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:49:19,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:49:19,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:49:19,897 INFO L87 Difference]: Start difference. First operand 727 states and 1136 transitions. Second operand has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:49:22,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:49:22,832 INFO L93 Difference]: Finished difference Result 2205 states and 3506 transitions. [2024-11-07 01:49:22,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 01:49:22,832 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 167 [2024-11-07 01:49:22,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:49:22,839 INFO L225 Difference]: With dead ends: 2205 [2024-11-07 01:49:22,839 INFO L226 Difference]: Without dead ends: 1498 [2024-11-07 01:49:22,841 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:22,841 INFO L432 NwaCegarLoop]: 540 mSDtfsCounter, 1497 mSDsluCounter, 1856 mSDsCounter, 0 mSdLazyCounter, 3320 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1515 SdHoareTripleChecker+Valid, 2396 SdHoareTripleChecker+Invalid, 3379 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 3320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-07 01:49:22,841 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1515 Valid, 2396 Invalid, 3379 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 3320 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-07 01:49:22,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1498 states. [2024-11-07 01:49:22,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1498 to 1064. [2024-11-07 01:49:22,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1064 states, 978 states have (on average 1.5541922290388548) internal successors, (1520), 981 states have internal predecessors, (1520), 65 states have call successors, (65), 18 states have call predecessors, (65), 20 states have return successors, (70), 66 states have call predecessors, (70), 65 states have call successors, (70) [2024-11-07 01:49:22,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1064 states to 1064 states and 1655 transitions. [2024-11-07 01:49:22,897 INFO L78 Accepts]: Start accepts. Automaton has 1064 states and 1655 transitions. Word has length 167 [2024-11-07 01:49:22,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:49:22,897 INFO L471 AbstractCegarLoop]: Abstraction has 1064 states and 1655 transitions. [2024-11-07 01:49:22,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:49:22,898 INFO L276 IsEmpty]: Start isEmpty. Operand 1064 states and 1655 transitions. [2024-11-07 01:49:22,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-07 01:49:22,899 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:49:22,900 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] [2024-11-07 01:49:22,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-07 01:49:22,900 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:49:22,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:49:22,900 INFO L85 PathProgramCache]: Analyzing trace with hash -1943037915, now seen corresponding path program 1 times [2024-11-07 01:49:22,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:49:22,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992429705] [2024-11-07 01:49:22,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:49:22,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:49:22,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:22,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:49:22,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:23,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 01:49:23,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:23,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 01:49:23,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:23,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-07 01:49:23,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:23,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-07 01:49:23,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:23,150 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,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:49:23,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992429705] [2024-11-07 01:49:23,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992429705] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:49:23,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:49:23,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:49:23,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383547486] [2024-11-07 01:49:23,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:49:23,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:49:23,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:49:23,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:49:23,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:49:23,152 INFO L87 Difference]: Start difference. First operand 1064 states and 1655 transitions. Second operand has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:49:24,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:49:24,809 INFO L93 Difference]: Finished difference Result 2558 states and 4063 transitions. [2024-11-07 01:49:24,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 01:49:24,809 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 167 [2024-11-07 01:49:24,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:49:24,815 INFO L225 Difference]: With dead ends: 2558 [2024-11-07 01:49:24,815 INFO L226 Difference]: Without dead ends: 1514 [2024-11-07 01:49:24,817 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:24,817 INFO L432 NwaCegarLoop]: 291 mSDtfsCounter, 1068 mSDsluCounter, 919 mSDsCounter, 0 mSdLazyCounter, 1712 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1087 SdHoareTripleChecker+Valid, 1210 SdHoareTripleChecker+Invalid, 1775 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 1712 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-07 01:49:24,817 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1087 Valid, 1210 Invalid, 1775 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 1712 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-07 01:49:24,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1514 states. [2024-11-07 01:49:24,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1514 to 1064. [2024-11-07 01:49:24,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1064 states, 978 states have (on average 1.5511247443762781) internal successors, (1517), 981 states have internal predecessors, (1517), 65 states have call successors, (65), 18 states have call predecessors, (65), 20 states have return successors, (70), 66 states have call predecessors, (70), 65 states have call successors, (70) [2024-11-07 01:49:24,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1064 states to 1064 states and 1652 transitions. [2024-11-07 01:49:24,878 INFO L78 Accepts]: Start accepts. Automaton has 1064 states and 1652 transitions. Word has length 167 [2024-11-07 01:49:24,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:49:24,879 INFO L471 AbstractCegarLoop]: Abstraction has 1064 states and 1652 transitions. [2024-11-07 01:49:24,879 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:49:24,879 INFO L276 IsEmpty]: Start isEmpty. Operand 1064 states and 1652 transitions. [2024-11-07 01:49:24,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-07 01:49:24,881 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:49:24,881 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] [2024-11-07 01:49:24,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-07 01:49:24,881 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:49:24,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:49:24,882 INFO L85 PathProgramCache]: Analyzing trace with hash 1811499875, now seen corresponding path program 1 times [2024-11-07 01:49:24,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:49:24,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181004217] [2024-11-07 01:49:24,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:49:24,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:49:24,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:24,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:49:24,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:25,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 01:49:25,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:25,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 01:49:25,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:25,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-07 01:49:25,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:25,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-07 01:49:25,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:25,116 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,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:49:25,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181004217] [2024-11-07 01:49:25,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181004217] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:49:25,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:49:25,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:49:25,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227510507] [2024-11-07 01:49:25,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:49:25,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:49:25,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:49:25,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:49:25,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:49:25,118 INFO L87 Difference]: Start difference. First operand 1064 states and 1652 transitions. Second operand has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:49:26,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:49:26,578 INFO L93 Difference]: Finished difference Result 2554 states and 4046 transitions. [2024-11-07 01:49:26,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 01:49:26,579 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 167 [2024-11-07 01:49:26,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:49:26,587 INFO L225 Difference]: With dead ends: 2554 [2024-11-07 01:49:26,587 INFO L226 Difference]: Without dead ends: 1510 [2024-11-07 01:49:26,589 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:26,590 INFO L432 NwaCegarLoop]: 291 mSDtfsCounter, 1066 mSDsluCounter, 919 mSDsCounter, 0 mSdLazyCounter, 1696 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1085 SdHoareTripleChecker+Valid, 1210 SdHoareTripleChecker+Invalid, 1759 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 1696 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-07 01:49:26,590 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1085 Valid, 1210 Invalid, 1759 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 1696 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-07 01:49:26,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1510 states. [2024-11-07 01:49:26,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1510 to 1064. [2024-11-07 01:49:26,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1064 states, 978 states have (on average 1.5480572597137015) internal successors, (1514), 981 states have internal predecessors, (1514), 65 states have call successors, (65), 18 states have call predecessors, (65), 20 states have return successors, (70), 66 states have call predecessors, (70), 65 states have call successors, (70) [2024-11-07 01:49:26,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1064 states to 1064 states and 1649 transitions. [2024-11-07 01:49:26,665 INFO L78 Accepts]: Start accepts. Automaton has 1064 states and 1649 transitions. Word has length 167 [2024-11-07 01:49:26,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:49:26,665 INFO L471 AbstractCegarLoop]: Abstraction has 1064 states and 1649 transitions. [2024-11-07 01:49:26,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:49:26,665 INFO L276 IsEmpty]: Start isEmpty. Operand 1064 states and 1649 transitions. [2024-11-07 01:49:26,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-07 01:49:26,667 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:49:26,667 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] [2024-11-07 01:49:26,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-07 01:49:26,667 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:49:26,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:49:26,668 INFO L85 PathProgramCache]: Analyzing trace with hash 1655519333, now seen corresponding path program 1 times [2024-11-07 01:49:26,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:49:26,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348373343] [2024-11-07 01:49:26,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:49:26,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:49:26,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:26,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:49:26,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:26,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 01:49:26,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:26,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 01:49:26,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:26,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-07 01:49:26,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:26,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-07 01:49:26,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:26,897 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,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:49:26,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348373343] [2024-11-07 01:49:26,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348373343] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:49:26,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:49:26,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:49:26,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799630915] [2024-11-07 01:49:26,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:49:26,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:49:26,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:49:26,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:49:26,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:49:26,900 INFO L87 Difference]: Start difference. First operand 1064 states and 1649 transitions. Second operand has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:49:29,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:49:29,973 INFO L93 Difference]: Finished difference Result 3482 states and 5493 transitions. [2024-11-07 01:49:29,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 01:49:29,974 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 167 [2024-11-07 01:49:29,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:49:29,984 INFO L225 Difference]: With dead ends: 3482 [2024-11-07 01:49:29,984 INFO L226 Difference]: Without dead ends: 2438 [2024-11-07 01:49:29,987 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:29,987 INFO L432 NwaCegarLoop]: 538 mSDtfsCounter, 1477 mSDsluCounter, 1856 mSDsCounter, 0 mSdLazyCounter, 3249 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1495 SdHoareTripleChecker+Valid, 2394 SdHoareTripleChecker+Invalid, 3310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 3249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-07 01:49:29,987 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1495 Valid, 2394 Invalid, 3310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 3249 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-07 01:49:29,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2438 states. [2024-11-07 01:49:30,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2438 to 1748. [2024-11-07 01:49:30,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1748 states, 1608 states have (on average 1.5416666666666667) internal successors, (2479), 1613 states have internal predecessors, (2479), 105 states have call successors, (105), 30 states have call predecessors, (105), 34 states have return successors, (118), 108 states have call predecessors, (118), 105 states have call successors, (118) [2024-11-07 01:49:30,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1748 states to 1748 states and 2702 transitions. [2024-11-07 01:49:30,110 INFO L78 Accepts]: Start accepts. Automaton has 1748 states and 2702 transitions. Word has length 167 [2024-11-07 01:49:30,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:49:30,110 INFO L471 AbstractCegarLoop]: Abstraction has 1748 states and 2702 transitions. [2024-11-07 01:49:30,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:49:30,110 INFO L276 IsEmpty]: Start isEmpty. Operand 1748 states and 2702 transitions. [2024-11-07 01:49:30,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-07 01:49:30,112 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:49:30,113 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] [2024-11-07 01:49:30,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-07 01:49:30,113 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:49:30,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:49:30,113 INFO L85 PathProgramCache]: Analyzing trace with hash 2066129699, now seen corresponding path program 1 times [2024-11-07 01:49:30,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:49:30,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482973898] [2024-11-07 01:49:30,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:49:30,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:49:30,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:30,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:49:30,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:30,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 01:49:30,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:30,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 01:49:30,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:30,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-07 01:49:30,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:30,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-07 01:49:30,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:30,329 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,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:49:30,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482973898] [2024-11-07 01:49:30,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482973898] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:49:30,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:49:30,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:49:30,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179041321] [2024-11-07 01:49:30,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:49:30,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:49:30,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:49:30,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:49:30,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:49:30,332 INFO L87 Difference]: Start difference. First operand 1748 states and 2702 transitions. Second operand has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:49:31,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:49:31,909 INFO L93 Difference]: Finished difference Result 4154 states and 6535 transitions. [2024-11-07 01:49:31,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 01:49:31,910 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 167 [2024-11-07 01:49:31,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:49:31,920 INFO L225 Difference]: With dead ends: 4154 [2024-11-07 01:49:31,921 INFO L226 Difference]: Without dead ends: 2426 [2024-11-07 01:49:31,925 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:31,926 INFO L432 NwaCegarLoop]: 291 mSDtfsCounter, 1065 mSDsluCounter, 919 mSDsCounter, 0 mSdLazyCounter, 1670 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1084 SdHoareTripleChecker+Valid, 1210 SdHoareTripleChecker+Invalid, 1733 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 1670 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-07 01:49:31,926 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1084 Valid, 1210 Invalid, 1733 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 1670 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-07 01:49:31,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2426 states. [2024-11-07 01:49:32,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2426 to 1748. [2024-11-07 01:49:32,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1748 states, 1608 states have (on average 1.5385572139303483) internal successors, (2474), 1613 states have internal predecessors, (2474), 105 states have call successors, (105), 30 states have call predecessors, (105), 34 states have return successors, (118), 108 states have call predecessors, (118), 105 states have call successors, (118) [2024-11-07 01:49:32,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1748 states to 1748 states and 2697 transitions. [2024-11-07 01:49:32,039 INFO L78 Accepts]: Start accepts. Automaton has 1748 states and 2697 transitions. Word has length 167 [2024-11-07 01:49:32,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:49:32,039 INFO L471 AbstractCegarLoop]: Abstraction has 1748 states and 2697 transitions. [2024-11-07 01:49:32,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:49:32,040 INFO L276 IsEmpty]: Start isEmpty. Operand 1748 states and 2697 transitions. [2024-11-07 01:49:32,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-07 01:49:32,042 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:49:32,042 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] [2024-11-07 01:49:32,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-07 01:49:32,042 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:49:32,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:49:32,043 INFO L85 PathProgramCache]: Analyzing trace with hash 278259877, now seen corresponding path program 1 times [2024-11-07 01:49:32,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:49:32,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462012273] [2024-11-07 01:49:32,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:49:32,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:49:32,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:32,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:49:32,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:32,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 01:49:32,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:32,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 01:49:32,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:32,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-07 01:49:32,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:32,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-07 01:49:32,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:32,283 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:32,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:49:32,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462012273] [2024-11-07 01:49:32,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462012273] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:49:32,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:49:32,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:49:32,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458500693] [2024-11-07 01:49:32,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:49:32,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:49:32,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:49:32,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:49:32,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:49:32,286 INFO L87 Difference]: Start difference. First operand 1748 states and 2697 transitions. Second operand has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:49:35,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:49:35,369 INFO L93 Difference]: Finished difference Result 5958 states and 9330 transitions. [2024-11-07 01:49:35,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 01:49:35,370 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 167 [2024-11-07 01:49:35,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:49:35,386 INFO L225 Difference]: With dead ends: 5958 [2024-11-07 01:49:35,386 INFO L226 Difference]: Without dead ends: 4230 [2024-11-07 01:49:35,390 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:35,391 INFO L432 NwaCegarLoop]: 538 mSDtfsCounter, 1469 mSDsluCounter, 1856 mSDsCounter, 0 mSdLazyCounter, 3211 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1487 SdHoareTripleChecker+Valid, 2394 SdHoareTripleChecker+Invalid, 3272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 3211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-07 01:49:35,391 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1487 Valid, 2394 Invalid, 3272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 3211 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-07 01:49:35,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4230 states. [2024-11-07 01:49:35,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4230 to 3118. [2024-11-07 01:49:35,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3118 states, 2870 states have (on average 1.532404181184669) internal successors, (4398), 2879 states have internal predecessors, (4398), 185 states have call successors, (185), 54 states have call predecessors, (185), 62 states have return successors, (220), 192 states have call predecessors, (220), 185 states have call successors, (220) [2024-11-07 01:49:35,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3118 states to 3118 states and 4803 transitions. [2024-11-07 01:49:35,587 INFO L78 Accepts]: Start accepts. Automaton has 3118 states and 4803 transitions. Word has length 167 [2024-11-07 01:49:35,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:49:35,588 INFO L471 AbstractCegarLoop]: Abstraction has 3118 states and 4803 transitions. [2024-11-07 01:49:35,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:49:35,588 INFO L276 IsEmpty]: Start isEmpty. Operand 3118 states and 4803 transitions. [2024-11-07 01:49:35,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-07 01:49:35,591 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:49:35,591 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] [2024-11-07 01:49:35,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-07 01:49:35,591 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:49:35,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:49:35,592 INFO L85 PathProgramCache]: Analyzing trace with hash -1857623325, now seen corresponding path program 1 times [2024-11-07 01:49:35,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:49:35,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781851555] [2024-11-07 01:49:35,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:49:35,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:49:35,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:35,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:49:35,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:35,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 01:49:35,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:35,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 01:49:35,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:35,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-07 01:49:35,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:35,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-07 01:49:35,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:35,801 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:35,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:49:35,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781851555] [2024-11-07 01:49:35,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781851555] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:49:35,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:49:35,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:49:35,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238856654] [2024-11-07 01:49:35,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:49:35,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:49:35,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:49:35,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:49:35,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:49:35,803 INFO L87 Difference]: Start difference. First operand 3118 states and 4803 transitions. Second operand has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:49:37,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:49:37,328 INFO L93 Difference]: Finished difference Result 7346 states and 11498 transitions. [2024-11-07 01:49:37,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 01:49:37,329 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 167 [2024-11-07 01:49:37,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:49:37,345 INFO L225 Difference]: With dead ends: 7346 [2024-11-07 01:49:37,345 INFO L226 Difference]: Without dead ends: 4248 [2024-11-07 01:49:37,352 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:37,353 INFO L432 NwaCegarLoop]: 290 mSDtfsCounter, 1126 mSDsluCounter, 919 mSDsCounter, 0 mSdLazyCounter, 1547 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1145 SdHoareTripleChecker+Valid, 1209 SdHoareTripleChecker+Invalid, 1611 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 1547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-07 01:49:37,353 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1145 Valid, 1209 Invalid, 1611 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 1547 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-07 01:49:37,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4248 states. [2024-11-07 01:49:37,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4248 to 3118. [2024-11-07 01:49:37,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3118 states, 2870 states have (on average 1.5292682926829269) internal successors, (4389), 2879 states have internal predecessors, (4389), 185 states have call successors, (185), 54 states have call predecessors, (185), 62 states have return successors, (220), 192 states have call predecessors, (220), 185 states have call successors, (220) [2024-11-07 01:49:37,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3118 states to 3118 states and 4794 transitions. [2024-11-07 01:49:37,607 INFO L78 Accepts]: Start accepts. Automaton has 3118 states and 4794 transitions. Word has length 167 [2024-11-07 01:49:37,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:49:37,608 INFO L471 AbstractCegarLoop]: Abstraction has 3118 states and 4794 transitions. [2024-11-07 01:49:37,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:49:37,608 INFO L276 IsEmpty]: Start isEmpty. Operand 3118 states and 4794 transitions. [2024-11-07 01:49:37,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-07 01:49:37,611 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:49:37,611 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] [2024-11-07 01:49:37,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-07 01:49:37,612 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:49:37,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:49:37,612 INFO L85 PathProgramCache]: Analyzing trace with hash -1787975451, now seen corresponding path program 1 times [2024-11-07 01:49:37,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:49:37,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848961831] [2024-11-07 01:49:37,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:49:37,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:49:37,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:37,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:49:37,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:37,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 01:49:37,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:37,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 01:49:37,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:37,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-07 01:49:37,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:37,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-07 01:49:37,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:37,873 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:37,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:49:37,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848961831] [2024-11-07 01:49:37,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848961831] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:49:37,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:49:37,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:49:37,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971604441] [2024-11-07 01:49:37,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:49:37,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:49:37,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:49:37,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:49:37,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:49:37,876 INFO L87 Difference]: Start difference. First operand 3118 states and 4794 transitions. Second operand has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:49:41,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:49:41,045 INFO L93 Difference]: Finished difference Result 10908 states and 16998 transitions. [2024-11-07 01:49:41,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-07 01:49:41,046 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 167 [2024-11-07 01:49:41,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:49:41,074 INFO L225 Difference]: With dead ends: 10908 [2024-11-07 01:49:41,074 INFO L226 Difference]: Without dead ends: 7810 [2024-11-07 01:49:41,083 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:41,084 INFO L432 NwaCegarLoop]: 538 mSDtfsCounter, 1467 mSDsluCounter, 1856 mSDsCounter, 0 mSdLazyCounter, 3168 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1485 SdHoareTripleChecker+Valid, 2394 SdHoareTripleChecker+Invalid, 3229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 3168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-07 01:49:41,084 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1485 Valid, 2394 Invalid, 3229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 3168 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-07 01:49:41,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7810 states. [2024-11-07 01:49:41,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7810 to 5872. [2024-11-07 01:49:41,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5872 states, 5408 states have (on average 1.5245931952662721) internal successors, (8245), 5425 states have internal predecessors, (8245), 345 states have call successors, (345), 102 states have call predecessors, (345), 118 states have return successors, (442), 360 states have call predecessors, (442), 345 states have call successors, (442) [2024-11-07 01:49:41,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5872 states to 5872 states and 9032 transitions. [2024-11-07 01:49:41,481 INFO L78 Accepts]: Start accepts. Automaton has 5872 states and 9032 transitions. Word has length 167 [2024-11-07 01:49:41,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:49:41,482 INFO L471 AbstractCegarLoop]: Abstraction has 5872 states and 9032 transitions. [2024-11-07 01:49:41,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:49:41,483 INFO L276 IsEmpty]: Start isEmpty. Operand 5872 states and 9032 transitions. [2024-11-07 01:49:41,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-07 01:49:41,487 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:49:41,488 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] [2024-11-07 01:49:41,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-07 01:49:41,488 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:49:41,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:49:41,488 INFO L85 PathProgramCache]: Analyzing trace with hash -1370086749, now seen corresponding path program 1 times [2024-11-07 01:49:41,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:49:41,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738419387] [2024-11-07 01:49:41,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:49:41,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:49:41,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:41,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:49:41,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:41,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 01:49:41,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:41,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 01:49:41,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:41,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-07 01:49:41,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:41,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-07 01:49:41,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:41,747 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:41,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:49:41,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738419387] [2024-11-07 01:49:41,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738419387] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:49:41,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:49:41,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:49:41,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769169441] [2024-11-07 01:49:41,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:49:41,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:49:41,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:49:41,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:49:41,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:49:41,749 INFO L87 Difference]: Start difference. First operand 5872 states and 9032 transitions. Second operand has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:49:43,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:49:43,552 INFO L93 Difference]: Finished difference Result 13712 states and 21405 transitions. [2024-11-07 01:49:43,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 01:49:43,553 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 167 [2024-11-07 01:49:43,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:49:43,580 INFO L225 Difference]: With dead ends: 13712 [2024-11-07 01:49:43,581 INFO L226 Difference]: Without dead ends: 7860 [2024-11-07 01:49:43,597 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:43,597 INFO L432 NwaCegarLoop]: 291 mSDtfsCounter, 1067 mSDsluCounter, 919 mSDsCounter, 0 mSdLazyCounter, 1605 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1086 SdHoareTripleChecker+Valid, 1210 SdHoareTripleChecker+Invalid, 1668 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 1605 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-07 01:49:43,598 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1086 Valid, 1210 Invalid, 1668 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 1605 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-07 01:49:43,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7860 states. [2024-11-07 01:49:43,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7860 to 5872. [2024-11-07 01:49:43,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5872 states, 5408 states have (on average 1.5214497041420119) internal successors, (8228), 5425 states have internal predecessors, (8228), 345 states have call successors, (345), 102 states have call predecessors, (345), 118 states have return successors, (442), 360 states have call predecessors, (442), 345 states have call successors, (442) [2024-11-07 01:49:44,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5872 states to 5872 states and 9015 transitions. [2024-11-07 01:49:44,010 INFO L78 Accepts]: Start accepts. Automaton has 5872 states and 9015 transitions. Word has length 167 [2024-11-07 01:49:44,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:49:44,011 INFO L471 AbstractCegarLoop]: Abstraction has 5872 states and 9015 transitions. [2024-11-07 01:49:44,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:49:44,011 INFO L276 IsEmpty]: Start isEmpty. Operand 5872 states and 9015 transitions. [2024-11-07 01:49:44,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-07 01:49:44,016 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:49:44,016 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-07 01:49:44,016 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:49:44,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:49:44,017 INFO L85 PathProgramCache]: Analyzing trace with hash 1307440097, now seen corresponding path program 1 times [2024-11-07 01:49:44,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:49:44,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865184486] [2024-11-07 01:49:44,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:49:44,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:49:44,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:44,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:49:44,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:44,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 01:49:44,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:44,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 01:49:44,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:44,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-07 01:49:44,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:44,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-07 01:49:44,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:44,217 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,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:49:44,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865184486] [2024-11-07 01:49:44,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865184486] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:49:44,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:49:44,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:49:44,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092119939] [2024-11-07 01:49:44,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:49:44,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:49:44,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:49:44,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:49:44,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:49:44,219 INFO L87 Difference]: Start difference. First operand 5872 states and 9015 transitions. Second operand has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:49:45,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:49:45,988 INFO L93 Difference]: Finished difference Result 13694 states and 21318 transitions. [2024-11-07 01:49:45,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 01:49:45,989 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 167 [2024-11-07 01:49:45,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:49:46,018 INFO L225 Difference]: With dead ends: 13694 [2024-11-07 01:49:46,018 INFO L226 Difference]: Without dead ends: 7842 [2024-11-07 01:49:46,035 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:46,036 INFO L432 NwaCegarLoop]: 291 mSDtfsCounter, 1217 mSDsluCounter, 723 mSDsCounter, 0 mSdLazyCounter, 1449 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1236 SdHoareTripleChecker+Valid, 1014 SdHoareTripleChecker+Invalid, 1539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 1449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-07 01:49:46,036 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1236 Valid, 1014 Invalid, 1539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 1449 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-07 01:49:46,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7842 states. [2024-11-07 01:49:46,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7842 to 5872. [2024-11-07 01:49:46,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5872 states, 5408 states have (on average 1.5183062130177514) internal successors, (8211), 5425 states have internal predecessors, (8211), 345 states have call successors, (345), 102 states have call predecessors, (345), 118 states have return successors, (442), 360 states have call predecessors, (442), 345 states have call successors, (442) [2024-11-07 01:49:46,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5872 states to 5872 states and 8998 transitions. [2024-11-07 01:49:46,466 INFO L78 Accepts]: Start accepts. Automaton has 5872 states and 8998 transitions. Word has length 167 [2024-11-07 01:49:46,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:49:46,466 INFO L471 AbstractCegarLoop]: Abstraction has 5872 states and 8998 transitions. [2024-11-07 01:49:46,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:49:46,467 INFO L276 IsEmpty]: Start isEmpty. Operand 5872 states and 8998 transitions. [2024-11-07 01:49:46,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-07 01:49:46,470 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:49:46,470 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] [2024-11-07 01:49:46,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-07 01:49:46,471 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:49:46,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:49:46,471 INFO L85 PathProgramCache]: Analyzing trace with hash 1670906595, now seen corresponding path program 1 times [2024-11-07 01:49:46,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:49:46,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894496607] [2024-11-07 01:49:46,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:49:46,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:49:46,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:46,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:49:46,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:46,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 01:49:46,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:46,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 01:49:46,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:46,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-07 01:49:46,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:46,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-07 01:49:46,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:46,676 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,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:49:46,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894496607] [2024-11-07 01:49:46,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894496607] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:49:46,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:49:46,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:49:46,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007619052] [2024-11-07 01:49:46,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:49:46,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:49:46,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:49:46,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:49:46,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:49:46,679 INFO L87 Difference]: Start difference. First operand 5872 states and 8998 transitions. Second operand has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:49:50,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:49:50,308 INFO L93 Difference]: Finished difference Result 23190 states and 35928 transitions. [2024-11-07 01:49:50,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-07 01:49:50,309 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 167 [2024-11-07 01:49:50,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:49:50,362 INFO L225 Difference]: With dead ends: 23190 [2024-11-07 01:49:50,363 INFO L226 Difference]: Without dead ends: 17338 [2024-11-07 01:49:50,381 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:49:50,383 INFO L432 NwaCegarLoop]: 535 mSDtfsCounter, 1855 mSDsluCounter, 1845 mSDsCounter, 0 mSdLazyCounter, 3083 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1885 SdHoareTripleChecker+Valid, 2380 SdHoareTripleChecker+Invalid, 3147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 3083 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-07 01:49:50,384 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1885 Valid, 2380 Invalid, 3147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 3083 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-07 01:49:50,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17338 states. [2024-11-07 01:49:51,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17338 to 11316. [2024-11-07 01:49:51,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11316 states, 10436 states have (on average 1.515810655423534) internal successors, (15819), 10469 states have internal predecessors, (15819), 649 states have call successors, (649), 198 states have call predecessors, (649), 230 states have return successors, (924), 680 states have call predecessors, (924), 649 states have call successors, (924) [2024-11-07 01:49:51,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11316 states to 11316 states and 17392 transitions. [2024-11-07 01:49:51,320 INFO L78 Accepts]: Start accepts. Automaton has 11316 states and 17392 transitions. Word has length 167 [2024-11-07 01:49:51,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:49:51,320 INFO L471 AbstractCegarLoop]: Abstraction has 11316 states and 17392 transitions. [2024-11-07 01:49:51,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:49:51,320 INFO L276 IsEmpty]: Start isEmpty. Operand 11316 states and 17392 transitions. [2024-11-07 01:49:51,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-07 01:49:51,326 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:49:51,327 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] [2024-11-07 01:49:51,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-07 01:49:51,327 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:49:51,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:49:51,327 INFO L85 PathProgramCache]: Analyzing trace with hash 1959725985, now seen corresponding path program 1 times [2024-11-07 01:49:51,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:49:51,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226356863] [2024-11-07 01:49:51,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:49:51,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:49:51,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:51,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:49:51,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:51,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 01:49:51,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:51,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 01:49:51,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:51,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-07 01:49:51,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:51,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-07 01:49:51,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:51,581 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,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:49:51,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226356863] [2024-11-07 01:49:51,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226356863] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:49:51,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:49:51,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:49:51,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922930600] [2024-11-07 01:49:51,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:49:51,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:49:51,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:49:51,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:49:51,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:49:51,584 INFO L87 Difference]: Start difference. First operand 11316 states and 17392 transitions. Second operand has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:49:56,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:49:56,215 INFO L93 Difference]: Finished difference Result 44648 states and 69364 transitions. [2024-11-07 01:49:56,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-07 01:49:56,216 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 167 [2024-11-07 01:49:56,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:49:56,306 INFO L225 Difference]: With dead ends: 44648 [2024-11-07 01:49:56,306 INFO L226 Difference]: Without dead ends: 33352 [2024-11-07 01:49:56,338 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:49:56,339 INFO L432 NwaCegarLoop]: 536 mSDtfsCounter, 1540 mSDsluCounter, 1848 mSDsCounter, 0 mSdLazyCounter, 3696 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1557 SdHoareTripleChecker+Valid, 2384 SdHoareTripleChecker+Invalid, 3759 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 3696 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-07 01:49:56,339 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1557 Valid, 2384 Invalid, 3759 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 3696 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-07 01:49:56,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33352 states. [2024-11-07 01:49:57,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33352 to 22261. [2024-11-07 01:49:57,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22261 states, 20565 states have (on average 1.5154388524191587) internal successors, (31165), 20630 states have internal predecessors, (31165), 1241 states have call successors, (1241), 390 states have call predecessors, (1241), 454 states have return successors, (2034), 1304 states have call predecessors, (2034), 1241 states have call successors, (2034) [2024-11-07 01:49:57,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22261 states to 22261 states and 34440 transitions. [2024-11-07 01:49:57,882 INFO L78 Accepts]: Start accepts. Automaton has 22261 states and 34440 transitions. Word has length 167 [2024-11-07 01:49:57,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:49:57,882 INFO L471 AbstractCegarLoop]: Abstraction has 22261 states and 34440 transitions. [2024-11-07 01:49:57,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:49:57,882 INFO L276 IsEmpty]: Start isEmpty. Operand 22261 states and 34440 transitions. [2024-11-07 01:49:57,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-07 01:49:57,894 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:49:57,894 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] [2024-11-07 01:49:57,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-07 01:49:57,894 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:49:57,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:49:57,895 INFO L85 PathProgramCache]: Analyzing trace with hash 1414853411, now seen corresponding path program 1 times [2024-11-07 01:49:57,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:49:57,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877214572] [2024-11-07 01:49:57,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:49:57,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:49:57,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:57,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:49:57,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:58,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 01:49:58,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:58,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 01:49:58,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:58,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-07 01:49:58,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:58,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-07 01:49:58,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:49:58,149 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:58,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:49:58,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877214572] [2024-11-07 01:49:58,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877214572] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:49:58,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:49:58,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:49:58,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763291900] [2024-11-07 01:49:58,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:49:58,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:49:58,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:49:58,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:49:58,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:49:58,152 INFO L87 Difference]: Start difference. First operand 22261 states and 34440 transitions. Second operand has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:50:04,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 01:50:04,498 INFO L93 Difference]: Finished difference Result 87175 states and 136282 transitions. [2024-11-07 01:50:04,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-07 01:50:04,498 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 167 [2024-11-07 01:50:04,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 01:50:04,711 INFO L225 Difference]: With dead ends: 87175 [2024-11-07 01:50:04,711 INFO L226 Difference]: Without dead ends: 64934 [2024-11-07 01:50:04,773 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:04,774 INFO L432 NwaCegarLoop]: 536 mSDtfsCounter, 1776 mSDsluCounter, 1848 mSDsCounter, 0 mSdLazyCounter, 3058 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1806 SdHoareTripleChecker+Valid, 2384 SdHoareTripleChecker+Invalid, 3122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 3058 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-07 01:50:04,775 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1806 Valid, 2384 Invalid, 3122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 3058 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-07 01:50:04,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64934 states. [2024-11-07 01:50:08,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64934 to 44118. [2024-11-07 01:50:08,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44118 states, 40822 states have (on average 1.5160207731125375) internal successors, (61887), 40951 states have internal predecessors, (61887), 2393 states have call successors, (2393), 774 states have call predecessors, (2393), 902 states have return successors, (4708), 2520 states have call predecessors, (4708), 2393 states have call successors, (4708) [2024-11-07 01:50:08,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44118 states to 44118 states and 68988 transitions. [2024-11-07 01:50:08,421 INFO L78 Accepts]: Start accepts. Automaton has 44118 states and 68988 transitions. Word has length 167 [2024-11-07 01:50:08,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 01:50:08,421 INFO L471 AbstractCegarLoop]: Abstraction has 44118 states and 68988 transitions. [2024-11-07 01:50:08,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-07 01:50:08,422 INFO L276 IsEmpty]: Start isEmpty. Operand 44118 states and 68988 transitions. [2024-11-07 01:50:08,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-07 01:50:08,434 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 01:50:08,435 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] [2024-11-07 01:50:08,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-07 01:50:08,435 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 01:50:08,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 01:50:08,435 INFO L85 PathProgramCache]: Analyzing trace with hash 2090013537, now seen corresponding path program 1 times [2024-11-07 01:50:08,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 01:50:08,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579092552] [2024-11-07 01:50:08,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 01:50:08,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 01:50:08,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:50:08,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-07 01:50:08,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:50:08,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-07 01:50:08,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:50:08,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-07 01:50:08,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:50:08,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-07 01:50:08,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:50:08,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-07 01:50:08,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 01:50:08,638 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:08,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 01:50:08,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579092552] [2024-11-07 01:50:08,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579092552] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 01:50:08,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 01:50:08,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 01:50:08,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096382021] [2024-11-07 01:50:08,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 01:50:08,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 01:50:08,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 01:50:08,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 01:50:08,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-07 01:50:08,640 INFO L87 Difference]: Start difference. First operand 44118 states and 68988 transitions. Second operand has 7 states, 7 states have (on average 22.428571428571427) internal successors, (157), 5 states have internal predecessors, (157), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5)