./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/systemc/token_ring.01.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1242b816-cefa-4c74-b58b-92964cd591ca/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1242b816-cefa-4c74-b58b-92964cd591ca/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1242b816-cefa-4c74-b58b-92964cd591ca/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1242b816-cefa-4c74-b58b-92964cd591ca/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/systemc/token_ring.01.cil-1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1242b816-cefa-4c74-b58b-92964cd591ca/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1242b816-cefa-4c74-b58b-92964cd591ca/bin/uautomizer-verify-BQ2R08f2Ya --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7b0a21004c99a1cc1588d43a2481960a2ce9f2cdf68e9a363306433e7d24bd30 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 05:46:07,023 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 05:46:07,090 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1242b816-cefa-4c74-b58b-92964cd591ca/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Overflow-32bit-Automizer_Default.epf [2023-11-29 05:46:07,095 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 05:46:07,095 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 05:46:07,119 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 05:46:07,120 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 05:46:07,121 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 05:46:07,121 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 05:46:07,131 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 05:46:07,132 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 05:46:07,132 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 05:46:07,133 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 05:46:07,134 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 05:46:07,134 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 05:46:07,135 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 05:46:07,135 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 05:46:07,136 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 05:46:07,136 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 05:46:07,137 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 05:46:07,137 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 05:46:07,138 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 05:46:07,138 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 05:46:07,138 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 05:46:07,139 INFO L153 SettingsManager]: * Check absence of signed integer overflows=true [2023-11-29 05:46:07,139 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 05:46:07,139 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 05:46:07,140 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 05:46:07,140 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 05:46:07,141 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 05:46:07,141 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 05:46:07,141 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 05:46:07,142 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 05:46:07,142 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 05:46:07,142 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 05:46:07,142 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 05:46:07,143 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 05:46:07,143 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 05:46:07,143 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 05:46:07,143 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 05:46:07,143 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 05:46:07,144 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 05:46:07,144 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 05:46:07,144 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 05:46:07,144 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1242b816-cefa-4c74-b58b-92964cd591ca/bin/uautomizer-verify-BQ2R08f2Ya/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1242b816-cefa-4c74-b58b-92964cd591ca/bin/uautomizer-verify-BQ2R08f2Ya 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 ! overflow) ) 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 -> 7b0a21004c99a1cc1588d43a2481960a2ce9f2cdf68e9a363306433e7d24bd30 [2023-11-29 05:46:07,366 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 05:46:07,400 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 05:46:07,402 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 05:46:07,403 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 05:46:07,404 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 05:46:07,405 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1242b816-cefa-4c74-b58b-92964cd591ca/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/systemc/token_ring.01.cil-1.c [2023-11-29 05:46:10,110 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 05:46:10,288 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 05:46:10,289 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1242b816-cefa-4c74-b58b-92964cd591ca/sv-benchmarks/c/systemc/token_ring.01.cil-1.c [2023-11-29 05:46:10,298 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1242b816-cefa-4c74-b58b-92964cd591ca/bin/uautomizer-verify-BQ2R08f2Ya/data/ed72ceae0/2364a0efb54c4174b8d1d5ef5abe6997/FLAG86c98a78c [2023-11-29 05:46:10,310 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1242b816-cefa-4c74-b58b-92964cd591ca/bin/uautomizer-verify-BQ2R08f2Ya/data/ed72ceae0/2364a0efb54c4174b8d1d5ef5abe6997 [2023-11-29 05:46:10,312 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 05:46:10,313 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 05:46:10,314 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 05:46:10,314 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 05:46:10,320 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 05:46:10,320 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 05:46:10" (1/1) ... [2023-11-29 05:46:10,321 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@741d48b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:46:10, skipping insertion in model container [2023-11-29 05:46:10,322 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 05:46:10" (1/1) ... [2023-11-29 05:46:10,357 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 05:46:10,519 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 05:46:10,530 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 05:46:10,559 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 05:46:10,575 INFO L206 MainTranslator]: Completed translation [2023-11-29 05:46:10,576 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:46:10 WrapperNode [2023-11-29 05:46:10,576 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 05:46:10,577 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 05:46:10,577 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 05:46:10,577 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 05:46:10,585 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:46:10" (1/1) ... [2023-11-29 05:46:10,593 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:46:10" (1/1) ... [2023-11-29 05:46:10,620 INFO L138 Inliner]: procedures = 30, calls = 35, calls flagged for inlining = 15, calls inlined = 15, statements flattened = 224 [2023-11-29 05:46:10,621 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 05:46:10,621 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 05:46:10,622 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 05:46:10,622 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 05:46:10,633 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:46:10" (1/1) ... [2023-11-29 05:46:10,634 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:46:10" (1/1) ... [2023-11-29 05:46:10,636 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:46:10" (1/1) ... [2023-11-29 05:46:10,650 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]. [2023-11-29 05:46:10,650 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:46:10" (1/1) ... [2023-11-29 05:46:10,650 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:46:10" (1/1) ... [2023-11-29 05:46:10,656 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:46:10" (1/1) ... [2023-11-29 05:46:10,661 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:46:10" (1/1) ... [2023-11-29 05:46:10,662 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:46:10" (1/1) ... [2023-11-29 05:46:10,664 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:46:10" (1/1) ... [2023-11-29 05:46:10,666 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 05:46:10,666 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 05:46:10,667 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 05:46:10,667 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 05:46:10,667 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:46:10" (1/1) ... [2023-11-29 05:46:10,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 05:46:10,688 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1242b816-cefa-4c74-b58b-92964cd591ca/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:46:10,701 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1242b816-cefa-4c74-b58b-92964cd591ca/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 05:46:10,704 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1242b816-cefa-4c74-b58b-92964cd591ca/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 05:46:10,735 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 05:46:10,735 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2023-11-29 05:46:10,736 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2023-11-29 05:46:10,736 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2023-11-29 05:46:10,736 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2023-11-29 05:46:10,736 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2023-11-29 05:46:10,736 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2023-11-29 05:46:10,736 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2023-11-29 05:46:10,737 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2023-11-29 05:46:10,737 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2023-11-29 05:46:10,737 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2023-11-29 05:46:10,737 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 05:46:10,737 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2023-11-29 05:46:10,737 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2023-11-29 05:46:10,737 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 05:46:10,738 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 05:46:10,813 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 05:46:10,816 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 05:46:11,088 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 05:46:11,122 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 05:46:11,122 INFO L309 CfgBuilder]: Removed 4 assume(true) statements. [2023-11-29 05:46:11,123 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 05:46:11 BoogieIcfgContainer [2023-11-29 05:46:11,123 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 05:46:11,125 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 05:46:11,126 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 05:46:11,129 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 05:46:11,129 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 05:46:10" (1/3) ... [2023-11-29 05:46:11,130 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36ab07a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 05:46:11, skipping insertion in model container [2023-11-29 05:46:11,130 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:46:10" (2/3) ... [2023-11-29 05:46:11,131 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36ab07a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 05:46:11, skipping insertion in model container [2023-11-29 05:46:11,131 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 05:46:11" (3/3) ... [2023-11-29 05:46:11,132 INFO L112 eAbstractionObserver]: Analyzing ICFG token_ring.01.cil-1.c [2023-11-29 05:46:11,152 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 05:46:11,153 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2023-11-29 05:46:11,202 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 05:46:11,208 INFO L357 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, mHoare=true, 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;@348f1a4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 05:46:11,208 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-11-29 05:46:11,211 INFO L276 IsEmpty]: Start isEmpty. Operand has 101 states, 75 states have (on average 1.6266666666666667) internal successors, (122), 80 states have internal predecessors, (122), 15 states have call successors, (15), 6 states have call predecessors, (15), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-11-29 05:46:11,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-11-29 05:46:11,221 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:46:11,222 INFO L195 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] [2023-11-29 05:46:11,222 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2023-11-29 05:46:11,227 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:46:11,228 INFO L85 PathProgramCache]: Analyzing trace with hash 1618851631, now seen corresponding path program 1 times [2023-11-29 05:46:11,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:46:11,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892145963] [2023-11-29 05:46:11,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:46:11,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:46:11,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:46:11,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:46:11,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:46:11,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 05:46:11,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:46:11,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-29 05:46:11,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:46:11,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-29 05:46:11,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:46:11,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 05:46:11,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:46:11,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:46:11,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:46:11,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892145963] [2023-11-29 05:46:11,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892145963] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:46:11,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:46:11,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 05:46:11,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113745562] [2023-11-29 05:46:11,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:46:11,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 05:46:11,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:46:11,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 05:46:11,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 05:46:11,680 INFO L87 Difference]: Start difference. First operand has 101 states, 75 states have (on average 1.6266666666666667) internal successors, (122), 80 states have internal predecessors, (122), 15 states have call successors, (15), 6 states have call predecessors, (15), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 4 states have internal predecessors, (39), 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) [2023-11-29 05:46:12,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:46:12,336 INFO L93 Difference]: Finished difference Result 326 states and 498 transitions. [2023-11-29 05:46:12,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 05:46:12,339 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 4 states have internal predecessors, (39), 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 49 [2023-11-29 05:46:12,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:46:12,351 INFO L225 Difference]: With dead ends: 326 [2023-11-29 05:46:12,351 INFO L226 Difference]: Without dead ends: 228 [2023-11-29 05:46:12,355 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2023-11-29 05:46:12,359 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 287 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 441 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 505 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-29 05:46:12,360 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [295 Valid, 327 Invalid, 505 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 441 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-29 05:46:12,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2023-11-29 05:46:12,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 187. [2023-11-29 05:46:12,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 145 states have (on average 1.4965517241379311) internal successors, (217), 150 states have internal predecessors, (217), 25 states have call successors, (25), 12 states have call predecessors, (25), 13 states have return successors, (28), 25 states have call predecessors, (28), 25 states have call successors, (28) [2023-11-29 05:46:12,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 270 transitions. [2023-11-29 05:46:12,425 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 270 transitions. Word has length 49 [2023-11-29 05:46:12,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:46:12,425 INFO L495 AbstractCegarLoop]: Abstraction has 187 states and 270 transitions. [2023-11-29 05:46:12,426 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 4 states have internal predecessors, (39), 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) [2023-11-29 05:46:12,426 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 270 transitions. [2023-11-29 05:46:12,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-11-29 05:46:12,429 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:46:12,429 INFO L195 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] [2023-11-29 05:46:12,429 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 05:46:12,429 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2023-11-29 05:46:12,430 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:46:12,430 INFO L85 PathProgramCache]: Analyzing trace with hash -570604117, now seen corresponding path program 1 times [2023-11-29 05:46:12,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:46:12,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203536463] [2023-11-29 05:46:12,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:46:12,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:46:12,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:46:12,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:46:12,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:46:12,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 05:46:12,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:46:12,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-29 05:46:12,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:46:12,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-29 05:46:12,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:46:12,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 05:46:12,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:46:12,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:46:12,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:46:12,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203536463] [2023-11-29 05:46:12,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203536463] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:46:12,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:46:12,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 05:46:12,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954595878] [2023-11-29 05:46:12,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:46:12,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 05:46:12,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:46:12,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 05:46:12,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 05:46:12,615 INFO L87 Difference]: Start difference. First operand 187 states and 270 transitions. Second operand has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 5 states have internal predecessors, (39), 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) [2023-11-29 05:46:13,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:46:13,363 INFO L93 Difference]: Finished difference Result 513 states and 741 transitions. [2023-11-29 05:46:13,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-29 05:46:13,364 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 5 states have internal predecessors, (39), 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 49 [2023-11-29 05:46:13,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:46:13,368 INFO L225 Difference]: With dead ends: 513 [2023-11-29 05:46:13,368 INFO L226 Difference]: Without dead ends: 333 [2023-11-29 05:46:13,371 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2023-11-29 05:46:13,373 INFO L413 NwaCegarLoop]: 148 mSDtfsCounter, 276 mSDsluCounter, 442 mSDsCounter, 0 mSdLazyCounter, 728 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 590 SdHoareTripleChecker+Invalid, 767 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 728 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-29 05:46:13,373 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [284 Valid, 590 Invalid, 767 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 728 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-29 05:46:13,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2023-11-29 05:46:13,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 270. [2023-11-29 05:46:13,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 211 states have (on average 1.4834123222748816) internal successors, (313), 217 states have internal predecessors, (313), 35 states have call successors, (35), 18 states have call predecessors, (35), 20 states have return successors, (40), 36 states have call predecessors, (40), 35 states have call successors, (40) [2023-11-29 05:46:13,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 388 transitions. [2023-11-29 05:46:13,415 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 388 transitions. Word has length 49 [2023-11-29 05:46:13,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:46:13,415 INFO L495 AbstractCegarLoop]: Abstraction has 270 states and 388 transitions. [2023-11-29 05:46:13,416 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 5 states have internal predecessors, (39), 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) [2023-11-29 05:46:13,416 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 388 transitions. [2023-11-29 05:46:13,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-11-29 05:46:13,418 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:46:13,418 INFO L195 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] [2023-11-29 05:46:13,418 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 05:46:13,419 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2023-11-29 05:46:13,419 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:46:13,419 INFO L85 PathProgramCache]: Analyzing trace with hash 1878996013, now seen corresponding path program 1 times [2023-11-29 05:46:13,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:46:13,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366080753] [2023-11-29 05:46:13,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:46:13,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:46:13,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:46:13,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:46:13,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:46:13,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 05:46:13,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:46:13,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-29 05:46:13,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:46:13,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-29 05:46:13,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:46:13,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 05:46:13,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:46:13,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:46:13,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:46:13,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366080753] [2023-11-29 05:46:13,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366080753] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:46:13,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:46:13,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 05:46:13,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132499066] [2023-11-29 05:46:13,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:46:13,575 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 05:46:13,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:46:13,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 05:46:13,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 05:46:13,576 INFO L87 Difference]: Start difference. First operand 270 states and 388 transitions. Second operand has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 5 states have internal predecessors, (39), 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) [2023-11-29 05:46:14,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:46:14,330 INFO L93 Difference]: Finished difference Result 835 states and 1203 transitions. [2023-11-29 05:46:14,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-29 05:46:14,331 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 5 states have internal predecessors, (39), 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 49 [2023-11-29 05:46:14,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:46:14,336 INFO L225 Difference]: With dead ends: 835 [2023-11-29 05:46:14,336 INFO L226 Difference]: Without dead ends: 572 [2023-11-29 05:46:14,339 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2023-11-29 05:46:14,340 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 323 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 717 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 333 SdHoareTripleChecker+Valid, 578 SdHoareTripleChecker+Invalid, 761 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 717 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-29 05:46:14,341 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [333 Valid, 578 Invalid, 761 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 717 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-29 05:46:14,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2023-11-29 05:46:14,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 429. [2023-11-29 05:46:14,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 429 states, 338 states have (on average 1.467455621301775) internal successors, (496), 346 states have internal predecessors, (496), 53 states have call successors, (53), 30 states have call predecessors, (53), 34 states have return successors, (66), 56 states have call predecessors, (66), 53 states have call successors, (66) [2023-11-29 05:46:14,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 615 transitions. [2023-11-29 05:46:14,392 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 615 transitions. Word has length 49 [2023-11-29 05:46:14,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:46:14,392 INFO L495 AbstractCegarLoop]: Abstraction has 429 states and 615 transitions. [2023-11-29 05:46:14,392 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 5 states have internal predecessors, (39), 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) [2023-11-29 05:46:14,393 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 615 transitions. [2023-11-29 05:46:14,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-11-29 05:46:14,395 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:46:14,395 INFO L195 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] [2023-11-29 05:46:14,395 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 05:46:14,395 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2023-11-29 05:46:14,396 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:46:14,396 INFO L85 PathProgramCache]: Analyzing trace with hash 849636715, now seen corresponding path program 1 times [2023-11-29 05:46:14,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:46:14,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639741341] [2023-11-29 05:46:14,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:46:14,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:46:14,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:46:14,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:46:14,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:46:14,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 05:46:14,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:46:14,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-29 05:46:14,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:46:14,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-29 05:46:14,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:46:14,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 05:46:14,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:46:14,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:46:14,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:46:14,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639741341] [2023-11-29 05:46:14,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639741341] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:46:14,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:46:14,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 05:46:14,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850911449] [2023-11-29 05:46:14,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:46:14,524 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 05:46:14,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:46:14,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 05:46:14,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 05:46:14,526 INFO L87 Difference]: Start difference. First operand 429 states and 615 transitions. Second operand has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 5 states have internal predecessors, (39), 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) [2023-11-29 05:46:15,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:46:15,256 INFO L93 Difference]: Finished difference Result 1333 states and 1916 transitions. [2023-11-29 05:46:15,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-29 05:46:15,256 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 5 states have internal predecessors, (39), 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 49 [2023-11-29 05:46:15,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:46:15,263 INFO L225 Difference]: With dead ends: 1333 [2023-11-29 05:46:15,263 INFO L226 Difference]: Without dead ends: 911 [2023-11-29 05:46:15,265 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2023-11-29 05:46:15,267 INFO L413 NwaCegarLoop]: 133 mSDtfsCounter, 270 mSDsluCounter, 422 mSDsCounter, 0 mSdLazyCounter, 735 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 555 SdHoareTripleChecker+Invalid, 784 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 735 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-29 05:46:15,268 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 555 Invalid, 784 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 735 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-29 05:46:15,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 911 states. [2023-11-29 05:46:15,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 911 to 714. [2023-11-29 05:46:15,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 714 states, 565 states have (on average 1.454867256637168) internal successors, (822), 577 states have internal predecessors, (822), 85 states have call successors, (85), 52 states have call predecessors, (85), 60 states have return successors, (120), 92 states have call predecessors, (120), 85 states have call successors, (120) [2023-11-29 05:46:15,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 714 states to 714 states and 1027 transitions. [2023-11-29 05:46:15,338 INFO L78 Accepts]: Start accepts. Automaton has 714 states and 1027 transitions. Word has length 49 [2023-11-29 05:46:15,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:46:15,338 INFO L495 AbstractCegarLoop]: Abstraction has 714 states and 1027 transitions. [2023-11-29 05:46:15,338 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 5 states have internal predecessors, (39), 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) [2023-11-29 05:46:15,338 INFO L276 IsEmpty]: Start isEmpty. Operand 714 states and 1027 transitions. [2023-11-29 05:46:15,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-11-29 05:46:15,341 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:46:15,341 INFO L195 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] [2023-11-29 05:46:15,341 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 05:46:15,341 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2023-11-29 05:46:15,342 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:46:15,342 INFO L85 PathProgramCache]: Analyzing trace with hash 1509168237, now seen corresponding path program 1 times [2023-11-29 05:46:15,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:46:15,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840206013] [2023-11-29 05:46:15,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:46:15,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:46:15,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:46:15,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:46:15,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:46:15,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 05:46:15,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:46:15,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-29 05:46:15,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:46:15,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-29 05:46:15,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:46:15,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 05:46:15,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:46:15,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:46:15,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:46:15,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840206013] [2023-11-29 05:46:15,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840206013] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:46:15,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:46:15,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 05:46:15,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203275228] [2023-11-29 05:46:15,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:46:15,436 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 05:46:15,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:46:15,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 05:46:15,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 05:46:15,437 INFO L87 Difference]: Start difference. First operand 714 states and 1027 transitions. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 4 states have internal predecessors, (39), 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) [2023-11-29 05:46:16,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:46:16,025 INFO L93 Difference]: Finished difference Result 1991 states and 2877 transitions. [2023-11-29 05:46:16,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 05:46:16,025 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 4 states have internal predecessors, (39), 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 49 [2023-11-29 05:46:16,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:46:16,034 INFO L225 Difference]: With dead ends: 1991 [2023-11-29 05:46:16,034 INFO L226 Difference]: Without dead ends: 1285 [2023-11-29 05:46:16,036 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2023-11-29 05:46:16,037 INFO L413 NwaCegarLoop]: 161 mSDtfsCounter, 385 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 569 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 408 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 632 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 569 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 05:46:16,038 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [408 Valid, 419 Invalid, 632 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 569 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 05:46:16,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1285 states. [2023-11-29 05:46:16,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1285 to 1092. [2023-11-29 05:46:16,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1092 states, 860 states have (on average 1.4313953488372093) internal successors, (1231), 881 states have internal predecessors, (1231), 134 states have call successors, (134), 82 states have call predecessors, (134), 94 states have return successors, (179), 136 states have call predecessors, (179), 134 states have call successors, (179) [2023-11-29 05:46:16,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1092 states to 1092 states and 1544 transitions. [2023-11-29 05:46:16,123 INFO L78 Accepts]: Start accepts. Automaton has 1092 states and 1544 transitions. Word has length 49 [2023-11-29 05:46:16,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:46:16,123 INFO L495 AbstractCegarLoop]: Abstraction has 1092 states and 1544 transitions. [2023-11-29 05:46:16,123 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 4 states have internal predecessors, (39), 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) [2023-11-29 05:46:16,123 INFO L276 IsEmpty]: Start isEmpty. Operand 1092 states and 1544 transitions. [2023-11-29 05:46:16,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-11-29 05:46:16,125 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:46:16,126 INFO L195 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] [2023-11-29 05:46:16,126 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-29 05:46:16,126 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2023-11-29 05:46:16,126 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:46:16,126 INFO L85 PathProgramCache]: Analyzing trace with hash -438581557, now seen corresponding path program 1 times [2023-11-29 05:46:16,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:46:16,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328850497] [2023-11-29 05:46:16,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:46:16,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:46:16,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:46:16,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:46:16,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:46:16,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 05:46:16,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:46:16,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-29 05:46:16,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:46:16,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-29 05:46:16,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:46:16,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 05:46:16,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:46:16,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:46:16,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:46:16,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328850497] [2023-11-29 05:46:16,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328850497] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:46:16,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:46:16,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 05:46:16,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526555143] [2023-11-29 05:46:16,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:46:16,231 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 05:46:16,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:46:16,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 05:46:16,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 05:46:16,233 INFO L87 Difference]: Start difference. First operand 1092 states and 1544 transitions. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 4 states have internal predecessors, (40), 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) [2023-11-29 05:46:16,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:46:16,614 INFO L93 Difference]: Finished difference Result 2328 states and 3339 transitions. [2023-11-29 05:46:16,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 05:46:16,614 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 4 states have internal predecessors, (40), 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 50 [2023-11-29 05:46:16,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:46:16,620 INFO L225 Difference]: With dead ends: 2328 [2023-11-29 05:46:16,621 INFO L226 Difference]: Without dead ends: 1244 [2023-11-29 05:46:16,623 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-11-29 05:46:16,624 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 112 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 337 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 05:46:16,625 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 341 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 337 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 05:46:16,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1244 states. [2023-11-29 05:46:16,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1244 to 1102. [2023-11-29 05:46:16,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1102 states, 870 states have (on average 1.4160919540229886) internal successors, (1232), 891 states have internal predecessors, (1232), 134 states have call successors, (134), 82 states have call predecessors, (134), 94 states have return successors, (179), 136 states have call predecessors, (179), 134 states have call successors, (179) [2023-11-29 05:46:16,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1102 states to 1102 states and 1545 transitions. [2023-11-29 05:46:16,706 INFO L78 Accepts]: Start accepts. Automaton has 1102 states and 1545 transitions. Word has length 50 [2023-11-29 05:46:16,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:46:16,707 INFO L495 AbstractCegarLoop]: Abstraction has 1102 states and 1545 transitions. [2023-11-29 05:46:16,707 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 4 states have internal predecessors, (40), 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) [2023-11-29 05:46:16,707 INFO L276 IsEmpty]: Start isEmpty. Operand 1102 states and 1545 transitions. [2023-11-29 05:46:16,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-11-29 05:46:16,708 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:46:16,708 INFO L195 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] [2023-11-29 05:46:16,709 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-29 05:46:16,709 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2023-11-29 05:46:16,709 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:46:16,709 INFO L85 PathProgramCache]: Analyzing trace with hash -415949303, now seen corresponding path program 1 times [2023-11-29 05:46:16,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:46:16,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103780551] [2023-11-29 05:46:16,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:46:16,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:46:16,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:46:16,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:46:16,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:46:16,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 05:46:16,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:46:16,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-29 05:46:16,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:46:16,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-29 05:46:16,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:46:16,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 05:46:16,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:46:16,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:46:16,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:46:16,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103780551] [2023-11-29 05:46:16,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103780551] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:46:16,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:46:16,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 05:46:16,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095664179] [2023-11-29 05:46:16,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:46:16,792 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 05:46:16,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:46:16,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 05:46:16,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 05:46:16,793 INFO L87 Difference]: Start difference. First operand 1102 states and 1545 transitions. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 4 states have internal predecessors, (40), 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) [2023-11-29 05:46:17,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:46:17,169 INFO L93 Difference]: Finished difference Result 2376 states and 3383 transitions. [2023-11-29 05:46:17,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 05:46:17,170 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 4 states have internal predecessors, (40), 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 50 [2023-11-29 05:46:17,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:46:17,179 INFO L225 Difference]: With dead ends: 2376 [2023-11-29 05:46:17,179 INFO L226 Difference]: Without dead ends: 1282 [2023-11-29 05:46:17,182 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2023-11-29 05:46:17,183 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 108 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 311 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 05:46:17,184 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 336 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 311 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 05:46:17,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1282 states. [2023-11-29 05:46:17,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1282 to 1130. [2023-11-29 05:46:17,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1130 states, 898 states have (on average 1.4031180400890868) internal successors, (1260), 919 states have internal predecessors, (1260), 134 states have call successors, (134), 82 states have call predecessors, (134), 94 states have return successors, (179), 136 states have call predecessors, (179), 134 states have call successors, (179) [2023-11-29 05:46:17,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1130 states to 1130 states and 1573 transitions. [2023-11-29 05:46:17,268 INFO L78 Accepts]: Start accepts. Automaton has 1130 states and 1573 transitions. Word has length 50 [2023-11-29 05:46:17,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:46:17,269 INFO L495 AbstractCegarLoop]: Abstraction has 1130 states and 1573 transitions. [2023-11-29 05:46:17,269 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 4 states have internal predecessors, (40), 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) [2023-11-29 05:46:17,269 INFO L276 IsEmpty]: Start isEmpty. Operand 1130 states and 1573 transitions. [2023-11-29 05:46:17,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-11-29 05:46:17,271 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:46:17,271 INFO L195 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] [2023-11-29 05:46:17,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-29 05:46:17,271 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2023-11-29 05:46:17,271 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:46:17,272 INFO L85 PathProgramCache]: Analyzing trace with hash -275400693, now seen corresponding path program 1 times [2023-11-29 05:46:17,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:46:17,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854345703] [2023-11-29 05:46:17,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:46:17,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:46:17,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:46:17,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:46:17,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:46:17,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 05:46:17,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:46:17,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-29 05:46:17,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:46:17,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-29 05:46:17,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:46:17,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 05:46:17,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:46:17,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:46:17,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:46:17,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854345703] [2023-11-29 05:46:17,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854345703] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:46:17,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:46:17,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 05:46:17,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881130849] [2023-11-29 05:46:17,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:46:17,402 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 05:46:17,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:46:17,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 05:46:17,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-11-29 05:46:17,403 INFO L87 Difference]: Start difference. First operand 1130 states and 1573 transitions. Second operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 6 states have internal predecessors, (40), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-29 05:46:17,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:46:17,999 INFO L93 Difference]: Finished difference Result 1642 states and 2285 transitions. [2023-11-29 05:46:18,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-29 05:46:18,000 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 6 states have internal predecessors, (40), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 50 [2023-11-29 05:46:18,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:46:18,005 INFO L225 Difference]: With dead ends: 1642 [2023-11-29 05:46:18,005 INFO L226 Difference]: Without dead ends: 974 [2023-11-29 05:46:18,007 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=246, Unknown=0, NotChecked=0, Total=342 [2023-11-29 05:46:18,008 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 343 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 533 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 353 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 533 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 05:46:18,009 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [353 Valid, 434 Invalid, 595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 533 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 05:46:18,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 974 states. [2023-11-29 05:46:18,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 974 to 812. [2023-11-29 05:46:18,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 812 states, 643 states have (on average 1.3903576982892691) internal successors, (894), 657 states have internal predecessors, (894), 100 states have call successors, (100), 59 states have call predecessors, (100), 65 states have return successors, (115), 99 states have call predecessors, (115), 100 states have call successors, (115) [2023-11-29 05:46:18,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 812 states to 812 states and 1109 transitions. [2023-11-29 05:46:18,051 INFO L78 Accepts]: Start accepts. Automaton has 812 states and 1109 transitions. Word has length 50 [2023-11-29 05:46:18,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:46:18,052 INFO L495 AbstractCegarLoop]: Abstraction has 812 states and 1109 transitions. [2023-11-29 05:46:18,052 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 6 states have internal predecessors, (40), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-29 05:46:18,052 INFO L276 IsEmpty]: Start isEmpty. Operand 812 states and 1109 transitions. [2023-11-29 05:46:18,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-11-29 05:46:18,053 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:46:18,054 INFO L195 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] [2023-11-29 05:46:18,054 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-29 05:46:18,054 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2023-11-29 05:46:18,054 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:46:18,055 INFO L85 PathProgramCache]: Analyzing trace with hash -1093049143, now seen corresponding path program 1 times [2023-11-29 05:46:18,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:46:18,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674320201] [2023-11-29 05:46:18,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:46:18,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:46:18,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:46:18,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:46:18,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:46:18,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 05:46:18,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:46:18,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-29 05:46:18,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:46:18,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-29 05:46:18,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:46:18,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 05:46:18,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:46:18,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:46:18,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:46:18,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674320201] [2023-11-29 05:46:18,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674320201] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:46:18,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:46:18,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 05:46:18,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325890678] [2023-11-29 05:46:18,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:46:18,181 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 05:46:18,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:46:18,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 05:46:18,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-11-29 05:46:18,182 INFO L87 Difference]: Start difference. First operand 812 states and 1109 transitions. Second operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 6 states have internal predecessors, (40), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-29 05:46:18,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:46:18,834 INFO L93 Difference]: Finished difference Result 1587 states and 2173 transitions. [2023-11-29 05:46:18,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-29 05:46:18,834 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 6 states have internal predecessors, (40), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 50 [2023-11-29 05:46:18,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:46:18,839 INFO L225 Difference]: With dead ends: 1587 [2023-11-29 05:46:18,840 INFO L226 Difference]: Without dead ends: 999 [2023-11-29 05:46:18,841 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2023-11-29 05:46:18,842 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 339 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 583 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 347 SdHoareTripleChecker+Valid, 429 SdHoareTripleChecker+Invalid, 646 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 05:46:18,842 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [347 Valid, 429 Invalid, 646 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 583 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 05:46:18,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 999 states. [2023-11-29 05:46:18,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 999 to 806. [2023-11-29 05:46:18,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 806 states, 639 states have (on average 1.3849765258215962) internal successors, (885), 651 states have internal predecessors, (885), 100 states have call successors, (100), 59 states have call predecessors, (100), 63 states have return successors, (107), 97 states have call predecessors, (107), 100 states have call successors, (107) [2023-11-29 05:46:18,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 806 states to 806 states and 1092 transitions. [2023-11-29 05:46:18,882 INFO L78 Accepts]: Start accepts. Automaton has 806 states and 1092 transitions. Word has length 50 [2023-11-29 05:46:18,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:46:18,883 INFO L495 AbstractCegarLoop]: Abstraction has 806 states and 1092 transitions. [2023-11-29 05:46:18,883 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 6 states have internal predecessors, (40), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-29 05:46:18,883 INFO L276 IsEmpty]: Start isEmpty. Operand 806 states and 1092 transitions. [2023-11-29 05:46:18,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-11-29 05:46:18,883 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:46:18,883 INFO L195 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] [2023-11-29 05:46:18,883 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-29 05:46:18,884 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2023-11-29 05:46:18,884 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:46:18,884 INFO L85 PathProgramCache]: Analyzing trace with hash 1512974411, now seen corresponding path program 1 times [2023-11-29 05:46:18,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:46:18,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152236637] [2023-11-29 05:46:18,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:46:18,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:46:18,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:46:18,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:46:18,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:46:18,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 05:46:18,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:46:18,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-29 05:46:18,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:46:18,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-29 05:46:18,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:46:19,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 05:46:19,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:46:19,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:46:19,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:46:19,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152236637] [2023-11-29 05:46:19,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152236637] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:46:19,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:46:19,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 05:46:19,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571200666] [2023-11-29 05:46:19,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:46:19,019 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 05:46:19,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:46:19,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 05:46:19,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-11-29 05:46:19,020 INFO L87 Difference]: Start difference. First operand 806 states and 1092 transitions. Second operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 6 states have internal predecessors, (40), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-29 05:46:19,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:46:19,645 INFO L93 Difference]: Finished difference Result 1523 states and 2059 transitions. [2023-11-29 05:46:19,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-29 05:46:19,645 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 6 states have internal predecessors, (40), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 50 [2023-11-29 05:46:19,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:46:19,651 INFO L225 Difference]: With dead ends: 1523 [2023-11-29 05:46:19,651 INFO L226 Difference]: Without dead ends: 860 [2023-11-29 05:46:19,653 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=246, Unknown=0, NotChecked=0, Total=342 [2023-11-29 05:46:19,654 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 312 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 605 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 320 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 652 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 605 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 05:46:19,654 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [320 Valid, 469 Invalid, 652 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 605 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 05:46:19,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 860 states. [2023-11-29 05:46:19,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 860 to 698. [2023-11-29 05:46:19,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 698 states, 556 states have (on average 1.381294964028777) internal successors, (768), 566 states have internal predecessors, (768), 85 states have call successors, (85), 51 states have call predecessors, (85), 53 states have return successors, (87), 81 states have call predecessors, (87), 85 states have call successors, (87) [2023-11-29 05:46:19,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 698 states and 940 transitions. [2023-11-29 05:46:19,702 INFO L78 Accepts]: Start accepts. Automaton has 698 states and 940 transitions. Word has length 50 [2023-11-29 05:46:19,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:46:19,702 INFO L495 AbstractCegarLoop]: Abstraction has 698 states and 940 transitions. [2023-11-29 05:46:19,702 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 6 states have internal predecessors, (40), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-29 05:46:19,703 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 940 transitions. [2023-11-29 05:46:19,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-11-29 05:46:19,703 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:46:19,703 INFO L195 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] [2023-11-29 05:46:19,703 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-29 05:46:19,704 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2023-11-29 05:46:19,704 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:46:19,704 INFO L85 PathProgramCache]: Analyzing trace with hash -481170295, now seen corresponding path program 1 times [2023-11-29 05:46:19,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:46:19,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795131084] [2023-11-29 05:46:19,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:46:19,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:46:19,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:46:19,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:46:19,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:46:19,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 05:46:19,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:46:19,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-29 05:46:19,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:46:19,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-29 05:46:19,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:46:19,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 05:46:19,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:46:19,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:46:19,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:46:19,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795131084] [2023-11-29 05:46:19,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795131084] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:46:19,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:46:19,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 05:46:19,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189429750] [2023-11-29 05:46:19,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:46:19,798 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 05:46:19,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:46:19,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 05:46:19,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-29 05:46:19,798 INFO L87 Difference]: Start difference. First operand 698 states and 940 transitions. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-29 05:46:20,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:46:20,256 INFO L93 Difference]: Finished difference Result 2190 states and 3002 transitions. [2023-11-29 05:46:20,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 05:46:20,257 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 50 [2023-11-29 05:46:20,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:46:20,266 INFO L225 Difference]: With dead ends: 2190 [2023-11-29 05:46:20,266 INFO L226 Difference]: Without dead ends: 1501 [2023-11-29 05:46:20,269 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2023-11-29 05:46:20,269 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 312 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 318 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 05:46:20,270 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [318 Valid, 355 Invalid, 380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 05:46:20,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1501 states. [2023-11-29 05:46:20,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1501 to 1327. [2023-11-29 05:46:20,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1327 states, 1057 states have (on average 1.3642384105960266) internal successors, (1442), 1074 states have internal predecessors, (1442), 158 states have call successors, (158), 97 states have call predecessors, (158), 108 states have return successors, (201), 157 states have call predecessors, (201), 158 states have call successors, (201) [2023-11-29 05:46:20,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1327 states to 1327 states and 1801 transitions. [2023-11-29 05:46:20,366 INFO L78 Accepts]: Start accepts. Automaton has 1327 states and 1801 transitions. Word has length 50 [2023-11-29 05:46:20,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:46:20,366 INFO L495 AbstractCegarLoop]: Abstraction has 1327 states and 1801 transitions. [2023-11-29 05:46:20,366 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-11-29 05:46:20,367 INFO L276 IsEmpty]: Start isEmpty. Operand 1327 states and 1801 transitions. [2023-11-29 05:46:20,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-11-29 05:46:20,367 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:46:20,368 INFO L195 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] [2023-11-29 05:46:20,368 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-29 05:46:20,368 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2023-11-29 05:46:20,368 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:46:20,369 INFO L85 PathProgramCache]: Analyzing trace with hash -707740520, now seen corresponding path program 1 times [2023-11-29 05:46:20,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:46:20,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000255051] [2023-11-29 05:46:20,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:46:20,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:46:20,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:46:20,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:46:20,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:46:20,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 05:46:20,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:46:20,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-29 05:46:20,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:46:20,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-29 05:46:20,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:46:20,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 05:46:20,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:46:20,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:46:20,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:46:20,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000255051] [2023-11-29 05:46:20,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000255051] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:46:20,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:46:20,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 05:46:20,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455440994] [2023-11-29 05:46:20,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:46:20,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 05:46:20,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:46:20,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 05:46:20,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 05:46:20,436 INFO L87 Difference]: Start difference. First operand 1327 states and 1801 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 3 states have internal predecessors, (41), 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) [2023-11-29 05:46:20,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:46:20,719 INFO L93 Difference]: Finished difference Result 2560 states and 3454 transitions. [2023-11-29 05:46:20,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 05:46:20,719 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 3 states have internal predecessors, (41), 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 51 [2023-11-29 05:46:20,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:46:20,725 INFO L225 Difference]: With dead ends: 2560 [2023-11-29 05:46:20,725 INFO L226 Difference]: Without dead ends: 1242 [2023-11-29 05:46:20,728 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-29 05:46:20,729 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 252 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 05:46:20,729 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [268 Valid, 186 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 05:46:20,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1242 states. [2023-11-29 05:46:20,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1242 to 1073. [2023-11-29 05:46:20,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1073 states, 859 states have (on average 1.3550640279394646) internal successors, (1164), 874 states have internal predecessors, (1164), 122 states have call successors, (122), 78 states have call predecessors, (122), 88 states have return successors, (152), 121 states have call predecessors, (152), 122 states have call successors, (152) [2023-11-29 05:46:20,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1073 states to 1073 states and 1438 transitions. [2023-11-29 05:46:20,780 INFO L78 Accepts]: Start accepts. Automaton has 1073 states and 1438 transitions. Word has length 51 [2023-11-29 05:46:20,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:46:20,780 INFO L495 AbstractCegarLoop]: Abstraction has 1073 states and 1438 transitions. [2023-11-29 05:46:20,781 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 3 states have internal predecessors, (41), 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) [2023-11-29 05:46:20,781 INFO L276 IsEmpty]: Start isEmpty. Operand 1073 states and 1438 transitions. [2023-11-29 05:46:20,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-11-29 05:46:20,781 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:46:20,781 INFO L195 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] [2023-11-29 05:46:20,781 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-29 05:46:20,781 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2023-11-29 05:46:20,782 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:46:20,782 INFO L85 PathProgramCache]: Analyzing trace with hash -1241023779, now seen corresponding path program 1 times [2023-11-29 05:46:20,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:46:20,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73057310] [2023-11-29 05:46:20,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:46:20,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:46:20,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:46:20,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:46:20,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:46:20,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 05:46:20,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:46:20,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-29 05:46:20,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:46:20,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-29 05:46:20,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:46:20,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 05:46:20,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:46:20,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:46:20,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:46:20,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73057310] [2023-11-29 05:46:20,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73057310] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:46:20,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:46:20,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 05:46:20,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322047396] [2023-11-29 05:46:20,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:46:20,832 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 05:46:20,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:46:20,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 05:46:20,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 05:46:20,833 INFO L87 Difference]: Start difference. First operand 1073 states and 1438 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2023-11-29 05:46:21,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:46:21,249 INFO L93 Difference]: Finished difference Result 3097 states and 4169 transitions. [2023-11-29 05:46:21,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 05:46:21,249 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 52 [2023-11-29 05:46:21,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:46:21,258 INFO L225 Difference]: With dead ends: 3097 [2023-11-29 05:46:21,258 INFO L226 Difference]: Without dead ends: 2032 [2023-11-29 05:46:21,261 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-11-29 05:46:21,262 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 298 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 05:46:21,262 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [307 Valid, 304 Invalid, 312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 266 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 05:46:21,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2032 states. [2023-11-29 05:46:21,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2032 to 1763. [2023-11-29 05:46:21,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1763 states, 1411 states have (on average 1.3316796598157334) internal successors, (1879), 1435 states have internal predecessors, (1879), 200 states have call successors, (200), 132 states have call predecessors, (200), 148 states have return successors, (249), 196 states have call predecessors, (249), 200 states have call successors, (249) [2023-11-29 05:46:21,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1763 states to 1763 states and 2328 transitions. [2023-11-29 05:46:21,347 INFO L78 Accepts]: Start accepts. Automaton has 1763 states and 2328 transitions. Word has length 52 [2023-11-29 05:46:21,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:46:21,348 INFO L495 AbstractCegarLoop]: Abstraction has 1763 states and 2328 transitions. [2023-11-29 05:46:21,348 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2023-11-29 05:46:21,348 INFO L276 IsEmpty]: Start isEmpty. Operand 1763 states and 2328 transitions. [2023-11-29 05:46:21,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2023-11-29 05:46:21,348 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:46:21,349 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:46:21,349 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-29 05:46:21,349 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2023-11-29 05:46:21,349 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:46:21,349 INFO L85 PathProgramCache]: Analyzing trace with hash -1603475235, now seen corresponding path program 1 times [2023-11-29 05:46:21,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:46:21,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930620844] [2023-11-29 05:46:21,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:46:21,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:46:21,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:46:21,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:46:21,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:46:21,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 05:46:21,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:46:21,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-29 05:46:21,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:46:21,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-29 05:46:21,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:46:21,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 05:46:21,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:46:21,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-29 05:46:21,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:46:21,418 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-29 05:46:21,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:46:21,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930620844] [2023-11-29 05:46:21,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930620844] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:46:21,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:46:21,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 05:46:21,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522502024] [2023-11-29 05:46:21,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:46:21,419 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 05:46:21,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:46:21,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 05:46:21,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 05:46:21,419 INFO L87 Difference]: Start difference. First operand 1763 states and 2328 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 4 states have internal predecessors, (54), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2023-11-29 05:46:22,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:46:22,267 INFO L93 Difference]: Finished difference Result 5622 states and 7481 transitions. [2023-11-29 05:46:22,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-29 05:46:22,268 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 4 states have internal predecessors, (54), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 69 [2023-11-29 05:46:22,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:46:22,290 INFO L225 Difference]: With dead ends: 5622 [2023-11-29 05:46:22,290 INFO L226 Difference]: Without dead ends: 3868 [2023-11-29 05:46:22,296 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2023-11-29 05:46:22,297 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 621 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 486 mSolverCounterSat, 141 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 635 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 627 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 141 IncrementalHoareTripleChecker+Valid, 486 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-29 05:46:22,297 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [635 Valid, 418 Invalid, 627 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [141 Valid, 486 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-29 05:46:22,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3868 states. [2023-11-29 05:46:22,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3868 to 3456. [2023-11-29 05:46:22,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3456 states, 2754 states have (on average 1.3108206245461147) internal successors, (3610), 2815 states have internal predecessors, (3610), 384 states have call successors, (384), 258 states have call predecessors, (384), 314 states have return successors, (586), 384 states have call predecessors, (586), 384 states have call successors, (586) [2023-11-29 05:46:22,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3456 states to 3456 states and 4580 transitions. [2023-11-29 05:46:22,552 INFO L78 Accepts]: Start accepts. Automaton has 3456 states and 4580 transitions. Word has length 69 [2023-11-29 05:46:22,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:46:22,553 INFO L495 AbstractCegarLoop]: Abstraction has 3456 states and 4580 transitions. [2023-11-29 05:46:22,553 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 4 states have internal predecessors, (54), 3 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2023-11-29 05:46:22,553 INFO L276 IsEmpty]: Start isEmpty. Operand 3456 states and 4580 transitions. [2023-11-29 05:46:22,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2023-11-29 05:46:22,555 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:46:22,555 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:46:22,555 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-29 05:46:22,555 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2023-11-29 05:46:22,556 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:46:22,556 INFO L85 PathProgramCache]: Analyzing trace with hash 1856219999, now seen corresponding path program 1 times [2023-11-29 05:46:22,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:46:22,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516838894] [2023-11-29 05:46:22,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:46:22,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:46:22,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:46:22,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:46:22,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:46:22,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 05:46:22,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:46:22,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-29 05:46:22,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:46:22,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-29 05:46:22,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:46:22,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 05:46:22,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:46:22,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-29 05:46:22,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:46:22,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 05:46:22,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:46:22,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-29 05:46:22,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:46:22,756 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-11-29 05:46:22,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:46:22,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516838894] [2023-11-29 05:46:22,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516838894] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:46:22,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:46:22,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 05:46:22,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501193956] [2023-11-29 05:46:22,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:46:22,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 05:46:22,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:46:22,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 05:46:22,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-29 05:46:22,758 INFO L87 Difference]: Start difference. First operand 3456 states and 4580 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 5 states have internal predecessors, (51), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2023-11-29 05:46:23,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:46:23,323 INFO L93 Difference]: Finished difference Result 6687 states and 8820 transitions. [2023-11-29 05:46:23,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 05:46:23,324 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 5 states have internal predecessors, (51), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 81 [2023-11-29 05:46:23,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:46:23,339 INFO L225 Difference]: With dead ends: 6687 [2023-11-29 05:46:23,339 INFO L226 Difference]: Without dead ends: 3934 [2023-11-29 05:46:23,344 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2023-11-29 05:46:23,345 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 296 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 303 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 05:46:23,346 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [303 Valid, 391 Invalid, 411 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 348 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 05:46:23,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3934 states. [2023-11-29 05:46:23,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3934 to 3432. [2023-11-29 05:46:23,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3432 states, 2726 states have (on average 1.2993396918561995) internal successors, (3542), 2791 states have internal predecessors, (3542), 384 states have call successors, (384), 258 states have call predecessors, (384), 318 states have return successors, (531), 384 states have call predecessors, (531), 384 states have call successors, (531) [2023-11-29 05:46:23,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3432 states to 3432 states and 4457 transitions. [2023-11-29 05:46:23,574 INFO L78 Accepts]: Start accepts. Automaton has 3432 states and 4457 transitions. Word has length 81 [2023-11-29 05:46:23,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:46:23,575 INFO L495 AbstractCegarLoop]: Abstraction has 3432 states and 4457 transitions. [2023-11-29 05:46:23,575 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 5 states have internal predecessors, (51), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2023-11-29 05:46:23,575 INFO L276 IsEmpty]: Start isEmpty. Operand 3432 states and 4457 transitions. [2023-11-29 05:46:23,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2023-11-29 05:46:23,577 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:46:23,577 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:46:23,577 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-29 05:46:23,578 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2023-11-29 05:46:23,578 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:46:23,578 INFO L85 PathProgramCache]: Analyzing trace with hash -704642847, now seen corresponding path program 1 times [2023-11-29 05:46:23,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:46:23,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970889688] [2023-11-29 05:46:23,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:46:23,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:46:23,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:46:23,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:46:23,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:46:23,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 05:46:23,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:46:23,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-29 05:46:23,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:46:23,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-29 05:46:23,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:46:23,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 05:46:23,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:46:23,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-29 05:46:23,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:46:23,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 05:46:23,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:46:23,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-11-29 05:46:23,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:46:23,652 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2023-11-29 05:46:23,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:46:23,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970889688] [2023-11-29 05:46:23,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970889688] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:46:23,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:46:23,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 05:46:23,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923314674] [2023-11-29 05:46:23,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:46:23,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 05:46:23,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:46:23,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 05:46:23,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 05:46:23,655 INFO L87 Difference]: Start difference. First operand 3432 states and 4457 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 3 states have internal predecessors, (46), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2023-11-29 05:46:23,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:46:23,974 INFO L93 Difference]: Finished difference Result 3808 states and 4956 transitions. [2023-11-29 05:46:23,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 05:46:23,975 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 3 states have internal predecessors, (46), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 81 [2023-11-29 05:46:23,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:46:23,991 INFO L225 Difference]: With dead ends: 3808 [2023-11-29 05:46:23,992 INFO L226 Difference]: Without dead ends: 3139 [2023-11-29 05:46:23,994 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-29 05:46:23,995 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 250 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 05:46:23,995 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [268 Valid, 181 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 05:46:23,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3139 states. [2023-11-29 05:46:24,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3139 to 2765. [2023-11-29 05:46:24,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2765 states, 2200 states have (on average 1.305909090909091) internal successors, (2873), 2255 states have internal predecessors, (2873), 303 states have call successors, (303), 204 states have call predecessors, (303), 258 states have return successors, (431), 306 states have call predecessors, (431), 303 states have call successors, (431) [2023-11-29 05:46:24,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2765 states to 2765 states and 3607 transitions. [2023-11-29 05:46:24,192 INFO L78 Accepts]: Start accepts. Automaton has 2765 states and 3607 transitions. Word has length 81 [2023-11-29 05:46:24,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:46:24,192 INFO L495 AbstractCegarLoop]: Abstraction has 2765 states and 3607 transitions. [2023-11-29 05:46:24,192 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 3 states have internal predecessors, (46), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2023-11-29 05:46:24,193 INFO L276 IsEmpty]: Start isEmpty. Operand 2765 states and 3607 transitions. [2023-11-29 05:46:24,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2023-11-29 05:46:24,194 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:46:24,194 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:46:24,194 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-29 05:46:24,195 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2023-11-29 05:46:24,195 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:46:24,195 INFO L85 PathProgramCache]: Analyzing trace with hash -282403481, now seen corresponding path program 1 times [2023-11-29 05:46:24,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:46:24,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976066350] [2023-11-29 05:46:24,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:46:24,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:46:24,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:46:24,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:46:24,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:46:24,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 05:46:24,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:46:24,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-29 05:46:24,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:46:24,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-29 05:46:24,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:46:24,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 05:46:24,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:46:24,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-11-29 05:46:24,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:46:24,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 05:46:24,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:46:24,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 05:46:24,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:46:24,296 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-11-29 05:46:24,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:46:24,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976066350] [2023-11-29 05:46:24,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976066350] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:46:24,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:46:24,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 05:46:24,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377945964] [2023-11-29 05:46:24,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:46:24,297 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 05:46:24,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:46:24,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 05:46:24,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 05:46:24,298 INFO L87 Difference]: Start difference. First operand 2765 states and 3607 transitions. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 5 states have internal predecessors, (55), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2023-11-29 05:46:25,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:46:25,215 INFO L93 Difference]: Finished difference Result 4861 states and 6408 transitions. [2023-11-29 05:46:25,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-11-29 05:46:25,216 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 5 states have internal predecessors, (55), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) Word has length 83 [2023-11-29 05:46:25,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:46:25,232 INFO L225 Difference]: With dead ends: 4861 [2023-11-29 05:46:25,232 INFO L226 Difference]: Without dead ends: 3075 [2023-11-29 05:46:25,237 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=101, Invalid=319, Unknown=0, NotChecked=0, Total=420 [2023-11-29 05:46:25,238 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 954 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 626 mSolverCounterSat, 253 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 968 SdHoareTripleChecker+Valid, 478 SdHoareTripleChecker+Invalid, 879 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 253 IncrementalHoareTripleChecker+Valid, 626 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-29 05:46:25,238 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [968 Valid, 478 Invalid, 879 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [253 Valid, 626 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-29 05:46:25,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3075 states. [2023-11-29 05:46:25,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3075 to 2765. [2023-11-29 05:46:25,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2765 states, 2200 states have (on average 1.295909090909091) internal successors, (2851), 2255 states have internal predecessors, (2851), 303 states have call successors, (303), 204 states have call predecessors, (303), 258 states have return successors, (398), 306 states have call predecessors, (398), 303 states have call successors, (398) [2023-11-29 05:46:25,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2765 states to 2765 states and 3552 transitions. [2023-11-29 05:46:25,456 INFO L78 Accepts]: Start accepts. Automaton has 2765 states and 3552 transitions. Word has length 83 [2023-11-29 05:46:25,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:46:25,457 INFO L495 AbstractCegarLoop]: Abstraction has 2765 states and 3552 transitions. [2023-11-29 05:46:25,457 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 5 states have internal predecessors, (55), 4 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2023-11-29 05:46:25,457 INFO L276 IsEmpty]: Start isEmpty. Operand 2765 states and 3552 transitions. [2023-11-29 05:46:25,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2023-11-29 05:46:25,459 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:46:25,459 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:46:25,459 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-29 05:46:25,459 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2023-11-29 05:46:25,460 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:46:25,460 INFO L85 PathProgramCache]: Analyzing trace with hash 1004720051, now seen corresponding path program 1 times [2023-11-29 05:46:25,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:46:25,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650615538] [2023-11-29 05:46:25,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:46:25,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:46:25,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:46:25,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:46:25,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:46:25,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 05:46:25,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:46:25,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-29 05:46:25,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:46:25,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-29 05:46:25,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:46:25,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-29 05:46:25,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:46:25,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-29 05:46:25,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:46:25,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 05:46:25,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:46:25,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 05:46:25,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:46:25,536 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-11-29 05:46:25,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:46:25,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650615538] [2023-11-29 05:46:25,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650615538] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:46:25,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:46:25,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 05:46:25,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783764387] [2023-11-29 05:46:25,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:46:25,538 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 05:46:25,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:46:25,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 05:46:25,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 05:46:25,539 INFO L87 Difference]: Start difference. First operand 2765 states and 3552 transitions. Second operand has 5 states, 4 states have (on average 14.5) internal successors, (58), 3 states have internal predecessors, (58), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2023-11-29 05:46:25,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:46:25,942 INFO L93 Difference]: Finished difference Result 3139 states and 4051 transitions. [2023-11-29 05:46:25,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 05:46:25,943 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 3 states have internal predecessors, (58), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) Word has length 89 [2023-11-29 05:46:25,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:46:25,957 INFO L225 Difference]: With dead ends: 3139 [2023-11-29 05:46:25,957 INFO L226 Difference]: Without dead ends: 3138 [2023-11-29 05:46:25,958 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-29 05:46:25,959 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 242 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 05:46:25,959 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 169 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 05:46:25,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3138 states. [2023-11-29 05:46:26,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3138 to 2764. [2023-11-29 05:46:26,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2764 states, 2200 states have (on average 1.2918181818181818) internal successors, (2842), 2254 states have internal predecessors, (2842), 303 states have call successors, (303), 204 states have call predecessors, (303), 258 states have return successors, (398), 306 states have call predecessors, (398), 303 states have call successors, (398) [2023-11-29 05:46:26,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2764 states to 2764 states and 3543 transitions. [2023-11-29 05:46:26,211 INFO L78 Accepts]: Start accepts. Automaton has 2764 states and 3543 transitions. Word has length 89 [2023-11-29 05:46:26,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:46:26,212 INFO L495 AbstractCegarLoop]: Abstraction has 2764 states and 3543 transitions. [2023-11-29 05:46:26,212 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 3 states have internal predecessors, (58), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2023-11-29 05:46:26,212 INFO L276 IsEmpty]: Start isEmpty. Operand 2764 states and 3543 transitions. [2023-11-29 05:46:26,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2023-11-29 05:46:26,214 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:46:26,214 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:46:26,214 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-29 05:46:26,214 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2023-11-29 05:46:26,215 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:46:26,215 INFO L85 PathProgramCache]: Analyzing trace with hash 1081550795, now seen corresponding path program 1 times [2023-11-29 05:46:26,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:46:26,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694619746] [2023-11-29 05:46:26,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:46:26,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:46:26,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:46:26,226 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 05:46:26,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:46:26,267 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 05:46:26,267 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-29 05:46:26,268 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2023-11-29 05:46:26,270 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2023-11-29 05:46:26,270 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2023-11-29 05:46:26,270 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2023-11-29 05:46:26,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-29 05:46:26,274 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:46:26,278 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 05:46:26,320 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret5 could not be translated [2023-11-29 05:46:26,323 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret5 could not be translated [2023-11-29 05:46:26,344 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 05:46:26 BoogieIcfgContainer [2023-11-29 05:46:26,345 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 05:46:26,345 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 05:46:26,345 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 05:46:26,345 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 05:46:26,346 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 05:46:11" (3/4) ... [2023-11-29 05:46:26,347 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-11-29 05:46:26,360 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret5 could not be translated [2023-11-29 05:46:26,361 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret5 could not be translated [2023-11-29 05:46:26,419 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1242b816-cefa-4c74-b58b-92964cd591ca/bin/uautomizer-verify-BQ2R08f2Ya/witness.graphml [2023-11-29 05:46:26,419 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 05:46:26,420 INFO L158 Benchmark]: Toolchain (without parser) took 16107.00ms. Allocated memory was 165.7MB in the beginning and 375.4MB in the end (delta: 209.7MB). Free memory was 133.4MB in the beginning and 167.0MB in the end (delta: -33.6MB). Peak memory consumption was 176.6MB. Max. memory is 16.1GB. [2023-11-29 05:46:26,420 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 127.9MB. Free memory is still 101.3MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 05:46:26,421 INFO L158 Benchmark]: CACSL2BoogieTranslator took 262.13ms. Allocated memory is still 165.7MB. Free memory was 133.4MB in the beginning and 120.3MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-29 05:46:26,421 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.70ms. Allocated memory is still 165.7MB. Free memory was 120.3MB in the beginning and 118.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 05:46:26,422 INFO L158 Benchmark]: Boogie Preprocessor took 44.49ms. Allocated memory is still 165.7MB. Free memory was 118.2MB in the beginning and 116.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 05:46:26,422 INFO L158 Benchmark]: RCFGBuilder took 456.68ms. Allocated memory is still 165.7MB. Free memory was 116.1MB in the beginning and 96.2MB in the end (delta: 20.0MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2023-11-29 05:46:26,422 INFO L158 Benchmark]: TraceAbstraction took 15219.26ms. Allocated memory was 165.7MB in the beginning and 375.4MB in the end (delta: 209.7MB). Free memory was 95.2MB in the beginning and 174.3MB in the end (delta: -79.2MB). Peak memory consumption was 132.6MB. Max. memory is 16.1GB. [2023-11-29 05:46:26,423 INFO L158 Benchmark]: Witness Printer took 74.35ms. Allocated memory is still 375.4MB. Free memory was 174.3MB in the beginning and 167.0MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-11-29 05:46:26,424 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 127.9MB. Free memory is still 101.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 262.13ms. Allocated memory is still 165.7MB. Free memory was 133.4MB in the beginning and 120.3MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.70ms. Allocated memory is still 165.7MB. Free memory was 120.3MB in the beginning and 118.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 44.49ms. Allocated memory is still 165.7MB. Free memory was 118.2MB in the beginning and 116.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 456.68ms. Allocated memory is still 165.7MB. Free memory was 116.1MB in the beginning and 96.2MB in the end (delta: 20.0MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 15219.26ms. Allocated memory was 165.7MB in the beginning and 375.4MB in the end (delta: 209.7MB). Free memory was 95.2MB in the beginning and 174.3MB in the end (delta: -79.2MB). Peak memory consumption was 132.6MB. Max. memory is 16.1GB. * Witness Printer took 74.35ms. Allocated memory is still 375.4MB. Free memory was 174.3MB in the beginning and 167.0MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret5 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret5 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 107]: integer overflow possible integer overflow possible We found a FailurePath: [L24] int m_pc = 0; [L25] int t1_pc = 0; [L26] int m_st ; [L27] int t1_st ; [L28] int m_i ; [L29] int t1_i ; [L30] int M_E = 2; [L31] int T1_E = 2; [L32] int E_M = 2; [L33] int E_1 = 2; [L37] int token ; [L39] int local ; [L473] int __retres1 ; [L477] CALL init_model() [L388] m_i = 1 [L389] t1_i = 1 [L477] RET init_model() [L478] CALL start_simulation() [L414] int kernel_st ; [L415] int tmp ; [L416] int tmp___0 ; [L420] kernel_st = 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, kernel_st=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L421] FCALL update_channels() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, kernel_st=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L422] CALL init_threads() [L170] COND TRUE m_i == 1 [L171] m_st = 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L175] COND TRUE t1_i == 1 [L176] t1_st = 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L422] RET init_threads() [L423] CALL fire_delta_events() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L259] COND FALSE !(M_E == 0) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L264] COND FALSE !(T1_E == 0) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L269] COND FALSE !(E_M == 0) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L274] COND FALSE !(E_1 == 0) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L423] RET fire_delta_events() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, kernel_st=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L424] CALL activate_threads() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L312] int tmp ; [L313] int tmp___0 ; [L317] CALL, EXPR is_master_triggered() [L121] int __retres1 ; VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L124] COND FALSE !(m_pc == 1) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L134] __retres1 = 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, __retres1=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L136] return (__retres1); [L317] RET, EXPR is_master_triggered() [L317] tmp = is_master_triggered() [L319] COND FALSE !(\read(tmp)) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, tmp=0, token=0] [L325] CALL, EXPR is_transmit1_triggered() [L140] int __retres1 ; VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L143] COND FALSE !(t1_pc == 1) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L153] __retres1 = 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, __retres1=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L155] return (__retres1); [L325] RET, EXPR is_transmit1_triggered() [L325] tmp___0 = is_transmit1_triggered() [L327] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, tmp=0, tmp___0=0, token=0] [L424] RET activate_threads() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, kernel_st=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L425] CALL reset_delta_events() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L287] COND FALSE !(M_E == 1) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L292] COND FALSE !(T1_E == 1) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L297] COND FALSE !(E_M == 1) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L302] COND FALSE !(E_1 == 1) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L425] RET reset_delta_events() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, kernel_st=0, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L428] COND TRUE 1 [L431] kernel_st = 1 [L432] CALL eval() [L206] int tmp ; VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L210] COND TRUE 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L213] CALL, EXPR exists_runnable_thread() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L185] int __retres1 ; VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L188] COND TRUE m_st == 0 [L189] __retres1 = 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, __retres1=1, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L201] return (__retres1); [L213] RET, EXPR exists_runnable_thread() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L213] tmp = exists_runnable_thread() [L215] COND TRUE \read(tmp) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, tmp=1, token=0] [L220] COND TRUE m_st == 0 [L221] int tmp_ndt_1; [L222] EXPR tmp_ndt_1 = __VERIFIER_nondet_int() [L223] COND FALSE, EXPR !(\read(tmp_ndt_1)) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, tmp=1, tmp_ndt_1=0, token=0] [L220-L231] { int tmp_ndt_1; tmp_ndt_1 = __VERIFIER_nondet_int(); if (tmp_ndt_1) { { m_st = 1; master(); } } else { } } VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, tmp=1, token=0] [L234] COND TRUE t1_st == 0 [L235] int tmp_ndt_2; [L236] EXPR tmp_ndt_2 = __VERIFIER_nondet_int() [L237] COND TRUE, EXPR \read(tmp_ndt_2) [L239] EXPR t1_st = 1 [L240] CALL, EXPR transmit1() [L88] COND TRUE t1_pc == 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=1, token=0] [L99] COND TRUE 1 [L101] t1_pc = 1 [L102] t1_st = 2 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L240] RET, EXPR transmit1() [L234-L245] { int tmp_ndt_2; tmp_ndt_2 = __VERIFIER_nondet_int(); if (tmp_ndt_2) { { t1_st = 1; transmit1(); } } else { } } VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, tmp=1, token=0] [L210] COND TRUE 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, tmp=1, token=0] [L213] CALL, EXPR exists_runnable_thread() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L185] int __retres1 ; VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L188] COND TRUE m_st == 0 [L189] __retres1 = 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, __retres1=1, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L201] return (__retres1); [L213] RET, EXPR exists_runnable_thread() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, tmp=1, token=0] [L213] tmp = exists_runnable_thread() [L215] COND TRUE \read(tmp) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, tmp=1, token=0] [L220] COND TRUE m_st == 0 [L221] int tmp_ndt_1; [L222] EXPR tmp_ndt_1 = __VERIFIER_nondet_int() [L223] COND TRUE, EXPR \read(tmp_ndt_1) [L225] EXPR m_st = 1 [L226] CALL, EXPR master() [L44] COND TRUE m_pc == 0 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=0] [L55] COND TRUE 1 [L58] token = __VERIFIER_nondet_int() [L59] local = token [L60] E_1 = 1 VAL [E_1=1, E_M=2, M_E=2, T1_E=2, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=2147483647] [L61] CALL immediate_notify() VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=2147483647] [L341] CALL activate_threads() VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=2147483647] [L312] int tmp ; [L313] int tmp___0 ; [L317] CALL, EXPR is_master_triggered() [L121] int __retres1 ; VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=2147483647] [L124] COND FALSE !(m_pc == 1) VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=2147483647] [L134] __retres1 = 0 VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, __retres1=0, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=2147483647] [L136] return (__retres1); [L317] RET, EXPR is_master_triggered() [L317] tmp = is_master_triggered() [L319] COND FALSE !(\read(tmp)) VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, tmp=0, token=2147483647] [L325] CALL, EXPR is_transmit1_triggered() [L140] int __retres1 ; VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=2147483647] [L143] COND TRUE t1_pc == 1 VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=2147483647] [L144] COND TRUE E_1 == 1 [L145] __retres1 = 1 VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, __retres1=1, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=2147483647] [L155] return (__retres1); [L325] RET, EXPR is_transmit1_triggered() [L325] tmp___0 = is_transmit1_triggered() [L327] COND TRUE \read(tmp___0) [L328] t1_st = 0 VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, tmp=0, tmp___0=1, token=2147483647] [L341] RET activate_threads() VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, token=2147483647] [L61] RET immediate_notify() VAL [E_1=1, E_M=2, M_E=2, T1_E=2, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=0, token=2147483647] [L62] E_1 = 2 [L63] m_pc = 1 [L64] m_st = 2 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=2147483647, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=0, token=2147483647] [L226] RET, EXPR master() [L220-L231] { int tmp_ndt_1; tmp_ndt_1 = __VERIFIER_nondet_int(); if (tmp_ndt_1) { { m_st = 1; master(); } } else { } } VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=2147483647, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=0, tmp=1, token=2147483647] [L234] COND TRUE t1_st == 0 [L235] int tmp_ndt_2; [L236] tmp_ndt_2 = __VERIFIER_nondet_int() [L237] COND TRUE \read(tmp_ndt_2) [L239] t1_st = 1 [L240] CALL transmit1() [L88] COND FALSE !(t1_pc == 0) VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=2147483647, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, token=2147483647] [L91] COND TRUE t1_pc == 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=2147483647, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, token=2147483647] [L107] token += 1 VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=2147483647, m_i=1, m_pc=1, m_st=2, t1_i=1, t1_pc=1, t1_st=1, token=2147483647] - UnprovableResult [Line: 69]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 69]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 107]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 101 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 15.1s, OverallIterations: 19, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 10.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6163 SdHoareTripleChecker+Valid, 6.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5980 mSDsluCounter, 6960 SdHoareTripleChecker+Invalid, 5.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5033 mSDsCounter, 1177 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8045 IncrementalHoareTripleChecker+Invalid, 9222 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1177 mSolverCounterUnsat, 1927 mSDtfsCounter, 8045 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 487 GetRequests, 275 SyntacticMatches, 0 SemanticMatches, 212 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 525 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3456occurred in iteration=14, InterpolantAutomatonStates: 212, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.0s AutomataMinimizationTime, 18 MinimizatonAttempts, 4032 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 1141 NumberOfCodeBlocks, 1141 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 1033 ConstructedInterpolants, 0 QuantifiedInterpolants, 2332 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 108/108 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-11-29 05:46:26,448 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1242b816-cefa-4c74-b58b-92964cd591ca/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(OVERFLOW)