./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/termination-memory-alloca/b.14-alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 9bd2c7ff Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44e924d8-35b3-48b7-8ef2-6551989869b6/bin/uautomizer-verify-uCwYo4JHxu/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44e924d8-35b3-48b7-8ef2-6551989869b6/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_44e924d8-35b3-48b7-8ef2-6551989869b6/bin/uautomizer-verify-uCwYo4JHxu/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44e924d8-35b3-48b7-8ef2-6551989869b6/bin/uautomizer-verify-uCwYo4JHxu/config/AutomizerReach.xml -i ../../sv-benchmarks/c/termination-memory-alloca/b.14-alloca.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44e924d8-35b3-48b7-8ef2-6551989869b6/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44e924d8-35b3-48b7-8ef2-6551989869b6/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 64bit --witnessprinter.graph.data.programhash 3bd2edbf3e593c12fc0be33924c944159e0cb6d32e04e77d638ccd9d0e66fc4a --- Real Ultimate output --- This is Ultimate 0.2.3-dev-9bd2c7f [2023-11-19 07:32:49,745 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-19 07:32:49,876 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44e924d8-35b3-48b7-8ef2-6551989869b6/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Overflow-64bit-Automizer_Default.epf [2023-11-19 07:32:49,881 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-19 07:32:49,881 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-19 07:32:49,910 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-19 07:32:49,911 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-19 07:32:49,912 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-19 07:32:49,913 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-19 07:32:49,918 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-19 07:32:49,919 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-19 07:32:49,919 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-19 07:32:49,920 INFO L153 SettingsManager]: * Use SBE=true [2023-11-19 07:32:49,922 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-19 07:32:49,922 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-19 07:32:49,922 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-19 07:32:49,923 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-19 07:32:49,923 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-19 07:32:49,924 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-19 07:32:49,924 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-19 07:32:49,925 INFO L153 SettingsManager]: * Check absence of signed integer overflows=true [2023-11-19 07:32:49,925 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-19 07:32:49,926 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-19 07:32:49,926 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-19 07:32:49,927 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-19 07:32:49,927 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-19 07:32:49,928 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-19 07:32:49,928 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:32:49,928 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-19 07:32:49,929 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-19 07:32:49,930 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-19 07:32:49,930 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-19 07:32:49,931 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-19 07:32:49,931 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-19 07:32:49,931 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-19 07:32:49,931 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-19 07:32:49,931 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-19 07:32:49,932 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-19 07:32:49,932 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_44e924d8-35b3-48b7-8ef2-6551989869b6/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_44e924d8-35b3-48b7-8ef2-6551989869b6/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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3bd2edbf3e593c12fc0be33924c944159e0cb6d32e04e77d638ccd9d0e66fc4a [2023-11-19 07:32:50,217 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-19 07:32:50,240 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-19 07:32:50,243 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-19 07:32:50,245 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-19 07:32:50,245 INFO L274 PluginConnector]: CDTParser initialized [2023-11-19 07:32:50,247 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44e924d8-35b3-48b7-8ef2-6551989869b6/bin/uautomizer-verify-uCwYo4JHxu/../../sv-benchmarks/c/termination-memory-alloca/b.14-alloca.i [2023-11-19 07:32:53,559 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-19 07:32:53,832 INFO L384 CDTParser]: Found 1 translation units. [2023-11-19 07:32:53,832 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44e924d8-35b3-48b7-8ef2-6551989869b6/sv-benchmarks/c/termination-memory-alloca/b.14-alloca.i [2023-11-19 07:32:53,850 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44e924d8-35b3-48b7-8ef2-6551989869b6/bin/uautomizer-verify-uCwYo4JHxu/data/bf0fb8f4a/fefcdcbbc3fd4da6b78e3514bbc3074b/FLAG35e39ef49 [2023-11-19 07:32:53,871 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44e924d8-35b3-48b7-8ef2-6551989869b6/bin/uautomizer-verify-uCwYo4JHxu/data/bf0fb8f4a/fefcdcbbc3fd4da6b78e3514bbc3074b [2023-11-19 07:32:53,874 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-19 07:32:53,875 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-19 07:32:53,885 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-19 07:32:53,886 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-19 07:32:53,892 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-19 07:32:53,896 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:32:53" (1/1) ... [2023-11-19 07:32:53,899 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c966935 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:32:53, skipping insertion in model container [2023-11-19 07:32:53,899 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:32:53" (1/1) ... [2023-11-19 07:32:53,944 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-19 07:32:54,296 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:32:54,309 INFO L202 MainTranslator]: Completed pre-run [2023-11-19 07:32:54,358 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:32:54,390 INFO L206 MainTranslator]: Completed translation [2023-11-19 07:32:54,390 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:32:54 WrapperNode [2023-11-19 07:32:54,390 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-19 07:32:54,392 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-19 07:32:54,392 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-19 07:32:54,392 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-19 07:32:54,401 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:32:54" (1/1) ... [2023-11-19 07:32:54,415 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:32:54" (1/1) ... [2023-11-19 07:32:54,439 INFO L138 Inliner]: procedures = 111, calls = 26, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 82 [2023-11-19 07:32:54,439 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-19 07:32:54,440 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-19 07:32:54,440 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-19 07:32:54,441 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-19 07:32:54,450 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:32:54" (1/1) ... [2023-11-19 07:32:54,451 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:32:54" (1/1) ... [2023-11-19 07:32:54,455 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:32:54" (1/1) ... [2023-11-19 07:32:54,456 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:32:54" (1/1) ... [2023-11-19 07:32:54,461 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:32:54" (1/1) ... [2023-11-19 07:32:54,465 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:32:54" (1/1) ... [2023-11-19 07:32:54,467 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:32:54" (1/1) ... [2023-11-19 07:32:54,468 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:32:54" (1/1) ... [2023-11-19 07:32:54,471 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-19 07:32:54,472 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-19 07:32:54,472 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-19 07:32:54,472 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-19 07:32:54,473 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:32:54" (1/1) ... [2023-11-19 07:32:54,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:32:54,497 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44e924d8-35b3-48b7-8ef2-6551989869b6/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:32:54,509 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44e924d8-35b3-48b7-8ef2-6551989869b6/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:32:54,541 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44e924d8-35b3-48b7-8ef2-6551989869b6/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:32:54,554 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-19 07:32:54,554 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-19 07:32:54,555 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-19 07:32:54,555 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-19 07:32:54,556 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-19 07:32:54,556 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-19 07:32:54,673 INFO L236 CfgBuilder]: Building ICFG [2023-11-19 07:32:54,674 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-19 07:32:54,839 INFO L277 CfgBuilder]: Performing block encoding [2023-11-19 07:32:54,847 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-19 07:32:54,848 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-19 07:32:54,851 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:32:54 BoogieIcfgContainer [2023-11-19 07:32:54,851 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-19 07:32:54,855 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-19 07:32:54,855 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-19 07:32:54,859 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-19 07:32:54,859 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 07:32:53" (1/3) ... [2023-11-19 07:32:54,860 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79b32294 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:32:54, skipping insertion in model container [2023-11-19 07:32:54,860 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:32:54" (2/3) ... [2023-11-19 07:32:54,861 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79b32294 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:32:54, skipping insertion in model container [2023-11-19 07:32:54,861 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:32:54" (3/3) ... [2023-11-19 07:32:54,862 INFO L112 eAbstractionObserver]: Analyzing ICFG b.14-alloca.i [2023-11-19 07:32:54,884 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-19 07:32:54,884 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2023-11-19 07:32:54,939 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 07:32:54,946 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;@4f1a92c7, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-19 07:32:54,946 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-11-19 07:32:54,951 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 23 states have internal predecessors, (28), 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:32:54,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-11-19 07:32:54,958 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:32:54,959 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:32:54,960 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2023-11-19 07:32:54,965 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:32:54,966 INFO L85 PathProgramCache]: Analyzing trace with hash 177751404, now seen corresponding path program 1 times [2023-11-19 07:32:54,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:32:54,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422320282] [2023-11-19 07:32:54,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:32:54,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:32:55,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:32:55,562 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:32:55,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:32:55,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422320282] [2023-11-19 07:32:55,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422320282] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:32:55,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:32:55,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 07:32:55,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78193388] [2023-11-19 07:32:55,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:32:55,571 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:32:55,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:32:55,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:32:55,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-19 07:32:55,617 INFO L87 Difference]: Start difference. First operand has 24 states, 17 states have (on average 1.6470588235294117) internal successors, (28), 23 states have internal predecessors, (28), 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) Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 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:32:55,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:32:55,725 INFO L93 Difference]: Finished difference Result 56 states and 70 transitions. [2023-11-19 07:32:55,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-19 07:32:55,731 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 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 8 [2023-11-19 07:32:55,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:32:55,740 INFO L225 Difference]: With dead ends: 56 [2023-11-19 07:32:55,742 INFO L226 Difference]: Without dead ends: 27 [2023-11-19 07:32:55,746 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-11-19 07:32:55,753 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 11 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 07:32:55,755 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 69 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 07:32:55,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2023-11-19 07:32:55,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 22. [2023-11-19 07:32:55,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 16 states have (on average 1.5625) internal successors, (25), 21 states have internal predecessors, (25), 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:32:55,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2023-11-19 07:32:55,808 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 8 [2023-11-19 07:32:55,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:32:55,809 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2023-11-19 07:32:55,809 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 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:32:55,809 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2023-11-19 07:32:55,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-11-19 07:32:55,810 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:32:55,810 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:32:55,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-19 07:32:55,812 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2023-11-19 07:32:55,812 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:32:55,813 INFO L85 PathProgramCache]: Analyzing trace with hash 1215326290, now seen corresponding path program 1 times [2023-11-19 07:32:55,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:32:55,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953127674] [2023-11-19 07:32:55,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:32:55,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:32:55,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:32:56,219 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:32:56,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:32:56,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953127674] [2023-11-19 07:32:56,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953127674] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:32:56,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:32:56,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-19 07:32:56,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989970195] [2023-11-19 07:32:56,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:32:56,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-19 07:32:56,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:32:56,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-19 07:32:56,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-19 07:32:56,224 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 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:32:56,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:32:56,308 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2023-11-19 07:32:56,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:32:56,309 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 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 9 [2023-11-19 07:32:56,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:32:56,310 INFO L225 Difference]: With dead ends: 22 [2023-11-19 07:32:56,310 INFO L226 Difference]: Without dead ends: 21 [2023-11-19 07:32:56,310 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2023-11-19 07:32:56,312 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 40 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-19 07:32:56,313 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 20 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-19 07:32:56,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2023-11-19 07:32:56,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2023-11-19 07:32:56,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 16 states have (on average 1.5) internal successors, (24), 20 states have internal predecessors, (24), 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:32:56,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2023-11-19 07:32:56,319 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 9 [2023-11-19 07:32:56,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:32:56,319 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2023-11-19 07:32:56,320 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 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:32:56,320 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2023-11-19 07:32:56,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-19 07:32:56,320 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:32:56,321 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:32:56,321 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-19 07:32:56,321 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2023-11-19 07:32:56,322 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:32:56,322 INFO L85 PathProgramCache]: Analyzing trace with hash -979590610, now seen corresponding path program 1 times [2023-11-19 07:32:56,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:32:56,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859549991] [2023-11-19 07:32:56,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:32:56,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:32:56,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:32:56,697 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:32:56,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:32:56,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859549991] [2023-11-19 07:32:56,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859549991] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:32:56,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:32:56,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-19 07:32:56,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413070627] [2023-11-19 07:32:56,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:32:56,701 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-19 07:32:56,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:32:56,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-19 07:32:56,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-19 07:32:56,704 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 7 states have internal predecessors, (10), 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:32:56,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:32:56,865 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2023-11-19 07:32:56,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-19 07:32:56,866 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 7 states have internal predecessors, (10), 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 10 [2023-11-19 07:32:56,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:32:56,867 INFO L225 Difference]: With dead ends: 29 [2023-11-19 07:32:56,867 INFO L226 Difference]: Without dead ends: 28 [2023-11-19 07:32:56,869 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2023-11-19 07:32:56,877 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 33 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 07:32:56,878 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 44 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 07:32:56,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2023-11-19 07:32:56,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 23. [2023-11-19 07:32:56,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 22 states have internal predecessors, (26), 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:32:56,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2023-11-19 07:32:56,891 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 10 [2023-11-19 07:32:56,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:32:56,895 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2023-11-19 07:32:56,896 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 7 states have internal predecessors, (10), 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:32:56,896 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2023-11-19 07:32:56,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-19 07:32:56,897 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:32:56,897 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:32:56,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-19 07:32:56,900 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2023-11-19 07:32:56,903 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:32:56,903 INFO L85 PathProgramCache]: Analyzing trace with hash -302537772, now seen corresponding path program 1 times [2023-11-19 07:32:56,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:32:56,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476216547] [2023-11-19 07:32:56,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:32:56,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:32:56,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:32:57,145 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:32:57,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:32:57,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476216547] [2023-11-19 07:32:57,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476216547] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:32:57,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:32:57,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-19 07:32:57,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726909539] [2023-11-19 07:32:57,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:32:57,148 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-19 07:32:57,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:32:57,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-19 07:32:57,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-19 07:32:57,149 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. Second operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 7 states have internal predecessors, (11), 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:32:57,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:32:57,284 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2023-11-19 07:32:57,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-19 07:32:57,285 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 7 states have internal predecessors, (11), 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 11 [2023-11-19 07:32:57,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:32:57,286 INFO L225 Difference]: With dead ends: 28 [2023-11-19 07:32:57,286 INFO L226 Difference]: Without dead ends: 27 [2023-11-19 07:32:57,286 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-11-19 07:32:57,287 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 27 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 07:32:57,288 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 42 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 07:32:57,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2023-11-19 07:32:57,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 24. [2023-11-19 07:32:57,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 23 states have internal predecessors, (27), 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:32:57,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2023-11-19 07:32:57,294 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 11 [2023-11-19 07:32:57,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:32:57,294 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2023-11-19 07:32:57,294 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 7 states have internal predecessors, (11), 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:32:57,295 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2023-11-19 07:32:57,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-19 07:32:57,295 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:32:57,295 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:32:57,296 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-19 07:32:57,296 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2023-11-19 07:32:57,296 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:32:57,297 INFO L85 PathProgramCache]: Analyzing trace with hash -788736272, now seen corresponding path program 1 times [2023-11-19 07:32:57,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:32:57,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025248632] [2023-11-19 07:32:57,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:32:57,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:32:57,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:32:57,668 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:32:57,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:32:57,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025248632] [2023-11-19 07:32:57,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025248632] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:32:57,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:32:57,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-19 07:32:57,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86575464] [2023-11-19 07:32:57,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:32:57,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-19 07:32:57,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:32:57,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-19 07:32:57,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-19 07:32:57,674 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 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:32:57,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:32:57,766 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2023-11-19 07:32:57,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:32:57,767 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 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 12 [2023-11-19 07:32:57,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:32:57,768 INFO L225 Difference]: With dead ends: 37 [2023-11-19 07:32:57,769 INFO L226 Difference]: Without dead ends: 35 [2023-11-19 07:32:57,769 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-19 07:32:57,770 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 17 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 07:32:57,771 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 55 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 07:32:57,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2023-11-19 07:32:57,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2023-11-19 07:32:57,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 34 states have internal predecessors, (40), 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:32:57,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2023-11-19 07:32:57,781 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 40 transitions. Word has length 12 [2023-11-19 07:32:57,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:32:57,781 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 40 transitions. [2023-11-19 07:32:57,781 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 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:32:57,782 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2023-11-19 07:32:57,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-11-19 07:32:57,782 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:32:57,783 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:32:57,783 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-19 07:32:57,783 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2023-11-19 07:32:57,784 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:32:57,784 INFO L85 PathProgramCache]: Analyzing trace with hash -940015839, now seen corresponding path program 1 times [2023-11-19 07:32:57,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:32:57,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359686475] [2023-11-19 07:32:57,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:32:57,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:32:57,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:32:58,185 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:32:58,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:32:58,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359686475] [2023-11-19 07:32:58,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359686475] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 07:32:58,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [869573341] [2023-11-19 07:32:58,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:32:58,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 07:32:58,187 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44e924d8-35b3-48b7-8ef2-6551989869b6/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:32:58,189 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44e924d8-35b3-48b7-8ef2-6551989869b6/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 07:32:58,195 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44e924d8-35b3-48b7-8ef2-6551989869b6/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-19 07:32:58,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:32:58,286 INFO L262 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 36 conjunts are in the unsatisfiable core [2023-11-19 07:32:58,298 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 07:32:58,398 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 45 [2023-11-19 07:32:58,418 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-19 07:32:58,421 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 49 [2023-11-19 07:32:58,454 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-19 07:32:58,487 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-19 07:32:58,518 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 40 [2023-11-19 07:32:58,532 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-19 07:32:58,534 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 49 [2023-11-19 07:32:58,551 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-19 07:32:58,551 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-19 07:32:58,555 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 45 treesize of output 21 [2023-11-19 07:32:58,580 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-11-19 07:32:58,585 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2023-11-19 07:32:58,601 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-11-19 07:32:58,610 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-11-19 07:32:58,624 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 1 [2023-11-19 07:32:58,642 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 45 [2023-11-19 07:32:58,661 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-19 07:32:58,665 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 54 [2023-11-19 07:32:58,675 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-19 07:32:58,677 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 0 case distinctions, treesize of input 57 treesize of output 29 [2023-11-19 07:32:58,694 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2023-11-19 07:32:58,703 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-11-19 07:32:58,715 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 40 [2023-11-19 07:32:58,739 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 45 [2023-11-19 07:32:58,753 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 54 [2023-11-19 07:32:58,765 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 29 [2023-11-19 07:32:58,793 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2023-11-19 07:32:58,803 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 40 [2023-11-19 07:32:58,816 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 54 [2023-11-19 07:32:58,823 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-19 07:32:58,824 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 0 case distinctions, treesize of input 57 treesize of output 29 [2023-11-19 07:32:58,840 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-11-19 07:32:58,845 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2023-11-19 07:32:58,860 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 10 treesize of output 8 [2023-11-19 07:32:59,113 INFO L349 Elim1Store]: treesize reduction 41, result has 29.3 percent of original size [2023-11-19 07:32:59,113 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 42 [2023-11-19 07:32:59,242 INFO L349 Elim1Store]: treesize reduction 41, result has 29.3 percent of original size [2023-11-19 07:32:59,246 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 44 [2023-11-19 07:32:59,394 INFO L349 Elim1Store]: treesize reduction 80, result has 15.8 percent of original size [2023-11-19 07:32:59,395 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 41 treesize of output 24 [2023-11-19 07:32:59,502 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 13 [2023-11-19 07:32:59,521 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:32:59,521 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 07:33:00,283 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:33:00,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [869573341] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-19 07:33:00,283 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-19 07:33:00,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11, 11] total 28 [2023-11-19 07:33:00,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241749994] [2023-11-19 07:33:00,284 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-19 07:33:00,285 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-11-19 07:33:00,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:33:00,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-11-19 07:33:00,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=655, Unknown=0, NotChecked=0, Total=812 [2023-11-19 07:33:00,287 INFO L87 Difference]: Start difference. First operand 35 states and 40 transitions. Second operand has 29 states, 28 states have (on average 1.6428571428571428) internal successors, (46), 29 states have internal predecessors, (46), 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:33:04,827 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.51s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-19 07:33:05,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:33:05,343 INFO L93 Difference]: Finished difference Result 137 states and 162 transitions. [2023-11-19 07:33:05,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2023-11-19 07:33:05,344 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 1.6428571428571428) internal successors, (46), 29 states have internal predecessors, (46), 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 16 [2023-11-19 07:33:05,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:33:05,346 INFO L225 Difference]: With dead ends: 137 [2023-11-19 07:33:05,346 INFO L226 Difference]: Without dead ends: 104 [2023-11-19 07:33:05,348 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 978 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=723, Invalid=2469, Unknown=0, NotChecked=0, Total=3192 [2023-11-19 07:33:05,349 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 170 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 382 mSolverCounterSat, 35 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 382 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2023-11-19 07:33:05,349 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 185 Invalid, 418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 382 Invalid, 1 Unknown, 0 Unchecked, 3.6s Time] [2023-11-19 07:33:05,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2023-11-19 07:33:05,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 72. [2023-11-19 07:33:05,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 67 states have (on average 1.3582089552238805) internal successors, (91), 71 states have internal predecessors, (91), 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:33:05,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 91 transitions. [2023-11-19 07:33:05,364 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 91 transitions. Word has length 16 [2023-11-19 07:33:05,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:33:05,365 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 91 transitions. [2023-11-19 07:33:05,365 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 1.6428571428571428) internal successors, (46), 29 states have internal predecessors, (46), 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:33:05,365 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 91 transitions. [2023-11-19 07:33:05,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-11-19 07:33:05,366 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:33:05,366 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:33:05,392 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44e924d8-35b3-48b7-8ef2-6551989869b6/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-19 07:33:05,580 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44e924d8-35b3-48b7-8ef2-6551989869b6/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-11-19 07:33:05,580 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2023-11-19 07:33:05,581 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:33:05,581 INFO L85 PathProgramCache]: Analyzing trace with hash -1412087133, now seen corresponding path program 1 times [2023-11-19 07:33:05,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:33:05,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271630219] [2023-11-19 07:33:05,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:33:05,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:33:05,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:05,806 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-19 07:33:05,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:33:05,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271630219] [2023-11-19 07:33:05,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271630219] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 07:33:05,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [421314169] [2023-11-19 07:33:05,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:33:05,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 07:33:05,807 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44e924d8-35b3-48b7-8ef2-6551989869b6/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:33:05,808 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44e924d8-35b3-48b7-8ef2-6551989869b6/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 07:33:05,824 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44e924d8-35b3-48b7-8ef2-6551989869b6/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-19 07:33:05,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:05,890 INFO L262 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 13 conjunts are in the unsatisfiable core [2023-11-19 07:33:05,893 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 07:33:05,903 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 10 treesize of output 8 [2023-11-19 07:33:06,021 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:33:06,024 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-11-19 07:33:06,030 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-19 07:33:06,033 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 07:33:06,157 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 33 treesize of output 25 [2023-11-19 07:33:06,212 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-19 07:33:06,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [421314169] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-19 07:33:06,212 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-19 07:33:06,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2023-11-19 07:33:06,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102430742] [2023-11-19 07:33:06,213 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-19 07:33:06,213 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-19 07:33:06,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:33:06,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-19 07:33:06,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2023-11-19 07:33:06,214 INFO L87 Difference]: Start difference. First operand 72 states and 91 transitions. Second operand has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 10 states have internal predecessors, (25), 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:33:06,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:33:06,389 INFO L93 Difference]: Finished difference Result 72 states and 91 transitions. [2023-11-19 07:33:06,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-19 07:33:06,390 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 10 states have internal predecessors, (25), 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 18 [2023-11-19 07:33:06,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:33:06,393 INFO L225 Difference]: With dead ends: 72 [2023-11-19 07:33:06,393 INFO L226 Difference]: Without dead ends: 71 [2023-11-19 07:33:06,393 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2023-11-19 07:33:06,395 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 17 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 3 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-19 07:33:06,395 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 46 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 52 Invalid, 4 Unknown, 0 Unchecked, 0.1s Time] [2023-11-19 07:33:06,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2023-11-19 07:33:06,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2023-11-19 07:33:06,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 67 states have (on average 1.3134328358208955) internal successors, (88), 70 states have internal predecessors, (88), 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:33:06,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 88 transitions. [2023-11-19 07:33:06,418 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 88 transitions. Word has length 18 [2023-11-19 07:33:06,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:33:06,418 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 88 transitions. [2023-11-19 07:33:06,419 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 10 states have internal predecessors, (25), 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:33:06,419 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 88 transitions. [2023-11-19 07:33:06,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-19 07:33:06,420 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:33:06,420 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:33:06,448 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44e924d8-35b3-48b7-8ef2-6551989869b6/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-19 07:33:06,640 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44e924d8-35b3-48b7-8ef2-6551989869b6/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 07:33:06,640 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2023-11-19 07:33:06,640 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:33:06,640 INFO L85 PathProgramCache]: Analyzing trace with hash -825028097, now seen corresponding path program 1 times [2023-11-19 07:33:06,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:33:06,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829609073] [2023-11-19 07:33:06,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:33:06,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:33:06,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:07,467 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:33:07,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:33:07,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829609073] [2023-11-19 07:33:07,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829609073] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 07:33:07,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1876285129] [2023-11-19 07:33:07,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:33:07,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 07:33:07,469 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44e924d8-35b3-48b7-8ef2-6551989869b6/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:33:07,473 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44e924d8-35b3-48b7-8ef2-6551989869b6/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 07:33:07,500 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44e924d8-35b3-48b7-8ef2-6551989869b6/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-19 07:33:07,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:07,575 INFO L262 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 21 conjunts are in the unsatisfiable core [2023-11-19 07:33:07,579 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 07:33:07,592 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-19 07:33:07,593 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 19 [2023-11-19 07:33:07,812 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-19 07:33:07,928 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-19 07:33:08,033 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:33:08,037 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-11-19 07:33:08,087 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:33:08,087 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 07:33:08,164 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_200 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_200) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) 2147483649)) is different from false [2023-11-19 07:33:08,297 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 07:33:08,298 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2023-11-19 07:33:08,305 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 121 treesize of output 109 [2023-11-19 07:33:08,317 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 15 treesize of output 13 [2023-11-19 07:33:08,325 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 20 treesize of output 16 [2023-11-19 07:33:08,486 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2023-11-19 07:33:08,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1876285129] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-19 07:33:08,486 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-19 07:33:08,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 16 [2023-11-19 07:33:08,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132042862] [2023-11-19 07:33:08,487 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-19 07:33:08,488 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-11-19 07:33:08,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:33:08,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-11-19 07:33:08,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=185, Unknown=5, NotChecked=28, Total=272 [2023-11-19 07:33:08,490 INFO L87 Difference]: Start difference. First operand 71 states and 88 transitions. Second operand has 17 states, 16 states have (on average 3.4375) internal successors, (55), 17 states have internal predecessors, (55), 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:33:09,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-19 07:33:09,160 INFO L93 Difference]: Finished difference Result 74 states and 91 transitions. [2023-11-19 07:33:09,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-19 07:33:09,161 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 3.4375) internal successors, (55), 17 states have internal predecessors, (55), 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 19 [2023-11-19 07:33:09,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-19 07:33:09,163 INFO L225 Difference]: With dead ends: 74 [2023-11-19 07:33:09,163 INFO L226 Difference]: Without dead ends: 73 [2023-11-19 07:33:09,164 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=141, Invalid=364, Unknown=5, NotChecked=42, Total=552 [2023-11-19 07:33:09,166 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 55 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 29 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-19 07:33:09,166 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 34 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 84 Invalid, 0 Unknown, 29 Unchecked, 0.2s Time] [2023-11-19 07:33:09,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2023-11-19 07:33:09,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 56. [2023-11-19 07:33:09,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 53 states have (on average 1.320754716981132) internal successors, (70), 55 states have internal predecessors, (70), 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:33:09,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 70 transitions. [2023-11-19 07:33:09,183 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 70 transitions. Word has length 19 [2023-11-19 07:33:09,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-19 07:33:09,183 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 70 transitions. [2023-11-19 07:33:09,183 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 3.4375) internal successors, (55), 17 states have internal predecessors, (55), 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:33:09,183 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 70 transitions. [2023-11-19 07:33:09,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-11-19 07:33:09,184 INFO L187 NwaCegarLoop]: Found error trace [2023-11-19 07:33:09,184 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-19 07:33:09,211 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44e924d8-35b3-48b7-8ef2-6551989869b6/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-19 07:33:09,402 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44e924d8-35b3-48b7-8ef2-6551989869b6/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 07:33:09,403 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2023-11-19 07:33:09,403 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:33:09,404 INFO L85 PathProgramCache]: Analyzing trace with hash 193932837, now seen corresponding path program 1 times [2023-11-19 07:33:09,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:33:09,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721735186] [2023-11-19 07:33:09,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:33:09,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:33:09,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:10,000 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:33:10,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:33:10,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721735186] [2023-11-19 07:33:10,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721735186] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 07:33:10,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1257826317] [2023-11-19 07:33:10,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:33:10,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 07:33:10,001 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44e924d8-35b3-48b7-8ef2-6551989869b6/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:33:10,008 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44e924d8-35b3-48b7-8ef2-6551989869b6/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 07:33:10,028 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_44e924d8-35b3-48b7-8ef2-6551989869b6/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-19 07:33:10,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:33:10,092 INFO L262 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 28 conjunts are in the unsatisfiable core [2023-11-19 07:33:10,097 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 07:33:10,112 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 98 treesize of output 94 [2023-11-19 07:33:10,317 INFO L349 Elim1Store]: treesize reduction 91, result has 31.6 percent of original size [2023-11-19 07:33:10,318 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 100 treesize of output 172 [2023-11-19 07:33:10,375 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-19 07:33:10,402 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2023-11-19 07:33:10,421 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2023-11-19 07:33:10,808 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 27 [2023-11-19 07:33:10,983 INFO L349 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2023-11-19 07:33:10,984 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 303 treesize of output 277 [2023-11-19 07:33:11,104 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 21 treesize of output 19 [2023-11-19 07:33:11,147 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 21 treesize of output 19 [2023-11-19 07:33:11,651 WARN L876 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| |c_ULTIMATE.start_test_fun_~c~0#1.base|)) (let ((.cse4 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (let ((.cse2 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|)) (.cse5 (select .cse4 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) (.cse0 (= |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (let ((.cse1 (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset|))) (and (not .cse0) (<= .cse1 0) (or (exists ((v_prenex_29 Int) (v_prenex_32 (Array Int Int)) (v_prenex_31 (Array Int Int)) (v_prenex_30 (Array Int Int))) (let ((.cse6 (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_30) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_31) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_32))) (let ((.cse3 (select .cse6 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (and (= .cse2 (store (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_31) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_32) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_prenex_29)) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset| .cse1)) (= .cse4 (store .cse3 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| .cse5)) (= (select .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.base|) v_prenex_31))))) (exists ((|ULTIMATE.start_test_fun_~y#1| Int) (v_DerPreprocessor_16 (Array Int Int)) (v_DerPreprocessor_17 (Array Int Int)) (v_DerPreprocessor_18 (Array Int Int))) (let ((.cse8 (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_16) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_17) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_18))) (let ((.cse7 (select .cse8 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (and (= (store (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_17) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_18) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store .cse7 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| |ULTIMATE.start_test_fun_~y#1|)) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset| .cse1) .cse2) (= v_DerPreprocessor_17 (select .cse8 |c_ULTIMATE.start_test_fun_~c~0#1.base|)) (= .cse4 (store .cse7 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| .cse5)) (= (store .cse7 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| (select v_DerPreprocessor_18 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) v_DerPreprocessor_18)))))))) (and (or (exists ((v_DerPreprocessor_23 (Array Int Int))) (let ((.cse9 (select v_DerPreprocessor_23 |c_ULTIMATE.start_test_fun_~c~0#1.offset|))) (and (<= .cse9 0) (exists ((v_DerPreprocessor_21 (Array Int Int)) (v_DerPreprocessor_22 (Array Int Int))) (let ((.cse12 (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_21) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_22) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_23))) (and (exists ((|ULTIMATE.start_test_fun_~y#1| Int) (v_DerPreprocessor_16 (Array Int Int)) (v_DerPreprocessor_17 (Array Int Int)) (v_DerPreprocessor_18 (Array Int Int))) (let ((.cse11 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_16) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_17) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_18) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (let ((.cse10 (store (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_17) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_18) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store .cse11 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| |ULTIMATE.start_test_fun_~y#1|)) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset| .cse9))) (and (= .cse10 v_DerPreprocessor_23) (= .cse10 .cse2) (= (store .cse11 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| .cse5) (select .cse12 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (= v_DerPreprocessor_16 .cse11))))) (= (select .cse12 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) v_DerPreprocessor_21))))))) (exists ((v_DerPreprocessor_23 (Array Int Int))) (let ((.cse13 (select v_DerPreprocessor_23 |c_ULTIMATE.start_test_fun_~c~0#1.offset|))) (and (<= .cse13 0) (exists ((v_DerPreprocessor_21 (Array Int Int)) (v_DerPreprocessor_22 (Array Int Int))) (let ((.cse17 (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_21) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_22) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_23))) (let ((.cse16 (select .cse17 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (and (exists ((v_prenex_43 (Array Int Int)) (v_prenex_42 (Array Int Int)) (v_prenex_41 Int) (v_prenex_44 (Array Int Int))) (let ((.cse14 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_42) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_43) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_44) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (let ((.cse15 (store (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_43) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_44) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store .cse14 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_prenex_41)) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset| .cse13))) (and (= .cse14 v_prenex_42) (= .cse15 v_DerPreprocessor_23) (= .cse15 .cse2) (= (store (store .cse16 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| (select v_prenex_44 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| (select v_prenex_44 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) v_prenex_44))))) (= (select .cse17 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) v_DerPreprocessor_21) (= (select .cse16 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) .cse5))))))))) .cse0))))) is different from true [2023-11-19 07:33:11,982 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (let ((.cse0 (select .cse5 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|))) (and (not (= |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| |c_ULTIMATE.start_test_fun_~c~0#1.base|)) (or (< .cse0 (+ (select (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 1)) (not |c_ULTIMATE.start_test_fun_#t~short8#1|)) (let ((.cse3 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|)) (.cse1 (= |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (or (let ((.cse2 (select .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset|))) (and (not .cse1) (<= .cse2 0) (or (exists ((v_prenex_29 Int) (v_prenex_32 (Array Int Int)) (v_prenex_31 (Array Int Int)) (v_prenex_30 (Array Int Int))) (let ((.cse6 (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_30) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_31) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_32))) (let ((.cse4 (select .cse6 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (and (= .cse3 (store (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_31) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_32) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store .cse4 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_prenex_29)) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset| .cse2)) (= .cse5 (store .cse4 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| .cse0)) (= (select .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.base|) v_prenex_31))))) (exists ((|ULTIMATE.start_test_fun_~y#1| Int) (v_DerPreprocessor_16 (Array Int Int)) (v_DerPreprocessor_17 (Array Int Int)) (v_DerPreprocessor_18 (Array Int Int))) (let ((.cse8 (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_16) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_17) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_18))) (let ((.cse7 (select .cse8 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (and (= (store (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_17) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_18) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store .cse7 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| |ULTIMATE.start_test_fun_~y#1|)) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset| .cse2) .cse3) (= v_DerPreprocessor_17 (select .cse8 |c_ULTIMATE.start_test_fun_~c~0#1.base|)) (= .cse5 (store .cse7 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| .cse0)) (= (store .cse7 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| (select v_DerPreprocessor_18 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) v_DerPreprocessor_18)))))))) (and (or (exists ((v_DerPreprocessor_23 (Array Int Int))) (let ((.cse9 (select v_DerPreprocessor_23 |c_ULTIMATE.start_test_fun_~c~0#1.offset|))) (and (<= .cse9 0) (exists ((v_DerPreprocessor_21 (Array Int Int)) (v_DerPreprocessor_22 (Array Int Int))) (let ((.cse12 (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_21) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_22) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_23))) (and (exists ((|ULTIMATE.start_test_fun_~y#1| Int) (v_DerPreprocessor_16 (Array Int Int)) (v_DerPreprocessor_17 (Array Int Int)) (v_DerPreprocessor_18 (Array Int Int))) (let ((.cse11 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_16) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_17) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_18) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (let ((.cse10 (store (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_17) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_18) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store .cse11 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| |ULTIMATE.start_test_fun_~y#1|)) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset| .cse9))) (and (= .cse10 v_DerPreprocessor_23) (= .cse10 .cse3) (= (store .cse11 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| .cse0) (select .cse12 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|)) (= v_DerPreprocessor_16 .cse11))))) (= (select .cse12 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) v_DerPreprocessor_21))))))) (exists ((v_DerPreprocessor_23 (Array Int Int))) (let ((.cse13 (select v_DerPreprocessor_23 |c_ULTIMATE.start_test_fun_~c~0#1.offset|))) (and (<= .cse13 0) (exists ((v_DerPreprocessor_21 (Array Int Int)) (v_DerPreprocessor_22 (Array Int Int))) (let ((.cse17 (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_21) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_DerPreprocessor_22) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_23))) (let ((.cse16 (select .cse17 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (and (exists ((v_prenex_43 (Array Int Int)) (v_prenex_42 (Array Int Int)) (v_prenex_41 Int) (v_prenex_44 (Array Int Int))) (let ((.cse14 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_prenex_42) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_43) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_44) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (let ((.cse15 (store (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| v_prenex_43) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_prenex_44) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store .cse14 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| v_prenex_41)) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset| .cse13))) (and (= .cse14 v_prenex_42) (= .cse15 v_DerPreprocessor_23) (= .cse15 .cse3) (= (store (store .cse16 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| (select v_prenex_44 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| (select v_prenex_44 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) v_prenex_44))))) (= (select .cse17 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) v_DerPreprocessor_21) (= (select .cse16 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) .cse0))))))))) .cse1)))))) is different from true [2023-11-19 07:33:13,567 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:33:13,730 INFO L349 Elim1Store]: treesize reduction 24, result has 59.3 percent of original size [2023-11-19 07:33:13,730 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 706 treesize of output 660 [2023-11-19 07:33:13,764 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 293 treesize of output 291 [2023-11-19 07:33:13,792 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 283 treesize of output 281 [2023-11-19 07:33:13,856 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 273 treesize of output 291 [2023-11-19 07:33:13,898 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 263 treesize of output 266 [2023-11-19 07:33:13,985 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 76 [2023-11-19 07:33:14,071 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 22 treesize of output 20 [2023-11-19 07:33:14,177 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 20 treesize of output 18 [2023-11-19 07:33:14,239 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-19 07:33:14,292 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-19 07:33:14,310 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-19 07:33:14,336 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 7 treesize of output 5 [2023-11-19 07:33:14,400 WARN L214 Elim1Store]: Array PQE input equivalent to false [2023-11-19 07:33:14,414 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 7 treesize of output 5 [2023-11-19 07:33:14,534 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 7 treesize of output 5 [2023-11-19 07:33:14,590 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 7 treesize of output 5 [2023-11-19 07:33:14,620 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 22 treesize of output 20 [2023-11-19 07:33:14,649 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 22 treesize of output 20 [2023-11-19 07:33:14,697 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 7 treesize of output 5 [2023-11-19 07:33:14,795 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 07:33:14,796 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2023-11-19 07:33:14,923 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:33:14,923 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-19 07:33:15,139 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 0 case distinctions, treesize of input 58 treesize of output 38 [2023-11-19 07:33:15,427 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 0 case distinctions, treesize of input 45 treesize of output 29 [2023-11-19 07:33:16,066 INFO L349 Elim1Store]: treesize reduction 68, result has 40.4 percent of original size [2023-11-19 07:33:16,067 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 50 treesize of output 68 [2023-11-19 07:33:16,265 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:33:16,268 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-11-19 07:33:16,340 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:33:16,340 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 07:33:17,443 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_255 Int) (|v_ULTIMATE.start_test_fun_#t~mem11#1_21| Int) (|ULTIMATE.start_test_fun_#t~mem12#1| Int) (v_ArrVal_252 (Array Int Int)) (v_ArrVal_257 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_252))) (let ((.cse0 (select .cse4 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|))) (let ((.cse3 (store .cse4 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset| (+ (- 1) |v_ULTIMATE.start_test_fun_#t~mem11#1_21|))))) (let ((.cse2 (store (select .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset| (+ |ULTIMATE.start_test_fun_#t~mem12#1| 1)))) (let ((.cse1 (store .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse2))) (or (< (select .cse0 |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) |v_ULTIMATE.start_test_fun_#t~mem11#1_21|) (< (+ 2147483649 |ULTIMATE.start_test_fun_#t~mem12#1|) 0) (< (select (select .cse1 |c_ULTIMATE.start_test_fun_~y_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~y_ref~0#1.offset|) 1) (< 0 (+ 2147483650 (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| .cse2) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store (select .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_255)) |c_ULTIMATE.start_test_fun_~y_ref~0#1.base| v_ArrVal_257) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|)))))))))) is different from false [2023-11-19 07:33:18,136 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2023-11-19 07:33:18,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1257826317] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-19 07:33:18,137 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-19 07:33:18,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 12, 12] total 30 [2023-11-19 07:33:18,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053507940] [2023-11-19 07:33:18,137 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-19 07:33:18,139 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-11-19 07:33:18,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:33:18,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-11-19 07:33:18,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=613, Unknown=14, NotChecked=162, Total=930 [2023-11-19 07:33:18,141 INFO L87 Difference]: Start difference. First operand 56 states and 70 transitions. Second operand has 31 states, 30 states have (on average 1.9333333333333333) internal successors, (58), 31 states have internal predecessors, (58), 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:33:20,158 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-19 07:33:24,665 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-19 07:33:29,213 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-19 07:33:33,913 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-19 07:33:35,971 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-19 07:33:37,995 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0]