/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/array-fpi/mods.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-09 23:21:49,068 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-09 23:21:49,070 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-09 23:21:49,122 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-09 23:21:49,122 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-09 23:21:49,123 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-09 23:21:49,124 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-09 23:21:49,125 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-09 23:21:49,126 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-09 23:21:49,127 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-09 23:21:49,127 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-09 23:21:49,128 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-09 23:21:49,128 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-09 23:21:49,129 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-09 23:21:49,129 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-09 23:21:49,130 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-09 23:21:49,131 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-09 23:21:49,131 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-09 23:21:49,132 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-09 23:21:49,133 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-09 23:21:49,134 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-09 23:21:49,136 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-09 23:21:49,137 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-09 23:21:49,138 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-09 23:21:49,139 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-09 23:21:49,140 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-09 23:21:49,140 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-09 23:21:49,141 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-09 23:21:49,141 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-09 23:21:49,142 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-09 23:21:49,142 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-09 23:21:49,142 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-09 23:21:49,143 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-09 23:21:49,143 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-09 23:21:49,144 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-09 23:21:49,144 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-09 23:21:49,144 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-09 23:21:49,144 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-09 23:21:49,145 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-09 23:21:49,145 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-09 23:21:49,146 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-09 23:21:49,147 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_Default.epf [2022-01-09 23:21:49,160 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-09 23:21:49,161 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-09 23:21:49,161 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-09 23:21:49,161 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-09 23:21:49,161 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-09 23:21:49,161 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-09 23:21:49,162 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-09 23:21:49,162 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-09 23:21:49,162 INFO L138 SettingsManager]: * Use SBE=true [2022-01-09 23:21:49,162 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-09 23:21:49,162 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-09 23:21:49,162 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-09 23:21:49,162 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-09 23:21:49,162 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-09 23:21:49,162 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-09 23:21:49,162 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-09 23:21:49,163 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-09 23:21:49,163 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-09 23:21:49,163 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-09 23:21:49,163 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-09 23:21:49,163 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-09 23:21:49,163 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-09 23:21:49,163 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-09 23:21:49,163 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-09 23:21:49,163 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-09 23:21:49,163 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-09 23:21:49,163 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-09 23:21:49,164 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-09 23:21:49,164 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-09 23:21:49,164 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-09 23:21:49,164 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-01-09 23:21:49,366 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-09 23:21:49,394 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-09 23:21:49,396 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-09 23:21:49,397 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-09 23:21:49,398 INFO L275 PluginConnector]: CDTParser initialized [2022-01-09 23:21:49,399 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-fpi/mods.c [2022-01-09 23:21:49,446 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/974136536/c3e39a9e48e14cb6b505fdb8af142fbe/FLAGc034adbb1 [2022-01-09 23:21:49,745 INFO L306 CDTParser]: Found 1 translation units. [2022-01-09 23:21:49,745 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/mods.c [2022-01-09 23:21:49,749 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/974136536/c3e39a9e48e14cb6b505fdb8af142fbe/FLAGc034adbb1 [2022-01-09 23:21:50,197 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/974136536/c3e39a9e48e14cb6b505fdb8af142fbe [2022-01-09 23:21:50,199 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-09 23:21:50,200 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-09 23:21:50,211 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-09 23:21:50,212 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-09 23:21:50,214 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-09 23:21:50,215 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 11:21:50" (1/1) ... [2022-01-09 23:21:50,217 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@299fe5df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:21:50, skipping insertion in model container [2022-01-09 23:21:50,217 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 11:21:50" (1/1) ... [2022-01-09 23:21:50,224 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-09 23:21:50,236 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-09 23:21:50,395 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/mods.c[587,600] [2022-01-09 23:21:50,418 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-09 23:21:50,425 INFO L203 MainTranslator]: Completed pre-run [2022-01-09 23:21:50,435 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/mods.c[587,600] [2022-01-09 23:21:50,449 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-09 23:21:50,459 INFO L208 MainTranslator]: Completed translation [2022-01-09 23:21:50,459 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:21:50 WrapperNode [2022-01-09 23:21:50,460 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-09 23:21:50,462 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-09 23:21:50,462 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-09 23:21:50,462 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-09 23:21:50,467 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:21:50" (1/1) ... [2022-01-09 23:21:50,478 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:21:50" (1/1) ... [2022-01-09 23:21:50,498 INFO L137 Inliner]: procedures = 17, calls = 32, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 104 [2022-01-09 23:21:50,498 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-09 23:21:50,499 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-09 23:21:50,499 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-09 23:21:50,499 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-09 23:21:50,505 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:21:50" (1/1) ... [2022-01-09 23:21:50,505 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:21:50" (1/1) ... [2022-01-09 23:21:50,510 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:21:50" (1/1) ... [2022-01-09 23:21:50,510 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:21:50" (1/1) ... [2022-01-09 23:21:50,524 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:21:50" (1/1) ... [2022-01-09 23:21:50,528 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:21:50" (1/1) ... [2022-01-09 23:21:50,532 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:21:50" (1/1) ... [2022-01-09 23:21:50,535 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-09 23:21:50,535 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-09 23:21:50,536 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-09 23:21:50,536 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-09 23:21:50,537 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:21:50" (1/1) ... [2022-01-09 23:21:50,542 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-09 23:21:50,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-09 23:21:50,558 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) [2022-01-09 23:21:50,569 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 [2022-01-09 23:21:50,604 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-09 23:21:50,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-09 23:21:50,605 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-09 23:21:50,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-09 23:21:50,605 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-01-09 23:21:50,605 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-09 23:21:50,605 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-09 23:21:50,605 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-09 23:21:50,605 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-09 23:21:50,688 INFO L234 CfgBuilder]: Building ICFG [2022-01-09 23:21:50,689 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-09 23:21:50,890 INFO L275 CfgBuilder]: Performing block encoding [2022-01-09 23:21:50,895 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-09 23:21:50,895 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2022-01-09 23:21:50,896 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 11:21:50 BoogieIcfgContainer [2022-01-09 23:21:50,896 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-09 23:21:50,898 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-09 23:21:50,898 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-09 23:21:50,902 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-09 23:21:50,902 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 11:21:50" (1/3) ... [2022-01-09 23:21:50,903 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7924de0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 11:21:50, skipping insertion in model container [2022-01-09 23:21:50,903 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:21:50" (2/3) ... [2022-01-09 23:21:50,903 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7924de0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 11:21:50, skipping insertion in model container [2022-01-09 23:21:50,903 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 11:21:50" (3/3) ... [2022-01-09 23:21:50,904 INFO L111 eAbstractionObserver]: Analyzing ICFG mods.c [2022-01-09 23:21:50,908 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-09 23:21:50,908 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-09 23:21:50,958 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-09 23:21:50,966 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-01-09 23:21:50,967 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-09 23:21:50,981 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 25 states have (on average 1.56) internal successors, (39), 26 states have internal predecessors, (39), 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) [2022-01-09 23:21:50,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-01-09 23:21:50,985 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:21:50,986 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 23:21:50,987 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:21:50,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:21:50,991 INFO L85 PathProgramCache]: Analyzing trace with hash 1389277550, now seen corresponding path program 1 times [2022-01-09 23:21:50,997 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:21:50,998 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152315447] [2022-01-09 23:21:50,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:21:50,999 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:21:51,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:21:51,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-09 23:21:51,133 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:21:51,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152315447] [2022-01-09 23:21:51,134 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152315447] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 23:21:51,134 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-09 23:21:51,134 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-09 23:21:51,135 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251961961] [2022-01-09 23:21:51,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 23:21:51,139 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-09 23:21:51,139 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:21:51,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-09 23:21:51,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-09 23:21:51,173 INFO L87 Difference]: Start difference. First operand has 27 states, 25 states have (on average 1.56) internal successors, (39), 26 states have internal predecessors, (39), 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 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 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) [2022-01-09 23:21:51,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:21:51,184 INFO L93 Difference]: Finished difference Result 50 states and 72 transitions. [2022-01-09 23:21:51,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-09 23:21:51,185 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 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 [2022-01-09 23:21:51,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:21:51,190 INFO L225 Difference]: With dead ends: 50 [2022-01-09 23:21:51,190 INFO L226 Difference]: Without dead ends: 23 [2022-01-09 23:21:51,192 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-09 23:21:51,195 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-09 23:21:51,195 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-09 23:21:51,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-01-09 23:21:51,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-01-09 23:21:51,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 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) [2022-01-09 23:21:51,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2022-01-09 23:21:51,217 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 16 [2022-01-09 23:21:51,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:21:51,218 INFO L470 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2022-01-09 23:21:51,218 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 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) [2022-01-09 23:21:51,218 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2022-01-09 23:21:51,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-01-09 23:21:51,218 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:21:51,219 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 23:21:51,219 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-09 23:21:51,219 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:21:51,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:21:51,220 INFO L85 PathProgramCache]: Analyzing trace with hash 796930410, now seen corresponding path program 1 times [2022-01-09 23:21:51,220 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:21:51,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452573836] [2022-01-09 23:21:51,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:21:51,220 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:21:51,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:21:51,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-09 23:21:51,283 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:21:51,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452573836] [2022-01-09 23:21:51,285 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452573836] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 23:21:51,285 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-09 23:21:51,285 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-09 23:21:51,285 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872476953] [2022-01-09 23:21:51,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 23:21:51,286 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-09 23:21:51,287 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:21:51,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-09 23:21:51,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-01-09 23:21:51,288 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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) [2022-01-09 23:21:51,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:21:51,334 INFO L93 Difference]: Finished difference Result 53 states and 64 transitions. [2022-01-09 23:21:51,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-09 23:21:51,334 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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 [2022-01-09 23:21:51,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:21:51,335 INFO L225 Difference]: With dead ends: 53 [2022-01-09 23:21:51,335 INFO L226 Difference]: Without dead ends: 37 [2022-01-09 23:21:51,335 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-01-09 23:21:51,336 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 41 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-09 23:21:51,337 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [41 Valid, 17 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-09 23:21:51,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-01-09 23:21:51,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 27. [2022-01-09 23:21:51,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 26 states have internal predecessors, (31), 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) [2022-01-09 23:21:51,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2022-01-09 23:21:51,341 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 16 [2022-01-09 23:21:51,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:21:51,342 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2022-01-09 23:21:51,342 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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) [2022-01-09 23:21:51,342 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-01-09 23:21:51,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-01-09 23:21:51,342 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:21:51,342 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 23:21:51,343 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-09 23:21:51,343 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:21:51,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:21:51,343 INFO L85 PathProgramCache]: Analyzing trace with hash 495241442, now seen corresponding path program 1 times [2022-01-09 23:21:51,343 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:21:51,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428676926] [2022-01-09 23:21:51,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:21:51,344 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:21:51,366 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-09 23:21:51,366 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1112646573] [2022-01-09 23:21:51,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:21:51,366 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-09 23:21:51,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-09 23:21:51,368 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) [2022-01-09 23:21:51,369 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-01-09 23:21:51,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:21:51,427 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 41 conjunts are in the unsatisfiable core [2022-01-09 23:21:51,433 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-09 23:21:51,500 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 [2022-01-09 23:21:51,515 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 11 treesize of output 7 [2022-01-09 23:21:51,567 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 19 treesize of output 18 [2022-01-09 23:21:51,684 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 36 treesize of output 23 [2022-01-09 23:21:51,802 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 36 treesize of output 23 [2022-01-09 23:21:51,968 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 121 treesize of output 68 [2022-01-09 23:21:52,126 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-09 23:21:52,127 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-09 23:21:52,663 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-09 23:21:52,663 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:21:52,663 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428676926] [2022-01-09 23:21:52,663 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-09 23:21:52,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1112646573] [2022-01-09 23:21:52,664 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1112646573] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-09 23:21:52,664 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-09 23:21:52,664 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2022-01-09 23:21:52,664 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231376155] [2022-01-09 23:21:52,664 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-09 23:21:52,665 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-01-09 23:21:52,665 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:21:52,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-01-09 23:21:52,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2022-01-09 23:21:52,666 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 21 states, 21 states have (on average 2.0) internal successors, (42), 21 states have internal predecessors, (42), 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) [2022-01-09 23:21:53,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:21:53,347 INFO L93 Difference]: Finished difference Result 50 states and 58 transitions. [2022-01-09 23:21:53,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-01-09 23:21:53,349 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.0) internal successors, (42), 21 states have internal predecessors, (42), 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 24 [2022-01-09 23:21:53,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:21:53,349 INFO L225 Difference]: With dead ends: 50 [2022-01-09 23:21:53,349 INFO L226 Difference]: Without dead ends: 48 [2022-01-09 23:21:53,350 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=99, Invalid=453, Unknown=0, NotChecked=0, Total=552 [2022-01-09 23:21:53,351 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 19 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 11 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-09 23:21:53,351 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 128 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 214 Invalid, 0 Unknown, 11 Unchecked, 0.4s Time] [2022-01-09 23:21:53,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-01-09 23:21:53,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 42. [2022-01-09 23:21:53,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.2195121951219512) internal successors, (50), 41 states have internal predecessors, (50), 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) [2022-01-09 23:21:53,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 50 transitions. [2022-01-09 23:21:53,360 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 50 transitions. Word has length 24 [2022-01-09 23:21:53,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:21:53,362 INFO L470 AbstractCegarLoop]: Abstraction has 42 states and 50 transitions. [2022-01-09 23:21:53,362 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.0) internal successors, (42), 21 states have internal predecessors, (42), 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) [2022-01-09 23:21:53,363 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 50 transitions. [2022-01-09 23:21:53,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-01-09 23:21:53,363 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:21:53,363 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 23:21:53,383 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-01-09 23:21:53,564 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-09 23:21:53,564 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:21:53,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:21:53,565 INFO L85 PathProgramCache]: Analyzing trace with hash 831040416, now seen corresponding path program 2 times [2022-01-09 23:21:53,565 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:21:53,565 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821137685] [2022-01-09 23:21:53,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:21:53,565 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:21:53,588 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-09 23:21:53,589 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [680017411] [2022-01-09 23:21:53,589 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-09 23:21:53,589 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-09 23:21:53,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-09 23:21:53,590 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) [2022-01-09 23:21:53,591 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-01-09 23:21:53,640 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-09 23:21:53,641 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-09 23:21:53,642 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-09 23:21:53,643 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-09 23:21:53,700 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-09 23:21:53,701 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-09 23:21:53,746 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-09 23:21:53,746 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:21:53,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821137685] [2022-01-09 23:21:53,746 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-09 23:21:53,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [680017411] [2022-01-09 23:21:53,747 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [680017411] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-09 23:21:53,747 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-09 23:21:53,747 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2022-01-09 23:21:53,747 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448647869] [2022-01-09 23:21:53,747 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-09 23:21:53,747 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-09 23:21:53,747 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:21:53,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-09 23:21:53,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-01-09 23:21:53,748 INFO L87 Difference]: Start difference. First operand 42 states and 50 transitions. Second operand has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 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) [2022-01-09 23:21:53,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:21:53,880 INFO L93 Difference]: Finished difference Result 106 states and 123 transitions. [2022-01-09 23:21:53,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-09 23:21:53,881 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 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 26 [2022-01-09 23:21:53,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:21:53,881 INFO L225 Difference]: With dead ends: 106 [2022-01-09 23:21:53,881 INFO L226 Difference]: Without dead ends: 61 [2022-01-09 23:21:53,882 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2022-01-09 23:21:53,882 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 46 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-09 23:21:53,883 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [46 Valid, 55 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-09 23:21:53,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-01-09 23:21:53,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 42. [2022-01-09 23:21:53,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.170731707317073) internal successors, (48), 41 states have internal predecessors, (48), 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) [2022-01-09 23:21:53,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 48 transitions. [2022-01-09 23:21:53,887 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 48 transitions. Word has length 26 [2022-01-09 23:21:53,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:21:53,888 INFO L470 AbstractCegarLoop]: Abstraction has 42 states and 48 transitions. [2022-01-09 23:21:53,888 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 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) [2022-01-09 23:21:53,888 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2022-01-09 23:21:53,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-01-09 23:21:53,888 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:21:53,888 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 23:21:53,905 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-01-09 23:21:54,104 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-01-09 23:21:54,105 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:21:54,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:21:54,105 INFO L85 PathProgramCache]: Analyzing trace with hash -756951010, now seen corresponding path program 3 times [2022-01-09 23:21:54,106 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:21:54,106 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641957892] [2022-01-09 23:21:54,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:21:54,106 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:21:54,122 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-09 23:21:54,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [254045687] [2022-01-09 23:21:54,122 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-09 23:21:54,122 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-09 23:21:54,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-09 23:21:54,124 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) [2022-01-09 23:21:54,125 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-01-09 23:21:54,180 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-01-09 23:21:54,180 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-09 23:21:54,181 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-09 23:21:54,183 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-09 23:21:54,239 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-09 23:21:54,239 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-09 23:21:54,284 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-09 23:21:54,285 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:21:54,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641957892] [2022-01-09 23:21:54,285 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-09 23:21:54,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [254045687] [2022-01-09 23:21:54,285 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [254045687] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-09 23:21:54,285 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-09 23:21:54,286 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2022-01-09 23:21:54,286 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879929609] [2022-01-09 23:21:54,286 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-09 23:21:54,286 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-09 23:21:54,286 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:21:54,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-09 23:21:54,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-01-09 23:21:54,287 INFO L87 Difference]: Start difference. First operand 42 states and 48 transitions. Second operand has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 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) [2022-01-09 23:21:54,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:21:54,382 INFO L93 Difference]: Finished difference Result 59 states and 64 transitions. [2022-01-09 23:21:54,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-09 23:21:54,382 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 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 28 [2022-01-09 23:21:54,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:21:54,383 INFO L225 Difference]: With dead ends: 59 [2022-01-09 23:21:54,383 INFO L226 Difference]: Without dead ends: 50 [2022-01-09 23:21:54,383 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2022-01-09 23:21:54,384 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 74 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-09 23:21:54,384 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [74 Valid, 38 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-09 23:21:54,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-01-09 23:21:54,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 35. [2022-01-09 23:21:54,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.1470588235294117) internal successors, (39), 34 states have internal predecessors, (39), 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) [2022-01-09 23:21:54,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2022-01-09 23:21:54,388 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 28 [2022-01-09 23:21:54,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:21:54,388 INFO L470 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2022-01-09 23:21:54,388 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 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) [2022-01-09 23:21:54,388 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2022-01-09 23:21:54,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-01-09 23:21:54,389 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:21:54,389 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 23:21:54,406 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-01-09 23:21:54,605 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-09 23:21:54,606 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:21:54,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:21:54,606 INFO L85 PathProgramCache]: Analyzing trace with hash -826292134, now seen corresponding path program 4 times [2022-01-09 23:21:54,606 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:21:54,606 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439753935] [2022-01-09 23:21:54,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:21:54,606 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:21:54,627 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-09 23:21:54,627 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1164712831] [2022-01-09 23:21:54,628 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-09 23:21:54,628 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-09 23:21:54,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-09 23:21:54,629 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-09 23:21:54,630 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-01-09 23:21:54,675 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-09 23:21:54,676 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-09 23:21:54,677 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 53 conjunts are in the unsatisfiable core [2022-01-09 23:21:54,680 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-09 23:21:54,697 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-01-09 23:21:54,713 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:21:54,714 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 23 treesize of output 22 [2022-01-09 23:21:54,755 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:21:54,755 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:21:54,756 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2022-01-09 23:21:54,832 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:21:54,833 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-09 23:21:54,834 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:21:54,835 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 42 [2022-01-09 23:21:54,901 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:21:54,902 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:21:54,903 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 0 case distinctions, treesize of input 50 treesize of output 38 [2022-01-09 23:21:55,037 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:21:55,039 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-09 23:21:55,040 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:21:55,041 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 41 [2022-01-09 23:21:55,132 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:21:55,132 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:21:55,133 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:21:55,142 INFO L353 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2022-01-09 23:21:55,142 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 53 treesize of output 54 [2022-01-09 23:21:55,260 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:21:55,261 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-09 23:21:55,263 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 282 treesize of output 129 [2022-01-09 23:21:55,381 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:21:55,382 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:21:55,383 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 38 [2022-01-09 23:21:55,502 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:21:55,503 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 53 treesize of output 29 [2022-01-09 23:21:55,527 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-09 23:21:55,527 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-09 23:21:57,622 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_68| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_68|)) (forall ((v_ArrVal_191 Int)) (= (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_68| 8)) v_ArrVal_191) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)))) is different from false [2022-01-09 23:21:59,844 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_68| Int)) (or (let ((.cse14 (+ (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1))) (let ((.cse3 (< .cse14 0)) (.cse13 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse9 (< .cse13 0)) (.cse8 (= (mod .cse13 .cse14) 0)) (.cse7 (not .cse3))) (and (or (and (or (forall ((v_ArrVal_191 Int)) (= (select (store (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse1 (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (store .cse0 .cse1 (let ((.cse2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ (- 1) (mod (select .cse0 .cse1) (+ .cse2 1)) (* (- 1) .cse2))))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_68| 8)) v_ArrVal_191) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)) .cse3) (or (forall ((v_ArrVal_191 Int)) (= (select (store (let ((.cse4 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse5 (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (store .cse4 .cse5 (let ((.cse6 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|))) (+ .cse6 (mod (select .cse4 .cse5) (+ .cse6 1)) 1)))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_68| 8)) v_ArrVal_191) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)) .cse7)) .cse8 (not .cse9)) (or (and .cse9 (not .cse8)) (let ((.cse10 (forall ((v_ArrVal_191 Int)) (= (select (store (let ((.cse11 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse12 (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (store .cse11 .cse12 (mod (select .cse11 .cse12) (+ (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_68| 8)) v_ArrVal_191) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)))) (and (or .cse7 .cse10) (or .cse3 .cse10)))))))) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_68|)))) is different from false [2022-01-09 23:22:03,569 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_71| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_71|)) (forall ((|v_ULTIMATE.start_main_~i~0#1_68| Int)) (or (and (forall ((v_ArrVal_186 Int)) (or (not (< (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_71| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_186)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1) 0)) (forall ((v_ArrVal_191 Int)) (= (select (store (let ((.cse0 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_71| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_186))) (store .cse0 |c_ULTIMATE.start_main_~a~0#1.offset| (mod (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse0) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_68| 8)) v_ArrVal_191) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)))) (forall ((v_ArrVal_186 Int)) (let ((.cse2 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_71| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_186))) (let ((.cse1 (select .cse2 |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (= (mod .cse1 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse2) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)) 0) (not (< .cse1 0)))))) (forall ((v_ArrVal_186 Int)) (or (< (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_71| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_186)) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1) 0) (forall ((v_ArrVal_191 Int)) (= (select (store (let ((.cse3 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_71| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_186))) (store .cse3 |c_ULTIMATE.start_main_~a~0#1.offset| (mod (select .cse3 |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse3) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_68| 8)) v_ArrVal_191) |c_ULTIMATE.start_main_~a~0#1.offset|) 0))))) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_68|)))))) is different from false [2022-01-09 23:22:10,432 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_68| Int) (v_ArrVal_182 Int) (|v_ULTIMATE.start_main_~i~0#1_71| Int)) (or (not (<= (+ (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~a~0#1.offset|))) v_ArrVal_182)) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_71|)) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_68|)) (and (forall ((v_ArrVal_186 Int)) (or (< (+ (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_182)))) (store .cse0 |c_ULTIMATE.start_main_~a~0#1.base| (store (let ((.cse1 (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse1 |c_ULTIMATE.start_main_~a~0#1.offset| (+ v_ArrVal_182 (select .cse1 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ (* |v_ULTIMATE.start_main_~i~0#1_71| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_186))) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1) 0) (forall ((v_ArrVal_191 Int)) (= (select (store (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_182)))) (let ((.cse2 (store (let ((.cse4 (select .cse3 |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse4 |c_ULTIMATE.start_main_~a~0#1.offset| (+ v_ArrVal_182 (select .cse4 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ (* |v_ULTIMATE.start_main_~i~0#1_71| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_186))) (store .cse2 |c_ULTIMATE.start_main_~a~0#1.offset| (mod (select .cse2 |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (select (select (store .cse3 |c_ULTIMATE.start_main_~a~0#1.base| .cse2) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1))))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_68| 8)) v_ArrVal_191) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)))) (forall ((v_ArrVal_186 Int)) (or (not (< (+ (select (select (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_182)))) (store .cse5 |c_ULTIMATE.start_main_~a~0#1.base| (store (let ((.cse6 (select .cse5 |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse6 |c_ULTIMATE.start_main_~a~0#1.offset| (+ v_ArrVal_182 (select .cse6 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ (* |v_ULTIMATE.start_main_~i~0#1_71| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_186))) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1) 0)) (forall ((v_ArrVal_191 Int)) (= (select (store (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_182)))) (let ((.cse7 (store (let ((.cse9 (select .cse8 |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse9 |c_ULTIMATE.start_main_~a~0#1.offset| (+ v_ArrVal_182 (select .cse9 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ (* |v_ULTIMATE.start_main_~i~0#1_71| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_186))) (store .cse7 |c_ULTIMATE.start_main_~a~0#1.offset| (mod (select .cse7 |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (select (select (store .cse8 |c_ULTIMATE.start_main_~a~0#1.base| .cse7) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1))))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_68| 8)) v_ArrVal_191) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)))) (forall ((v_ArrVal_186 Int)) (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_182)))) (let ((.cse12 (store (let ((.cse13 (select .cse11 |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse13 |c_ULTIMATE.start_main_~a~0#1.offset| (+ v_ArrVal_182 (select .cse13 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ (* |v_ULTIMATE.start_main_~i~0#1_71| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_186))) (let ((.cse10 (select .cse12 |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (not (< .cse10 0)) (= (mod .cse10 (+ (select (select (store .cse11 |c_ULTIMATE.start_main_~a~0#1.base| .cse12) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)) 0))))))))) is different from false [2022-01-09 23:22:34,477 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_68| Int) (v_ArrVal_182 Int) (v_ArrVal_180 Int) (|v_ULTIMATE.start_main_~i~0#1_71| Int)) (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|)) (.cse1 (* 8 |c_ULTIMATE.start_main_~i~0#1|))) (or (not (<= (+ (select .cse0 |c_ULTIMATE.start_main_~#sum~0#1.offset|) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse1 |c_ULTIMATE.start_main_~a~0#1.offset|))) v_ArrVal_180)) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_71|)) (not (<= (+ v_ArrVal_180 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store .cse0 |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_180)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse1 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) v_ArrVal_182)) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_68|)) (and (forall ((v_ArrVal_186 Int)) (or (< (+ (select (select (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_182)))) (store .cse2 |c_ULTIMATE.start_main_~a~0#1.base| (store (let ((.cse3 (select .cse2 |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse3 |c_ULTIMATE.start_main_~a~0#1.offset| (+ v_ArrVal_182 (select .cse3 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ (* |v_ULTIMATE.start_main_~i~0#1_71| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_186))) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1) 0) (forall ((v_ArrVal_191 Int)) (= (select (store (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_182)))) (let ((.cse4 (store (let ((.cse6 (select .cse5 |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse6 |c_ULTIMATE.start_main_~a~0#1.offset| (+ v_ArrVal_182 (select .cse6 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ (* |v_ULTIMATE.start_main_~i~0#1_71| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_186))) (store .cse4 |c_ULTIMATE.start_main_~a~0#1.offset| (mod (select .cse4 |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (select (select (store .cse5 |c_ULTIMATE.start_main_~a~0#1.base| .cse4) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1))))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_68| 8)) v_ArrVal_191) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)))) (forall ((v_ArrVal_186 Int)) (or (not (< (+ (select (select (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_182)))) (store .cse7 |c_ULTIMATE.start_main_~a~0#1.base| (store (let ((.cse8 (select .cse7 |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse8 |c_ULTIMATE.start_main_~a~0#1.offset| (+ v_ArrVal_182 (select .cse8 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ (* |v_ULTIMATE.start_main_~i~0#1_71| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_186))) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1) 0)) (forall ((v_ArrVal_191 Int)) (= (select (store (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_182)))) (let ((.cse9 (store (let ((.cse11 (select .cse10 |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse11 |c_ULTIMATE.start_main_~a~0#1.offset| (+ v_ArrVal_182 (select .cse11 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ (* |v_ULTIMATE.start_main_~i~0#1_71| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_186))) (store .cse9 |c_ULTIMATE.start_main_~a~0#1.offset| (mod (select .cse9 |c_ULTIMATE.start_main_~a~0#1.offset|) (+ (select (select (store .cse10 |c_ULTIMATE.start_main_~a~0#1.base| .cse9) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1))))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_68| 8)) v_ArrVal_191) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)))) (forall ((v_ArrVal_186 Int)) (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset| v_ArrVal_182)))) (let ((.cse14 (store (let ((.cse15 (select .cse13 |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse15 |c_ULTIMATE.start_main_~a~0#1.offset| (+ v_ArrVal_182 (select .cse15 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ (* |v_ULTIMATE.start_main_~i~0#1_71| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_186))) (let ((.cse12 (select .cse14 |c_ULTIMATE.start_main_~a~0#1.offset|))) (or (not (< .cse12 0)) (= (mod .cse12 (+ (select (select (store .cse13 |c_ULTIMATE.start_main_~a~0#1.base| .cse14) |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|) 1)) 0)))))))))) is different from false