./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/array-patterns/array11_pattern.c --full-output --preprocessor.use.memory.slicer false --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6ae2ee47 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/array-patterns/array11_pattern.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c3ac08a3f6fb5579b9b2ae158efc8988dd3312e617d74223198803ffe0b335cb --preprocessor.use.memory.slicer false --- Real Ultimate output --- This is Ultimate 0.2.3-dev-6ae2ee4-m [2023-11-22 21:20:25,692 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-22 21:20:25,772 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-22 21:20:25,776 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-22 21:20:25,777 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-22 21:20:25,796 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-22 21:20:25,797 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-22 21:20:25,797 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-22 21:20:25,798 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-22 21:20:25,798 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-22 21:20:25,798 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-22 21:20:25,799 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-22 21:20:25,799 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-22 21:20:25,800 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-22 21:20:25,800 INFO L153 SettingsManager]: * Use SBE=true [2023-11-22 21:20:25,800 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-22 21:20:25,801 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-22 21:20:25,801 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-22 21:20:25,801 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-22 21:20:25,802 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-22 21:20:25,802 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-22 21:20:25,803 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-22 21:20:25,803 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-22 21:20:25,803 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-22 21:20:25,804 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-22 21:20:25,804 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-22 21:20:25,804 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-22 21:20:25,805 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-22 21:20:25,805 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-22 21:20:25,805 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-22 21:20:25,806 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-22 21:20:25,806 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-22 21:20:25,807 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-22 21:20:25,807 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-22 21:20:25,807 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-22 21:20:25,808 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-22 21:20:25,808 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-22 21:20:25,808 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-22 21:20:25,809 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-22 21:20:25,809 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-22 21:20:25,809 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-22 21:20:25,810 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-22 21:20:25,810 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:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c3ac08a3f6fb5579b9b2ae158efc8988dd3312e617d74223198803ffe0b335cb Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Use memory slicer -> false [2023-11-22 21:20:26,051 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-22 21:20:26,073 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-22 21:20:26,075 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-22 21:20:26,078 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-22 21:20:26,078 INFO L274 PluginConnector]: CDTParser initialized [2023-11-22 21:20:26,079 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-patterns/array11_pattern.c [2023-11-22 21:20:27,179 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-22 21:20:27,360 INFO L384 CDTParser]: Found 1 translation units. [2023-11-22 21:20:27,361 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-patterns/array11_pattern.c [2023-11-22 21:20:27,368 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dfa93baa2/a46d5abb6ff845e0914d5ca30a3080bd/FLAG3ef7fe562 [2023-11-22 21:20:27,379 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dfa93baa2/a46d5abb6ff845e0914d5ca30a3080bd [2023-11-22 21:20:27,381 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-22 21:20:27,382 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-22 21:20:27,383 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-22 21:20:27,383 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-22 21:20:27,393 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-22 21:20:27,394 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 09:20:27" (1/1) ... [2023-11-22 21:20:27,395 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d8c2bd1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:20:27, skipping insertion in model container [2023-11-22 21:20:27,395 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 09:20:27" (1/1) ... [2023-11-22 21:20:27,420 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-22 21:20:27,547 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/array-patterns/array11_pattern.c[1357,1370] [2023-11-22 21:20:27,567 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-22 21:20:27,581 INFO L202 MainTranslator]: Completed pre-run [2023-11-22 21:20:27,592 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/array-patterns/array11_pattern.c[1357,1370] [2023-11-22 21:20:27,599 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-22 21:20:27,612 INFO L206 MainTranslator]: Completed translation [2023-11-22 21:20:27,613 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:20:27 WrapperNode [2023-11-22 21:20:27,613 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-22 21:20:27,614 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-22 21:20:27,614 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-22 21:20:27,615 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-22 21:20:27,623 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:20:27" (1/1) ... [2023-11-22 21:20:27,636 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:20:27" (1/1) ... [2023-11-22 21:20:27,664 INFO L138 Inliner]: procedures = 16, calls = 22, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 78 [2023-11-22 21:20:27,664 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-22 21:20:27,665 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-22 21:20:27,665 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-22 21:20:27,665 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-22 21:20:27,674 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:20:27" (1/1) ... [2023-11-22 21:20:27,675 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:20:27" (1/1) ... [2023-11-22 21:20:27,679 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:20:27" (1/1) ... [2023-11-22 21:20:27,679 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:20:27" (1/1) ... [2023-11-22 21:20:27,687 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:20:27" (1/1) ... [2023-11-22 21:20:27,691 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:20:27" (1/1) ... [2023-11-22 21:20:27,692 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:20:27" (1/1) ... [2023-11-22 21:20:27,693 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:20:27" (1/1) ... [2023-11-22 21:20:27,695 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-22 21:20:27,696 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-22 21:20:27,696 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-22 21:20:27,696 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-22 21:20:27,697 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:20:27" (1/1) ... [2023-11-22 21:20:27,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-22 21:20:27,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 21:20:27,724 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-22 21:20:27,730 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-22 21:20:27,786 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-22 21:20:27,786 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-22 21:20:27,786 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-22 21:20:27,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-22 21:20:27,786 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-22 21:20:27,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-22 21:20:27,787 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-22 21:20:27,787 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-22 21:20:27,787 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-22 21:20:27,787 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-22 21:20:27,853 INFO L241 CfgBuilder]: Building ICFG [2023-11-22 21:20:27,855 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-22 21:20:28,281 INFO L282 CfgBuilder]: Performing block encoding [2023-11-22 21:20:28,305 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-22 21:20:28,306 INFO L309 CfgBuilder]: Removed 3 assume(true) statements. [2023-11-22 21:20:28,306 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:20:28 BoogieIcfgContainer [2023-11-22 21:20:28,307 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-22 21:20:28,309 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-22 21:20:28,309 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-22 21:20:28,312 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-22 21:20:28,312 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 09:20:27" (1/3) ... [2023-11-22 21:20:28,313 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2651efbb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 09:20:28, skipping insertion in model container [2023-11-22 21:20:28,313 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:20:27" (2/3) ... [2023-11-22 21:20:28,314 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2651efbb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 09:20:28, skipping insertion in model container [2023-11-22 21:20:28,314 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:20:28" (3/3) ... [2023-11-22 21:20:28,315 INFO L112 eAbstractionObserver]: Analyzing ICFG array11_pattern.c [2023-11-22 21:20:28,329 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-22 21:20:28,329 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-22 21:20:28,368 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-22 21:20:28,374 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;@66f5c40b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-22 21:20:28,374 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-22 21:20:28,377 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 16 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-22 21:20:28,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-11-22 21:20:28,382 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:20:28,383 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 21:20:28,383 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 21:20:28,388 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:20:28,389 INFO L85 PathProgramCache]: Analyzing trace with hash 1955600755, now seen corresponding path program 1 times [2023-11-22 21:20:28,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 21:20:28,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790986186] [2023-11-22 21:20:28,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:20:28,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 21:20:28,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:20:28,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-22 21:20:28,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:20:28,571 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-22 21:20:28,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 21:20:28,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790986186] [2023-11-22 21:20:28,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1790986186] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 21:20:28,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 21:20:28,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-22 21:20:28,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118416042] [2023-11-22 21:20:28,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 21:20:28,578 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-22 21:20:28,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 21:20:28,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-22 21:20:28,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-22 21:20:28,603 INFO L87 Difference]: Start difference. First operand has 20 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 16 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-22 21:20:28,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 21:20:28,644 INFO L93 Difference]: Finished difference Result 38 states and 57 transitions. [2023-11-22 21:20:28,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-22 21:20:28,647 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2023-11-22 21:20:28,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 21:20:28,653 INFO L225 Difference]: With dead ends: 38 [2023-11-22 21:20:28,653 INFO L226 Difference]: Without dead ends: 18 [2023-11-22 21:20:28,657 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-22 21:20:28,662 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-22 21:20:28,662 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 19 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-22 21:20:28,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2023-11-22 21:20:28,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2023-11-22 21:20:28,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-22 21:20:28,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2023-11-22 21:20:28,699 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 21 transitions. Word has length 14 [2023-11-22 21:20:28,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 21:20:28,700 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 21 transitions. [2023-11-22 21:20:28,701 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-22 21:20:28,702 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2023-11-22 21:20:28,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-11-22 21:20:28,703 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:20:28,704 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 21:20:28,704 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-22 21:20:28,704 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 21:20:28,705 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:20:28,706 INFO L85 PathProgramCache]: Analyzing trace with hash -1269041496, now seen corresponding path program 1 times [2023-11-22 21:20:28,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 21:20:28,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914147874] [2023-11-22 21:20:28,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:20:28,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 21:20:28,761 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-22 21:20:28,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [916796947] [2023-11-22 21:20:28,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:20:28,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 21:20:28,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 21:20:28,765 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-22 21:20:28,784 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-22 21:20:28,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:20:28,837 INFO L262 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-22 21:20:28,843 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 21:20:28,907 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-22 21:20:28,907 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 21:20:28,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 21:20:28,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914147874] [2023-11-22 21:20:28,908 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-22 21:20:28,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [916796947] [2023-11-22 21:20:28,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [916796947] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 21:20:28,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 21:20:28,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-22 21:20:28,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932516749] [2023-11-22 21:20:28,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 21:20:28,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-22 21:20:28,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 21:20:28,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-22 21:20:28,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-22 21:20:28,912 INFO L87 Difference]: Start difference. First operand 18 states and 21 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-22 21:20:28,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 21:20:28,936 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2023-11-22 21:20:28,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-22 21:20:28,937 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 21 [2023-11-22 21:20:28,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 21:20:28,938 INFO L225 Difference]: With dead ends: 23 [2023-11-22 21:20:28,938 INFO L226 Difference]: Without dead ends: 19 [2023-11-22 21:20:28,938 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-22 21:20:28,939 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 3 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-22 21:20:28,940 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 42 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-22 21:20:28,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2023-11-22 21:20:28,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2023-11-22 21:20:28,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-22 21:20:28,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2023-11-22 21:20:28,949 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 22 transitions. Word has length 21 [2023-11-22 21:20:28,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 21:20:28,950 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 22 transitions. [2023-11-22 21:20:28,950 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-22 21:20:28,951 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2023-11-22 21:20:28,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-11-22 21:20:28,952 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:20:28,952 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 21:20:28,972 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-22 21:20:29,172 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 21:20:29,173 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 21:20:29,174 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:20:29,174 INFO L85 PathProgramCache]: Analyzing trace with hash -651651653, now seen corresponding path program 1 times [2023-11-22 21:20:29,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 21:20:29,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042143566] [2023-11-22 21:20:29,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:20:29,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 21:20:29,194 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-22 21:20:29,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [179347088] [2023-11-22 21:20:29,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:20:29,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 21:20:29,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 21:20:29,202 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-22 21:20:29,238 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-22 21:20:29,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:20:29,323 INFO L262 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-22 21:20:29,325 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 21:20:29,359 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 21:20:29,359 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-22 21:20:29,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 21:20:29,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042143566] [2023-11-22 21:20:29,360 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-22 21:20:29,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [179347088] [2023-11-22 21:20:29,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [179347088] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 21:20:29,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 21:20:29,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-22 21:20:29,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129103265] [2023-11-22 21:20:29,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 21:20:29,361 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-22 21:20:29,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 21:20:29,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-22 21:20:29,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-22 21:20:29,363 INFO L87 Difference]: Start difference. First operand 19 states and 22 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-22 21:20:29,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 21:20:29,498 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2023-11-22 21:20:29,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-22 21:20:29,498 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 22 [2023-11-22 21:20:29,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 21:20:29,499 INFO L225 Difference]: With dead ends: 35 [2023-11-22 21:20:29,499 INFO L226 Difference]: Without dead ends: 20 [2023-11-22 21:20:29,500 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-11-22 21:20:29,501 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 6 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-22 21:20:29,501 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 51 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-22 21:20:29,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2023-11-22 21:20:29,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2023-11-22 21:20:29,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-22 21:20:29,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2023-11-22 21:20:29,505 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 22 [2023-11-22 21:20:29,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 21:20:29,505 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2023-11-22 21:20:29,506 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-22 21:20:29,506 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2023-11-22 21:20:29,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-11-22 21:20:29,506 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 21:20:29,506 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 21:20:29,523 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-22 21:20:29,707 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2023-11-22 21:20:29,707 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 21:20:29,708 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 21:20:29,708 INFO L85 PathProgramCache]: Analyzing trace with hash -1163521459, now seen corresponding path program 1 times [2023-11-22 21:20:29,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 21:20:29,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756075759] [2023-11-22 21:20:29,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:20:29,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 21:20:29,734 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-22 21:20:29,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1381862857] [2023-11-22 21:20:29,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 21:20:29,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-22 21:20:29,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 21:20:29,759 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-22 21:20:29,778 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-22 21:20:29,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 21:20:29,820 INFO L262 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 43 conjunts are in the unsatisfiable core [2023-11-22 21:20:29,824 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-22 21:20:29,893 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-22 21:20:29,965 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 27 treesize of output 15 [2023-11-22 21:20:30,404 INFO L349 Elim1Store]: treesize reduction 100, result has 13.0 percent of original size [2023-11-22 21:20:30,405 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 56 treesize of output 41 [2023-11-22 21:20:30,637 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-22 21:20:30,638 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-22 21:22:52,325 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse39 (mod |c_ULTIMATE.start_main_~index~0#1| 4294967296))) (let ((.cse5 (= (+ |c_ULTIMATE.start_main_~index~0#1| 1) c_~ARR_SIZE~0)) (.cse15 (mod (* |c_ULTIMATE.start_main_~index~0#1| |c_ULTIMATE.start_main_~num~0#1|) 4294967296)) (.cse66 (* .cse39 4))) (let ((.cse25 (< 2147483647 .cse39)) (.cse32 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse66)) (.cse40 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse66)) (.cse24 (< .cse39 2147483648)) (.cse16 (< 2147483647 .cse15)) (.cse1 (< .cse15 2147483648)) (.cse10 (+ .cse15 (- 4294967296))) (.cse2 (* c_~ARR_SIZE~0 2)) (.cse19 (not .cse5)) (.cse9 (+ (- 17179869184) |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse66)) (.cse21 (+ .cse39 (- 4294967296))) (.cse22 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse23 (+ (- 17179869184) |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse66)) (.cse0 (mod (* |c_ULTIMATE.start_main_~index~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1|) 4294967296))) (and (or (< 2147483647 .cse0) (and (or (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| (store .cse22 .cse23 .cse0)))) (let ((.cse8 (select .cse7 |c_ULTIMATE.start_main_~#array2~0#1.base|))) (let ((.cse11 (let ((.cse20 (store .cse8 .cse9 .cse21))) (let ((.cse17 (select (select (store .cse7 |c_ULTIMATE.start_main_~#array2~0#1.base| .cse20) |c_ULTIMATE.start_main_~#array1~0#1.base|) |c_ULTIMATE.start_main_~#array1~0#1.offset|)) (.cse18 (select .cse20 |c_ULTIMATE.start_main_~#array2~0#1.offset|))) (or (= .cse2 (+ .cse17 |c_ULTIMATE.start_main_~sum~0#1| 2 .cse18)) .cse19 (= (+ .cse17 |c_ULTIMATE.start_main_~sum~0#1| .cse18) 0)))))) (and (or .cse1 (and (let ((.cse6 (store .cse8 .cse9 .cse10))) (let ((.cse3 (select (select (store .cse7 |c_ULTIMATE.start_main_~#array2~0#1.base| .cse6) |c_ULTIMATE.start_main_~#array1~0#1.base|) |c_ULTIMATE.start_main_~#array1~0#1.offset|)) (.cse4 (select .cse6 |c_ULTIMATE.start_main_~#array2~0#1.offset|))) (or (= .cse2 (+ |c_ULTIMATE.start_main_~sum~0#1| 2 .cse3 .cse4)) (= (+ |c_ULTIMATE.start_main_~sum~0#1| .cse3 .cse4) 0) .cse5))) .cse11)) (or (and (let ((.cse14 (store .cse8 .cse9 .cse15))) (let ((.cse12 (select .cse14 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse13 (select (select (store .cse7 |c_ULTIMATE.start_main_~#array2~0#1.base| .cse14) |c_ULTIMATE.start_main_~#array1~0#1.base|) |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (or (= .cse2 (+ |c_ULTIMATE.start_main_~sum~0#1| 2 .cse12 .cse13)) (= (+ |c_ULTIMATE.start_main_~sum~0#1| .cse12 .cse13) 0) .cse5))) .cse11) .cse16))))) .cse24) (or .cse25 (let ((.cse30 (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| (store .cse22 .cse40 .cse0)))) (let ((.cse31 (select .cse30 |c_ULTIMATE.start_main_~#array2~0#1.base|))) (let ((.cse26 (let ((.cse38 (store .cse31 .cse32 .cse39))) (let ((.cse36 (select .cse38 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse37 (select (select (store .cse30 |c_ULTIMATE.start_main_~#array2~0#1.base| .cse38) |c_ULTIMATE.start_main_~#array1~0#1.base|) |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (or (= (+ .cse36 .cse37 |c_ULTIMATE.start_main_~sum~0#1|) 0) (= .cse2 (+ .cse36 .cse37 |c_ULTIMATE.start_main_~sum~0#1| 2)) .cse19))))) (and (or (and .cse26 (let ((.cse29 (store .cse31 .cse32 .cse15))) (let ((.cse27 (select (select (store .cse30 |c_ULTIMATE.start_main_~#array2~0#1.base| .cse29) |c_ULTIMATE.start_main_~#array1~0#1.base|) |c_ULTIMATE.start_main_~#array1~0#1.offset|)) (.cse28 (select .cse29 |c_ULTIMATE.start_main_~#array2~0#1.offset|))) (or (= .cse2 (+ .cse27 |c_ULTIMATE.start_main_~sum~0#1| 2 .cse28)) (= (+ .cse27 |c_ULTIMATE.start_main_~sum~0#1| .cse28) 0) .cse5)))) .cse16) (or .cse1 (and .cse26 (let ((.cse35 (store .cse31 .cse32 .cse10))) (let ((.cse33 (select (select (store .cse30 |c_ULTIMATE.start_main_~#array2~0#1.base| .cse35) |c_ULTIMATE.start_main_~#array1~0#1.base|) |c_ULTIMATE.start_main_~#array1~0#1.offset|)) (.cse34 (select .cse35 |c_ULTIMATE.start_main_~#array2~0#1.offset|))) (or (= 0 (+ .cse33 |c_ULTIMATE.start_main_~sum~0#1| .cse34)) (= .cse2 (+ .cse33 |c_ULTIMATE.start_main_~sum~0#1| 2 .cse34)) .cse5)))))))))))) (or (< .cse0 2147483648) (let ((.cse53 (+ .cse0 (- 4294967296)))) (and (or .cse25 (let ((.cse44 (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| (store .cse22 .cse40 .cse53)))) (let ((.cse46 (select .cse44 |c_ULTIMATE.start_main_~#array2~0#1.base|))) (let ((.cse41 (let ((.cse52 (store .cse46 .cse32 .cse39))) (let ((.cse50 (select .cse52 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse51 (select (select (store .cse44 |c_ULTIMATE.start_main_~#array2~0#1.base| .cse52) |c_ULTIMATE.start_main_~#array1~0#1.base|) |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (or (= .cse2 (+ .cse50 |c_ULTIMATE.start_main_~sum~0#1| 2 .cse51)) (= (+ .cse50 |c_ULTIMATE.start_main_~sum~0#1| .cse51) 0) .cse19))))) (and (or (and .cse41 (let ((.cse45 (store .cse46 .cse32 .cse15))) (let ((.cse42 (select .cse45 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse43 (select (select (store .cse44 |c_ULTIMATE.start_main_~#array2~0#1.base| .cse45) |c_ULTIMATE.start_main_~#array1~0#1.base|) |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (or (= (+ .cse42 |c_ULTIMATE.start_main_~sum~0#1| .cse43) 0) (= .cse2 (+ .cse42 |c_ULTIMATE.start_main_~sum~0#1| 2 .cse43)) .cse5)))) .cse16) (or .cse1 (and .cse41 (let ((.cse49 (store .cse46 .cse32 .cse10))) (let ((.cse47 (select .cse49 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse48 (select (select (store .cse44 |c_ULTIMATE.start_main_~#array2~0#1.base| .cse49) |c_ULTIMATE.start_main_~#array1~0#1.base|) |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (or (= .cse2 (+ .cse47 .cse48 |c_ULTIMATE.start_main_~sum~0#1| 2)) (= (+ .cse47 .cse48 |c_ULTIMATE.start_main_~sum~0#1|) 0) .cse5)))))))))) (or .cse24 (let ((.cse58 (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| (store .cse22 .cse23 .cse53)))) (let ((.cse59 (select .cse58 |c_ULTIMATE.start_main_~#array2~0#1.base|))) (let ((.cse54 (let ((.cse65 (store .cse59 .cse9 .cse21))) (let ((.cse63 (select .cse65 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse64 (select (select (store .cse58 |c_ULTIMATE.start_main_~#array2~0#1.base| .cse65) |c_ULTIMATE.start_main_~#array1~0#1.base|) |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (or (= .cse2 (+ |c_ULTIMATE.start_main_~sum~0#1| 2 .cse63 .cse64)) (= 0 (+ |c_ULTIMATE.start_main_~sum~0#1| .cse63 .cse64)) .cse19))))) (and (or (and .cse54 (let ((.cse57 (store .cse59 .cse9 .cse15))) (let ((.cse55 (select (select (store .cse58 |c_ULTIMATE.start_main_~#array2~0#1.base| .cse57) |c_ULTIMATE.start_main_~#array1~0#1.base|) |c_ULTIMATE.start_main_~#array1~0#1.offset|)) (.cse56 (select .cse57 |c_ULTIMATE.start_main_~#array2~0#1.offset|))) (or (= .cse2 (+ .cse55 |c_ULTIMATE.start_main_~sum~0#1| 2 .cse56)) (= (+ .cse55 |c_ULTIMATE.start_main_~sum~0#1| .cse56) 0) .cse5)))) .cse16) (or .cse1 (and .cse54 (let ((.cse62 (store .cse59 .cse9 .cse10))) (let ((.cse60 (select (select (store .cse58 |c_ULTIMATE.start_main_~#array2~0#1.base| .cse62) |c_ULTIMATE.start_main_~#array1~0#1.base|) |c_ULTIMATE.start_main_~#array1~0#1.offset|)) (.cse61 (select .cse62 |c_ULTIMATE.start_main_~#array2~0#1.offset|))) (or (= .cse2 (+ .cse60 |c_ULTIMATE.start_main_~sum~0#1| 2 .cse61)) (= (+ .cse60 |c_ULTIMATE.start_main_~sum~0#1| .cse61) 0) .cse5))))))))))))))))) is different from false [2023-11-22 21:22:54,333 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse39 (mod |c_ULTIMATE.start_main_~index~0#1| 4294967296))) (let ((.cse5 (= (+ |c_ULTIMATE.start_main_~index~0#1| 1) c_~ARR_SIZE~0)) (.cse15 (mod (* |c_ULTIMATE.start_main_~index~0#1| |c_ULTIMATE.start_main_~num~0#1|) 4294967296)) (.cse66 (* .cse39 4))) (let ((.cse25 (< 2147483647 .cse39)) (.cse32 (+ |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse66)) (.cse40 (+ |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse66)) (.cse24 (< .cse39 2147483648)) (.cse16 (< 2147483647 .cse15)) (.cse1 (< .cse15 2147483648)) (.cse10 (+ .cse15 (- 4294967296))) (.cse2 (* c_~ARR_SIZE~0 2)) (.cse19 (not .cse5)) (.cse9 (+ (- 17179869184) |c_ULTIMATE.start_main_~#array2~0#1.offset| .cse66)) (.cse21 (+ .cse39 (- 4294967296))) (.cse22 (select |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base|)) (.cse23 (+ (- 17179869184) |c_ULTIMATE.start_main_~#array1~0#1.offset| .cse66)) (.cse0 (mod (* |c_ULTIMATE.start_main_~index~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1| |c_ULTIMATE.start_main_~num~0#1|) 4294967296))) (and (or (< 2147483647 .cse0) (and (or (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| (store .cse22 .cse23 .cse0)))) (let ((.cse8 (select .cse7 |c_ULTIMATE.start_main_~#array2~0#1.base|))) (let ((.cse11 (let ((.cse20 (store .cse8 .cse9 .cse21))) (let ((.cse17 (select (select (store .cse7 |c_ULTIMATE.start_main_~#array2~0#1.base| .cse20) |c_ULTIMATE.start_main_~#array1~0#1.base|) |c_ULTIMATE.start_main_~#array1~0#1.offset|)) (.cse18 (select .cse20 |c_ULTIMATE.start_main_~#array2~0#1.offset|))) (or (= .cse2 (+ .cse17 |c_ULTIMATE.start_main_~sum~0#1| 2 .cse18)) .cse19 (= (+ .cse17 |c_ULTIMATE.start_main_~sum~0#1| .cse18) 0)))))) (and (or .cse1 (and (let ((.cse6 (store .cse8 .cse9 .cse10))) (let ((.cse3 (select (select (store .cse7 |c_ULTIMATE.start_main_~#array2~0#1.base| .cse6) |c_ULTIMATE.start_main_~#array1~0#1.base|) |c_ULTIMATE.start_main_~#array1~0#1.offset|)) (.cse4 (select .cse6 |c_ULTIMATE.start_main_~#array2~0#1.offset|))) (or (= .cse2 (+ |c_ULTIMATE.start_main_~sum~0#1| 2 .cse3 .cse4)) (= (+ |c_ULTIMATE.start_main_~sum~0#1| .cse3 .cse4) 0) .cse5))) .cse11)) (or (and (let ((.cse14 (store .cse8 .cse9 .cse15))) (let ((.cse12 (select .cse14 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse13 (select (select (store .cse7 |c_ULTIMATE.start_main_~#array2~0#1.base| .cse14) |c_ULTIMATE.start_main_~#array1~0#1.base|) |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (or (= .cse2 (+ |c_ULTIMATE.start_main_~sum~0#1| 2 .cse12 .cse13)) (= (+ |c_ULTIMATE.start_main_~sum~0#1| .cse12 .cse13) 0) .cse5))) .cse11) .cse16))))) .cse24) (or .cse25 (let ((.cse30 (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| (store .cse22 .cse40 .cse0)))) (let ((.cse31 (select .cse30 |c_ULTIMATE.start_main_~#array2~0#1.base|))) (let ((.cse26 (let ((.cse38 (store .cse31 .cse32 .cse39))) (let ((.cse36 (select .cse38 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse37 (select (select (store .cse30 |c_ULTIMATE.start_main_~#array2~0#1.base| .cse38) |c_ULTIMATE.start_main_~#array1~0#1.base|) |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (or (= (+ .cse36 .cse37 |c_ULTIMATE.start_main_~sum~0#1|) 0) (= .cse2 (+ .cse36 .cse37 |c_ULTIMATE.start_main_~sum~0#1| 2)) .cse19))))) (and (or (and .cse26 (let ((.cse29 (store .cse31 .cse32 .cse15))) (let ((.cse27 (select (select (store .cse30 |c_ULTIMATE.start_main_~#array2~0#1.base| .cse29) |c_ULTIMATE.start_main_~#array1~0#1.base|) |c_ULTIMATE.start_main_~#array1~0#1.offset|)) (.cse28 (select .cse29 |c_ULTIMATE.start_main_~#array2~0#1.offset|))) (or (= .cse2 (+ .cse27 |c_ULTIMATE.start_main_~sum~0#1| 2 .cse28)) (= (+ .cse27 |c_ULTIMATE.start_main_~sum~0#1| .cse28) 0) .cse5)))) .cse16) (or .cse1 (and .cse26 (let ((.cse35 (store .cse31 .cse32 .cse10))) (let ((.cse33 (select (select (store .cse30 |c_ULTIMATE.start_main_~#array2~0#1.base| .cse35) |c_ULTIMATE.start_main_~#array1~0#1.base|) |c_ULTIMATE.start_main_~#array1~0#1.offset|)) (.cse34 (select .cse35 |c_ULTIMATE.start_main_~#array2~0#1.offset|))) (or (= 0 (+ .cse33 |c_ULTIMATE.start_main_~sum~0#1| .cse34)) (= .cse2 (+ .cse33 |c_ULTIMATE.start_main_~sum~0#1| 2 .cse34)) .cse5)))))))))))) (or (< .cse0 2147483648) (let ((.cse53 (+ .cse0 (- 4294967296)))) (and (or .cse25 (let ((.cse44 (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| (store .cse22 .cse40 .cse53)))) (let ((.cse46 (select .cse44 |c_ULTIMATE.start_main_~#array2~0#1.base|))) (let ((.cse41 (let ((.cse52 (store .cse46 .cse32 .cse39))) (let ((.cse50 (select .cse52 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse51 (select (select (store .cse44 |c_ULTIMATE.start_main_~#array2~0#1.base| .cse52) |c_ULTIMATE.start_main_~#array1~0#1.base|) |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (or (= .cse2 (+ .cse50 |c_ULTIMATE.start_main_~sum~0#1| 2 .cse51)) (= (+ .cse50 |c_ULTIMATE.start_main_~sum~0#1| .cse51) 0) .cse19))))) (and (or (and .cse41 (let ((.cse45 (store .cse46 .cse32 .cse15))) (let ((.cse42 (select .cse45 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse43 (select (select (store .cse44 |c_ULTIMATE.start_main_~#array2~0#1.base| .cse45) |c_ULTIMATE.start_main_~#array1~0#1.base|) |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (or (= (+ .cse42 |c_ULTIMATE.start_main_~sum~0#1| .cse43) 0) (= .cse2 (+ .cse42 |c_ULTIMATE.start_main_~sum~0#1| 2 .cse43)) .cse5)))) .cse16) (or .cse1 (and .cse41 (let ((.cse49 (store .cse46 .cse32 .cse10))) (let ((.cse47 (select .cse49 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse48 (select (select (store .cse44 |c_ULTIMATE.start_main_~#array2~0#1.base| .cse49) |c_ULTIMATE.start_main_~#array1~0#1.base|) |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (or (= .cse2 (+ .cse47 .cse48 |c_ULTIMATE.start_main_~sum~0#1| 2)) (= (+ .cse47 .cse48 |c_ULTIMATE.start_main_~sum~0#1|) 0) .cse5)))))))))) (or .cse24 (let ((.cse58 (store |c_#memory_int| |c_ULTIMATE.start_main_~#array1~0#1.base| (store .cse22 .cse23 .cse53)))) (let ((.cse59 (select .cse58 |c_ULTIMATE.start_main_~#array2~0#1.base|))) (let ((.cse54 (let ((.cse65 (store .cse59 .cse9 .cse21))) (let ((.cse63 (select .cse65 |c_ULTIMATE.start_main_~#array2~0#1.offset|)) (.cse64 (select (select (store .cse58 |c_ULTIMATE.start_main_~#array2~0#1.base| .cse65) |c_ULTIMATE.start_main_~#array1~0#1.base|) |c_ULTIMATE.start_main_~#array1~0#1.offset|))) (or (= .cse2 (+ |c_ULTIMATE.start_main_~sum~0#1| 2 .cse63 .cse64)) (= 0 (+ |c_ULTIMATE.start_main_~sum~0#1| .cse63 .cse64)) .cse19))))) (and (or (and .cse54 (let ((.cse57 (store .cse59 .cse9 .cse15))) (let ((.cse55 (select (select (store .cse58 |c_ULTIMATE.start_main_~#array2~0#1.base| .cse57) |c_ULTIMATE.start_main_~#array1~0#1.base|) |c_ULTIMATE.start_main_~#array1~0#1.offset|)) (.cse56 (select .cse57 |c_ULTIMATE.start_main_~#array2~0#1.offset|))) (or (= .cse2 (+ .cse55 |c_ULTIMATE.start_main_~sum~0#1| 2 .cse56)) (= (+ .cse55 |c_ULTIMATE.start_main_~sum~0#1| .cse56) 0) .cse5)))) .cse16) (or .cse1 (and .cse54 (let ((.cse62 (store .cse59 .cse9 .cse10))) (let ((.cse60 (select (select (store .cse58 |c_ULTIMATE.start_main_~#array2~0#1.base| .cse62) |c_ULTIMATE.start_main_~#array1~0#1.base|) |c_ULTIMATE.start_main_~#array1~0#1.offset|)) (.cse61 (select .cse62 |c_ULTIMATE.start_main_~#array2~0#1.offset|))) (or (= .cse2 (+ .cse60 |c_ULTIMATE.start_main_~sum~0#1| 2 .cse61)) (= (+ .cse60 |c_ULTIMATE.start_main_~sum~0#1| .cse61) 0) .cse5))))))))))))))))) is different from true Killed by 15