/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-tiling/poly2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-09 23:06:18,411 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-09 23:06:18,412 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-09 23:06:18,464 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-09 23:06:18,465 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-09 23:06:18,466 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-09 23:06:18,470 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-09 23:06:18,475 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-09 23:06:18,476 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-09 23:06:18,477 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-09 23:06:18,478 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-09 23:06:18,479 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-09 23:06:18,479 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-09 23:06:18,480 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-09 23:06:18,481 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-09 23:06:18,482 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-09 23:06:18,482 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-09 23:06:18,486 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-09 23:06:18,504 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-09 23:06:18,505 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-09 23:06:18,507 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-09 23:06:18,511 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-09 23:06:18,511 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-09 23:06:18,512 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-09 23:06:18,514 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-09 23:06:18,515 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-09 23:06:18,515 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-09 23:06:18,516 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-09 23:06:18,516 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-09 23:06:18,517 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-09 23:06:18,517 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-09 23:06:18,518 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-09 23:06:18,518 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-09 23:06:18,519 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-09 23:06:18,520 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-09 23:06:18,520 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-09 23:06:18,521 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-09 23:06:18,521 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-09 23:06:18,521 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-09 23:06:18,522 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-09 23:06:18,522 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-09 23:06:18,532 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:06:18,558 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-09 23:06:18,559 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-09 23:06:18,559 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-09 23:06:18,559 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-09 23:06:18,560 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-09 23:06:18,561 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-09 23:06:18,561 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-09 23:06:18,561 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-09 23:06:18,561 INFO L138 SettingsManager]: * Use SBE=true [2022-01-09 23:06:18,561 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-09 23:06:18,562 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-09 23:06:18,562 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-09 23:06:18,562 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-09 23:06:18,563 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-09 23:06:18,563 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-09 23:06:18,563 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-09 23:06:18,563 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-09 23:06:18,563 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-09 23:06:18,563 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-09 23:06:18,563 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-09 23:06:18,564 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-09 23:06:18,564 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-09 23:06:18,564 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-09 23:06:18,564 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-09 23:06:18,564 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-09 23:06:18,564 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-09 23:06:18,565 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-09 23:06:18,565 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-09 23:06:18,565 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-09 23:06:18,565 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-09 23:06:18,565 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:06:18,809 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-09 23:06:18,831 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-09 23:06:18,833 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-09 23:06:18,834 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-09 23:06:18,837 INFO L275 PluginConnector]: CDTParser initialized [2022-01-09 23:06:18,838 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-tiling/poly2.c [2022-01-09 23:06:18,894 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f507c7277/8bbe792946c740b19617c7f441333b6b/FLAGd09c6011a [2022-01-09 23:06:19,306 INFO L306 CDTParser]: Found 1 translation units. [2022-01-09 23:06:19,306 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-tiling/poly2.c [2022-01-09 23:06:19,317 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f507c7277/8bbe792946c740b19617c7f441333b6b/FLAGd09c6011a [2022-01-09 23:06:19,708 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f507c7277/8bbe792946c740b19617c7f441333b6b [2022-01-09 23:06:19,710 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-09 23:06:19,712 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-09 23:06:19,713 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-09 23:06:19,713 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-09 23:06:19,716 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-09 23:06:19,717 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 11:06:19" (1/1) ... [2022-01-09 23:06:19,718 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1aadfd18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:06:19, skipping insertion in model container [2022-01-09 23:06:19,718 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 11:06:19" (1/1) ... [2022-01-09 23:06:19,723 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-09 23:06:19,735 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-09 23:06:19,851 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-tiling/poly2.c[396,409] [2022-01-09 23:06:19,879 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-09 23:06:19,885 INFO L203 MainTranslator]: Completed pre-run [2022-01-09 23:06:19,893 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-tiling/poly2.c[396,409] [2022-01-09 23:06:19,898 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-09 23:06:19,909 INFO L208 MainTranslator]: Completed translation [2022-01-09 23:06:19,909 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:06:19 WrapperNode [2022-01-09 23:06:19,909 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-09 23:06:19,910 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-09 23:06:19,910 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-09 23:06:19,911 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-09 23:06:19,916 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:06:19" (1/1) ... [2022-01-09 23:06:19,921 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:06:19" (1/1) ... [2022-01-09 23:06:19,935 INFO L137 Inliner]: procedures = 16, calls = 13, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 58 [2022-01-09 23:06:19,936 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-09 23:06:19,936 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-09 23:06:19,936 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-09 23:06:19,937 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-09 23:06:19,943 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:06:19" (1/1) ... [2022-01-09 23:06:19,943 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:06:19" (1/1) ... [2022-01-09 23:06:19,944 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:06:19" (1/1) ... [2022-01-09 23:06:19,944 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:06:19" (1/1) ... [2022-01-09 23:06:19,948 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:06:19" (1/1) ... [2022-01-09 23:06:19,951 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:06:19" (1/1) ... [2022-01-09 23:06:19,952 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:06:19" (1/1) ... [2022-01-09 23:06:19,954 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-09 23:06:19,954 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-09 23:06:19,954 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-09 23:06:19,954 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-09 23:06:19,955 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:06:19" (1/1) ... [2022-01-09 23:06:19,967 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-09 23:06:19,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-09 23:06:19,997 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:06:20,019 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:06:20,031 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-09 23:06:20,032 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-09 23:06:20,032 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-09 23:06:20,032 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-01-09 23:06:20,032 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-09 23:06:20,032 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-09 23:06:20,032 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-09 23:06:20,080 INFO L234 CfgBuilder]: Building ICFG [2022-01-09 23:06:20,083 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-09 23:06:20,253 INFO L275 CfgBuilder]: Performing block encoding [2022-01-09 23:06:20,258 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-09 23:06:20,258 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-01-09 23:06:20,260 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 11:06:20 BoogieIcfgContainer [2022-01-09 23:06:20,260 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-09 23:06:20,261 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-09 23:06:20,261 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-09 23:06:20,279 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-09 23:06:20,279 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 11:06:19" (1/3) ... [2022-01-09 23:06:20,280 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41b54509 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 11:06:20, skipping insertion in model container [2022-01-09 23:06:20,280 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 11:06:19" (2/3) ... [2022-01-09 23:06:20,281 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41b54509 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 11:06:20, skipping insertion in model container [2022-01-09 23:06:20,281 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 11:06:20" (3/3) ... [2022-01-09 23:06:20,282 INFO L111 eAbstractionObserver]: Analyzing ICFG poly2.c [2022-01-09 23:06:20,286 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-09 23:06:20,286 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-09 23:06:20,338 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-09 23:06:20,343 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:06:20,344 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-09 23:06:20,367 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:06:20,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-01-09 23:06:20,371 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:06:20,372 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 23:06:20,372 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:06:20,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:06:20,376 INFO L85 PathProgramCache]: Analyzing trace with hash 1777950591, now seen corresponding path program 1 times [2022-01-09 23:06:20,398 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:06:20,399 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745227795] [2022-01-09 23:06:20,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:06:20,400 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:06:20,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:06:20,516 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:06:20,517 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:06:20,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745227795] [2022-01-09 23:06:20,518 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745227795] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 23:06:20,518 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-09 23:06:20,518 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-09 23:06:20,520 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511378591] [2022-01-09 23:06:20,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 23:06:20,524 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-09 23:06:20,524 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:06:20,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-09 23:06:20,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-09 23:06:20,549 INFO L87 Difference]: Start difference. First operand has 19 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:06:20,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:06:20,561 INFO L93 Difference]: Finished difference Result 33 states and 44 transitions. [2022-01-09 23:06:20,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-09 23:06:20,563 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-01-09 23:06:20,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:06:20,569 INFO L225 Difference]: With dead ends: 33 [2022-01-09 23:06:20,569 INFO L226 Difference]: Without dead ends: 15 [2022-01-09 23:06:20,572 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:06:20,582 INFO L933 BasicCegarLoop]: 22 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, 22 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:06:20,583 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-09 23:06:20,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-01-09 23:06:20,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-01-09 23:06:20,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 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:06:20,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2022-01-09 23:06:20,607 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 10 [2022-01-09 23:06:20,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:06:20,608 INFO L470 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2022-01-09 23:06:20,608 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:06:20,608 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2022-01-09 23:06:20,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-01-09 23:06:20,609 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:06:20,609 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 23:06:20,609 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-09 23:06:20,611 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:06:20,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:06:20,615 INFO L85 PathProgramCache]: Analyzing trace with hash 747895801, now seen corresponding path program 1 times [2022-01-09 23:06:20,615 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:06:20,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902453104] [2022-01-09 23:06:20,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:06:20,616 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:06:20,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:06:20,681 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:06:20,681 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:06:20,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902453104] [2022-01-09 23:06:20,682 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902453104] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 23:06:20,682 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-09 23:06:20,682 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-09 23:06:20,682 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21637631] [2022-01-09 23:06:20,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 23:06:20,683 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-09 23:06:20,684 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:06:20,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-09 23:06:20,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-09 23:06:20,685 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:06:20,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:06:20,711 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2022-01-09 23:06:20,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-09 23:06:20,712 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-01-09 23:06:20,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:06:20,713 INFO L225 Difference]: With dead ends: 27 [2022-01-09 23:06:20,713 INFO L226 Difference]: Without dead ends: 17 [2022-01-09 23:06:20,713 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-09 23:06:20,714 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 1 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-09 23:06:20,715 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 19 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-09 23:06:20,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-01-09 23:06:20,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2022-01-09 23:06:20,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 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:06:20,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2022-01-09 23:06:20,719 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 10 [2022-01-09 23:06:20,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:06:20,720 INFO L470 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2022-01-09 23:06:20,720 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:06:20,720 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2022-01-09 23:06:20,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-01-09 23:06:20,720 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:06:20,721 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 23:06:20,721 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-09 23:06:20,721 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:06:20,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:06:20,722 INFO L85 PathProgramCache]: Analyzing trace with hash -483954537, now seen corresponding path program 1 times [2022-01-09 23:06:20,722 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:06:20,722 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857244287] [2022-01-09 23:06:20,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:06:20,723 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:06:20,736 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-09 23:06:20,737 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [416987223] [2022-01-09 23:06:20,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:06:20,737 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-09 23:06:20,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-09 23:06:20,739 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:06:20,740 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:06:20,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:06:20,794 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 4 conjunts are in the unsatisfiable core [2022-01-09 23:06:20,798 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-09 23:06:20,878 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-09 23:06:20,879 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-09 23:06:20,938 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-09 23:06:20,938 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:06:20,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857244287] [2022-01-09 23:06:20,939 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-09 23:06:20,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [416987223] [2022-01-09 23:06:20,939 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [416987223] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-09 23:06:20,939 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-09 23:06:20,939 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2022-01-09 23:06:20,940 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777941924] [2022-01-09 23:06:20,940 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-09 23:06:20,940 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-09 23:06:20,941 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:06:20,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-09 23:06:20,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-01-09 23:06:20,942 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 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:06:20,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:06:20,988 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2022-01-09 23:06:20,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-09 23:06:20,989 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 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 12 [2022-01-09 23:06:20,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:06:20,991 INFO L225 Difference]: With dead ends: 29 [2022-01-09 23:06:20,991 INFO L226 Difference]: Without dead ends: 19 [2022-01-09 23:06:20,992 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-01-09 23:06:20,995 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 6 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-09 23:06:20,996 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 21 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-09 23:06:20,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-01-09 23:06:21,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2022-01-09 23:06:21,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 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:06:21,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2022-01-09 23:06:21,005 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 12 [2022-01-09 23:06:21,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:06:21,005 INFO L470 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2022-01-09 23:06:21,006 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 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:06:21,006 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2022-01-09 23:06:21,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-01-09 23:06:21,006 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:06:21,007 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 23:06:21,041 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-01-09 23:06:21,231 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:06:21,232 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:06:21,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:06:21,232 INFO L85 PathProgramCache]: Analyzing trace with hash 1118844341, now seen corresponding path program 2 times [2022-01-09 23:06:21,233 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:06:21,233 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536748800] [2022-01-09 23:06:21,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:06:21,233 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:06:21,248 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-09 23:06:21,249 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1197958862] [2022-01-09 23:06:21,249 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-09 23:06:21,249 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-09 23:06:21,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-09 23:06:21,253 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:06:21,254 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:06:21,313 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-01-09 23:06:21,314 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-09 23:06:21,314 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 3 conjunts are in the unsatisfiable core [2022-01-09 23:06:21,320 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-09 23:06:21,372 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-09 23:06:21,373 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-09 23:06:21,373 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:06:21,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536748800] [2022-01-09 23:06:21,373 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-09 23:06:21,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1197958862] [2022-01-09 23:06:21,373 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1197958862] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-09 23:06:21,373 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-09 23:06:21,374 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-09 23:06:21,374 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200556423] [2022-01-09 23:06:21,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-09 23:06:21,374 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-09 23:06:21,374 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:06:21,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-09 23:06:21,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-01-09 23:06:21,375 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:06:21,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:06:21,414 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2022-01-09 23:06:21,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-09 23:06:21,415 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-01-09 23:06:21,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:06:21,418 INFO L225 Difference]: With dead ends: 33 [2022-01-09 23:06:21,418 INFO L226 Difference]: Without dead ends: 26 [2022-01-09 23:06:21,418 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 11 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:06:21,421 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 17 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-09 23:06:21,422 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 13 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-09 23:06:21,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-01-09 23:06:21,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 19. [2022-01-09 23:06:21,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 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:06:21,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2022-01-09 23:06:21,426 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 14 [2022-01-09 23:06:21,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:06:21,426 INFO L470 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2022-01-09 23:06:21,427 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-09 23:06:21,427 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-01-09 23:06:21,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-01-09 23:06:21,427 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:06:21,427 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 23:06:21,454 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-01-09 23:06:21,628 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:06:21,628 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:06:21,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:06:21,629 INFO L85 PathProgramCache]: Analyzing trace with hash -1181996269, now seen corresponding path program 1 times [2022-01-09 23:06:21,629 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:06:21,629 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68011480] [2022-01-09 23:06:21,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:06:21,630 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:06:21,646 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-09 23:06:21,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [595517206] [2022-01-09 23:06:21,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:06:21,647 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-09 23:06:21,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-09 23:06:21,649 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:06:21,671 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:06:21,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:06:21,711 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 4 conjunts are in the unsatisfiable core [2022-01-09 23:06:21,713 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-09 23:06:21,807 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-09 23:06:21,807 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-09 23:06:21,868 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-09 23:06:21,869 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:06:21,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68011480] [2022-01-09 23:06:21,874 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-09 23:06:21,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [595517206] [2022-01-09 23:06:21,875 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [595517206] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-09 23:06:21,875 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-09 23:06:21,875 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2022-01-09 23:06:21,875 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441292942] [2022-01-09 23:06:21,875 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-09 23:06:21,875 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-09 23:06:21,876 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:06:21,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-09 23:06:21,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-01-09 23:06:21,876 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 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:06:21,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:06:21,940 INFO L93 Difference]: Finished difference Result 42 states and 45 transitions. [2022-01-09 23:06:21,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-09 23:06:21,941 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 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:06:21,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:06:21,943 INFO L225 Difference]: With dead ends: 42 [2022-01-09 23:06:21,943 INFO L226 Difference]: Without dead ends: 35 [2022-01-09 23:06:21,944 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2022-01-09 23:06:21,945 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 41 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-09 23:06:21,945 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [41 Valid, 21 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-09 23:06:21,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-01-09 23:06:21,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 21. [2022-01-09 23:06:21,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 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:06:21,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2022-01-09 23:06:21,952 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 16 [2022-01-09 23:06:21,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:06:21,953 INFO L470 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2022-01-09 23:06:21,953 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 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:06:21,953 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2022-01-09 23:06:21,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-01-09 23:06:21,954 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:06:21,954 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 23:06:21,979 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-01-09 23:06:22,167 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:06:22,168 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:06:22,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:06:22,168 INFO L85 PathProgramCache]: Analyzing trace with hash -381665039, now seen corresponding path program 2 times [2022-01-09 23:06:22,168 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:06:22,169 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712716266] [2022-01-09 23:06:22,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:06:22,169 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:06:22,182 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-09 23:06:22,183 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1067485877] [2022-01-09 23:06:22,183 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-09 23:06:22,183 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-09 23:06:22,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-09 23:06:22,186 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:06:22,187 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:06:22,236 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-09 23:06:22,236 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-09 23:06:22,237 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 27 conjunts are in the unsatisfiable core [2022-01-09 23:06:22,241 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-09 23:06:22,298 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 19 treesize of output 15 [2022-01-09 23:06:22,357 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:06:22,357 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:06:22,400 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 21 [2022-01-09 23:06:22,450 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:06:22,451 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:06:22,517 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-09 23:06:22,517 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-09 23:06:24,644 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_34| Int)) (or (forall ((v_ArrVal_68 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_34| 8)) v_ArrVal_68) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_34|)))) is different from false [2022-01-09 23:06:29,391 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_37| Int)) (or (forall ((v_ArrVal_68 Int) (|v_ULTIMATE.start_main_~i~0#1_34| Int) (v_ArrVal_64 Int)) (or (= (select (store (let ((.cse0 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_37| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_64))) (store .cse0 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (- 2) (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_34| 8)) v_ArrVal_68) |c_ULTIMATE.start_main_~a~0#1.offset|) 0) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_34|)))) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_37|)))) is different from false [2022-01-09 23:06:29,455 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 55 [2022-01-09 23:06:29,495 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 97 treesize of output 95 [2022-01-09 23:06:29,571 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-01-09 23:06:29,571 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:06:29,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712716266] [2022-01-09 23:06:29,572 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-09 23:06:29,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1067485877] [2022-01-09 23:06:29,572 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1067485877] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-09 23:06:29,572 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-09 23:06:29,572 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12] total 19 [2022-01-09 23:06:29,573 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121003796] [2022-01-09 23:06:29,573 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-09 23:06:29,573 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-01-09 23:06:29,573 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:06:29,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-01-09 23:06:29,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=216, Unknown=7, NotChecked=62, Total=342 [2022-01-09 23:06:29,575 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 19 states have internal predecessors, (32), 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:06:31,595 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~i~0#1| 0) (= (+ 2 (* |c_ULTIMATE.start_main_~i~0#1| |c_ULTIMATE.start_main_~i~0#1|)) (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|))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (forall ((|v_ULTIMATE.start_main_~i~0#1_37| Int)) (or (forall ((v_ArrVal_68 Int) (|v_ULTIMATE.start_main_~i~0#1_34| Int) (v_ArrVal_64 Int)) (or (= (select (store (let ((.cse0 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_37| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_64))) (store .cse0 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (- 2) (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_34| 8)) v_ArrVal_68) |c_ULTIMATE.start_main_~a~0#1.offset|) 0) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_34|)))) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_37|))))) is different from false [2022-01-09 23:06:33,617 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~i~0#1| 0) (= (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|)) (* |c_ULTIMATE.start_main_~i~0#1| |c_ULTIMATE.start_main_~i~0#1|)) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (forall ((|v_ULTIMATE.start_main_~i~0#1_34| Int)) (or (forall ((v_ArrVal_68 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_34| 8)) v_ArrVal_68) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_34|))))) is different from false [2022-01-09 23:06:35,627 WARN L838 $PredicateComparison]: unable to prove that (and (= 0 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (forall ((|v_ULTIMATE.start_main_~i~0#1_34| Int)) (or (forall ((v_ArrVal_68 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_34| 8)) v_ArrVal_68) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_34|))))) is different from false [2022-01-09 23:06:35,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:06:35,761 INFO L93 Difference]: Finished difference Result 57 states and 62 transitions. [2022-01-09 23:06:35,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-01-09 23:06:35,761 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 19 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-01-09 23:06:35,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:06:35,762 INFO L225 Difference]: With dead ends: 57 [2022-01-09 23:06:35,762 INFO L226 Difference]: Without dead ends: 55 [2022-01-09 23:06:35,763 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 14 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 12.9s TimeCoverageRelationStatistics Valid=109, Invalid=407, Unknown=10, NotChecked=230, Total=756 [2022-01-09 23:06:35,763 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 63 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 111 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-09 23:06:35,763 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [63 Valid, 84 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 93 Invalid, 0 Unknown, 111 Unchecked, 0.1s Time] [2022-01-09 23:06:35,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-01-09 23:06:35,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 28. [2022-01-09 23:06:35,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 states have internal predecessors, (32), 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:06:35,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2022-01-09 23:06:35,768 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 18 [2022-01-09 23:06:35,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:06:35,768 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2022-01-09 23:06:35,769 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 19 states have internal predecessors, (32), 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:06:35,769 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2022-01-09 23:06:35,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-01-09 23:06:35,769 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:06:35,769 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 23:06:35,795 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-01-09 23:06:35,983 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-09 23:06:35,983 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:06:35,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:06:35,984 INFO L85 PathProgramCache]: Analyzing trace with hash -448018393, now seen corresponding path program 1 times [2022-01-09 23:06:35,984 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:06:35,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128808771] [2022-01-09 23:06:35,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:06:35,984 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:06:35,994 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-09 23:06:35,994 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2107077750] [2022-01-09 23:06:35,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:06:35,994 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-09 23:06:35,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-09 23:06:35,997 INFO L229 MonitoredProcess]: Starting monitored process 6 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:06:35,999 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-01-09 23:06:36,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-09 23:06:36,049 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 27 conjunts are in the unsatisfiable core [2022-01-09 23:06:36,054 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-09 23:06:36,072 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 13 treesize of output 9 [2022-01-09 23:06:36,111 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-01-09 23:06:36,111 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-01-09 23:06:36,141 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2022-01-09 23:06:36,216 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-09 23:06:36,216 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-09 23:06:36,367 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2022-01-09 23:06:36,370 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 36 treesize of output 32 [2022-01-09 23:06:36,395 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-09 23:06:36,396 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:06:36,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128808771] [2022-01-09 23:06:36,396 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-09 23:06:36,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2107077750] [2022-01-09 23:06:36,396 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2107077750] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-09 23:06:36,396 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-09 23:06:36,396 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 16 [2022-01-09 23:06:36,396 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967640739] [2022-01-09 23:06:36,396 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-09 23:06:36,398 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-01-09 23:06:36,398 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:06:36,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-01-09 23:06:36,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2022-01-09 23:06:36,399 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand has 16 states, 16 states have (on average 2.0) internal successors, (32), 16 states have internal predecessors, (32), 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:06:36,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:06:36,569 INFO L93 Difference]: Finished difference Result 59 states and 63 transitions. [2022-01-09 23:06:36,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-09 23:06:36,570 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.0) internal successors, (32), 16 states have internal predecessors, (32), 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 22 [2022-01-09 23:06:36,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:06:36,571 INFO L225 Difference]: With dead ends: 59 [2022-01-09 23:06:36,571 INFO L226 Difference]: Without dead ends: 57 [2022-01-09 23:06:36,571 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 23 SyntacticMatches, 5 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2022-01-09 23:06:36,572 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 35 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 25 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-09 23:06:36,572 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 136 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 190 Invalid, 0 Unknown, 25 Unchecked, 0.1s Time] [2022-01-09 23:06:36,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-01-09 23:06:36,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 33. [2022-01-09 23:06:36,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.15625) internal successors, (37), 32 states have internal predecessors, (37), 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:06:36,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2022-01-09 23:06:36,577 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 22 [2022-01-09 23:06:36,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:06:36,578 INFO L470 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2022-01-09 23:06:36,578 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.0) internal successors, (32), 16 states have internal predecessors, (32), 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:06:36,578 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2022-01-09 23:06:36,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-01-09 23:06:36,578 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:06:36,578 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 23:06:36,607 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-01-09 23:06:36,792 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-09 23:06:36,793 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:06:36,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:06:36,793 INFO L85 PathProgramCache]: Analyzing trace with hash 1713393197, now seen corresponding path program 3 times [2022-01-09 23:06:36,793 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:06:36,793 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690071199] [2022-01-09 23:06:36,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:06:36,794 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:06:36,804 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-09 23:06:36,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1288455501] [2022-01-09 23:06:36,804 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-09 23:06:36,804 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-09 23:06:36,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-09 23:06:36,807 INFO L229 MonitoredProcess]: Starting monitored process 7 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:06:36,808 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-01-09 23:06:36,856 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-01-09 23:06:36,856 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-09 23:06:36,857 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 9 conjunts are in the unsatisfiable core [2022-01-09 23:06:36,859 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-09 23:06:36,969 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 16 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-09 23:06:36,969 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-09 23:06:37,058 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 16 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-09 23:06:37,058 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:06:37,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690071199] [2022-01-09 23:06:37,059 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-09 23:06:37,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1288455501] [2022-01-09 23:06:37,059 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1288455501] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-09 23:06:37,059 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-09 23:06:37,059 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2022-01-09 23:06:37,059 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521403257] [2022-01-09 23:06:37,059 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-09 23:06:37,059 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-01-09 23:06:37,059 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:06:37,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-01-09 23:06:37,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2022-01-09 23:06:37,061 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand has 16 states, 16 states have (on average 2.125) internal successors, (34), 16 states have internal predecessors, (34), 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:06:37,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:06:37,273 INFO L93 Difference]: Finished difference Result 112 states and 123 transitions. [2022-01-09 23:06:37,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-01-09 23:06:37,274 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.125) internal successors, (34), 16 states have internal predecessors, (34), 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 22 [2022-01-09 23:06:37,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:06:37,274 INFO L225 Difference]: With dead ends: 112 [2022-01-09 23:06:37,274 INFO L226 Difference]: Without dead ends: 78 [2022-01-09 23:06:37,275 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=156, Invalid=396, Unknown=0, NotChecked=0, Total=552 [2022-01-09 23:06:37,276 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 219 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-09 23:06:37,276 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [219 Valid, 78 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-09 23:06:37,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-01-09 23:06:37,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 48. [2022-01-09 23:06:37,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 47 states have (on average 1.127659574468085) internal successors, (53), 47 states have internal predecessors, (53), 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:06:37,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 53 transitions. [2022-01-09 23:06:37,289 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 53 transitions. Word has length 22 [2022-01-09 23:06:37,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:06:37,289 INFO L470 AbstractCegarLoop]: Abstraction has 48 states and 53 transitions. [2022-01-09 23:06:37,289 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.125) internal successors, (34), 16 states have internal predecessors, (34), 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:06:37,290 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 53 transitions. [2022-01-09 23:06:37,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-01-09 23:06:37,290 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:06:37,290 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 23:06:37,315 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-01-09 23:06:37,507 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-09 23:06:37,508 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:06:37,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:06:37,508 INFO L85 PathProgramCache]: Analyzing trace with hash 1533511587, now seen corresponding path program 2 times [2022-01-09 23:06:37,508 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:06:37,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362292325] [2022-01-09 23:06:37,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:06:37,508 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:06:37,521 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-09 23:06:37,521 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1985046530] [2022-01-09 23:06:37,521 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-09 23:06:37,522 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-09 23:06:37,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-09 23:06:37,526 INFO L229 MonitoredProcess]: Starting monitored process 8 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:06:37,528 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-01-09 23:06:37,586 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-09 23:06:37,586 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-09 23:06:37,587 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 33 conjunts are in the unsatisfiable core [2022-01-09 23:06:37,590 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-09 23:06:37,609 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 19 treesize of output 15 [2022-01-09 23:06:37,641 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-01-09 23:06:37,641 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-01-09 23:06:37,682 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-01-09 23:06:37,683 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-01-09 23:06:37,712 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 21 [2022-01-09 23:06:37,753 INFO L353 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-01-09 23:06:37,754 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2022-01-09 23:06:37,836 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-09 23:06:37,836 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-09 23:06:39,946 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_72| Int)) (or (forall ((v_ArrVal_160 Int)) (= 3 (+ 2 (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_72| 8)) v_ArrVal_160) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))))) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_72|)))) is different from false [2022-01-09 23:06:50,085 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_76| Int)) (or (forall ((v_ArrVal_153 Int)) (= 3 (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_76| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_153) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_76|)))) is different from false [2022-01-09 23:06:50,095 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 25 [2022-01-09 23:06:50,098 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 194 treesize of output 186 [2022-01-09 23:06:50,180 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2022-01-09 23:06:50,180 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:06:50,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362292325] [2022-01-09 23:06:50,180 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-09 23:06:50,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1985046530] [2022-01-09 23:06:50,181 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1985046530] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-09 23:06:50,181 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-09 23:06:50,181 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 16] total 22 [2022-01-09 23:06:50,181 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984341764] [2022-01-09 23:06:50,182 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-09 23:06:50,183 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-01-09 23:06:50,183 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:06:50,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-01-09 23:06:50,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=304, Unknown=18, NotChecked=74, Total=462 [2022-01-09 23:06:50,184 INFO L87 Difference]: Start difference. First operand 48 states and 53 transitions. Second operand has 22 states, 22 states have (on average 1.8636363636363635) internal successors, (41), 22 states have internal predecessors, (41), 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:06:52,199 WARN L838 $PredicateComparison]: unable to prove that (and (= (+ 2 (* |c_ULTIMATE.start_main_~i~0#1| |c_ULTIMATE.start_main_~i~0#1|)) (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|))) (forall ((|v_ULTIMATE.start_main_~i~0#1_76| Int)) (or (forall ((v_ArrVal_153 Int)) (= 3 (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_76| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_153) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_76|)))) (= |c_ULTIMATE.start_main_~i~0#1| 1)) is different from false [2022-01-09 23:06:54,225 WARN L838 $PredicateComparison]: unable to prove that (and (= (+ 2 (* |c_ULTIMATE.start_main_~i~0#1| |c_ULTIMATE.start_main_~i~0#1|)) (+ (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|)) 2)) (forall ((|v_ULTIMATE.start_main_~i~0#1_72| Int)) (or (forall ((v_ArrVal_160 Int)) (= 3 (+ 2 (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_72| 8)) v_ArrVal_160) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))))) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_72|)))) (= |c_ULTIMATE.start_main_~i~0#1| 1)) is different from false [2022-01-09 23:06:56,240 WARN L838 $PredicateComparison]: unable to prove that (and (= (+ (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) 2) 3) (forall ((v_ArrVal_160 Int) (|v_ULTIMATE.start_main_~i~0#1_72| Int)) (or (= (+ 2 (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|) 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (store .cse0 .cse1 (+ (- 2) (select .cse0 .cse1)))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_72| 8)) v_ArrVal_160) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) 3) (not (<= (+ 2 |c_ULTIMATE.start_main_~i~0#1|) |v_ULTIMATE.start_main_~i~0#1_72|)))) (forall ((|v_ULTIMATE.start_main_~i~0#1_72| Int)) (or (forall ((v_ArrVal_160 Int)) (= 3 (+ 2 (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_72| 8)) v_ArrVal_160) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))))) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_72|))))) is different from false [2022-01-09 23:06:56,738 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_160 Int)) (= (+ 2 (select (store (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_160) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) 3)) (forall ((v_ArrVal_160 Int) (|v_ULTIMATE.start_main_~i~0#1_72| Int)) (or (= 3 (+ 2 (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 (+ (- 2) (select .cse0 .cse1)))) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_72| 8)) v_ArrVal_160) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_72|))))) is different from false [2022-01-09 23:06:56,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:06:56,788 INFO L93 Difference]: Finished difference Result 72 states and 77 transitions. [2022-01-09 23:06:56,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-01-09 23:06:56,788 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.8636363636363635) internal successors, (41), 22 states have internal predecessors, (41), 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:06:56,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:06:56,789 INFO L225 Difference]: With dead ends: 72 [2022-01-09 23:06:56,789 INFO L226 Difference]: Without dead ends: 70 [2022-01-09 23:06:56,790 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 23 SyntacticMatches, 7 SemanticMatches, 25 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 18.7s TimeCoverageRelationStatistics Valid=82, Invalid=340, Unknown=22, NotChecked=258, Total=702 [2022-01-09 23:06:56,790 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 25 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 190 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-09 23:06:56,790 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 112 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 104 Invalid, 0 Unknown, 190 Unchecked, 0.1s Time] [2022-01-09 23:06:56,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-01-09 23:06:56,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 55. [2022-01-09 23:06:56,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 54 states have (on average 1.1111111111111112) internal successors, (60), 54 states have internal predecessors, (60), 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:06:56,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 60 transitions. [2022-01-09 23:06:56,799 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 60 transitions. Word has length 26 [2022-01-09 23:06:56,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:06:56,799 INFO L470 AbstractCegarLoop]: Abstraction has 55 states and 60 transitions. [2022-01-09 23:06:56,799 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.8636363636363635) internal successors, (41), 22 states have internal predecessors, (41), 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:06:56,799 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 60 transitions. [2022-01-09 23:06:56,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-01-09 23:06:56,800 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:06:56,800 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 23:06:56,823 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-01-09 23:06:57,001 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-09 23:06:57,001 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:06:57,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:06:57,002 INFO L85 PathProgramCache]: Analyzing trace with hash -2031628823, now seen corresponding path program 4 times [2022-01-09 23:06:57,002 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:06:57,002 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566402813] [2022-01-09 23:06:57,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:06:57,002 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:06:57,022 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-09 23:06:57,022 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1170367826] [2022-01-09 23:06:57,022 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-09 23:06:57,022 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-09 23:06:57,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-09 23:06:57,026 INFO L229 MonitoredProcess]: Starting monitored process 9 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:06:57,027 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-01-09 23:06:57,077 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-09 23:06:57,078 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-09 23:06:57,079 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 39 conjunts are in the unsatisfiable core [2022-01-09 23:06:57,082 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-09 23:06:57,105 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 19 treesize of output 15 [2022-01-09 23:06:57,141 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:06:57,141 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:06:57,169 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:06:57,169 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:06:57,198 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:06:57,199 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:06:57,238 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 21 [2022-01-09 23:06:57,279 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:06:57,279 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 25 treesize of output 24 [2022-01-09 23:06:57,319 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:06:57,319 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 25 treesize of output 24 [2022-01-09 23:06:57,353 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:06:57,355 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 25 treesize of output 24 [2022-01-09 23:06:57,411 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 8 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-09 23:06:57,411 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-09 23:06:59,493 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_87| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_87|)) (forall ((v_ArrVal_211 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_87| 8)) v_ArrVal_211) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)))) is different from false [2022-01-09 23:06:59,886 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_211 Int) (v_ArrVal_210 Int) (|v_ULTIMATE.start_main_~i~0#1_87| Int)) (or (= (select (store (store (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_210) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_87| 8)) v_ArrVal_211) |c_ULTIMATE.start_main_~a~0#1.offset|) 0) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_87|)))) is different from false [2022-01-09 23:07:01,917 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_88| Int)) (or (forall ((v_ArrVal_211 Int) (v_ArrVal_210 Int) (|v_ULTIMATE.start_main_~i~0#1_87| Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_88| 1) |v_ULTIMATE.start_main_~i~0#1_87|)) (= (select (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_88| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_210) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_87| 8)) v_ArrVal_211) |c_ULTIMATE.start_main_~a~0#1.offset|) 0))) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_88|)))) is different from false [2022-01-09 23:07:03,950 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_211 Int) (v_ArrVal_210 Int) (|v_ULTIMATE.start_main_~i~0#1_88| Int) (|v_ULTIMATE.start_main_~i~0#1_87| Int) (v_ArrVal_208 Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_88| 1) |v_ULTIMATE.start_main_~i~0#1_87|)) (= (select (store (store (store (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_208) (+ (* |v_ULTIMATE.start_main_~i~0#1_88| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_210) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_87| 8)) v_ArrVal_211) |c_ULTIMATE.start_main_~a~0#1.offset|) 0) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_88|)))) is different from false [2022-01-09 23:07:06,021 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_89| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_89|)) (forall ((v_ArrVal_211 Int) (v_ArrVal_210 Int) (|v_ULTIMATE.start_main_~i~0#1_88| Int) (|v_ULTIMATE.start_main_~i~0#1_87| Int) (v_ArrVal_208 Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_88| 1) |v_ULTIMATE.start_main_~i~0#1_87|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_89| 1) |v_ULTIMATE.start_main_~i~0#1_88|)) (= (select (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_89| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_208) (+ (* |v_ULTIMATE.start_main_~i~0#1_88| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_210) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_87| 8)) v_ArrVal_211) |c_ULTIMATE.start_main_~a~0#1.offset|) 0))))) is different from false [2022-01-09 23:07:08,094 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_211 Int) (v_ArrVal_210 Int) (|v_ULTIMATE.start_main_~i~0#1_89| Int) (|v_ULTIMATE.start_main_~i~0#1_88| Int) (|v_ULTIMATE.start_main_~i~0#1_87| Int) (v_ArrVal_208 Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_89|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_88| 1) |v_ULTIMATE.start_main_~i~0#1_87|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_89| 1) |v_ULTIMATE.start_main_~i~0#1_88|)) (= (select (store (store (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 (+ (- 2) (select .cse0 .cse1)))) (+ (* |v_ULTIMATE.start_main_~i~0#1_89| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_208) (+ (* |v_ULTIMATE.start_main_~i~0#1_88| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_210) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_87| 8)) v_ArrVal_211) |c_ULTIMATE.start_main_~a~0#1.offset|) 0))) is different from false [2022-01-09 23:07:10,968 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_92| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_92|)) (forall ((v_ArrVal_203 Int) (v_ArrVal_211 Int) (v_ArrVal_210 Int) (|v_ULTIMATE.start_main_~i~0#1_89| Int) (|v_ULTIMATE.start_main_~i~0#1_88| Int) (|v_ULTIMATE.start_main_~i~0#1_87| Int) (v_ArrVal_208 Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_88| 1) |v_ULTIMATE.start_main_~i~0#1_87|)) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_89|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_89| 1) |v_ULTIMATE.start_main_~i~0#1_88|)) (= (select (store (store (store (let ((.cse0 (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_92| 8)) v_ArrVal_203))) (store .cse0 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (- 2) (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ (* |v_ULTIMATE.start_main_~i~0#1_89| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_208) (+ (* |v_ULTIMATE.start_main_~i~0#1_88| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_210) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_87| 8)) v_ArrVal_211) |c_ULTIMATE.start_main_~a~0#1.offset|) 0))))) is different from false [2022-01-09 23:07:13,052 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_203 Int) (v_ArrVal_201 Int) (v_ArrVal_211 Int) (v_ArrVal_210 Int) (|v_ULTIMATE.start_main_~i~0#1_89| Int) (|v_ULTIMATE.start_main_~i~0#1_88| Int) (|v_ULTIMATE.start_main_~i~0#1_87| Int) (v_ArrVal_208 Int) (|v_ULTIMATE.start_main_~i~0#1_92| Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_88| 1) |v_ULTIMATE.start_main_~i~0#1_87|)) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_89|)) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_92|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_89| 1) |v_ULTIMATE.start_main_~i~0#1_88|)) (= (select (store (store (store (let ((.cse0 (store (store (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_201) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_92| 8)) v_ArrVal_203))) (store .cse0 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (- 2) (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ (* |v_ULTIMATE.start_main_~i~0#1_89| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_208) (+ (* |v_ULTIMATE.start_main_~i~0#1_88| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_210) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_87| 8)) v_ArrVal_211) |c_ULTIMATE.start_main_~a~0#1.offset|) 0))) is different from false [2022-01-09 23:07:15,233 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_93| Int)) (or (forall ((v_ArrVal_203 Int) (v_ArrVal_201 Int) (v_ArrVal_211 Int) (v_ArrVal_210 Int) (|v_ULTIMATE.start_main_~i~0#1_89| Int) (|v_ULTIMATE.start_main_~i~0#1_88| Int) (|v_ULTIMATE.start_main_~i~0#1_87| Int) (v_ArrVal_208 Int) (|v_ULTIMATE.start_main_~i~0#1_92| Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_88| 1) |v_ULTIMATE.start_main_~i~0#1_87|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_93| 1) |v_ULTIMATE.start_main_~i~0#1_92|)) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_89|)) (= (select (store (store (store (let ((.cse0 (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_93| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_201) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_92| 8)) v_ArrVal_203))) (store .cse0 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|) (- 2)))) (+ (* |v_ULTIMATE.start_main_~i~0#1_89| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_208) (+ (* |v_ULTIMATE.start_main_~i~0#1_88| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_210) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_87| 8)) v_ArrVal_211) |c_ULTIMATE.start_main_~a~0#1.offset|) 0) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_89| 1) |v_ULTIMATE.start_main_~i~0#1_88|)))) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_93|)))) is different from false [2022-01-09 23:07:17,361 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_203 Int) (v_ArrVal_201 Int) (v_ArrVal_200 Int) (v_ArrVal_211 Int) (v_ArrVal_210 Int) (|v_ULTIMATE.start_main_~i~0#1_89| Int) (|v_ULTIMATE.start_main_~i~0#1_88| Int) (|v_ULTIMATE.start_main_~i~0#1_87| Int) (v_ArrVal_208 Int) (|v_ULTIMATE.start_main_~i~0#1_93| Int) (|v_ULTIMATE.start_main_~i~0#1_92| Int)) (or (= (select (store (store (store (let ((.cse0 (store (store (store (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_200) (+ (* |v_ULTIMATE.start_main_~i~0#1_93| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_201) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_92| 8)) v_ArrVal_203))) (store .cse0 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (- 2) (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ (* |v_ULTIMATE.start_main_~i~0#1_89| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_208) (+ (* |v_ULTIMATE.start_main_~i~0#1_88| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_210) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_87| 8)) v_ArrVal_211) |c_ULTIMATE.start_main_~a~0#1.offset|) 0) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_88| 1) |v_ULTIMATE.start_main_~i~0#1_87|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_93| 1) |v_ULTIMATE.start_main_~i~0#1_92|)) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_89|)) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_93|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_89| 1) |v_ULTIMATE.start_main_~i~0#1_88|)))) is different from false [2022-01-09 23:07:19,620 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_94| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_94|)) (forall ((v_ArrVal_203 Int) (v_ArrVal_201 Int) (v_ArrVal_200 Int) (v_ArrVal_211 Int) (v_ArrVal_210 Int) (|v_ULTIMATE.start_main_~i~0#1_89| Int) (|v_ULTIMATE.start_main_~i~0#1_88| Int) (|v_ULTIMATE.start_main_~i~0#1_87| Int) (v_ArrVal_208 Int) (|v_ULTIMATE.start_main_~i~0#1_93| Int) (|v_ULTIMATE.start_main_~i~0#1_92| Int)) (or (= (select (store (store (store (let ((.cse0 (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_94| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_200) (+ (* |v_ULTIMATE.start_main_~i~0#1_93| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_201) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_92| 8)) v_ArrVal_203))) (store .cse0 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|) (- 2)))) (+ (* |v_ULTIMATE.start_main_~i~0#1_89| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_208) (+ (* |v_ULTIMATE.start_main_~i~0#1_88| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_210) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_87| 8)) v_ArrVal_211) |c_ULTIMATE.start_main_~a~0#1.offset|) 0) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_88| 1) |v_ULTIMATE.start_main_~i~0#1_87|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_93| 1) |v_ULTIMATE.start_main_~i~0#1_92|)) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_89|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_94| 1) |v_ULTIMATE.start_main_~i~0#1_93|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_89| 1) |v_ULTIMATE.start_main_~i~0#1_88|)))))) is different from false [2022-01-09 23:07:19,644 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 97 [2022-01-09 23:07:19,651 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 3236 treesize of output 3220 [2022-01-09 23:07:20,577 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 28 not checked. [2022-01-09 23:07:20,577 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:07:20,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566402813] [2022-01-09 23:07:20,577 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-09 23:07:20,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1170367826] [2022-01-09 23:07:20,578 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1170367826] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-09 23:07:20,578 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-09 23:07:20,578 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 20] total 31 [2022-01-09 23:07:20,578 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203382042] [2022-01-09 23:07:20,578 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-09 23:07:20,578 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-01-09 23:07:20,578 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:07:20,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-01-09 23:07:20,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=315, Unknown=12, NotChecked=506, Total=930 [2022-01-09 23:07:20,579 INFO L87 Difference]: Start difference. First operand 55 states and 60 transitions. Second operand has 31 states, 31 states have (on average 1.5483870967741935) internal successors, (48), 31 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:07:22,592 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~i~0#1| 0) (forall ((|v_ULTIMATE.start_main_~i~0#1_94| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_94|)) (forall ((v_ArrVal_203 Int) (v_ArrVal_201 Int) (v_ArrVal_200 Int) (v_ArrVal_211 Int) (v_ArrVal_210 Int) (|v_ULTIMATE.start_main_~i~0#1_89| Int) (|v_ULTIMATE.start_main_~i~0#1_88| Int) (|v_ULTIMATE.start_main_~i~0#1_87| Int) (v_ArrVal_208 Int) (|v_ULTIMATE.start_main_~i~0#1_93| Int) (|v_ULTIMATE.start_main_~i~0#1_92| Int)) (or (= (select (store (store (store (let ((.cse0 (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_94| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_200) (+ (* |v_ULTIMATE.start_main_~i~0#1_93| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_201) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_92| 8)) v_ArrVal_203))) (store .cse0 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|) (- 2)))) (+ (* |v_ULTIMATE.start_main_~i~0#1_89| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_208) (+ (* |v_ULTIMATE.start_main_~i~0#1_88| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_210) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_87| 8)) v_ArrVal_211) |c_ULTIMATE.start_main_~a~0#1.offset|) 0) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_88| 1) |v_ULTIMATE.start_main_~i~0#1_87|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_93| 1) |v_ULTIMATE.start_main_~i~0#1_92|)) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_89|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_94| 1) |v_ULTIMATE.start_main_~i~0#1_93|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_89| 1) |v_ULTIMATE.start_main_~i~0#1_88|)))))) (= (+ 2 (* |c_ULTIMATE.start_main_~i~0#1| |c_ULTIMATE.start_main_~i~0#1|)) (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|))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)) is different from false [2022-01-09 23:07:24,604 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~i~0#1_93| Int)) (or (forall ((v_ArrVal_203 Int) (v_ArrVal_201 Int) (v_ArrVal_211 Int) (v_ArrVal_210 Int) (|v_ULTIMATE.start_main_~i~0#1_89| Int) (|v_ULTIMATE.start_main_~i~0#1_88| Int) (|v_ULTIMATE.start_main_~i~0#1_87| Int) (v_ArrVal_208 Int) (|v_ULTIMATE.start_main_~i~0#1_92| Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_88| 1) |v_ULTIMATE.start_main_~i~0#1_87|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_93| 1) |v_ULTIMATE.start_main_~i~0#1_92|)) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_89|)) (= (select (store (store (store (let ((.cse0 (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_93| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_201) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_92| 8)) v_ArrVal_203))) (store .cse0 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|) (- 2)))) (+ (* |v_ULTIMATE.start_main_~i~0#1_89| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_208) (+ (* |v_ULTIMATE.start_main_~i~0#1_88| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_210) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_87| 8)) v_ArrVal_211) |c_ULTIMATE.start_main_~a~0#1.offset|) 0) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_89| 1) |v_ULTIMATE.start_main_~i~0#1_88|)))) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_93|)))) (<= 1 |c_ULTIMATE.start_main_~i~0#1|) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= 2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))) is different from false [2022-01-09 23:07:26,616 WARN L838 $PredicateComparison]: unable to prove that (and (<= 2 |c_ULTIMATE.start_main_~i~0#1|) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= 2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (forall ((|v_ULTIMATE.start_main_~i~0#1_92| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_92|)) (forall ((v_ArrVal_203 Int) (v_ArrVal_211 Int) (v_ArrVal_210 Int) (|v_ULTIMATE.start_main_~i~0#1_89| Int) (|v_ULTIMATE.start_main_~i~0#1_88| Int) (|v_ULTIMATE.start_main_~i~0#1_87| Int) (v_ArrVal_208 Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_88| 1) |v_ULTIMATE.start_main_~i~0#1_87|)) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_89|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_89| 1) |v_ULTIMATE.start_main_~i~0#1_88|)) (= (select (store (store (store (let ((.cse0 (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_92| 8)) v_ArrVal_203))) (store .cse0 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (- 2) (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (+ (* |v_ULTIMATE.start_main_~i~0#1_89| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_208) (+ (* |v_ULTIMATE.start_main_~i~0#1_88| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_210) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_87| 8)) v_ArrVal_211) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)))))) is different from false [2022-01-09 23:07:28,637 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~i~0#1_89| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_89|)) (forall ((v_ArrVal_211 Int) (v_ArrVal_210 Int) (|v_ULTIMATE.start_main_~i~0#1_88| Int) (|v_ULTIMATE.start_main_~i~0#1_87| Int) (v_ArrVal_208 Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_88| 1) |v_ULTIMATE.start_main_~i~0#1_87|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_89| 1) |v_ULTIMATE.start_main_~i~0#1_88|)) (= (select (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_89| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_208) (+ (* |v_ULTIMATE.start_main_~i~0#1_88| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_210) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_87| 8)) v_ArrVal_211) |c_ULTIMATE.start_main_~a~0#1.offset|) 0))))) (= (+ 2 (* |c_ULTIMATE.start_main_~i~0#1| |c_ULTIMATE.start_main_~i~0#1|)) (+ (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|)) 2)) (= |c_ULTIMATE.start_main_~i~0#1| 0) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)) is different from false [2022-01-09 23:07:30,650 WARN L838 $PredicateComparison]: unable to prove that (and (<= 1 |c_ULTIMATE.start_main_~i~0#1|) (forall ((|v_ULTIMATE.start_main_~i~0#1_88| Int)) (or (forall ((v_ArrVal_211 Int) (v_ArrVal_210 Int) (|v_ULTIMATE.start_main_~i~0#1_87| Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_88| 1) |v_ULTIMATE.start_main_~i~0#1_87|)) (= (select (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_88| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_210) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_87| 8)) v_ArrVal_211) |c_ULTIMATE.start_main_~a~0#1.offset|) 0))) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_88|)))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= (+ 2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) 2)) is different from false [2022-01-09 23:07:32,662 WARN L838 $PredicateComparison]: unable to prove that (and (<= 2 |c_ULTIMATE.start_main_~i~0#1|) (forall ((|v_ULTIMATE.start_main_~i~0#1_87| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_87|)) (forall ((v_ArrVal_211 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_87| 8)) v_ArrVal_211) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= (+ 2 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) 2)) is different from false [2022-01-09 23:07:32,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:07:32,714 INFO L93 Difference]: Finished difference Result 62 states and 67 transitions. [2022-01-09 23:07:32,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-01-09 23:07:32,715 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 1.5483870967741935) internal successors, (48), 31 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) Word has length 26 [2022-01-09 23:07:32,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:07:32,715 INFO L225 Difference]: With dead ends: 62 [2022-01-09 23:07:32,715 INFO L226 Difference]: Without dead ends: 60 [2022-01-09 23:07:32,716 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 17 SyntacticMatches, 9 SemanticMatches, 37 ConstructedPredicates, 17 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 33.2s TimeCoverageRelationStatistics Valid=123, Invalid=389, Unknown=18, NotChecked=952, Total=1482 [2022-01-09 23:07:32,717 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 25 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 277 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-09 23:07:32,717 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 49 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 109 Invalid, 0 Unknown, 277 Unchecked, 0.1s Time] [2022-01-09 23:07:32,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-01-09 23:07:32,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 57. [2022-01-09 23:07:32,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 56 states have (on average 1.1071428571428572) internal successors, (62), 56 states have internal predecessors, (62), 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:07:32,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 62 transitions. [2022-01-09 23:07:32,725 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 62 transitions. Word has length 26 [2022-01-09 23:07:32,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:07:32,725 INFO L470 AbstractCegarLoop]: Abstraction has 57 states and 62 transitions. [2022-01-09 23:07:32,725 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 1.5483870967741935) internal successors, (48), 31 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:07:32,725 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 62 transitions. [2022-01-09 23:07:32,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-01-09 23:07:32,726 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:07:32,726 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 23:07:32,747 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-01-09 23:07:32,939 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-01-09 23:07:32,940 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:07:32,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:07:32,940 INFO L85 PathProgramCache]: Analyzing trace with hash 1298792513, now seen corresponding path program 3 times [2022-01-09 23:07:32,940 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:07:32,940 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139312463] [2022-01-09 23:07:32,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:07:32,940 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:07:32,948 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-09 23:07:32,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1448862394] [2022-01-09 23:07:32,948 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-09 23:07:32,949 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-09 23:07:32,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-09 23:07:32,954 INFO L229 MonitoredProcess]: Starting monitored process 10 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:07:32,963 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-01-09 23:07:33,021 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-01-09 23:07:33,021 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-09 23:07:33,022 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 10 conjunts are in the unsatisfiable core [2022-01-09 23:07:33,023 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-09 23:07:33,130 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-09 23:07:33,130 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-09 23:07:33,202 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-09 23:07:33,202 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:07:33,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139312463] [2022-01-09 23:07:33,203 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-09 23:07:33,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1448862394] [2022-01-09 23:07:33,203 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1448862394] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-09 23:07:33,203 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-09 23:07:33,203 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 15 [2022-01-09 23:07:33,203 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894628408] [2022-01-09 23:07:33,203 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-09 23:07:33,207 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-01-09 23:07:33,207 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:07:33,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-01-09 23:07:33,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2022-01-09 23:07:33,208 INFO L87 Difference]: Start difference. First operand 57 states and 62 transitions. Second operand has 15 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 15 states have internal predecessors, (35), 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:07:33,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:07:33,418 INFO L93 Difference]: Finished difference Result 86 states and 89 transitions. [2022-01-09 23:07:33,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-01-09 23:07:33,419 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 15 states have internal predecessors, (35), 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:07:33,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:07:33,420 INFO L225 Difference]: With dead ends: 86 [2022-01-09 23:07:33,420 INFO L226 Difference]: Without dead ends: 73 [2022-01-09 23:07:33,420 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=158, Invalid=442, Unknown=0, NotChecked=0, Total=600 [2022-01-09 23:07:33,421 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 96 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-09 23:07:33,421 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [96 Valid, 109 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 259 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-09 23:07:33,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-01-09 23:07:33,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 50. [2022-01-09 23:07:33,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 49 states have (on average 1.0816326530612246) internal successors, (53), 49 states have internal predecessors, (53), 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:07:33,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 53 transitions. [2022-01-09 23:07:33,428 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 53 transitions. Word has length 28 [2022-01-09 23:07:33,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:07:33,428 INFO L470 AbstractCegarLoop]: Abstraction has 50 states and 53 transitions. [2022-01-09 23:07:33,428 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 15 states have internal predecessors, (35), 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:07:33,429 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 53 transitions. [2022-01-09 23:07:33,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-01-09 23:07:33,429 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:07:33,429 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 23:07:33,456 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-01-09 23:07:33,643 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-09 23:07:33,644 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:07:33,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:07:33,644 INFO L85 PathProgramCache]: Analyzing trace with hash -802396711, now seen corresponding path program 4 times [2022-01-09 23:07:33,644 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:07:33,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384881602] [2022-01-09 23:07:33,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:07:33,644 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:07:33,653 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-09 23:07:33,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [838547090] [2022-01-09 23:07:33,653 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-09 23:07:33,653 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-09 23:07:33,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-09 23:07:33,656 INFO L229 MonitoredProcess]: Starting monitored process 11 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:07:33,659 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-01-09 23:07:33,706 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-09 23:07:33,707 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-09 23:07:33,708 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 37 conjunts are in the unsatisfiable core [2022-01-09 23:07:33,710 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-09 23:07:33,754 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 13 treesize of output 9 [2022-01-09 23:07:33,797 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:07:33,798 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 25 treesize of output 24 [2022-01-09 23:07:33,825 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-09 23:07:33,826 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 25 treesize of output 24 [2022-01-09 23:07:33,851 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2022-01-09 23:07:33,969 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-09 23:07:33,970 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-09 23:07:34,204 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 28 [2022-01-09 23:07:34,208 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 786 treesize of output 770 [2022-01-09 23:07:34,297 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-09 23:07:34,297 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-09 23:07:34,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384881602] [2022-01-09 23:07:34,297 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-01-09 23:07:34,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [838547090] [2022-01-09 23:07:34,297 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [838547090] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-09 23:07:34,297 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-09 23:07:34,297 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16] total 27 [2022-01-09 23:07:34,297 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041842926] [2022-01-09 23:07:34,298 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-09 23:07:34,298 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-01-09 23:07:34,298 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-09 23:07:34,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-01-09 23:07:34,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=606, Unknown=0, NotChecked=0, Total=702 [2022-01-09 23:07:34,299 INFO L87 Difference]: Start difference. First operand 50 states and 53 transitions. Second operand has 27 states, 27 states have (on average 2.074074074074074) internal successors, (56), 27 states have internal predecessors, (56), 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:07:34,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-09 23:07:34,741 INFO L93 Difference]: Finished difference Result 103 states and 108 transitions. [2022-01-09 23:07:34,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-01-09 23:07:34,742 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.074074074074074) internal successors, (56), 27 states have internal predecessors, (56), 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 30 [2022-01-09 23:07:34,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-09 23:07:34,742 INFO L225 Difference]: With dead ends: 103 [2022-01-09 23:07:34,742 INFO L226 Difference]: Without dead ends: 82 [2022-01-09 23:07:34,743 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 32 SyntacticMatches, 4 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 330 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=191, Invalid=1141, Unknown=0, NotChecked=0, Total=1332 [2022-01-09 23:07:34,743 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 113 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 397 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 537 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 92 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-09 23:07:34,743 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [113 Valid, 255 Invalid, 537 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 397 Invalid, 0 Unknown, 92 Unchecked, 0.2s Time] [2022-01-09 23:07:34,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-01-09 23:07:34,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 44. [2022-01-09 23:07:34,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 43 states have (on average 1.1395348837209303) internal successors, (49), 43 states have internal predecessors, (49), 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:07:34,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 49 transitions. [2022-01-09 23:07:34,749 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 49 transitions. Word has length 30 [2022-01-09 23:07:34,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-09 23:07:34,749 INFO L470 AbstractCegarLoop]: Abstraction has 44 states and 49 transitions. [2022-01-09 23:07:34,749 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 2.074074074074074) internal successors, (56), 27 states have internal predecessors, (56), 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:07:34,749 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2022-01-09 23:07:34,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-01-09 23:07:34,750 INFO L506 BasicCegarLoop]: Found error trace [2022-01-09 23:07:34,750 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-09 23:07:34,773 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-01-09 23:07:34,964 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-01-09 23:07:34,964 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-09 23:07:34,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-09 23:07:34,965 INFO L85 PathProgramCache]: Analyzing trace with hash 435427615, now seen corresponding path program 5 times [2022-01-09 23:07:34,965 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-09 23:07:34,965 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786119277] [2022-01-09 23:07:34,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-09 23:07:34,965 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-09 23:07:34,972 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-01-09 23:07:34,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [982009999] [2022-01-09 23:07:34,972 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-01-09 23:07:34,972 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-09 23:07:34,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-09 23:07:34,973 INFO L229 MonitoredProcess]: Starting monitored process 12 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:07:34,980 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-01-09 23:07:35,043 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2022-01-09 23:07:35,043 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-09 23:07:35,044 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 46 conjunts are in the unsatisfiable core [2022-01-09 23:07:35,051 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-09 23:07:35,067 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 19 treesize of output 15 [2022-01-09 23:07:35,106 INFO L353 Elim1Store]: treesize reduction 40, result has 23.1 percent of original size [2022-01-09 23:07:35,106 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2022-01-09 23:07:35,171 INFO L353 Elim1Store]: treesize reduction 72, result has 20.9 percent of original size [2022-01-09 23:07:35,171 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 36