./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/loops-crafted-1/discover_list.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 9bd2c7ff Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_055cae4c-1377-4791-879a-9a4b4722b208/bin/uautomizer-verify-uCwYo4JHxu/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_055cae4c-1377-4791-879a-9a4b4722b208/bin/uautomizer-verify-uCwYo4JHxu/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_055cae4c-1377-4791-879a-9a4b4722b208/bin/uautomizer-verify-uCwYo4JHxu/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_055cae4c-1377-4791-879a-9a4b4722b208/bin/uautomizer-verify-uCwYo4JHxu/config/AutomizerReach.xml -i ../../sv-benchmarks/c/loops-crafted-1/discover_list.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_055cae4c-1377-4791-879a-9a4b4722b208/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_055cae4c-1377-4791-879a-9a4b4722b208/bin/uautomizer-verify-uCwYo4JHxu --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b98ece0168fde0a9f5db629b0589397995dd8e9526df8a73dd8042a19f16d948 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-9bd2c7f [2023-11-19 07:34:50,175 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-19 07:34:50,281 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_055cae4c-1377-4791-879a-9a4b4722b208/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Overflow-32bit-Automizer_Default.epf [2023-11-19 07:34:50,287 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-19 07:34:50,288 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-19 07:34:50,316 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-19 07:34:50,316 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-19 07:34:50,317 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-19 07:34:50,318 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-19 07:34:50,319 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-19 07:34:50,320 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-19 07:34:50,320 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-19 07:34:50,321 INFO L153 SettingsManager]: * Use SBE=true [2023-11-19 07:34:50,322 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-19 07:34:50,322 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-19 07:34:50,323 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-19 07:34:50,324 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-19 07:34:50,324 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-19 07:34:50,325 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-19 07:34:50,325 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-19 07:34:50,326 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-19 07:34:50,327 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-19 07:34:50,327 INFO L153 SettingsManager]: * Check absence of signed integer overflows=true [2023-11-19 07:34:50,328 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-19 07:34:50,329 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-19 07:34:50,329 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-19 07:34:50,330 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-19 07:34:50,331 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-19 07:34:50,331 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-19 07:34:50,332 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-19 07:34:50,332 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:34:50,333 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-19 07:34:50,334 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-19 07:34:50,334 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-19 07:34:50,335 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-19 07:34:50,335 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-19 07:34:50,336 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-19 07:34:50,337 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-19 07:34:50,337 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-19 07:34:50,337 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-19 07:34:50,338 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-19 07:34:50,339 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_055cae4c-1377-4791-879a-9a4b4722b208/bin/uautomizer-verify-uCwYo4JHxu/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_055cae4c-1377-4791-879a-9a4b4722b208/bin/uautomizer-verify-uCwYo4JHxu Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b98ece0168fde0a9f5db629b0589397995dd8e9526df8a73dd8042a19f16d948 [2023-11-19 07:34:50,643 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-19 07:34:50,676 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-19 07:34:50,678 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-19 07:34:50,680 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-19 07:34:50,680 INFO L274 PluginConnector]: CDTParser initialized [2023-11-19 07:34:50,682 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_055cae4c-1377-4791-879a-9a4b4722b208/bin/uautomizer-verify-uCwYo4JHxu/../../sv-benchmarks/c/loops-crafted-1/discover_list.c [2023-11-19 07:34:53,778 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-19 07:34:54,070 INFO L384 CDTParser]: Found 1 translation units. [2023-11-19 07:34:54,071 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_055cae4c-1377-4791-879a-9a4b4722b208/sv-benchmarks/c/loops-crafted-1/discover_list.c [2023-11-19 07:34:54,094 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_055cae4c-1377-4791-879a-9a4b4722b208/bin/uautomizer-verify-uCwYo4JHxu/data/48eb7ba5d/0ea7c24ee2dc42c197bc42276d4139b2/FLAGd9cc97e12 [2023-11-19 07:34:54,108 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_055cae4c-1377-4791-879a-9a4b4722b208/bin/uautomizer-verify-uCwYo4JHxu/data/48eb7ba5d/0ea7c24ee2dc42c197bc42276d4139b2 [2023-11-19 07:34:54,112 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-19 07:34:54,114 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-19 07:34:54,116 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-19 07:34:54,116 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-19 07:34:54,122 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-19 07:34:54,123 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:34:54" (1/1) ... [2023-11-19 07:34:54,125 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@792732f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:34:54, skipping insertion in model container [2023-11-19 07:34:54,125 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:34:54" (1/1) ... [2023-11-19 07:34:54,169 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-19 07:34:54,569 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:34:54,592 INFO L202 MainTranslator]: Completed pre-run [2023-11-19 07:34:54,696 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:34:54,728 WARN L675 CHandler]: The function smp_send_req is called, but not defined or handled by StandardFunctionHandler. [2023-11-19 07:34:54,728 WARN L675 CHandler]: The function toupper is called, but not defined or handled by StandardFunctionHandler. [2023-11-19 07:34:54,729 WARN L675 CHandler]: The function sprintf is called, but not defined or handled by StandardFunctionHandler. [2023-11-19 07:34:54,737 INFO L206 MainTranslator]: Completed translation [2023-11-19 07:34:54,737 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:34:54 WrapperNode [2023-11-19 07:34:54,738 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-19 07:34:54,739 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-19 07:34:54,739 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-19 07:34:54,739 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-19 07:34:54,748 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:34:54" (1/1) ... [2023-11-19 07:34:54,781 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:34:54" (1/1) ... [2023-11-19 07:34:54,853 INFO L138 Inliner]: procedures = 36, calls = 643, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 569 [2023-11-19 07:34:54,854 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-19 07:34:54,855 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-19 07:34:54,855 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-19 07:34:54,855 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-19 07:34:54,866 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:34:54" (1/1) ... [2023-11-19 07:34:54,866 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:34:54" (1/1) ... [2023-11-19 07:34:54,873 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:34:54" (1/1) ... [2023-11-19 07:34:54,873 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:34:54" (1/1) ... [2023-11-19 07:34:54,898 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:34:54" (1/1) ... [2023-11-19 07:34:54,905 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:34:54" (1/1) ... [2023-11-19 07:34:54,923 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:34:54" (1/1) ... [2023-11-19 07:34:54,927 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:34:54" (1/1) ... [2023-11-19 07:34:54,937 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-19 07:34:54,938 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-19 07:34:54,938 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-19 07:34:54,938 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-19 07:34:54,939 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:34:54" (1/1) ... [2023-11-19 07:34:54,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:34:54,964 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_055cae4c-1377-4791-879a-9a4b4722b208/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:34:54,986 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_055cae4c-1377-4791-879a-9a4b4722b208/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-19 07:34:55,008 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_055cae4c-1377-4791-879a-9a4b4722b208/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-19 07:34:55,035 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-19 07:34:55,035 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-19 07:34:55,035 INFO L130 BoogieDeclarations]: Found specification of procedure sprintf [2023-11-19 07:34:55,036 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-19 07:34:55,038 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-19 07:34:55,038 INFO L130 BoogieDeclarations]: Found specification of procedure smp_send_req [2023-11-19 07:34:55,038 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2023-11-19 07:34:55,039 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2023-11-19 07:34:55,039 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-19 07:34:55,039 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-19 07:34:55,040 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-19 07:34:55,041 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-19 07:34:55,042 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-11-19 07:34:55,043 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-11-19 07:34:55,043 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-19 07:34:55,191 INFO L236 CfgBuilder]: Building ICFG [2023-11-19 07:34:55,193 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-19 07:34:56,075 INFO L277 CfgBuilder]: Performing block encoding [2023-11-19 07:34:56,085 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-19 07:34:56,085 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-19 07:34:56,090 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:34:56 BoogieIcfgContainer [2023-11-19 07:34:56,091 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-19 07:34:56,094 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-19 07:34:56,094 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-19 07:34:56,097 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-19 07:34:56,097 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 07:34:54" (1/3) ... [2023-11-19 07:34:56,098 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b24b96d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:34:56, skipping insertion in model container [2023-11-19 07:34:56,098 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:34:54" (2/3) ... [2023-11-19 07:34:56,099 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b24b96d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:34:56, skipping insertion in model container [2023-11-19 07:34:56,099 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:34:56" (3/3) ... [2023-11-19 07:34:56,100 INFO L112 eAbstractionObserver]: Analyzing ICFG discover_list.c [2023-11-19 07:34:56,125 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-19 07:34:56,125 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 42 error locations. [2023-11-19 07:34:56,191 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 07:34:56,198 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@44750a35, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-19 07:34:56,199 INFO L358 AbstractCegarLoop]: Starting to check reachability of 42 error locations. [2023-11-19 07:34:56,203 INFO L276 IsEmpty]: Start isEmpty. Operand has 159 states, 106 states have (on average 1.7452830188679245) internal successors, (185), 148 states have internal predecessors, (185), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-19 07:34:56,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2023-11-19 07:34:56,208 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:34:56,209 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2023-11-19 07:34:56,210 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2023-11-19 07:34:56,214 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:34:56,214 INFO L85 PathProgramCache]: Analyzing trace with hash 37800, now seen corresponding path program 1 times [2023-11-19 07:34:56,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:34:56,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955123754] [2023-11-19 07:34:56,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:34:56,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:34:56,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:34:56,795 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-19 07:34:56,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:34:56,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955123754] [2023-11-19 07:34:56,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955123754] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:34:56,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:34:56,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 07:34:56,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539974624] [2023-11-19 07:34:56,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:34:56,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 07:34:56,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:34:56,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:34:56,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:34:56,855 INFO L87 Difference]: Start difference. First operand has 159 states, 106 states have (on average 1.7452830188679245) internal successors, (185), 148 states have internal predecessors, (185), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:34:56,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:34:56,939 INFO L93 Difference]: Finished difference Result 300 states and 384 transitions. [2023-11-19 07:34:56,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:34:56,942 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2023-11-19 07:34:56,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:34:56,951 INFO L225 Difference]: With dead ends: 300 [2023-11-19 07:34:56,951 INFO L226 Difference]: Without dead ends: 140 [2023-11-19 07:34:56,955 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:34:56,959 INFO L413 NwaCegarLoop]: 188 mSDtfsCounter, 163 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 07:34:56,960 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 207 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 07:34:56,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2023-11-19 07:34:57,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2023-11-19 07:34:57,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 92 states have (on average 1.6195652173913044) internal successors, (149), 129 states have internal predecessors, (149), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-19 07:34:57,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 165 transitions. [2023-11-19 07:34:57,015 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 165 transitions. Word has length 3 [2023-11-19 07:34:57,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:34:57,015 INFO L495 AbstractCegarLoop]: Abstraction has 140 states and 165 transitions. [2023-11-19 07:34:57,015 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-19 07:34:57,016 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 165 transitions. [2023-11-19 07:34:57,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-19 07:34:57,017 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:34:57,018 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] [2023-11-19 07:34:57,018 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-19 07:34:57,018 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2023-11-19 07:34:57,019 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:34:57,019 INFO L85 PathProgramCache]: Analyzing trace with hash -68542022, now seen corresponding path program 1 times [2023-11-19 07:34:57,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:34:57,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007512902] [2023-11-19 07:34:57,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:34:57,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:34:57,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:34:57,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-19 07:34:57,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:34:57,304 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-19 07:34:57,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:34:57,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007512902] [2023-11-19 07:34:57,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007512902] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:34:57,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:34:57,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-19 07:34:57,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281180131] [2023-11-19 07:34:57,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:34:57,313 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 07:34:57,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:34:57,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 07:34:57,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-19 07:34:57,317 INFO L87 Difference]: Start difference. First operand 140 states and 165 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-19 07:34:57,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:34:57,625 INFO L93 Difference]: Finished difference Result 277 states and 329 transitions. [2023-11-19 07:34:57,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 07:34:57,626 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2023-11-19 07:34:57,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:34:57,634 INFO L225 Difference]: With dead ends: 277 [2023-11-19 07:34:57,634 INFO L226 Difference]: Without dead ends: 146 [2023-11-19 07:34:57,640 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-19 07:34:57,641 INFO L413 NwaCegarLoop]: 156 mSDtfsCounter, 8 mSDsluCounter, 510 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 666 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-19 07:34:57,642 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 666 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-19 07:34:57,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2023-11-19 07:34:57,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 142. [2023-11-19 07:34:57,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 94 states have (on average 1.6063829787234043) internal successors, (151), 131 states have internal predecessors, (151), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-19 07:34:57,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 167 transitions. [2023-11-19 07:34:57,662 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 167 transitions. Word has length 25 [2023-11-19 07:34:57,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:34:57,662 INFO L495 AbstractCegarLoop]: Abstraction has 142 states and 167 transitions. [2023-11-19 07:34:57,662 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-19 07:34:57,663 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 167 transitions. [2023-11-19 07:34:57,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-19 07:34:57,663 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:34:57,664 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] [2023-11-19 07:34:57,664 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-19 07:34:57,664 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2023-11-19 07:34:57,665 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:34:57,665 INFO L85 PathProgramCache]: Analyzing trace with hash -1656889924, now seen corresponding path program 1 times [2023-11-19 07:34:57,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:34:57,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563854694] [2023-11-19 07:34:57,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:34:57,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:34:57,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:34:57,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-19 07:34:57,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:34:57,846 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-19 07:34:57,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:34:57,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563854694] [2023-11-19 07:34:57,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563854694] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:34:57,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:34:57,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 07:34:57,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334689487] [2023-11-19 07:34:57,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:34:57,849 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:34:57,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:34:57,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:34:57,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:34:57,850 INFO L87 Difference]: Start difference. First operand 142 states and 167 transitions. Second operand has 5 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-19 07:34:58,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:34:58,018 INFO L93 Difference]: Finished difference Result 151 states and 181 transitions. [2023-11-19 07:34:58,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 07:34:58,019 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2023-11-19 07:34:58,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:34:58,020 INFO L225 Difference]: With dead ends: 151 [2023-11-19 07:34:58,021 INFO L226 Difference]: Without dead ends: 147 [2023-11-19 07:34:58,021 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:34:58,023 INFO L413 NwaCegarLoop]: 147 mSDtfsCounter, 132 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 07:34:58,023 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 376 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 07:34:58,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2023-11-19 07:34:58,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 144. [2023-11-19 07:34:58,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 98 states have (on average 1.5612244897959184) internal successors, (153), 133 states have internal predecessors, (153), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-19 07:34:58,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 169 transitions. [2023-11-19 07:34:58,041 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 169 transitions. Word has length 25 [2023-11-19 07:34:58,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:34:58,041 INFO L495 AbstractCegarLoop]: Abstraction has 144 states and 169 transitions. [2023-11-19 07:34:58,042 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-19 07:34:58,042 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 169 transitions. [2023-11-19 07:34:58,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-11-19 07:34:58,043 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:34:58,043 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] [2023-11-19 07:34:58,044 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-19 07:34:58,044 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2023-11-19 07:34:58,045 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:34:58,045 INFO L85 PathProgramCache]: Analyzing trace with hash 1066852143, now seen corresponding path program 1 times [2023-11-19 07:34:58,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:34:58,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083530894] [2023-11-19 07:34:58,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:34:58,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:34:58,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:34:58,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-19 07:34:58,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:34:58,181 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-19 07:34:58,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:34:58,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083530894] [2023-11-19 07:34:58,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083530894] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:34:58,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:34:58,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-19 07:34:58,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588611199] [2023-11-19 07:34:58,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:34:58,183 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:34:58,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:34:58,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:34:58,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:34:58,185 INFO L87 Difference]: Start difference. First operand 144 states and 169 transitions. Second operand has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-19 07:34:58,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:34:58,308 INFO L93 Difference]: Finished difference Result 153 states and 181 transitions. [2023-11-19 07:34:58,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:34:58,309 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2023-11-19 07:34:58,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:34:58,310 INFO L225 Difference]: With dead ends: 153 [2023-11-19 07:34:58,311 INFO L226 Difference]: Without dead ends: 151 [2023-11-19 07:34:58,311 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:34:58,313 INFO L413 NwaCegarLoop]: 159 mSDtfsCounter, 8 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 07:34:58,313 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 416 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 07:34:58,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2023-11-19 07:34:58,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 144. [2023-11-19 07:34:58,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 98 states have (on average 1.5612244897959184) internal successors, (153), 133 states have internal predecessors, (153), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-19 07:34:58,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 169 transitions. [2023-11-19 07:34:58,328 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 169 transitions. Word has length 31 [2023-11-19 07:34:58,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:34:58,329 INFO L495 AbstractCegarLoop]: Abstraction has 144 states and 169 transitions. [2023-11-19 07:34:58,329 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-19 07:34:58,329 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 169 transitions. [2023-11-19 07:34:58,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-11-19 07:34:58,331 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:34:58,331 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] [2023-11-19 07:34:58,331 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-19 07:34:58,331 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2023-11-19 07:34:58,332 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:34:58,332 INFO L85 PathProgramCache]: Analyzing trace with hash 1066854065, now seen corresponding path program 1 times [2023-11-19 07:34:58,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:34:58,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059199903] [2023-11-19 07:34:58,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:34:58,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:34:58,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:34:58,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-19 07:34:58,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:34:58,450 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-19 07:34:58,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:34:58,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059199903] [2023-11-19 07:34:58,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059199903] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:34:58,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:34:58,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 07:34:58,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050396086] [2023-11-19 07:34:58,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:34:58,452 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:34:58,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:34:58,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:34:58,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:34:58,454 INFO L87 Difference]: Start difference. First operand 144 states and 169 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-19 07:34:58,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:34:58,637 INFO L93 Difference]: Finished difference Result 355 states and 415 transitions. [2023-11-19 07:34:58,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 07:34:58,638 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2023-11-19 07:34:58,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:34:58,642 INFO L225 Difference]: With dead ends: 355 [2023-11-19 07:34:58,642 INFO L226 Difference]: Without dead ends: 247 [2023-11-19 07:34:58,644 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-19 07:34:58,646 INFO L413 NwaCegarLoop]: 236 mSDtfsCounter, 107 mSDsluCounter, 546 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 782 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 07:34:58,649 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 782 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 07:34:58,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2023-11-19 07:34:58,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 146. [2023-11-19 07:34:58,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 100 states have (on average 1.55) internal successors, (155), 135 states have internal predecessors, (155), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-19 07:34:58,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 171 transitions. [2023-11-19 07:34:58,682 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 171 transitions. Word has length 31 [2023-11-19 07:34:58,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:34:58,683 INFO L495 AbstractCegarLoop]: Abstraction has 146 states and 171 transitions. [2023-11-19 07:34:58,683 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-19 07:34:58,683 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 171 transitions. [2023-11-19 07:34:58,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-11-19 07:34:58,686 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:34:58,686 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] [2023-11-19 07:34:58,686 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-19 07:34:58,687 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2023-11-19 07:34:58,687 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:34:58,688 INFO L85 PathProgramCache]: Analyzing trace with hash 1116724199, now seen corresponding path program 1 times [2023-11-19 07:34:58,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:34:58,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231392295] [2023-11-19 07:34:58,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:34:58,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:34:58,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:34:58,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-19 07:34:58,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:34:59,052 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-19 07:34:59,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:34:59,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231392295] [2023-11-19 07:34:59,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231392295] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:34:59,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:34:59,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 07:34:59,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904886350] [2023-11-19 07:34:59,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:34:59,054 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:34:59,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:34:59,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:34:59,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:34:59,062 INFO L87 Difference]: Start difference. First operand 146 states and 171 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-19 07:34:59,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:34:59,196 INFO L93 Difference]: Finished difference Result 277 states and 325 transitions. [2023-11-19 07:34:59,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 07:34:59,197 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2023-11-19 07:34:59,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:34:59,199 INFO L225 Difference]: With dead ends: 277 [2023-11-19 07:34:59,199 INFO L226 Difference]: Without dead ends: 147 [2023-11-19 07:34:59,200 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-19 07:34:59,203 INFO L413 NwaCegarLoop]: 158 mSDtfsCounter, 8 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 578 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 07:34:59,206 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 578 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 07:34:59,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2023-11-19 07:34:59,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2023-11-19 07:34:59,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 101 states have (on average 1.5445544554455446) internal successors, (156), 136 states have internal predecessors, (156), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-19 07:34:59,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 172 transitions. [2023-11-19 07:34:59,220 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 172 transitions. Word has length 31 [2023-11-19 07:34:59,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:34:59,222 INFO L495 AbstractCegarLoop]: Abstraction has 147 states and 172 transitions. [2023-11-19 07:34:59,222 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-19 07:34:59,222 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 172 transitions. [2023-11-19 07:34:59,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-11-19 07:34:59,227 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:34:59,227 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] [2023-11-19 07:34:59,228 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-19 07:34:59,229 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2023-11-19 07:34:59,229 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:34:59,229 INFO L85 PathProgramCache]: Analyzing trace with hash -764469213, now seen corresponding path program 1 times [2023-11-19 07:34:59,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:34:59,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537544103] [2023-11-19 07:34:59,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:34:59,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:34:59,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:34:59,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-19 07:34:59,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:34:59,682 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:34:59,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:34:59,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537544103] [2023-11-19 07:34:59,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537544103] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 07:34:59,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1610101100] [2023-11-19 07:34:59,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:34:59,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 07:34:59,684 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_055cae4c-1377-4791-879a-9a4b4722b208/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:34:59,692 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_055cae4c-1377-4791-879a-9a4b4722b208/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 07:34:59,720 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_055cae4c-1377-4791-879a-9a4b4722b208/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-19 07:34:59,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:34:59,912 INFO L262 TraceCheckSpWp]: Trace formula consists of 552 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-19 07:34:59,919 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 07:34:59,989 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:34:59,990 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 07:35:00,089 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:35:00,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1610101100] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-19 07:35:00,090 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-19 07:35:00,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2023-11-19 07:35:00,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346905126] [2023-11-19 07:35:00,091 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-19 07:35:00,091 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-19 07:35:00,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:35:00,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-19 07:35:00,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2023-11-19 07:35:00,094 INFO L87 Difference]: Start difference. First operand 147 states and 172 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 1 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-19 07:35:00,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:35:00,398 INFO L93 Difference]: Finished difference Result 287 states and 339 transitions. [2023-11-19 07:35:00,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-19 07:35:00,399 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 1 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 32 [2023-11-19 07:35:00,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:35:00,401 INFO L225 Difference]: With dead ends: 287 [2023-11-19 07:35:00,401 INFO L226 Difference]: Without dead ends: 156 [2023-11-19 07:35:00,402 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=211, Unknown=0, NotChecked=0, Total=306 [2023-11-19 07:35:00,403 INFO L413 NwaCegarLoop]: 157 mSDtfsCounter, 13 mSDsluCounter, 423 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 580 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 07:35:00,404 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 580 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 07:35:00,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2023-11-19 07:35:00,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2023-11-19 07:35:00,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 109 states have (on average 1.5321100917431192) internal successors, (167), 144 states have internal predecessors, (167), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-19 07:35:00,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 183 transitions. [2023-11-19 07:35:00,415 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 183 transitions. Word has length 32 [2023-11-19 07:35:00,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:35:00,416 INFO L495 AbstractCegarLoop]: Abstraction has 156 states and 183 transitions. [2023-11-19 07:35:00,416 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 10 states have internal predecessors, (38), 1 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-11-19 07:35:00,416 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 183 transitions. [2023-11-19 07:35:00,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-11-19 07:35:00,420 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:35:00,420 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 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-19 07:35:00,452 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_055cae4c-1377-4791-879a-9a4b4722b208/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-19 07:35:00,636 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_055cae4c-1377-4791-879a-9a4b4722b208/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 07:35:00,636 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 39 more)] === [2023-11-19 07:35:00,637 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:35:00,637 INFO L85 PathProgramCache]: Analyzing trace with hash -497218841, now seen corresponding path program 2 times [2023-11-19 07:35:00,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:35:00,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230581214] [2023-11-19 07:35:00,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:35:00,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:35:00,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:35:00,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-19 07:35:00,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:35:01,121 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:35:01,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:35:01,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230581214] [2023-11-19 07:35:01,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230581214] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 07:35:01,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1491425145] [2023-11-19 07:35:01,122 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-19 07:35:01,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 07:35:01,123 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_055cae4c-1377-4791-879a-9a4b4722b208/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:35:01,124 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_055cae4c-1377-4791-879a-9a4b4722b208/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 07:35:01,148 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_055cae4c-1377-4791-879a-9a4b4722b208/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-19 07:35:01,360 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-19 07:35:01,360 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-19 07:35:01,365 INFO L262 TraceCheckSpWp]: Trace formula consists of 573 conjuncts, 50 conjunts are in the unsatisfiable core [2023-11-19 07:35:01,371 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 07:35:01,454 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 266 treesize of output 262 [2023-11-19 07:35:01,695 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2023-11-19 07:35:01,696 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 30 [2023-11-19 07:35:01,858 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2023-11-19 07:35:01,916 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2023-11-19 07:35:08,598 WARN L854 $PredicateComparison]: unable to prove that (and (= |c_~#smp_def_rrlen_arr~0.offset| 0) (let ((.cse0 (select |c_old(#memory_int)| |c_#Ultimate.C_memset_#ptr.base|)) (.cse2 (select |c_#memory_int| |c_#Ultimate.C_memset_#ptr.base|))) (or (exists ((|v_#Ultimate.C_memset_#t~loopctr203_14| Int)) (and (= (store |c_old(#memory_int)| |c_#Ultimate.C_memset_#ptr.base| (let ((.cse1 (+ |v_#Ultimate.C_memset_#t~loopctr203_14| |c_#Ultimate.C_memset_#ptr.offset|))) (store .cse0 .cse1 (select .cse2 .cse1)))) |c_#memory_int|) (<= |v_#Ultimate.C_memset_#t~loopctr203_14| 0))) (exists ((|v_#Ultimate.C_memset_#t~loopctr203_12| Int) (|v_#Ultimate.C_memset_#t~loopctr203_14| Int) (|v_#Ultimate.C_memset_#t~loopctr203_15| Int)) (and (= (store |c_old(#memory_int)| |c_#Ultimate.C_memset_#ptr.base| (let ((.cse5 (+ |v_#Ultimate.C_memset_#t~loopctr203_15| |c_#Ultimate.C_memset_#ptr.offset|))) (store (let ((.cse4 (+ |v_#Ultimate.C_memset_#t~loopctr203_14| |c_#Ultimate.C_memset_#ptr.offset|))) (store (let ((.cse3 (+ |v_#Ultimate.C_memset_#t~loopctr203_12| |c_#Ultimate.C_memset_#ptr.offset|))) (store .cse0 .cse3 (select .cse2 .cse3))) .cse4 (select .cse2 .cse4))) .cse5 (select .cse2 .cse5)))) |c_#memory_int|) (<= |v_#Ultimate.C_memset_#t~loopctr203_12| 0) (not (= |v_#Ultimate.C_memset_#t~loopctr203_12| |v_#Ultimate.C_memset_#t~loopctr203_15|)) (<= |v_#Ultimate.C_memset_#t~loopctr203_15| (+ |v_#Ultimate.C_memset_#t~loopctr203_14| 1)) (not (= |v_#Ultimate.C_memset_#t~loopctr203_12| |v_#Ultimate.C_memset_#t~loopctr203_14|)) (not (= |v_#Ultimate.C_memset_#t~loopctr203_15| |v_#Ultimate.C_memset_#t~loopctr203_14|)) (<= |v_#Ultimate.C_memset_#t~loopctr203_14| (+ |v_#Ultimate.C_memset_#t~loopctr203_12| 1)))) (exists ((|v_#Ultimate.C_memset_#t~loopctr203_12| Int) (|v_#Ultimate.C_memset_#t~loopctr203_15| Int)) (and (<= |v_#Ultimate.C_memset_#t~loopctr203_15| (+ |v_#Ultimate.C_memset_#t~loopctr203_12| 1)) (<= |v_#Ultimate.C_memset_#t~loopctr203_12| 0) (not (= |v_#Ultimate.C_memset_#t~loopctr203_12| |v_#Ultimate.C_memset_#t~loopctr203_15|)) (= |c_#memory_int| (store |c_old(#memory_int)| |c_#Ultimate.C_memset_#ptr.base| (let ((.cse7 (+ |v_#Ultimate.C_memset_#t~loopctr203_15| |c_#Ultimate.C_memset_#ptr.offset|))) (store (let ((.cse6 (+ |v_#Ultimate.C_memset_#t~loopctr203_12| |c_#Ultimate.C_memset_#ptr.offset|))) (store .cse0 .cse6 (select .cse2 .cse6))) .cse7 (select .cse2 .cse7))))))) (exists ((|v_#Ultimate.C_memset_#t~loopctr203_13| Int) (|v_#Ultimate.C_memset_#t~loopctr203_15| Int)) (and (<= |v_#Ultimate.C_memset_#t~loopctr203_15| (+ |v_#Ultimate.C_memset_#t~loopctr203_13| 1)) (not (= |v_#Ultimate.C_memset_#t~loopctr203_13| |v_#Ultimate.C_memset_#t~loopctr203_15|)) (<= |v_#Ultimate.C_memset_#t~loopctr203_15| 0) (<= |v_#Ultimate.C_memset_#t~loopctr203_13| (+ |v_#Ultimate.C_memset_#t~loopctr203_15| 1)) (= (store |c_old(#memory_int)| |c_#Ultimate.C_memset_#ptr.base| (let ((.cse9 (+ |v_#Ultimate.C_memset_#t~loopctr203_15| |c_#Ultimate.C_memset_#ptr.offset|))) (store (let ((.cse8 (+ |v_#Ultimate.C_memset_#t~loopctr203_13| |c_#Ultimate.C_memset_#ptr.offset|))) (store .cse0 .cse8 (select .cse2 .cse8))) .cse9 (select .cse2 .cse9)))) |c_#memory_int|))) (exists ((|v_#Ultimate.C_memset_#t~loopctr203_12| Int) (|v_#Ultimate.C_memset_#t~loopctr203_14| Int)) (and (<= |v_#Ultimate.C_memset_#t~loopctr203_12| (+ |v_#Ultimate.C_memset_#t~loopctr203_14| 1)) (= (store |c_old(#memory_int)| |c_#Ultimate.C_memset_#ptr.base| (let ((.cse11 (+ |v_#Ultimate.C_memset_#t~loopctr203_12| |c_#Ultimate.C_memset_#ptr.offset|))) (store (let ((.cse10 (+ |v_#Ultimate.C_memset_#t~loopctr203_14| |c_#Ultimate.C_memset_#ptr.offset|))) (store .cse0 .cse10 (select .cse2 .cse10))) .cse11 (select .cse2 .cse11)))) |c_#memory_int|) (<= |v_#Ultimate.C_memset_#t~loopctr203_12| 0) (not (= |v_#Ultimate.C_memset_#t~loopctr203_12| |v_#Ultimate.C_memset_#t~loopctr203_14|)) (<= |v_#Ultimate.C_memset_#t~loopctr203_14| (+ |v_#Ultimate.C_memset_#t~loopctr203_12| 1)))) (exists ((|v_#Ultimate.C_memset_#t~loopctr203_12| Int) (|v_#Ultimate.C_memset_#t~loopctr203_13| Int) (|v_#Ultimate.C_memset_#t~loopctr203_15| Int)) (and (not (= |v_#Ultimate.C_memset_#t~loopctr203_13| |v_#Ultimate.C_memset_#t~loopctr203_12|)) (<= |v_#Ultimate.C_memset_#t~loopctr203_15| (+ |v_#Ultimate.C_memset_#t~loopctr203_13| 1)) (not (= |v_#Ultimate.C_memset_#t~loopctr203_13| |v_#Ultimate.C_memset_#t~loopctr203_15|)) (<= |v_#Ultimate.C_memset_#t~loopctr203_12| 0) (<= |v_#Ultimate.C_memset_#t~loopctr203_13| (+ |v_#Ultimate.C_memset_#t~loopctr203_12| 1)) (not (= |v_#Ultimate.C_memset_#t~loopctr203_12| |v_#Ultimate.C_memset_#t~loopctr203_15|)) (= (store |c_old(#memory_int)| |c_#Ultimate.C_memset_#ptr.base| (let ((.cse14 (+ |v_#Ultimate.C_memset_#t~loopctr203_15| |c_#Ultimate.C_memset_#ptr.offset|))) (store (let ((.cse13 (+ |v_#Ultimate.C_memset_#t~loopctr203_13| |c_#Ultimate.C_memset_#ptr.offset|))) (store (let ((.cse12 (+ |v_#Ultimate.C_memset_#t~loopctr203_12| |c_#Ultimate.C_memset_#ptr.offset|))) (store .cse0 .cse12 (select .cse2 .cse12))) .cse13 (select .cse2 .cse13))) .cse14 (select .cse2 .cse14)))) |c_#memory_int|))) (exists ((|v_#Ultimate.C_memset_#t~loopctr203_13| Int) (|v_#Ultimate.C_memset_#t~loopctr203_14| Int) (|v_#Ultimate.C_memset_#t~loopctr203_15| Int)) (let ((.cse18 (+ |v_#Ultimate.C_memset_#t~loopctr203_14| 1))) (and (not (= |v_#Ultimate.C_memset_#t~loopctr203_13| |v_#Ultimate.C_memset_#t~loopctr203_15|)) (not (= |v_#Ultimate.C_memset_#t~loopctr203_13| |v_#Ultimate.C_memset_#t~loopctr203_14|)) (= (store |c_old(#memory_int)| |c_#Ultimate.C_memset_#ptr.base| (let ((.cse17 (+ |v_#Ultimate.C_memset_#t~loopctr203_15| |c_#Ultimate.C_memset_#ptr.offset|))) (store (let ((.cse16 (+ |v_#Ultimate.C_memset_#t~loopctr203_14| |c_#Ultimate.C_memset_#ptr.offset|))) (store (let ((.cse15 (+ |v_#Ultimate.C_memset_#t~loopctr203_13| |c_#Ultimate.C_memset_#ptr.offset|))) (store .cse0 .cse15 (select .cse2 .cse15))) .cse16 (select .cse2 .cse16))) .cse17 (select .cse2 .cse17)))) |c_#memory_int|) (<= |v_#Ultimate.C_memset_#t~loopctr203_13| .cse18) (<= |v_#Ultimate.C_memset_#t~loopctr203_14| (+ |v_#Ultimate.C_memset_#t~loopctr203_13| 1)) (<= |v_#Ultimate.C_memset_#t~loopctr203_15| .cse18) (<= |v_#Ultimate.C_memset_#t~loopctr203_14| 0) (not (= |v_#Ultimate.C_memset_#t~loopctr203_15| |v_#Ultimate.C_memset_#t~loopctr203_14|))))) (exists ((|v_#Ultimate.C_memset_#t~loopctr203_14| Int) (|v_#Ultimate.C_memset_#t~loopctr203_15| Int)) (and (<= |v_#Ultimate.C_memset_#t~loopctr203_14| (+ |v_#Ultimate.C_memset_#t~loopctr203_15| 1)) (<= |v_#Ultimate.C_memset_#t~loopctr203_15| (+ |v_#Ultimate.C_memset_#t~loopctr203_14| 1)) (<= |v_#Ultimate.C_memset_#t~loopctr203_14| 0) (= (store |c_old(#memory_int)| |c_#Ultimate.C_memset_#ptr.base| (let ((.cse20 (+ |v_#Ultimate.C_memset_#t~loopctr203_15| |c_#Ultimate.C_memset_#ptr.offset|))) (store (let ((.cse19 (+ |v_#Ultimate.C_memset_#t~loopctr203_14| |c_#Ultimate.C_memset_#ptr.offset|))) (store .cse0 .cse19 (select .cse2 .cse19))) .cse20 (select .cse2 .cse20)))) |c_#memory_int|) (not (= |v_#Ultimate.C_memset_#t~loopctr203_15| |v_#Ultimate.C_memset_#t~loopctr203_14|)))) (exists ((|v_#Ultimate.C_memset_#t~loopctr203_12| Int) (|v_#Ultimate.C_memset_#t~loopctr203_13| Int) (|v_#Ultimate.C_memset_#t~loopctr203_14| Int) (|v_#Ultimate.C_memset_#t~loopctr203_15| Int)) (and (not (= |v_#Ultimate.C_memset_#t~loopctr203_13| |v_#Ultimate.C_memset_#t~loopctr203_12|)) (= (store |c_old(#memory_int)| |c_#Ultimate.C_memset_#ptr.base| (let ((.cse24 (+ |v_#Ultimate.C_memset_#t~loopctr203_15| |c_#Ultimate.C_memset_#ptr.offset|))) (store (let ((.cse23 (+ |v_#Ultimate.C_memset_#t~loopctr203_14| |c_#Ultimate.C_memset_#ptr.offset|))) (store (let ((.cse22 (+ |v_#Ultimate.C_memset_#t~loopctr203_13| |c_#Ultimate.C_memset_#ptr.offset|))) (store (let ((.cse21 (+ |v_#Ultimate.C_memset_#t~loopctr203_12| |c_#Ultimate.C_memset_#ptr.offset|))) (store .cse0 .cse21 (select .cse2 .cse21))) .cse22 (select .cse2 .cse22))) .cse23 (select .cse2 .cse23))) .cse24 (select .cse2 .cse24)))) |c_#memory_int|) (not (= |v_#Ultimate.C_memset_#t~loopctr203_13| |v_#Ultimate.C_memset_#t~loopctr203_15|)) (not (= |v_#Ultimate.C_memset_#t~loopctr203_13| |v_#Ultimate.C_memset_#t~loopctr203_14|)) (<= |v_#Ultimate.C_memset_#t~loopctr203_12| 0) (<= |v_#Ultimate.C_memset_#t~loopctr203_13| (+ |v_#Ultimate.C_memset_#t~loopctr203_12| 1)) (not (= |v_#Ultimate.C_memset_#t~loopctr203_12| |v_#Ultimate.C_memset_#t~loopctr203_15|)) (<= |v_#Ultimate.C_memset_#t~loopctr203_14| (+ |v_#Ultimate.C_memset_#t~loopctr203_13| 1)) (<= |v_#Ultimate.C_memset_#t~loopctr203_15| (+ |v_#Ultimate.C_memset_#t~loopctr203_14| 1)) (not (= |v_#Ultimate.C_memset_#t~loopctr203_12| |v_#Ultimate.C_memset_#t~loopctr203_14|)) (not (= |v_#Ultimate.C_memset_#t~loopctr203_15| |v_#Ultimate.C_memset_#t~loopctr203_14|)))) (exists ((|v_#Ultimate.C_memset_#t~loopctr203_12| Int) (|v_#Ultimate.C_memset_#t~loopctr203_14| Int) (|v_#Ultimate.C_memset_#t~loopctr203_15| Int)) (and (<= |v_#Ultimate.C_memset_#t~loopctr203_15| (+ |v_#Ultimate.C_memset_#t~loopctr203_12| 1)) (= (store |c_old(#memory_int)| |c_#Ultimate.C_memset_#ptr.base| (let ((.cse27 (+ |v_#Ultimate.C_memset_#t~loopctr203_15| |c_#Ultimate.C_memset_#ptr.offset|))) (store (let ((.cse26 (+ |v_#Ultimate.C_memset_#t~loopctr203_14| |c_#Ultimate.C_memset_#ptr.offset|))) (store (let ((.cse25 (+ |v_#Ultimate.C_memset_#t~loopctr203_12| |c_#Ultimate.C_memset_#ptr.offset|))) (store .cse0 .cse25 (select .cse2 .cse25))) .cse26 (select .cse2 .cse26))) .cse27 (select .cse2 .cse27)))) |c_#memory_int|) (<= |v_#Ultimate.C_memset_#t~loopctr203_12| 0) (<= |v_#Ultimate.C_memset_#t~loopctr203_14| (+ |v_#Ultimate.C_memset_#t~loopctr203_15| 1)) (not (= |v_#Ultimate.C_memset_#t~loopctr203_12| |v_#Ultimate.C_memset_#t~loopctr203_15|)) (<= |v_#Ultimate.C_memset_#t~loopctr203_15| (+ |v_#Ultimate.C_memset_#t~loopctr203_14| 1)) (not (= |v_#Ultimate.C_memset_#t~loopctr203_12| |v_#Ultimate.C_memset_#t~loopctr203_14|)) (not (= |v_#Ultimate.C_memset_#t~loopctr203_15| |v_#Ultimate.C_memset_#t~loopctr203_14|)))) (exists ((|v_#Ultimate.C_memset_#t~loopctr203_12| Int)) (and (= (store |c_old(#memory_int)| |c_#Ultimate.C_memset_#ptr.base| (let ((.cse28 (+ |v_#Ultimate.C_memset_#t~loopctr203_12| |c_#Ultimate.C_memset_#ptr.offset|))) (store .cse0 .cse28 (select .cse2 .cse28)))) |c_#memory_int|) (<= |v_#Ultimate.C_memset_#t~loopctr203_12| 0))) (exists ((|v_#Ultimate.C_memset_#t~loopctr203_13| Int) (|v_#Ultimate.C_memset_#t~loopctr203_14| Int) (|v_#Ultimate.C_memset_#t~loopctr203_15| Int)) (and (not (= |v_#Ultimate.C_memset_#t~loopctr203_13| |v_#Ultimate.C_memset_#t~loopctr203_15|)) (not (= |v_#Ultimate.C_memset_#t~loopctr203_13| |v_#Ultimate.C_memset_#t~loopctr203_14|)) (<= |v_#Ultimate.C_memset_#t~loopctr203_15| 0) (<= |v_#Ultimate.C_memset_#t~loopctr203_13| (+ |v_#Ultimate.C_memset_#t~loopctr203_15| 1)) (= (store |c_old(#memory_int)| |c_#Ultimate.C_memset_#ptr.base| (let ((.cse31 (+ |v_#Ultimate.C_memset_#t~loopctr203_15| |c_#Ultimate.C_memset_#ptr.offset|))) (store (let ((.cse30 (+ |v_#Ultimate.C_memset_#t~loopctr203_14| |c_#Ultimate.C_memset_#ptr.offset|))) (store (let ((.cse29 (+ |v_#Ultimate.C_memset_#t~loopctr203_13| |c_#Ultimate.C_memset_#ptr.offset|))) (store .cse0 .cse29 (select .cse2 .cse29))) .cse30 (select .cse2 .cse30))) .cse31 (select .cse2 .cse31)))) |c_#memory_int|) (<= |v_#Ultimate.C_memset_#t~loopctr203_14| (+ |v_#Ultimate.C_memset_#t~loopctr203_13| 1)) (<= |v_#Ultimate.C_memset_#t~loopctr203_15| (+ |v_#Ultimate.C_memset_#t~loopctr203_14| 1)) (not (= |v_#Ultimate.C_memset_#t~loopctr203_15| |v_#Ultimate.C_memset_#t~loopctr203_14|)))) (exists ((|v_#Ultimate.C_memset_#t~loopctr203_14| Int) (|v_#Ultimate.C_memset_#t~loopctr203_15| Int)) (and (<= |v_#Ultimate.C_memset_#t~loopctr203_15| (+ |v_#Ultimate.C_memset_#t~loopctr203_14| 1)) (<= |v_#Ultimate.C_memset_#t~loopctr203_14| 0) (= (store |c_old(#memory_int)| |c_#Ultimate.C_memset_#ptr.base| (let ((.cse33 (+ |v_#Ultimate.C_memset_#t~loopctr203_15| |c_#Ultimate.C_memset_#ptr.offset|))) (store (let ((.cse32 (+ |v_#Ultimate.C_memset_#t~loopctr203_14| |c_#Ultimate.C_memset_#ptr.offset|))) (store .cse0 .cse32 (select .cse2 .cse32))) .cse33 (select .cse2 .cse33)))) |c_#memory_int|) (not (= |v_#Ultimate.C_memset_#t~loopctr203_15| |v_#Ultimate.C_memset_#t~loopctr203_14|)))))) (= 12 |c_~#smp_def_rrlen_arr~0.base|)) is different from false [2023-11-19 07:35:20,335 WARN L293 SmtUtils]: Spent 9.90s on a formula simplification. DAG size of input: 884 DAG size of output: 217 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2023-11-19 07:35:20,336 INFO L349 Elim1Store]: treesize reduction 4453, result has 10.9 percent of original size [2023-11-19 07:35:20,337 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 13 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 16 new quantified variables, introduced 57 case distinctions, treesize of input 744 treesize of output 1688