./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/systemc/token_ring.01.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version e7bb482b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42ae59d5-8c4b-4d0f-babf-fc943224b68f/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42ae59d5-8c4b-4d0f-babf-fc943224b68f/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42ae59d5-8c4b-4d0f-babf-fc943224b68f/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42ae59d5-8c4b-4d0f-babf-fc943224b68f/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/systemc/token_ring.01.cil-2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42ae59d5-8c4b-4d0f-babf-fc943224b68f/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42ae59d5-8c4b-4d0f-babf-fc943224b68f/bin/uautomizer-verify-WvqO1wxjHP --witnessprinter.witness.filename witness.graphml --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 327bb4ad7f981d20a6e5212aac300a9249d1857b0280531d57d587d5a0195c5f --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 21:56:58,838 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 21:56:58,944 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42ae59d5-8c4b-4d0f-babf-fc943224b68f/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Overflow-32bit-Automizer_Default.epf [2023-11-06 21:56:58,957 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 21:56:58,958 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 21:56:58,997 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 21:56:58,999 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 21:56:59,000 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 21:56:59,002 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 21:56:59,007 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 21:56:59,008 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 21:56:59,008 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 21:56:59,009 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 21:56:59,011 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 21:56:59,012 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 21:56:59,012 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 21:56:59,013 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 21:56:59,013 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 21:56:59,014 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 21:56:59,014 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 21:56:59,015 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 21:56:59,015 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 21:56:59,017 INFO L153 SettingsManager]: * Check absence of signed integer overflows=true [2023-11-06 21:56:59,018 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-06 21:56:59,018 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 21:56:59,019 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 21:56:59,019 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 21:56:59,020 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 21:56:59,021 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 21:56:59,021 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 21:56:59,023 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 21:56:59,023 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 21:56:59,024 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 21:56:59,024 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 21:56:59,024 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 21:56:59,025 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 21:56:59,025 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 21:56:59,025 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 21:56:59,025 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 21:56:59,026 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 21:56:59,026 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 21:56:59,027 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_42ae59d5-8c4b-4d0f-babf-fc943224b68f/bin/uautomizer-verify-WvqO1wxjHP/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_42ae59d5-8c4b-4d0f-babf-fc943224b68f/bin/uautomizer-verify-WvqO1wxjHP Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> 327bb4ad7f981d20a6e5212aac300a9249d1857b0280531d57d587d5a0195c5f [2023-11-06 21:56:59,321 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 21:56:59,346 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 21:56:59,350 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 21:56:59,352 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 21:56:59,352 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 21:56:59,354 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42ae59d5-8c4b-4d0f-babf-fc943224b68f/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/systemc/token_ring.01.cil-2.c [2023-11-06 21:57:02,649 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 21:57:02,856 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 21:57:02,857 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42ae59d5-8c4b-4d0f-babf-fc943224b68f/sv-benchmarks/c/systemc/token_ring.01.cil-2.c [2023-11-06 21:57:02,868 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42ae59d5-8c4b-4d0f-babf-fc943224b68f/bin/uautomizer-verify-WvqO1wxjHP/data/e9306a30b/c20475c6398041999e9ebe5dcdd2b83b/FLAG996553f7e [2023-11-06 21:57:02,893 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42ae59d5-8c4b-4d0f-babf-fc943224b68f/bin/uautomizer-verify-WvqO1wxjHP/data/e9306a30b/c20475c6398041999e9ebe5dcdd2b83b [2023-11-06 21:57:02,901 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 21:57:02,904 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 21:57:02,910 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 21:57:02,910 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 21:57:02,917 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 21:57:02,918 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:57:02" (1/1) ... [2023-11-06 21:57:02,919 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ceb43d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:57:02, skipping insertion in model container [2023-11-06 21:57:02,919 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:57:02" (1/1) ... [2023-11-06 21:57:02,958 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 21:57:03,232 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 21:57:03,252 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 21:57:03,315 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 21:57:03,341 INFO L206 MainTranslator]: Completed translation [2023-11-06 21:57:03,342 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:57:03 WrapperNode [2023-11-06 21:57:03,342 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 21:57:03,344 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 21:57:03,344 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 21:57:03,344 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 21:57:03,354 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:57:03" (1/1) ... [2023-11-06 21:57:03,364 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:57:03" (1/1) ... [2023-11-06 21:57:03,394 INFO L138 Inliner]: procedures = 30, calls = 36, calls flagged for inlining = 14, calls inlined = 14, statements flattened = 234 [2023-11-06 21:57:03,395 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 21:57:03,396 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 21:57:03,396 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 21:57:03,396 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 21:57:03,406 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:57:03" (1/1) ... [2023-11-06 21:57:03,407 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:57:03" (1/1) ... [2023-11-06 21:57:03,410 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:57:03" (1/1) ... [2023-11-06 21:57:03,410 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:57:03" (1/1) ... [2023-11-06 21:57:03,417 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:57:03" (1/1) ... [2023-11-06 21:57:03,425 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:57:03" (1/1) ... [2023-11-06 21:57:03,427 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:57:03" (1/1) ... [2023-11-06 21:57:03,429 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:57:03" (1/1) ... [2023-11-06 21:57:03,433 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 21:57:03,434 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 21:57:03,434 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 21:57:03,434 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 21:57:03,435 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:57:03" (1/1) ... [2023-11-06 21:57:03,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 21:57:03,461 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42ae59d5-8c4b-4d0f-babf-fc943224b68f/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 21:57:03,479 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42ae59d5-8c4b-4d0f-babf-fc943224b68f/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 21:57:03,517 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42ae59d5-8c4b-4d0f-babf-fc943224b68f/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 21:57:03,529 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 21:57:03,530 INFO L130 BoogieDeclarations]: Found specification of procedure error [2023-11-06 21:57:03,530 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2023-11-06 21:57:03,530 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2023-11-06 21:57:03,530 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2023-11-06 21:57:03,530 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2023-11-06 21:57:03,531 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2023-11-06 21:57:03,531 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2023-11-06 21:57:03,531 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2023-11-06 21:57:03,531 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2023-11-06 21:57:03,531 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2023-11-06 21:57:03,532 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2023-11-06 21:57:03,532 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2023-11-06 21:57:03,532 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 21:57:03,532 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2023-11-06 21:57:03,533 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2023-11-06 21:57:03,533 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 21:57:03,533 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 21:57:03,608 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 21:57:03,610 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 21:57:04,034 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 21:57:04,043 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 21:57:04,043 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2023-11-06 21:57:04,046 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:57:04 BoogieIcfgContainer [2023-11-06 21:57:04,046 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 21:57:04,048 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 21:57:04,048 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 21:57:04,051 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 21:57:04,052 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 09:57:02" (1/3) ... [2023-11-06 21:57:04,053 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1222d3c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:57:04, skipping insertion in model container [2023-11-06 21:57:04,053 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:57:03" (2/3) ... [2023-11-06 21:57:04,053 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1222d3c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:57:04, skipping insertion in model container [2023-11-06 21:57:04,053 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:57:04" (3/3) ... [2023-11-06 21:57:04,055 INFO L112 eAbstractionObserver]: Analyzing ICFG token_ring.01.cil-2.c [2023-11-06 21:57:04,075 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 21:57:04,075 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2023-11-06 21:57:04,135 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 21:57:04,142 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=LoopsAndPotentialCycles, 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;@7a288831, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 21:57:04,142 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-11-06 21:57:04,147 INFO L276 IsEmpty]: Start isEmpty. Operand has 124 states, 95 states have (on average 1.5473684210526315) internal successors, (147), 102 states have internal predecessors, (147), 17 states have call successors, (17), 7 states have call predecessors, (17), 7 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2023-11-06 21:57:04,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-11-06 21:57:04,158 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:57:04,160 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, 1, 1, 1] [2023-11-06 21:57:04,160 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-06 21:57:04,169 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:57:04,169 INFO L85 PathProgramCache]: Analyzing trace with hash -1551110128, now seen corresponding path program 1 times [2023-11-06 21:57:04,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:57:04,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056295112] [2023-11-06 21:57:04,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:57:04,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:57:04,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:04,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 21:57:04,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:04,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 21:57:04,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:04,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 21:57:04,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:04,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 21:57:04,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:04,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-06 21:57:04,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:04,801 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-06 21:57:04,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:57:04,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056295112] [2023-11-06 21:57:04,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056295112] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:57:04,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:57:04,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 21:57:04,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701304840] [2023-11-06 21:57:04,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:57:04,817 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 21:57:04,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:57:04,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 21:57:04,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-06 21:57:04,868 INFO L87 Difference]: Start difference. First operand has 124 states, 95 states have (on average 1.5473684210526315) internal successors, (147), 102 states have internal predecessors, (147), 17 states have call successors, (17), 7 states have call predecessors, (17), 7 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 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-06 21:57:05,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:57:05,668 INFO L93 Difference]: Finished difference Result 386 states and 578 transitions. [2023-11-06 21:57:05,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-06 21:57:05,670 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 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 55 [2023-11-06 21:57:05,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:57:05,685 INFO L225 Difference]: With dead ends: 386 [2023-11-06 21:57:05,685 INFO L226 Difference]: Without dead ends: 257 [2023-11-06 21:57:05,689 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-06 21:57:05,693 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 321 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 420 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 329 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 492 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-06 21:57:05,694 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [329 Valid, 477 Invalid, 492 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 420 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-06 21:57:05,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2023-11-06 21:57:05,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 214. [2023-11-06 21:57:05,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 172 states have (on average 1.4651162790697674) internal successors, (252), 177 states have internal predecessors, (252), 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-06 21:57:05,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 305 transitions. [2023-11-06 21:57:05,779 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 305 transitions. Word has length 55 [2023-11-06 21:57:05,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:57:05,780 INFO L495 AbstractCegarLoop]: Abstraction has 214 states and 305 transitions. [2023-11-06 21:57:05,780 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 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-06 21:57:05,780 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 305 transitions. [2023-11-06 21:57:05,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-11-06 21:57:05,783 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:57:05,784 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, 1, 1, 1] [2023-11-06 21:57:05,784 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 21:57:05,784 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-06 21:57:05,785 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:57:05,785 INFO L85 PathProgramCache]: Analyzing trace with hash 913324044, now seen corresponding path program 1 times [2023-11-06 21:57:05,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:57:05,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848854794] [2023-11-06 21:57:05,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:57:05,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:57:05,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:05,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 21:57:05,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:05,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 21:57:05,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:06,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 21:57:06,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:06,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 21:57:06,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:06,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-06 21:57:06,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:06,031 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-06 21:57:06,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:57:06,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848854794] [2023-11-06 21:57:06,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848854794] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:57:06,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:57:06,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-06 21:57:06,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631293779] [2023-11-06 21:57:06,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:57:06,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 21:57:06,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:57:06,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 21:57:06,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-06 21:57:06,036 INFO L87 Difference]: Start difference. First operand 214 states and 305 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 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-06 21:57:06,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:57:06,961 INFO L93 Difference]: Finished difference Result 580 states and 828 transitions. [2023-11-06 21:57:06,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-06 21:57:06,961 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 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 55 [2023-11-06 21:57:06,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:57:06,967 INFO L225 Difference]: With dead ends: 580 [2023-11-06 21:57:06,967 INFO L226 Difference]: Without dead ends: 375 [2023-11-06 21:57:06,970 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2023-11-06 21:57:06,972 INFO L413 NwaCegarLoop]: 188 mSDtfsCounter, 302 mSDsluCounter, 611 mSDsCounter, 0 mSdLazyCounter, 698 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 310 SdHoareTripleChecker+Valid, 799 SdHoareTripleChecker+Invalid, 737 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 698 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-06 21:57:06,972 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [310 Valid, 799 Invalid, 737 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 698 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-06 21:57:06,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2023-11-06 21:57:07,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 309. [2023-11-06 21:57:07,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 250 states have (on average 1.456) internal successors, (364), 256 states have internal predecessors, (364), 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-06 21:57:07,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 439 transitions. [2023-11-06 21:57:07,025 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 439 transitions. Word has length 55 [2023-11-06 21:57:07,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:57:07,026 INFO L495 AbstractCegarLoop]: Abstraction has 309 states and 439 transitions. [2023-11-06 21:57:07,026 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 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-06 21:57:07,026 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 439 transitions. [2023-11-06 21:57:07,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-11-06 21:57:07,029 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:57:07,029 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, 1, 1, 1] [2023-11-06 21:57:07,029 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 21:57:07,030 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-06 21:57:07,030 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:57:07,030 INFO L85 PathProgramCache]: Analyzing trace with hash 15930766, now seen corresponding path program 1 times [2023-11-06 21:57:07,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:57:07,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471290435] [2023-11-06 21:57:07,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:57:07,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:57:07,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:07,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 21:57:07,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:07,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 21:57:07,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:07,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 21:57:07,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:07,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 21:57:07,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:07,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-06 21:57:07,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:07,178 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-06 21:57:07,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:57:07,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471290435] [2023-11-06 21:57:07,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471290435] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:57:07,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:57:07,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-06 21:57:07,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856453040] [2023-11-06 21:57:07,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:57:07,180 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 21:57:07,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:57:07,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 21:57:07,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-06 21:57:07,182 INFO L87 Difference]: Start difference. First operand 309 states and 439 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 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-06 21:57:08,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:57:08,040 INFO L93 Difference]: Finished difference Result 946 states and 1346 transitions. [2023-11-06 21:57:08,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-06 21:57:08,041 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 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 55 [2023-11-06 21:57:08,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:57:08,046 INFO L225 Difference]: With dead ends: 946 [2023-11-06 21:57:08,046 INFO L226 Difference]: Without dead ends: 646 [2023-11-06 21:57:08,048 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-06 21:57:08,049 INFO L413 NwaCegarLoop]: 184 mSDtfsCounter, 357 mSDsluCounter, 603 mSDsCounter, 0 mSdLazyCounter, 687 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 367 SdHoareTripleChecker+Valid, 787 SdHoareTripleChecker+Invalid, 731 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 687 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-06 21:57:08,050 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [367 Valid, 787 Invalid, 731 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 687 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-06 21:57:08,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 646 states. [2023-11-06 21:57:08,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 646 to 492. [2023-11-06 21:57:08,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 492 states, 401 states have (on average 1.4438902743142146) internal successors, (579), 409 states have internal predecessors, (579), 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-06 21:57:08,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 698 transitions. [2023-11-06 21:57:08,120 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 698 transitions. Word has length 55 [2023-11-06 21:57:08,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:57:08,121 INFO L495 AbstractCegarLoop]: Abstraction has 492 states and 698 transitions. [2023-11-06 21:57:08,121 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 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-06 21:57:08,121 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 698 transitions. [2023-11-06 21:57:08,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-11-06 21:57:08,124 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:57:08,125 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, 1, 1, 1] [2023-11-06 21:57:08,125 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 21:57:08,125 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-06 21:57:08,125 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:57:08,126 INFO L85 PathProgramCache]: Analyzing trace with hash 264077260, now seen corresponding path program 1 times [2023-11-06 21:57:08,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:57:08,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221613392] [2023-11-06 21:57:08,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:57:08,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:57:08,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:08,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 21:57:08,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:08,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 21:57:08,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:08,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 21:57:08,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:08,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 21:57:08,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:08,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-06 21:57:08,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:08,265 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-06 21:57:08,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:57:08,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221613392] [2023-11-06 21:57:08,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221613392] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:57:08,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:57:08,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-06 21:57:08,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647338228] [2023-11-06 21:57:08,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:57:08,267 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 21:57:08,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:57:08,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 21:57:08,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-06 21:57:08,268 INFO L87 Difference]: Start difference. First operand 492 states and 698 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 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-06 21:57:09,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:57:09,149 INFO L93 Difference]: Finished difference Result 1522 states and 2161 transitions. [2023-11-06 21:57:09,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-06 21:57:09,149 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 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 55 [2023-11-06 21:57:09,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:57:09,161 INFO L225 Difference]: With dead ends: 1522 [2023-11-06 21:57:09,161 INFO L226 Difference]: Without dead ends: 1039 [2023-11-06 21:57:09,163 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-06 21:57:09,174 INFO L413 NwaCegarLoop]: 172 mSDtfsCounter, 297 mSDsluCounter, 585 mSDsCounter, 0 mSdLazyCounter, 717 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 304 SdHoareTripleChecker+Valid, 757 SdHoareTripleChecker+Invalid, 766 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 717 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-06 21:57:09,176 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [304 Valid, 757 Invalid, 766 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 717 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-06 21:57:09,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1039 states. [2023-11-06 21:57:09,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1039 to 801. [2023-11-06 21:57:09,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 801 states, 652 states have (on average 1.4248466257668713) internal successors, (929), 664 states have internal predecessors, (929), 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-06 21:57:09,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 801 states and 1134 transitions. [2023-11-06 21:57:09,296 INFO L78 Accepts]: Start accepts. Automaton has 801 states and 1134 transitions. Word has length 55 [2023-11-06 21:57:09,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:57:09,298 INFO L495 AbstractCegarLoop]: Abstraction has 801 states and 1134 transitions. [2023-11-06 21:57:09,298 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 5 states have internal predecessors, (45), 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-06 21:57:09,299 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 1134 transitions. [2023-11-06 21:57:09,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-11-06 21:57:09,305 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:57:09,306 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, 1, 1, 1] [2023-11-06 21:57:09,306 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-06 21:57:09,306 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-06 21:57:09,307 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:57:09,307 INFO L85 PathProgramCache]: Analyzing trace with hash 687723982, now seen corresponding path program 1 times [2023-11-06 21:57:09,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:57:09,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264031158] [2023-11-06 21:57:09,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:57:09,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:57:09,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:09,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 21:57:09,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:09,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 21:57:09,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:09,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 21:57:09,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:09,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 21:57:09,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:09,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-06 21:57:09,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:09,497 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-06 21:57:09,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:57:09,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264031158] [2023-11-06 21:57:09,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264031158] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:57:09,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:57:09,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 21:57:09,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922960934] [2023-11-06 21:57:09,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:57:09,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 21:57:09,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:57:09,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 21:57:09,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-06 21:57:09,502 INFO L87 Difference]: Start difference. First operand 801 states and 1134 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 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-06 21:57:10,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:57:10,272 INFO L93 Difference]: Finished difference Result 2213 states and 3139 transitions. [2023-11-06 21:57:10,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-06 21:57:10,273 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 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 55 [2023-11-06 21:57:10,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:57:10,283 INFO L225 Difference]: With dead ends: 2213 [2023-11-06 21:57:10,283 INFO L226 Difference]: Without dead ends: 1422 [2023-11-06 21:57:10,286 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-06 21:57:10,287 INFO L413 NwaCegarLoop]: 193 mSDtfsCounter, 420 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 552 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 443 SdHoareTripleChecker+Valid, 538 SdHoareTripleChecker+Invalid, 615 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 552 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-06 21:57:10,288 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [443 Valid, 538 Invalid, 615 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 552 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-06 21:57:10,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1422 states. [2023-11-06 21:57:10,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1422 to 1215. [2023-11-06 21:57:10,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1215 states, 983 states have (on average 1.397761953204476) internal successors, (1374), 1004 states have internal predecessors, (1374), 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-06 21:57:10,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1215 states to 1215 states and 1687 transitions. [2023-11-06 21:57:10,473 INFO L78 Accepts]: Start accepts. Automaton has 1215 states and 1687 transitions. Word has length 55 [2023-11-06 21:57:10,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:57:10,474 INFO L495 AbstractCegarLoop]: Abstraction has 1215 states and 1687 transitions. [2023-11-06 21:57:10,474 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 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-06 21:57:10,474 INFO L276 IsEmpty]: Start isEmpty. Operand 1215 states and 1687 transitions. [2023-11-06 21:57:10,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2023-11-06 21:57:10,476 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:57:10,476 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, 1, 1, 1, 1] [2023-11-06 21:57:10,477 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-06 21:57:10,477 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-06 21:57:10,477 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:57:10,477 INFO L85 PathProgramCache]: Analyzing trace with hash -987112854, now seen corresponding path program 1 times [2023-11-06 21:57:10,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:57:10,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686241343] [2023-11-06 21:57:10,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:57:10,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:57:10,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:10,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 21:57:10,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:10,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 21:57:10,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:10,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 21:57:10,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:10,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 21:57:10,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:10,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-06 21:57:10,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:10,615 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-06 21:57:10,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:57:10,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686241343] [2023-11-06 21:57:10,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686241343] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:57:10,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:57:10,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-06 21:57:10,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825229086] [2023-11-06 21:57:10,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:57:10,617 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 21:57:10,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:57:10,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 21:57:10,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-06 21:57:10,619 INFO L87 Difference]: Start difference. First operand 1215 states and 1687 transitions. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 5 states have internal predecessors, (46), 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-06 21:57:11,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:57:11,224 INFO L93 Difference]: Finished difference Result 2637 states and 3715 transitions. [2023-11-06 21:57:11,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-06 21:57:11,224 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 5 states have internal predecessors, (46), 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 56 [2023-11-06 21:57:11,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:57:11,234 INFO L225 Difference]: With dead ends: 2637 [2023-11-06 21:57:11,234 INFO L226 Difference]: Without dead ends: 1432 [2023-11-06 21:57:11,237 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2023-11-06 21:57:11,238 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 157 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 414 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 542 SdHoareTripleChecker+Invalid, 447 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-06 21:57:11,239 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 542 Invalid, 447 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 414 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-06 21:57:11,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1432 states. [2023-11-06 21:57:11,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1432 to 1230. [2023-11-06 21:57:11,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1230 states, 998 states have (on average 1.3827655310621243) internal successors, (1380), 1019 states have internal predecessors, (1380), 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-06 21:57:11,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1230 states to 1230 states and 1693 transitions. [2023-11-06 21:57:11,375 INFO L78 Accepts]: Start accepts. Automaton has 1230 states and 1693 transitions. Word has length 56 [2023-11-06 21:57:11,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:57:11,376 INFO L495 AbstractCegarLoop]: Abstraction has 1230 states and 1693 transitions. [2023-11-06 21:57:11,376 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 5 states have internal predecessors, (46), 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-06 21:57:11,376 INFO L276 IsEmpty]: Start isEmpty. Operand 1230 states and 1693 transitions. [2023-11-06 21:57:11,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2023-11-06 21:57:11,378 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:57:11,378 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, 1, 1, 1, 1] [2023-11-06 21:57:11,378 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-06 21:57:11,378 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-06 21:57:11,379 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:57:11,379 INFO L85 PathProgramCache]: Analyzing trace with hash -1059499412, now seen corresponding path program 1 times [2023-11-06 21:57:11,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:57:11,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772257015] [2023-11-06 21:57:11,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:57:11,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:57:11,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:11,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 21:57:11,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:11,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 21:57:11,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:11,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 21:57:11,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:11,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 21:57:11,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:11,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-06 21:57:11,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:11,475 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-06 21:57:11,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:57:11,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772257015] [2023-11-06 21:57:11,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772257015] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:57:11,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:57:11,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-06 21:57:11,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9101325] [2023-11-06 21:57:11,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:57:11,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 21:57:11,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:57:11,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 21:57:11,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-06 21:57:11,478 INFO L87 Difference]: Start difference. First operand 1230 states and 1693 transitions. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 5 states have internal predecessors, (46), 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-06 21:57:12,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:57:12,060 INFO L93 Difference]: Finished difference Result 2692 states and 3760 transitions. [2023-11-06 21:57:12,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-06 21:57:12,060 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 5 states have internal predecessors, (46), 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 56 [2023-11-06 21:57:12,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:57:12,070 INFO L225 Difference]: With dead ends: 2692 [2023-11-06 21:57:12,071 INFO L226 Difference]: Without dead ends: 1472 [2023-11-06 21:57:12,076 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2023-11-06 21:57:12,077 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 129 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 370 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 537 SdHoareTripleChecker+Invalid, 404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-06 21:57:12,077 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 537 Invalid, 404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 370 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-06 21:57:12,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1472 states. [2023-11-06 21:57:12,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1472 to 1272. [2023-11-06 21:57:12,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1272 states, 1040 states have (on average 1.3673076923076923) internal successors, (1422), 1061 states have internal predecessors, (1422), 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-06 21:57:12,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1272 states to 1272 states and 1735 transitions. [2023-11-06 21:57:12,220 INFO L78 Accepts]: Start accepts. Automaton has 1272 states and 1735 transitions. Word has length 56 [2023-11-06 21:57:12,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:57:12,220 INFO L495 AbstractCegarLoop]: Abstraction has 1272 states and 1735 transitions. [2023-11-06 21:57:12,220 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 5 states have internal predecessors, (46), 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-06 21:57:12,221 INFO L276 IsEmpty]: Start isEmpty. Operand 1272 states and 1735 transitions. [2023-11-06 21:57:12,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2023-11-06 21:57:12,228 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:57:12,228 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, 1, 1, 1, 1] [2023-11-06 21:57:12,229 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-06 21:57:12,229 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-06 21:57:12,229 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:57:12,230 INFO L85 PathProgramCache]: Analyzing trace with hash 863728622, now seen corresponding path program 1 times [2023-11-06 21:57:12,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:57:12,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612699840] [2023-11-06 21:57:12,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:57:12,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:57:12,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:12,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 21:57:12,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:12,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 21:57:12,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:12,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 21:57:12,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:12,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 21:57:12,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:12,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-06 21:57:12,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:12,397 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-06 21:57:12,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:57:12,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612699840] [2023-11-06 21:57:12,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612699840] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:57:12,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:57:12,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-06 21:57:12,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35714877] [2023-11-06 21:57:12,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:57:12,399 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 21:57:12,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:57:12,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 21:57:12,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-11-06 21:57:12,401 INFO L87 Difference]: Start difference. First operand 1272 states and 1735 transitions. Second operand has 8 states, 8 states have (on average 5.75) internal successors, (46), 6 states have internal predecessors, (46), 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-06 21:57:13,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:57:13,075 INFO L93 Difference]: Finished difference Result 1838 states and 2509 transitions. [2023-11-06 21:57:13,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-06 21:57:13,075 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 6 states have internal predecessors, (46), 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 56 [2023-11-06 21:57:13,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:57:13,085 INFO L225 Difference]: With dead ends: 1838 [2023-11-06 21:57:13,085 INFO L226 Difference]: Without dead ends: 1088 [2023-11-06 21:57:13,088 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-06 21:57:13,089 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 374 mSDsluCounter, 482 mSDsCounter, 0 mSdLazyCounter, 508 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 384 SdHoareTripleChecker+Valid, 588 SdHoareTripleChecker+Invalid, 570 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 508 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-06 21:57:13,089 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [384 Valid, 588 Invalid, 570 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 508 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-06 21:57:13,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1088 states. [2023-11-06 21:57:13,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1088 to 918. [2023-11-06 21:57:13,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 918 states, 749 states have (on average 1.356475300400534) internal successors, (1016), 763 states have internal predecessors, (1016), 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-06 21:57:13,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 918 states to 918 states and 1231 transitions. [2023-11-06 21:57:13,240 INFO L78 Accepts]: Start accepts. Automaton has 918 states and 1231 transitions. Word has length 56 [2023-11-06 21:57:13,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:57:13,240 INFO L495 AbstractCegarLoop]: Abstraction has 918 states and 1231 transitions. [2023-11-06 21:57:13,241 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 6 states have internal predecessors, (46), 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-06 21:57:13,241 INFO L276 IsEmpty]: Start isEmpty. Operand 918 states and 1231 transitions. [2023-11-06 21:57:13,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2023-11-06 21:57:13,242 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:57:13,242 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, 1, 1, 1, 1] [2023-11-06 21:57:13,242 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-06 21:57:13,243 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-06 21:57:13,245 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:57:13,245 INFO L85 PathProgramCache]: Analyzing trace with hash 1082583340, now seen corresponding path program 1 times [2023-11-06 21:57:13,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:57:13,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765335408] [2023-11-06 21:57:13,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:57:13,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:57:13,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:13,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 21:57:13,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:13,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 21:57:13,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:13,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 21:57:13,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:13,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 21:57:13,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:13,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-06 21:57:13,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:13,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-06 21:57:13,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:57:13,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765335408] [2023-11-06 21:57:13,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765335408] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:57:13,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:57:13,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-06 21:57:13,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960946841] [2023-11-06 21:57:13,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:57:13,436 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 21:57:13,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:57:13,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 21:57:13,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-11-06 21:57:13,438 INFO L87 Difference]: Start difference. First operand 918 states and 1231 transitions. Second operand has 8 states, 8 states have (on average 5.75) internal successors, (46), 6 states have internal predecessors, (46), 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-06 21:57:14,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:57:14,221 INFO L93 Difference]: Finished difference Result 1779 states and 2393 transitions. [2023-11-06 21:57:14,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-06 21:57:14,222 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 6 states have internal predecessors, (46), 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 56 [2023-11-06 21:57:14,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:57:14,229 INFO L225 Difference]: With dead ends: 1779 [2023-11-06 21:57:14,230 INFO L226 Difference]: Without dead ends: 1116 [2023-11-06 21:57:14,250 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-06 21:57:14,253 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 371 mSDsluCounter, 476 mSDsCounter, 0 mSdLazyCounter, 564 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 379 SdHoareTripleChecker+Valid, 583 SdHoareTripleChecker+Invalid, 627 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 564 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-06 21:57:14,253 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [379 Valid, 583 Invalid, 627 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 564 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-06 21:57:14,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1116 states. [2023-11-06 21:57:14,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1116 to 912. [2023-11-06 21:57:14,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 912 states, 745 states have (on average 1.3516778523489932) internal successors, (1007), 757 states have internal predecessors, (1007), 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-06 21:57:14,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 912 states to 912 states and 1214 transitions. [2023-11-06 21:57:14,361 INFO L78 Accepts]: Start accepts. Automaton has 912 states and 1214 transitions. Word has length 56 [2023-11-06 21:57:14,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:57:14,362 INFO L495 AbstractCegarLoop]: Abstraction has 912 states and 1214 transitions. [2023-11-06 21:57:14,362 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 6 states have internal predecessors, (46), 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-06 21:57:14,362 INFO L276 IsEmpty]: Start isEmpty. Operand 912 states and 1214 transitions. [2023-11-06 21:57:14,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2023-11-06 21:57:14,363 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:57:14,363 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, 1, 1, 1, 1] [2023-11-06 21:57:14,364 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-06 21:57:14,364 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-06 21:57:14,364 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:57:14,364 INFO L85 PathProgramCache]: Analyzing trace with hash 1505285166, now seen corresponding path program 1 times [2023-11-06 21:57:14,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:57:14,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77209670] [2023-11-06 21:57:14,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:57:14,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:57:14,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:14,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 21:57:14,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:14,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 21:57:14,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:14,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 21:57:14,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:14,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 21:57:14,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:14,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-06 21:57:14,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:14,533 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-06 21:57:14,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:57:14,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77209670] [2023-11-06 21:57:14,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77209670] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:57:14,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:57:14,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-06 21:57:14,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554958073] [2023-11-06 21:57:14,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:57:14,535 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 21:57:14,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:57:14,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 21:57:14,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-11-06 21:57:14,536 INFO L87 Difference]: Start difference. First operand 912 states and 1214 transitions. Second operand has 8 states, 8 states have (on average 5.75) internal successors, (46), 6 states have internal predecessors, (46), 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-06 21:57:15,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:57:15,317 INFO L93 Difference]: Finished difference Result 1721 states and 2289 transitions. [2023-11-06 21:57:15,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-06 21:57:15,318 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 6 states have internal predecessors, (46), 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 56 [2023-11-06 21:57:15,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:57:15,324 INFO L225 Difference]: With dead ends: 1721 [2023-11-06 21:57:15,324 INFO L226 Difference]: Without dead ends: 968 [2023-11-06 21:57:15,326 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-06 21:57:15,327 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 333 mSDsluCounter, 499 mSDsCounter, 0 mSdLazyCounter, 581 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 341 SdHoareTripleChecker+Valid, 624 SdHoareTripleChecker+Invalid, 628 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 581 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-06 21:57:15,328 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [341 Valid, 624 Invalid, 628 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 581 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-06 21:57:15,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 968 states. [2023-11-06 21:57:15,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 968 to 796. [2023-11-06 21:57:15,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 796 states, 654 states have (on average 1.348623853211009) internal successors, (882), 664 states have internal predecessors, (882), 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-06 21:57:15,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 1054 transitions. [2023-11-06 21:57:15,412 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 1054 transitions. Word has length 56 [2023-11-06 21:57:15,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:57:15,413 INFO L495 AbstractCegarLoop]: Abstraction has 796 states and 1054 transitions. [2023-11-06 21:57:15,413 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 6 states have internal predecessors, (46), 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-06 21:57:15,413 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 1054 transitions. [2023-11-06 21:57:15,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2023-11-06 21:57:15,414 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:57:15,414 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, 1, 1, 1, 1] [2023-11-06 21:57:15,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-06 21:57:15,415 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-06 21:57:15,415 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:57:15,415 INFO L85 PathProgramCache]: Analyzing trace with hash 687636716, now seen corresponding path program 1 times [2023-11-06 21:57:15,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:57:15,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704995163] [2023-11-06 21:57:15,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:57:15,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:57:15,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:15,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 21:57:15,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:15,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 21:57:15,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:15,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 21:57:15,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:15,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 21:57:15,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:15,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-06 21:57:15,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:15,497 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-06 21:57:15,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:57:15,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704995163] [2023-11-06 21:57:15,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704995163] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:57:15,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:57:15,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 21:57:15,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829229451] [2023-11-06 21:57:15,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:57:15,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 21:57:15,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:57:15,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 21:57:15,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-06 21:57:15,499 INFO L87 Difference]: Start difference. First operand 796 states and 1054 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 4 states have internal predecessors, (46), 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-06 21:57:16,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:57:16,058 INFO L93 Difference]: Finished difference Result 2454 states and 3298 transitions. [2023-11-06 21:57:16,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-06 21:57:16,058 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 4 states have internal predecessors, (46), 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 56 [2023-11-06 21:57:16,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:57:16,070 INFO L225 Difference]: With dead ends: 2454 [2023-11-06 21:57:16,070 INFO L226 Difference]: Without dead ends: 1669 [2023-11-06 21:57:16,073 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-06 21:57:16,073 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 420 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 426 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-06 21:57:16,074 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [426 Valid, 381 Invalid, 343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-06 21:57:16,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1669 states. [2023-11-06 21:57:16,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1669 to 1495. [2023-11-06 21:57:16,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1495 states, 1225 states have (on average 1.3273469387755101) internal successors, (1626), 1242 states have internal predecessors, (1626), 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-06 21:57:16,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1495 states to 1495 states and 1985 transitions. [2023-11-06 21:57:16,254 INFO L78 Accepts]: Start accepts. Automaton has 1495 states and 1985 transitions. Word has length 56 [2023-11-06 21:57:16,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:57:16,255 INFO L495 AbstractCegarLoop]: Abstraction has 1495 states and 1985 transitions. [2023-11-06 21:57:16,255 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 4 states have internal predecessors, (46), 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-06 21:57:16,255 INFO L276 IsEmpty]: Start isEmpty. Operand 1495 states and 1985 transitions. [2023-11-06 21:57:16,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-11-06 21:57:16,256 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:57:16,257 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, 1, 1, 1, 1, 1] [2023-11-06 21:57:16,257 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-06 21:57:16,257 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-06 21:57:16,258 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:57:16,258 INFO L85 PathProgramCache]: Analyzing trace with hash -1414703249, now seen corresponding path program 1 times [2023-11-06 21:57:16,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:57:16,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884725731] [2023-11-06 21:57:16,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:57:16,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:57:16,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:16,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 21:57:16,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:16,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 21:57:16,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:16,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 21:57:16,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:16,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 21:57:16,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:16,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-06 21:57:16,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:16,307 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-06 21:57:16,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:57:16,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884725731] [2023-11-06 21:57:16,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884725731] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:57:16,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:57:16,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 21:57:16,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855491340] [2023-11-06 21:57:16,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:57:16,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 21:57:16,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:57:16,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 21:57:16,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 21:57:16,310 INFO L87 Difference]: Start difference. First operand 1495 states and 1985 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 3 states have internal predecessors, (47), 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-06 21:57:16,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:57:16,743 INFO L93 Difference]: Finished difference Result 2879 states and 3805 transitions. [2023-11-06 21:57:16,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 21:57:16,743 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 3 states have internal predecessors, (47), 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 57 [2023-11-06 21:57:16,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:57:16,756 INFO L225 Difference]: With dead ends: 2879 [2023-11-06 21:57:16,756 INFO L226 Difference]: Without dead ends: 1395 [2023-11-06 21:57:16,761 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 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-06 21:57:16,762 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 277 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 21:57:16,762 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 247 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 21:57:16,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1395 states. [2023-11-06 21:57:16,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1395 to 1218. [2023-11-06 21:57:16,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1218 states, 1004 states have (on average 1.3197211155378485) internal successors, (1325), 1019 states have internal predecessors, (1325), 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-06 21:57:16,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1218 states to 1218 states and 1599 transitions. [2023-11-06 21:57:16,922 INFO L78 Accepts]: Start accepts. Automaton has 1218 states and 1599 transitions. Word has length 57 [2023-11-06 21:57:16,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:57:16,923 INFO L495 AbstractCegarLoop]: Abstraction has 1218 states and 1599 transitions. [2023-11-06 21:57:16,923 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 3 states have internal predecessors, (47), 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-06 21:57:16,923 INFO L276 IsEmpty]: Start isEmpty. Operand 1218 states and 1599 transitions. [2023-11-06 21:57:16,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-11-06 21:57:16,924 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:57:16,924 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, 1, 1, 1, 1, 1, 1] [2023-11-06 21:57:16,924 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-06 21:57:16,925 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-06 21:57:16,925 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:57:16,925 INFO L85 PathProgramCache]: Analyzing trace with hash 375464921, now seen corresponding path program 1 times [2023-11-06 21:57:16,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:57:16,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049591198] [2023-11-06 21:57:16,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:57:16,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:57:16,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:16,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 21:57:16,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:16,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 21:57:16,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:16,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 21:57:16,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:16,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 21:57:16,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:16,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-06 21:57:16,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:17,000 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-06 21:57:17,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:57:17,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049591198] [2023-11-06 21:57:17,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049591198] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:57:17,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:57:17,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 21:57:17,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873929490] [2023-11-06 21:57:17,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:57:17,002 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 21:57:17,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:57:17,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 21:57:17,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 21:57:17,004 INFO L87 Difference]: Start difference. First operand 1218 states and 1599 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 3 states have internal predecessors, (48), 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-06 21:57:17,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:57:17,607 INFO L93 Difference]: Finished difference Result 3492 states and 4608 transitions. [2023-11-06 21:57:17,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-06 21:57:17,608 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 3 states have internal predecessors, (48), 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 58 [2023-11-06 21:57:17,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:57:17,622 INFO L225 Difference]: With dead ends: 3492 [2023-11-06 21:57:17,622 INFO L226 Difference]: Without dead ends: 2284 [2023-11-06 21:57:17,627 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-06 21:57:17,627 INFO L413 NwaCegarLoop]: 147 mSDtfsCounter, 329 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 338 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-06 21:57:17,628 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [338 Valid, 394 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-06 21:57:17,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2284 states. [2023-11-06 21:57:17,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2284 to 1992. [2023-11-06 21:57:17,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1992 states, 1640 states have (on average 1.302439024390244) internal successors, (2136), 1664 states have internal predecessors, (2136), 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-06 21:57:17,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1992 states to 1992 states and 2585 transitions. [2023-11-06 21:57:17,900 INFO L78 Accepts]: Start accepts. Automaton has 1992 states and 2585 transitions. Word has length 58 [2023-11-06 21:57:17,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:57:17,901 INFO L495 AbstractCegarLoop]: Abstraction has 1992 states and 2585 transitions. [2023-11-06 21:57:17,901 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 3 states have internal predecessors, (48), 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-06 21:57:17,901 INFO L276 IsEmpty]: Start isEmpty. Operand 1992 states and 2585 transitions. [2023-11-06 21:57:17,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2023-11-06 21:57:17,902 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:57:17,903 INFO L195 NwaCegarLoop]: trace histogram [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-06 21:57:17,903 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-06 21:57:17,903 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-06 21:57:17,903 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:57:17,904 INFO L85 PathProgramCache]: Analyzing trace with hash -163397292, now seen corresponding path program 1 times [2023-11-06 21:57:17,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:57:17,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047681750] [2023-11-06 21:57:17,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:57:17,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:57:17,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:17,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 21:57:17,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:17,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 21:57:17,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:17,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 21:57:17,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:17,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 21:57:17,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:17,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-06 21:57:17,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:17,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-06 21:57:17,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:18,006 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-06 21:57:18,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:57:18,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047681750] [2023-11-06 21:57:18,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047681750] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:57:18,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:57:18,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 21:57:18,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278305762] [2023-11-06 21:57:18,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:57:18,008 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 21:57:18,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:57:18,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 21:57:18,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-06 21:57:18,010 INFO L87 Difference]: Start difference. First operand 1992 states and 2585 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 4 states have internal predecessors, (61), 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-06 21:57:19,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:57:19,265 INFO L93 Difference]: Finished difference Result 6324 states and 8267 transitions. [2023-11-06 21:57:19,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-06 21:57:19,266 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 4 states have internal predecessors, (61), 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 77 [2023-11-06 21:57:19,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:57:19,294 INFO L225 Difference]: With dead ends: 6324 [2023-11-06 21:57:19,294 INFO L226 Difference]: Without dead ends: 4343 [2023-11-06 21:57:19,301 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2023-11-06 21:57:19,302 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 700 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 468 mSolverCounterSat, 141 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 714 SdHoareTripleChecker+Valid, 546 SdHoareTripleChecker+Invalid, 609 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 141 IncrementalHoareTripleChecker+Valid, 468 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-06 21:57:19,302 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [714 Valid, 546 Invalid, 609 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [141 Valid, 468 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-06 21:57:19,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4343 states. [2023-11-06 21:57:19,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4343 to 3908. [2023-11-06 21:57:19,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3908 states, 3206 states have (on average 1.2844666250779788) internal successors, (4118), 3267 states have internal predecessors, (4118), 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-06 21:57:19,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3908 states to 3908 states and 5088 transitions. [2023-11-06 21:57:19,916 INFO L78 Accepts]: Start accepts. Automaton has 3908 states and 5088 transitions. Word has length 77 [2023-11-06 21:57:19,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:57:19,917 INFO L495 AbstractCegarLoop]: Abstraction has 3908 states and 5088 transitions. [2023-11-06 21:57:19,917 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 4 states have internal predecessors, (61), 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-06 21:57:19,917 INFO L276 IsEmpty]: Start isEmpty. Operand 3908 states and 5088 transitions. [2023-11-06 21:57:19,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2023-11-06 21:57:19,919 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:57:19,920 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, 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-06 21:57:19,920 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-06 21:57:19,920 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-06 21:57:19,920 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:57:19,921 INFO L85 PathProgramCache]: Analyzing trace with hash 654619595, now seen corresponding path program 1 times [2023-11-06 21:57:19,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:57:19,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923722368] [2023-11-06 21:57:19,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:57:19,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:57:19,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:20,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 21:57:20,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:20,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 21:57:20,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:20,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 21:57:20,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:20,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 21:57:20,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:20,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-06 21:57:20,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:20,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-11-06 21:57:20,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:20,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-06 21:57:20,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:20,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-11-06 21:57:20,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:20,159 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-11-06 21:57:20,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:57:20,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923722368] [2023-11-06 21:57:20,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923722368] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:57:20,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:57:20,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-06 21:57:20,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398216233] [2023-11-06 21:57:20,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:57:20,161 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 21:57:20,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:57:20,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 21:57:20,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-06 21:57:20,162 INFO L87 Difference]: Start difference. First operand 3908 states and 5088 transitions. Second operand has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 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-06 21:57:21,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:57:21,142 INFO L93 Difference]: Finished difference Result 7528 states and 9761 transitions. [2023-11-06 21:57:21,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-06 21:57:21,142 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 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 91 [2023-11-06 21:57:21,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:57:21,173 INFO L225 Difference]: With dead ends: 7528 [2023-11-06 21:57:21,173 INFO L226 Difference]: Without dead ends: 4409 [2023-11-06 21:57:21,182 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-06 21:57:21,182 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 536 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 543 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-06 21:57:21,183 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [543 Valid, 362 Invalid, 380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-06 21:57:21,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4409 states. [2023-11-06 21:57:21,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4409 to 3876. [2023-11-06 21:57:21,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3876 states, 3170 states have (on average 1.2750788643533124) internal successors, (4042), 3235 states have internal predecessors, (4042), 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-06 21:57:21,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3876 states to 3876 states and 4957 transitions. [2023-11-06 21:57:21,726 INFO L78 Accepts]: Start accepts. Automaton has 3876 states and 4957 transitions. Word has length 91 [2023-11-06 21:57:21,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:57:21,726 INFO L495 AbstractCegarLoop]: Abstraction has 3876 states and 4957 transitions. [2023-11-06 21:57:21,736 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.285714285714286) internal successors, (58), 5 states have internal predecessors, (58), 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-06 21:57:21,744 INFO L276 IsEmpty]: Start isEmpty. Operand 3876 states and 4957 transitions. [2023-11-06 21:57:21,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2023-11-06 21:57:21,746 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:57:21,746 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, 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-06 21:57:21,746 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-06 21:57:21,746 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-06 21:57:21,747 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:57:21,747 INFO L85 PathProgramCache]: Analyzing trace with hash 1979475789, now seen corresponding path program 1 times [2023-11-06 21:57:21,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:57:21,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463839244] [2023-11-06 21:57:21,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:57:21,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:57:21,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:21,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 21:57:21,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:21,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 21:57:21,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:21,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 21:57:21,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:21,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 21:57:21,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:21,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-06 21:57:21,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:21,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-11-06 21:57:21,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:21,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-06 21:57:21,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:21,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-11-06 21:57:21,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:21,817 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-11-06 21:57:21,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:57:21,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463839244] [2023-11-06 21:57:21,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463839244] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:57:21,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:57:21,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 21:57:21,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310999185] [2023-11-06 21:57:21,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:57:21,821 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 21:57:21,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:57:21,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 21:57:21,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 21:57:21,823 INFO L87 Difference]: Start difference. First operand 3876 states and 4957 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 3 states have internal predecessors, (53), 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-06 21:57:22,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:57:22,468 INFO L93 Difference]: Finished difference Result 4271 states and 5475 transitions. [2023-11-06 21:57:22,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 21:57:22,469 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 3 states have internal predecessors, (53), 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 91 [2023-11-06 21:57:22,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:57:22,503 INFO L225 Difference]: With dead ends: 4271 [2023-11-06 21:57:22,503 INFO L226 Difference]: Without dead ends: 3518 [2023-11-06 21:57:22,506 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 19 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-06 21:57:22,507 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 275 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 21:57:22,508 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 242 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 21:57:22,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3518 states. [2023-11-06 21:57:23,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3518 to 3125. [2023-11-06 21:57:23,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3125 states, 2560 states have (on average 1.280078125) internal successors, (3277), 2615 states have internal predecessors, (3277), 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-06 21:57:23,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3125 states to 3125 states and 4011 transitions. [2023-11-06 21:57:23,025 INFO L78 Accepts]: Start accepts. Automaton has 3125 states and 4011 transitions. Word has length 91 [2023-11-06 21:57:23,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:57:23,026 INFO L495 AbstractCegarLoop]: Abstraction has 3125 states and 4011 transitions. [2023-11-06 21:57:23,026 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 3 states have internal predecessors, (53), 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-06 21:57:23,026 INFO L276 IsEmpty]: Start isEmpty. Operand 3125 states and 4011 transitions. [2023-11-06 21:57:23,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2023-11-06 21:57:23,031 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:57:23,032 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, 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] [2023-11-06 21:57:23,032 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-06 21:57:23,032 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-06 21:57:23,032 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:57:23,033 INFO L85 PathProgramCache]: Analyzing trace with hash -1024919005, now seen corresponding path program 1 times [2023-11-06 21:57:23,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:57:23,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955860717] [2023-11-06 21:57:23,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:57:23,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:57:23,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:23,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 21:57:23,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:23,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 21:57:23,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:23,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 21:57:23,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:23,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 21:57:23,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:23,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-06 21:57:23,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:23,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-11-06 21:57:23,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:23,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-06 21:57:23,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:23,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-06 21:57:23,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:23,150 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-11-06 21:57:23,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:57:23,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955860717] [2023-11-06 21:57:23,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955860717] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:57:23,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:57:23,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-06 21:57:23,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587214340] [2023-11-06 21:57:23,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:57:23,152 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 21:57:23,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:57:23,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 21:57:23,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-06 21:57:23,153 INFO L87 Difference]: Start difference. First operand 3125 states and 4011 transitions. Second operand has 7 states, 7 states have (on average 9.0) internal successors, (63), 5 states have internal predecessors, (63), 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-06 21:57:24,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:57:24,456 INFO L93 Difference]: Finished difference Result 5468 states and 7103 transitions. [2023-11-06 21:57:24,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-11-06 21:57:24,457 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 5 states have internal predecessors, (63), 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 93 [2023-11-06 21:57:24,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:57:24,483 INFO L225 Difference]: With dead ends: 5468 [2023-11-06 21:57:24,484 INFO L226 Difference]: Without dead ends: 3435 [2023-11-06 21:57:24,492 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-06 21:57:24,493 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 1051 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 606 mSolverCounterSat, 253 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1065 SdHoareTripleChecker+Valid, 615 SdHoareTripleChecker+Invalid, 859 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 253 IncrementalHoareTripleChecker+Valid, 606 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-06 21:57:24,494 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1065 Valid, 615 Invalid, 859 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [253 Valid, 606 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-06 21:57:24,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3435 states. [2023-11-06 21:57:24,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3435 to 3125. [2023-11-06 21:57:24,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3125 states, 2560 states have (on average 1.271484375) internal successors, (3255), 2615 states have internal predecessors, (3255), 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-06 21:57:24,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3125 states to 3125 states and 3956 transitions. [2023-11-06 21:57:24,962 INFO L78 Accepts]: Start accepts. Automaton has 3125 states and 3956 transitions. Word has length 93 [2023-11-06 21:57:24,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:57:24,963 INFO L495 AbstractCegarLoop]: Abstraction has 3125 states and 3956 transitions. [2023-11-06 21:57:24,963 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 5 states have internal predecessors, (63), 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-06 21:57:24,963 INFO L276 IsEmpty]: Start isEmpty. Operand 3125 states and 3956 transitions. [2023-11-06 21:57:24,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2023-11-06 21:57:24,965 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:57:24,965 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, 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, 1, 1, 1, 1] [2023-11-06 21:57:24,965 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-06 21:57:24,966 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-06 21:57:24,967 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:57:24,967 INFO L85 PathProgramCache]: Analyzing trace with hash 1670091637, now seen corresponding path program 1 times [2023-11-06 21:57:24,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:57:24,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840413154] [2023-11-06 21:57:24,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:57:24,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:57:24,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:25,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-06 21:57:25,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:25,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 21:57:25,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:25,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-06 21:57:25,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:25,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 21:57:25,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:25,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-06 21:57:25,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:25,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-06 21:57:25,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:25,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-06 21:57:25,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:25,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-06 21:57:25,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:57:25,062 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-11-06 21:57:25,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:57:25,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840413154] [2023-11-06 21:57:25,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840413154] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:57:25,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:57:25,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 21:57:25,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382860378] [2023-11-06 21:57:25,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:57:25,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 21:57:25,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:57:25,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 21:57:25,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 21:57:25,065 INFO L87 Difference]: Start difference. First operand 3125 states and 3956 transitions. Second operand has 5 states, 4 states have (on average 16.5) internal successors, (66), 3 states have internal predecessors, (66), 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-06 21:57:25,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 21:57:25,700 INFO L93 Difference]: Finished difference Result 3518 states and 4474 transitions. [2023-11-06 21:57:25,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 21:57:25,705 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.5) internal successors, (66), 3 states have internal predecessors, (66), 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 100 [2023-11-06 21:57:25,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 21:57:25,725 INFO L225 Difference]: With dead ends: 3518 [2023-11-06 21:57:25,726 INFO L226 Difference]: Without dead ends: 3517 [2023-11-06 21:57:25,728 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-06 21:57:25,729 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 269 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 21:57:25,729 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [286 Valid, 230 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 21:57:25,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3517 states. [2023-11-06 21:57:26,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3517 to 3124. [2023-11-06 21:57:26,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3124 states, 2560 states have (on average 1.26796875) internal successors, (3246), 2614 states have internal predecessors, (3246), 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-06 21:57:26,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3124 states to 3124 states and 3947 transitions. [2023-11-06 21:57:26,296 INFO L78 Accepts]: Start accepts. Automaton has 3124 states and 3947 transitions. Word has length 100 [2023-11-06 21:57:26,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 21:57:26,296 INFO L495 AbstractCegarLoop]: Abstraction has 3124 states and 3947 transitions. [2023-11-06 21:57:26,296 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.5) internal successors, (66), 3 states have internal predecessors, (66), 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-06 21:57:26,297 INFO L276 IsEmpty]: Start isEmpty. Operand 3124 states and 3947 transitions. [2023-11-06 21:57:26,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2023-11-06 21:57:26,298 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 21:57:26,299 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, 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, 1, 1, 1, 1, 1] [2023-11-06 21:57:26,299 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-06 21:57:26,299 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-06 21:57:26,300 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:57:26,300 INFO L85 PathProgramCache]: Analyzing trace with hash 233233506, now seen corresponding path program 1 times [2023-11-06 21:57:26,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:57:26,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167202191] [2023-11-06 21:57:26,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:57:26,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:57:26,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 21:57:26,328 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 21:57:26,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 21:57:26,380 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 21:57:26,380 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-06 21:57:26,383 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2023-11-06 21:57:26,385 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2023-11-06 21:57:26,385 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2023-11-06 21:57:26,386 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2023-11-06 21:57:26,386 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-06 21:57:26,390 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-06 21:57:26,396 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 21:57:26,503 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 09:57:26 BoogieIcfgContainer [2023-11-06 21:57:26,503 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 21:57:26,504 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 21:57:26,504 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 21:57:26,504 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 21:57:26,505 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:57:04" (3/4) ... [2023-11-06 21:57:26,506 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-11-06 21:57:26,609 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42ae59d5-8c4b-4d0f-babf-fc943224b68f/bin/uautomizer-verify-WvqO1wxjHP/witness.graphml.graphml [2023-11-06 21:57:26,609 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 21:57:26,610 INFO L158 Benchmark]: Toolchain (without parser) took 23705.98ms. Allocated memory was 146.8MB in the beginning and 673.2MB in the end (delta: 526.4MB). Free memory was 103.2MB in the beginning and 414.7MB in the end (delta: -311.5MB). Peak memory consumption was 218.0MB. Max. memory is 16.1GB. [2023-11-06 21:57:26,610 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 96.5MB. Free memory is still 47.7MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 21:57:26,610 INFO L158 Benchmark]: CACSL2BoogieTranslator took 432.73ms. Allocated memory is still 146.8MB. Free memory was 102.8MB in the beginning and 89.9MB in the end (delta: 12.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-06 21:57:26,611 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.49ms. Allocated memory is still 146.8MB. Free memory was 89.9MB in the beginning and 87.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 21:57:26,611 INFO L158 Benchmark]: Boogie Preprocessor took 36.96ms. Allocated memory is still 146.8MB. Free memory was 87.8MB in the beginning and 86.4MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 21:57:26,611 INFO L158 Benchmark]: RCFGBuilder took 612.73ms. Allocated memory is still 146.8MB. Free memory was 86.0MB in the beginning and 107.9MB in the end (delta: -21.8MB). Peak memory consumption was 11.3MB. Max. memory is 16.1GB. [2023-11-06 21:57:26,612 INFO L158 Benchmark]: TraceAbstraction took 22455.46ms. Allocated memory was 146.8MB in the beginning and 673.2MB in the end (delta: 526.4MB). Free memory was 107.2MB in the beginning and 421.0MB in the end (delta: -313.8MB). Peak memory consumption was 215.0MB. Max. memory is 16.1GB. [2023-11-06 21:57:26,612 INFO L158 Benchmark]: Witness Printer took 105.07ms. Allocated memory is still 673.2MB. Free memory was 421.0MB in the beginning and 414.7MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-11-06 21:57:26,614 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.30ms. Allocated memory is still 96.5MB. Free memory is still 47.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 432.73ms. Allocated memory is still 146.8MB. Free memory was 102.8MB in the beginning and 89.9MB in the end (delta: 12.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.49ms. Allocated memory is still 146.8MB. Free memory was 89.9MB in the beginning and 87.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 36.96ms. Allocated memory is still 146.8MB. Free memory was 87.8MB in the beginning and 86.4MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 612.73ms. Allocated memory is still 146.8MB. Free memory was 86.0MB in the beginning and 107.9MB in the end (delta: -21.8MB). Peak memory consumption was 11.3MB. Max. memory is 16.1GB. * TraceAbstraction took 22455.46ms. Allocated memory was 146.8MB in the beginning and 673.2MB in the end (delta: 526.4MB). Free memory was 107.2MB in the beginning and 421.0MB in the end (delta: -313.8MB). Peak memory consumption was 215.0MB. Max. memory is 16.1GB. * Witness Printer took 105.07ms. Allocated memory is still 673.2MB. Free memory was 421.0MB in the beginning and 414.7MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * 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: 119]: 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 ; VAL [E_1=2, E_M=2, M_E=2, T1_E=2, local=0, m_i=0, m_pc=0, m_st=0, t1_i=0, t1_pc=0, t1_st=0, token=0] [L485] int __retres1 ; [L489] CALL init_model() [L400] m_i = 1 [L401] t1_i = 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] [L489] RET init_model() [L490] CALL start_simulation() [L426] int kernel_st ; [L427] int tmp ; [L428] int tmp___0 ; [L432] 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] [L433] 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] [L434] CALL init_threads() [L182] COND TRUE m_i == 1 [L183] 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] [L187] COND TRUE t1_i == 1 [L188] 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] [L434] RET init_threads() [L435] 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] [L271] 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] [L276] 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] [L281] 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] [L286] 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] [L435] 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] [L436] 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] [L324] int tmp ; [L325] int tmp___0 ; [L329] CALL, EXPR is_master_triggered() [L133] 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] [L136] 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] [L146] __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] [L148] return (__retres1); VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, \result=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] [L329] RET, EXPR is_master_triggered() [L329] tmp = is_master_triggered() [L331] 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] [L337] CALL, EXPR is_transmit1_triggered() [L152] 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] [L155] 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] [L165] __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] [L167] return (__retres1); VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \old(m_st)=0, \old(t1_st)=0, \result=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] [L337] RET, EXPR is_transmit1_triggered() [L337] tmp___0 = is_transmit1_triggered() [L339] 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] [L436] 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] [L437] 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] [L299] 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] [L304] 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] [L309] 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] [L314] 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] [L437] 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] [L440] COND TRUE 1 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] [L443] kernel_st = 1 [L444] CALL eval() [L218] 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] [L222] 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] [L225] 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] [L197] 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] [L200] COND TRUE m_st == 0 [L201] __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] [L213] return (__retres1); VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \result=1, __retres1=1, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L225] RET, EXPR exists_runnable_thread() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, exists_runnable_thread()=1, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=0, t1_st=0, token=0] [L225] tmp = exists_runnable_thread() [L227] 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] [L232] COND TRUE m_st == 0 [L233] int tmp_ndt_1; [L234] EXPR tmp_ndt_1 = __VERIFIER_nondet_int() [L235] 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] [L232-L243] { 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] [L246] COND TRUE t1_st == 0 [L247] int tmp_ndt_2; [L248] EXPR tmp_ndt_2 = __VERIFIER_nondet_int() [L249] COND TRUE, EXPR \read(tmp_ndt_2) [L251] EXPR t1_st = 1 [L252] CALL, EXPR transmit1() [L100] 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] [L111] 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=1, token=0] [L113] t1_pc = 1 [L114] 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] [L252] RET, EXPR transmit1() [L246-L257] { 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] [L222] 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] [L225] 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] [L197] 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] [L200] COND TRUE m_st == 0 [L201] __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] [L213] return (__retres1); VAL [E_1=2, E_M=2, M_E=2, T1_E=2, \result=1, __retres1=1, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, token=0] [L225] RET, EXPR exists_runnable_thread() VAL [E_1=2, E_M=2, M_E=2, T1_E=2, exists_runnable_thread()=1, local=0, m_i=1, m_pc=0, m_st=0, t1_i=1, t1_pc=1, t1_st=2, tmp=1, token=0] [L225] tmp = exists_runnable_thread() [L227] 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] [L232] COND TRUE m_st == 0 [L233] int tmp_ndt_1; [L234] EXPR tmp_ndt_1 = __VERIFIER_nondet_int() [L235] COND TRUE, EXPR \read(tmp_ndt_1) [L237] EXPR m_st = 1 [L238] CALL, EXPR master() [L42] int tmp_var = __VERIFIER_nondet_int(); [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, tmp_var=0, token=0] [L55] 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=1, t1_i=1, t1_pc=1, t1_st=2, tmp_var=0, token=0] [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, tmp_var=0, 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] [L353] 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] [L324] int tmp ; [L325] int tmp___0 ; [L329] CALL, EXPR is_master_triggered() [L133] 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] [L136] 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] [L146] __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] [L148] return (__retres1); VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, \result=0, __retres1=0, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=2147483647] [L329] RET, EXPR is_master_triggered() [L329] tmp = is_master_triggered() [L331] 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] [L337] CALL, EXPR is_transmit1_triggered() [L152] 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] [L155] 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] [L156] COND TRUE E_1 == 1 [L157] __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] [L167] return (__retres1); VAL [E_1=1, E_M=2, M_E=2, T1_E=2, \old(m_st)=1, \old(t1_st)=2, \result=1, __retres1=1, local=2147483647, m_i=1, m_pc=0, m_st=1, t1_i=1, t1_pc=1, t1_st=2, token=2147483647] [L337] RET, EXPR is_transmit1_triggered() [L337] tmp___0 = is_transmit1_triggered() [L339] COND TRUE \read(tmp___0) [L340] 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] [L353] 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, tmp_var=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, tmp_var=0, token=2147483647] [L238] RET, EXPR master() [L232-L243] { 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] [L246] COND TRUE t1_st == 0 [L247] int tmp_ndt_2; [L248] tmp_ndt_2 = __VERIFIER_nondet_int() [L249] COND TRUE \read(tmp_ndt_2) [L251] t1_st = 1 [L252] CALL transmit1() [L100] 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] [L103] 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] [L119] 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: 119]: 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 8 procedures, 124 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 22.3s, OverallIterations: 19, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 14.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 7101 SdHoareTripleChecker+Valid, 7.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6918 mSDsluCounter, 9249 SdHoareTripleChecker+Invalid, 6.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6810 mSDsCounter, 1272 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7766 IncrementalHoareTripleChecker+Invalid, 9038 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1272 mSolverCounterUnsat, 2439 mSDtfsCounter, 7766 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 498 GetRequests, 277 SyntacticMatches, 0 SemanticMatches, 221 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 560 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3908occurred in iteration=14, InterpolantAutomatonStates: 219, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 4.4s AutomataMinimizationTime, 18 MinimizatonAttempts, 4363 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 1279 NumberOfCodeBlocks, 1279 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 1160 ConstructedInterpolants, 0 QuantifiedInterpolants, 2539 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 121/121 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-06 21:57:26,636 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_42ae59d5-8c4b-4d0f-babf-fc943224b68f/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with 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)