/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/ldv-regression/test22-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 00:50:39,303 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 00:50:39,304 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 00:50:39,345 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 00:50:39,346 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 00:50:39,348 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 00:50:39,351 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 00:50:39,355 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 00:50:39,357 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 00:50:39,359 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 00:50:39,359 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 00:50:39,360 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 00:50:39,360 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 00:50:39,360 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 00:50:39,361 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 00:50:39,362 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 00:50:39,366 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 00:50:39,367 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 00:50:39,370 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 00:50:39,371 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 00:50:39,372 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 00:50:39,374 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 00:50:39,377 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 00:50:39,378 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 00:50:39,379 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 00:50:39,379 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 00:50:39,380 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 00:50:39,380 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 00:50:39,380 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 00:50:39,381 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 00:50:39,381 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 00:50:39,381 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 00:50:39,382 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 00:50:39,382 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 00:50:39,383 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 00:50:39,383 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 00:50:39,383 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 00:50:39,383 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 00:50:39,384 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 00:50:39,384 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 00:50:39,385 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 00:50:39,390 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-10 00:50:39,410 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 00:50:39,411 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 00:50:39,411 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 00:50:39,411 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 00:50:39,411 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-10 00:50:39,412 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-10 00:50:39,412 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 00:50:39,412 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 00:50:39,412 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 00:50:39,412 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 00:50:39,412 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 00:50:39,412 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 00:50:39,412 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 00:50:39,413 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 00:50:39,413 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 00:50:39,413 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 00:50:39,413 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 00:50:39,413 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 00:50:39,413 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 00:50:39,413 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 00:50:39,413 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 00:50:39,413 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 00:50:39,413 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 00:50:39,413 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 00:50:39,413 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 00:50:39,414 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-10 00:50:39,414 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-10 00:50:39,414 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 00:50:39,414 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 00:50:39,414 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 00:50:39,414 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-10 00:50:39,577 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 00:50:39,596 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 00:50:39,598 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 00:50:39,598 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 00:50:39,599 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 00:50:39,600 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-regression/test22-1.c [2022-01-10 00:50:39,655 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/49d6188ac/275cbe6ea45b48bb8edbc317d6afc0ee/FLAGc0d9599ce [2022-01-10 00:50:39,967 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 00:50:39,968 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-regression/test22-1.c [2022-01-10 00:50:39,973 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/49d6188ac/275cbe6ea45b48bb8edbc317d6afc0ee/FLAGc0d9599ce [2022-01-10 00:50:40,397 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/49d6188ac/275cbe6ea45b48bb8edbc317d6afc0ee [2022-01-10 00:50:40,401 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 00:50:40,403 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-10 00:50:40,404 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 00:50:40,404 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 00:50:40,407 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 00:50:40,407 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:50:40" (1/1) ... [2022-01-10 00:50:40,409 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@fc204da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:50:40, skipping insertion in model container [2022-01-10 00:50:40,409 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 12:50:40" (1/1) ... [2022-01-10 00:50:40,413 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 00:50:40,424 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 00:50:40,590 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-regression/test22-1.c[1029,1042] [2022-01-10 00:50:40,593 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 00:50:40,600 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 00:50:40,619 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-regression/test22-1.c[1029,1042] [2022-01-10 00:50:40,621 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 00:50:40,633 INFO L208 MainTranslator]: Completed translation [2022-01-10 00:50:40,634 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:50:40 WrapperNode [2022-01-10 00:50:40,635 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 00:50:40,635 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 00:50:40,636 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 00:50:40,636 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 00:50:40,640 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:50:40" (1/1) ... [2022-01-10 00:50:40,652 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:50:40" (1/1) ... [2022-01-10 00:50:40,670 INFO L137 Inliner]: procedures = 16, calls = 26, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 85 [2022-01-10 00:50:40,670 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 00:50:40,671 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 00:50:40,671 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 00:50:40,671 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 00:50:40,676 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:50:40" (1/1) ... [2022-01-10 00:50:40,676 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:50:40" (1/1) ... [2022-01-10 00:50:40,680 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:50:40" (1/1) ... [2022-01-10 00:50:40,680 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:50:40" (1/1) ... [2022-01-10 00:50:40,690 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:50:40" (1/1) ... [2022-01-10 00:50:40,693 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:50:40" (1/1) ... [2022-01-10 00:50:40,697 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:50:40" (1/1) ... [2022-01-10 00:50:40,699 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 00:50:40,700 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 00:50:40,700 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 00:50:40,700 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 00:50:40,701 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:50:40" (1/1) ... [2022-01-10 00:50:40,705 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 00:50:40,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 00:50:40,720 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-10 00:50:40,726 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-10 00:50:40,750 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 00:50:40,751 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-10 00:50:40,751 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-10 00:50:40,751 INFO L130 BoogieDeclarations]: Found specification of procedure get_dummy [2022-01-10 00:50:40,751 INFO L138 BoogieDeclarations]: Found implementation of procedure get_dummy [2022-01-10 00:50:40,751 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 00:50:40,751 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 00:50:40,751 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-10 00:50:40,815 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 00:50:40,817 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 00:50:40,975 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 00:50:40,979 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 00:50:40,979 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-01-10 00:50:40,980 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:50:40 BoogieIcfgContainer [2022-01-10 00:50:40,980 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 00:50:40,981 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 00:50:40,981 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 00:50:40,987 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 00:50:40,987 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 12:50:40" (1/3) ... [2022-01-10 00:50:40,988 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d0908c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:50:40, skipping insertion in model container [2022-01-10 00:50:40,988 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 12:50:40" (2/3) ... [2022-01-10 00:50:40,988 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d0908c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 12:50:40, skipping insertion in model container [2022-01-10 00:50:40,988 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 12:50:40" (3/3) ... [2022-01-10 00:50:40,989 INFO L111 eAbstractionObserver]: Analyzing ICFG test22-1.c [2022-01-10 00:50:40,992 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 00:50:40,992 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-10 00:50:41,035 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 00:50:41,042 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-10 00:50:41,043 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-10 00:50:41,058 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 20 states have (on average 1.35) internal successors, (27), 21 states have internal predecessors, (27), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-10 00:50:41,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-01-10 00:50:41,061 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:50:41,062 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:50:41,062 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:50:41,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:50:41,066 INFO L85 PathProgramCache]: Analyzing trace with hash -911093318, now seen corresponding path program 1 times [2022-01-10 00:50:41,071 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:50:41,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199578635] [2022-01-10 00:50:41,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:50:41,073 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:50:41,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:50:41,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 00:50:41,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:50:41,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-01-10 00:50:41,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:50:41,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-01-10 00:50:41,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:50:41,295 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-01-10 00:50:41,295 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:50:41,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199578635] [2022-01-10 00:50:41,296 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199578635] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 00:50:41,296 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 00:50:41,296 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 00:50:41,298 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31331166] [2022-01-10 00:50:41,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:50:41,301 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-10 00:50:41,301 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:50:41,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-10 00:50:41,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-10 00:50:41,328 INFO L87 Difference]: Start difference. First operand has 26 states, 20 states have (on average 1.35) internal successors, (27), 21 states have internal predecessors, (27), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-01-10 00:50:41,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:50:41,341 INFO L93 Difference]: Finished difference Result 35 states and 42 transitions. [2022-01-10 00:50:41,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-10 00:50:41,342 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 28 [2022-01-10 00:50:41,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:50:41,347 INFO L225 Difference]: With dead ends: 35 [2022-01-10 00:50:41,347 INFO L226 Difference]: Without dead ends: 22 [2022-01-10 00:50:41,349 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 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-10 00:50:41,352 INFO L933 BasicCegarLoop]: 31 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, 31 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-10 00:50:41,352 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 00:50:41,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-01-10 00:50:41,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-01-10 00:50:41,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-10 00:50:41,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2022-01-10 00:50:41,379 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 28 [2022-01-10 00:50:41,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:50:41,381 INFO L470 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2022-01-10 00:50:41,382 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-01-10 00:50:41,382 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2022-01-10 00:50:41,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-01-10 00:50:41,383 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:50:41,384 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:50:41,384 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-10 00:50:41,385 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:50:41,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:50:41,385 INFO L85 PathProgramCache]: Analyzing trace with hash 1614870372, now seen corresponding path program 1 times [2022-01-10 00:50:41,385 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:50:41,386 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995950313] [2022-01-10 00:50:41,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:50:41,386 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:50:41,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:50:41,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 00:50:41,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:50:41,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-01-10 00:50:41,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:50:41,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-01-10 00:50:41,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:50:41,571 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-01-10 00:50:41,571 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:50:41,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995950313] [2022-01-10 00:50:41,572 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995950313] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 00:50:41,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [87096250] [2022-01-10 00:50:41,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:50:41,572 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 00:50:41,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 00:50:41,574 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-10 00:50:41,601 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-10 00:50:41,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:50:41,695 INFO L263 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 29 conjunts are in the unsatisfiable core [2022-01-10 00:50:41,700 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 00:50:42,084 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 17 treesize of output 9 [2022-01-10 00:50:42,101 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 00:50:42,101 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 00:50:42,157 INFO L353 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-01-10 00:50:42,157 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-01-10 00:50:42,230 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-01-10 00:50:42,231 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [87096250] provided 1 perfect and 1 imperfect interpolant sequences [2022-01-10 00:50:42,231 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-01-10 00:50:42,231 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10, 16] total 26 [2022-01-10 00:50:42,232 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136845768] [2022-01-10 00:50:42,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 00:50:42,232 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 00:50:42,232 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:50:42,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 00:50:42,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=583, Unknown=0, NotChecked=0, Total=650 [2022-01-10 00:50:42,234 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-01-10 00:50:42,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:50:42,282 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2022-01-10 00:50:42,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 00:50:42,283 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 29 [2022-01-10 00:50:42,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:50:42,283 INFO L225 Difference]: With dead ends: 30 [2022-01-10 00:50:42,283 INFO L226 Difference]: Without dead ends: 25 [2022-01-10 00:50:42,284 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=79, Invalid=677, Unknown=0, NotChecked=0, Total=756 [2022-01-10 00:50:42,284 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 11 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 00:50:42,285 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 77 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 00:50:42,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-01-10 00:50:42,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2022-01-10 00:50:42,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-10 00:50:42,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2022-01-10 00:50:42,288 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 29 [2022-01-10 00:50:42,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:50:42,289 INFO L470 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2022-01-10 00:50:42,289 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-01-10 00:50:42,289 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2022-01-10 00:50:42,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-01-10 00:50:42,290 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:50:42,290 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:50:42,335 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-10 00:50:42,507 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 00:50:42,507 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:50:42,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:50:42,507 INFO L85 PathProgramCache]: Analyzing trace with hash -1377934871, now seen corresponding path program 1 times [2022-01-10 00:50:42,508 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:50:42,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280720627] [2022-01-10 00:50:42,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:50:42,508 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:50:42,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:50:42,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 00:50:42,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:50:42,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-01-10 00:50:42,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:50:42,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-01-10 00:50:42,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:50:42,729 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-01-10 00:50:42,730 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:50:42,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280720627] [2022-01-10 00:50:42,730 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280720627] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 00:50:42,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2010405160] [2022-01-10 00:50:42,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:50:42,730 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 00:50:42,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 00:50:42,744 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-10 00:50:42,764 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-10 00:50:42,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:50:42,837 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 30 conjunts are in the unsatisfiable core [2022-01-10 00:50:42,839 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 00:50:43,220 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 17 treesize of output 9 [2022-01-10 00:50:43,228 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 00:50:43,228 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 00:50:43,313 INFO L353 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-01-10 00:50:43,313 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-01-10 00:50:43,388 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-01-10 00:50:43,388 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2010405160] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 00:50:43,388 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 00:50:43,388 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 17, 7] total 29 [2022-01-10 00:50:43,388 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660720509] [2022-01-10 00:50:43,389 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 00:50:43,389 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-01-10 00:50:43,389 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:50:43,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-01-10 00:50:43,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=730, Unknown=0, NotChecked=0, Total=812 [2022-01-10 00:50:43,390 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand has 29 states, 27 states have (on average 1.7777777777777777) internal successors, (48), 24 states have internal predecessors, (48), 6 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (9), 7 states have call predecessors, (9), 6 states have call successors, (9) [2022-01-10 00:50:44,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:50:44,260 INFO L93 Difference]: Finished difference Result 71 states and 91 transitions. [2022-01-10 00:50:44,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-01-10 00:50:44,261 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 27 states have (on average 1.7777777777777777) internal successors, (48), 24 states have internal predecessors, (48), 6 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (9), 7 states have call predecessors, (9), 6 states have call successors, (9) Word has length 31 [2022-01-10 00:50:44,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:50:44,262 INFO L225 Difference]: With dead ends: 71 [2022-01-10 00:50:44,262 INFO L226 Difference]: Without dead ends: 61 [2022-01-10 00:50:44,264 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 444 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=484, Invalid=2486, Unknown=0, NotChecked=0, Total=2970 [2022-01-10 00:50:44,264 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 120 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 494 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 575 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 494 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 00:50:44,264 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [123 Valid, 267 Invalid, 575 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 494 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 00:50:44,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-01-10 00:50:44,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 39. [2022-01-10 00:50:44,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 31 states have (on average 1.096774193548387) internal successors, (34), 31 states have internal predecessors, (34), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (10), 6 states have call predecessors, (10), 5 states have call successors, (10) [2022-01-10 00:50:44,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 49 transitions. [2022-01-10 00:50:44,272 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 49 transitions. Word has length 31 [2022-01-10 00:50:44,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:50:44,272 INFO L470 AbstractCegarLoop]: Abstraction has 39 states and 49 transitions. [2022-01-10 00:50:44,272 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 27 states have (on average 1.7777777777777777) internal successors, (48), 24 states have internal predecessors, (48), 6 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (9), 7 states have call predecessors, (9), 6 states have call successors, (9) [2022-01-10 00:50:44,272 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 49 transitions. [2022-01-10 00:50:44,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-01-10 00:50:44,273 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:50:44,273 INFO L514 BasicCegarLoop]: trace histogram [5, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:50:44,300 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-10 00:50:44,498 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,SelfDestructingSolverStorable2 [2022-01-10 00:50:44,499 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:50:44,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:50:44,499 INFO L85 PathProgramCache]: Analyzing trace with hash -772238856, now seen corresponding path program 2 times [2022-01-10 00:50:44,499 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:50:44,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683504676] [2022-01-10 00:50:44,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:50:44,500 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:50:44,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:50:44,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 00:50:44,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:50:44,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-01-10 00:50:44,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:50:44,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-01-10 00:50:44,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:50:44,762 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-01-10 00:50:44,762 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:50:44,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683504676] [2022-01-10 00:50:44,762 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683504676] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 00:50:44,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1409572204] [2022-01-10 00:50:44,763 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-10 00:50:44,763 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 00:50:44,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 00:50:44,774 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-10 00:50:44,775 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-10 00:50:44,836 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-10 00:50:44,837 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 00:50:44,838 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 43 conjunts are in the unsatisfiable core [2022-01-10 00:50:44,840 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 00:50:45,286 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 17 treesize of output 9 [2022-01-10 00:50:45,292 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 3 proven. 28 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-10 00:50:45,292 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 00:50:45,460 INFO L353 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-01-10 00:50:45,460 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-01-10 00:50:45,523 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-01-10 00:50:45,523 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1409572204] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 00:50:45,523 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 00:50:45,524 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 19, 10] total 37 [2022-01-10 00:50:45,525 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699018560] [2022-01-10 00:50:45,527 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 00:50:45,528 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-01-10 00:50:45,531 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:50:45,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-01-10 00:50:45,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=1164, Unknown=0, NotChecked=0, Total=1332 [2022-01-10 00:50:45,533 INFO L87 Difference]: Start difference. First operand 39 states and 49 transitions. Second operand has 37 states, 35 states have (on average 1.8857142857142857) internal successors, (66), 33 states have internal predecessors, (66), 6 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (9), 7 states have call predecessors, (9), 6 states have call successors, (9) [2022-01-10 00:50:47,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:50:47,252 INFO L93 Difference]: Finished difference Result 90 states and 114 transitions. [2022-01-10 00:50:47,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2022-01-10 00:50:47,253 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 35 states have (on average 1.8857142857142857) internal successors, (66), 33 states have internal predecessors, (66), 6 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (9), 7 states have call predecessors, (9), 6 states have call successors, (9) Word has length 37 [2022-01-10 00:50:47,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:50:47,253 INFO L225 Difference]: With dead ends: 90 [2022-01-10 00:50:47,254 INFO L226 Difference]: Without dead ends: 85 [2022-01-10 00:50:47,256 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1593 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1387, Invalid=5753, Unknown=0, NotChecked=0, Total=7140 [2022-01-10 00:50:47,256 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 182 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 438 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 570 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 438 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 00:50:47,256 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [185 Valid, 268 Invalid, 570 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 438 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 00:50:47,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-01-10 00:50:47,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 51. [2022-01-10 00:50:47,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 43 states have (on average 1.069767441860465) internal successors, (46), 43 states have internal predecessors, (46), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (10), 6 states have call predecessors, (10), 5 states have call successors, (10) [2022-01-10 00:50:47,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 61 transitions. [2022-01-10 00:50:47,279 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 61 transitions. Word has length 37 [2022-01-10 00:50:47,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:50:47,279 INFO L470 AbstractCegarLoop]: Abstraction has 51 states and 61 transitions. [2022-01-10 00:50:47,280 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 35 states have (on average 1.8857142857142857) internal successors, (66), 33 states have internal predecessors, (66), 6 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (9), 7 states have call predecessors, (9), 6 states have call successors, (9) [2022-01-10 00:50:47,280 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 61 transitions. [2022-01-10 00:50:47,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-01-10 00:50:47,282 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:50:47,283 INFO L514 BasicCegarLoop]: trace histogram [11, 10, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:50:47,310 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-01-10 00:50:47,499 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 00:50:47,499 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:50:47,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:50:47,500 INFO L85 PathProgramCache]: Analyzing trace with hash -1758737322, now seen corresponding path program 3 times [2022-01-10 00:50:47,500 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:50:47,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204337877] [2022-01-10 00:50:47,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:50:47,500 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:50:47,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:50:47,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 00:50:47,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:50:47,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-01-10 00:50:47,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:50:47,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-01-10 00:50:47,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:50:47,876 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 3 proven. 113 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-01-10 00:50:47,876 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:50:47,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204337877] [2022-01-10 00:50:47,876 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204337877] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 00:50:47,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1260759137] [2022-01-10 00:50:47,876 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-10 00:50:47,876 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 00:50:47,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 00:50:47,877 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-10 00:50:47,879 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-10 00:50:47,941 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-01-10 00:50:47,941 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 00:50:47,942 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 60 conjunts are in the unsatisfiable core [2022-01-10 00:50:47,944 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 00:50:48,564 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 41 treesize of output 25 [2022-01-10 00:50:48,582 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 19 proven. 18 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2022-01-10 00:50:48,582 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 00:50:48,731 INFO L353 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-01-10 00:50:48,731 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 31 [2022-01-10 00:50:48,987 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2022-01-10 00:50:48,988 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1260759137] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 00:50:48,988 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 00:50:48,988 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 16, 15] total 40 [2022-01-10 00:50:48,988 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340571121] [2022-01-10 00:50:48,988 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 00:50:48,988 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-01-10 00:50:48,989 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:50:48,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-01-10 00:50:48,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=1460, Unknown=0, NotChecked=0, Total=1560 [2022-01-10 00:50:48,989 INFO L87 Difference]: Start difference. First operand 51 states and 61 transitions. Second operand has 40 states, 37 states have (on average 1.9189189189189189) internal successors, (71), 35 states have internal predecessors, (71), 7 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (9), 8 states have call predecessors, (9), 7 states have call successors, (9) [2022-01-10 00:50:51,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:50:51,542 INFO L93 Difference]: Finished difference Result 163 states and 183 transitions. [2022-01-10 00:50:51,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2022-01-10 00:50:51,542 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 37 states have (on average 1.9189189189189189) internal successors, (71), 35 states have internal predecessors, (71), 7 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (9), 8 states have call predecessors, (9), 7 states have call successors, (9) Word has length 49 [2022-01-10 00:50:51,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:50:51,548 INFO L225 Difference]: With dead ends: 163 [2022-01-10 00:50:51,548 INFO L226 Difference]: Without dead ends: 117 [2022-01-10 00:50:51,551 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 88 SyntacticMatches, 1 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2752 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1116, Invalid=11316, Unknown=0, NotChecked=0, Total=12432 [2022-01-10 00:50:51,551 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 229 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 2017 mSolverCounterSat, 149 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 2166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 149 IncrementalHoareTripleChecker+Valid, 2017 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-01-10 00:50:51,552 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [229 Valid, 410 Invalid, 2166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [149 Valid, 2017 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-01-10 00:50:51,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2022-01-10 00:50:51,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 49. [2022-01-10 00:50:51,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 42 states have (on average 1.0714285714285714) internal successors, (45), 43 states have internal predecessors, (45), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-01-10 00:50:51,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 56 transitions. [2022-01-10 00:50:51,564 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 56 transitions. Word has length 49 [2022-01-10 00:50:51,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:50:51,564 INFO L470 AbstractCegarLoop]: Abstraction has 49 states and 56 transitions. [2022-01-10 00:50:51,565 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 37 states have (on average 1.9189189189189189) internal successors, (71), 35 states have internal predecessors, (71), 7 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (9), 8 states have call predecessors, (9), 7 states have call successors, (9) [2022-01-10 00:50:51,565 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 56 transitions. [2022-01-10 00:50:51,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-01-10 00:50:51,565 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:50:51,565 INFO L514 BasicCegarLoop]: trace histogram [12, 11, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:50:51,585 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-10 00:50:51,782 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 00:50:51,782 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:50:51,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:50:51,783 INFO L85 PathProgramCache]: Analyzing trace with hash -290973603, now seen corresponding path program 1 times [2022-01-10 00:50:51,783 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:50:51,783 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367191424] [2022-01-10 00:50:51,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:50:51,783 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:50:51,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:50:51,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 00:50:51,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:50:51,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-01-10 00:50:51,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:50:51,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-01-10 00:50:51,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:50:51,870 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2022-01-10 00:50:51,870 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:50:51,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367191424] [2022-01-10 00:50:51,870 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367191424] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 00:50:51,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1705951001] [2022-01-10 00:50:51,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:50:51,870 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 00:50:51,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 00:50:51,875 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-10 00:50:51,876 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-10 00:50:51,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:50:51,934 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 12 conjunts are in the unsatisfiable core [2022-01-10 00:50:51,938 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 00:50:52,154 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2022-01-10 00:50:52,155 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 00:50:52,284 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2022-01-10 00:50:52,284 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1705951001] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 00:50:52,284 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 00:50:52,285 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 12] total 30 [2022-01-10 00:50:52,285 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299759725] [2022-01-10 00:50:52,285 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 00:50:52,285 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-01-10 00:50:52,285 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:50:52,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-01-10 00:50:52,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=779, Unknown=0, NotChecked=0, Total=870 [2022-01-10 00:50:52,286 INFO L87 Difference]: Start difference. First operand 49 states and 56 transitions. Second operand has 30 states, 27 states have (on average 1.7407407407407407) internal successors, (47), 23 states have internal predecessors, (47), 8 states have call successors, (8), 3 states have call predecessors, (8), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-01-10 00:50:52,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:50:52,448 INFO L93 Difference]: Finished difference Result 85 states and 95 transitions. [2022-01-10 00:50:52,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-10 00:50:52,448 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 27 states have (on average 1.7407407407407407) internal successors, (47), 23 states have internal predecessors, (47), 8 states have call successors, (8), 3 states have call predecessors, (8), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Word has length 51 [2022-01-10 00:50:52,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:50:52,448 INFO L225 Difference]: With dead ends: 85 [2022-01-10 00:50:52,449 INFO L226 Difference]: Without dead ends: 47 [2022-01-10 00:50:52,449 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 264 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=192, Invalid=1368, Unknown=0, NotChecked=0, Total=1560 [2022-01-10 00:50:52,450 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 64 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 00:50:52,450 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [70 Valid, 281 Invalid, 377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 00:50:52,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-01-10 00:50:52,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2022-01-10 00:50:52,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 41 states have (on average 1.048780487804878) internal successors, (43), 42 states have internal predecessors, (43), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-01-10 00:50:52,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2022-01-10 00:50:52,471 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 51 [2022-01-10 00:50:52,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:50:52,472 INFO L470 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2022-01-10 00:50:52,472 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 27 states have (on average 1.7407407407407407) internal successors, (47), 23 states have internal predecessors, (47), 8 states have call successors, (8), 3 states have call predecessors, (8), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-01-10 00:50:52,472 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2022-01-10 00:50:52,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-01-10 00:50:52,472 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:50:52,473 INFO L514 BasicCegarLoop]: trace histogram [12, 11, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:50:52,505 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-10 00:50:52,689 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 00:50:52,690 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:50:52,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:50:52,690 INFO L85 PathProgramCache]: Analyzing trace with hash -1067708707, now seen corresponding path program 2 times [2022-01-10 00:50:52,690 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:50:52,691 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348836535] [2022-01-10 00:50:52,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:50:52,691 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:50:52,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:50:52,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 00:50:52,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:50:52,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-01-10 00:50:52,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:50:52,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-01-10 00:50:52,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:50:52,753 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2022-01-10 00:50:52,753 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:50:52,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348836535] [2022-01-10 00:50:52,753 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348836535] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 00:50:52,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [461392963] [2022-01-10 00:50:52,754 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-10 00:50:52,754 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 00:50:52,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 00:50:52,757 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-10 00:50:52,758 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-10 00:50:52,849 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-10 00:50:52,849 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 00:50:52,850 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 24 conjunts are in the unsatisfiable core [2022-01-10 00:50:52,852 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 00:50:53,131 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2022-01-10 00:50:53,131 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 00:50:53,306 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2022-01-10 00:50:53,306 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [461392963] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 00:50:53,306 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 00:50:53,307 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 12] total 25 [2022-01-10 00:50:53,307 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338167468] [2022-01-10 00:50:53,307 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 00:50:53,307 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-01-10 00:50:53,307 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:50:53,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-01-10 00:50:53,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=528, Unknown=0, NotChecked=0, Total=600 [2022-01-10 00:50:53,308 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand has 25 states, 23 states have (on average 1.7391304347826086) internal successors, (40), 20 states have internal predecessors, (40), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-01-10 00:50:53,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:50:53,507 INFO L93 Difference]: Finished difference Result 81 states and 87 transitions. [2022-01-10 00:50:53,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-10 00:50:53,514 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 23 states have (on average 1.7391304347826086) internal successors, (40), 20 states have internal predecessors, (40), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) Word has length 51 [2022-01-10 00:50:53,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:50:53,515 INFO L225 Difference]: With dead ends: 81 [2022-01-10 00:50:53,515 INFO L226 Difference]: Without dead ends: 47 [2022-01-10 00:50:53,516 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=133, Invalid=859, Unknown=0, NotChecked=0, Total=992 [2022-01-10 00:50:53,518 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 48 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 00:50:53,518 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 155 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 00:50:53,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-01-10 00:50:53,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2022-01-10 00:50:53,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 41 states have (on average 1.048780487804878) internal successors, (43), 42 states have internal predecessors, (43), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-01-10 00:50:53,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 50 transitions. [2022-01-10 00:50:53,535 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 50 transitions. Word has length 51 [2022-01-10 00:50:53,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:50:53,536 INFO L470 AbstractCegarLoop]: Abstraction has 47 states and 50 transitions. [2022-01-10 00:50:53,536 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 23 states have (on average 1.7391304347826086) internal successors, (40), 20 states have internal predecessors, (40), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2022-01-10 00:50:53,536 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 50 transitions. [2022-01-10 00:50:53,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-01-10 00:50:53,540 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 00:50:53,540 INFO L514 BasicCegarLoop]: trace histogram [12, 11, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 00:50:53,559 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-10 00:50:53,757 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 00:50:53,758 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 00:50:53,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 00:50:53,758 INFO L85 PathProgramCache]: Analyzing trace with hash -644061985, now seen corresponding path program 3 times [2022-01-10 00:50:53,758 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 00:50:53,758 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156661975] [2022-01-10 00:50:53,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 00:50:53,771 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 00:50:53,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:50:54,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-01-10 00:50:54,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:50:54,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-01-10 00:50:54,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:50:54,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-01-10 00:50:54,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 00:50:54,122 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 122 proven. 16 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-01-10 00:50:54,122 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 00:50:54,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156661975] [2022-01-10 00:50:54,122 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156661975] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 00:50:54,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [571412644] [2022-01-10 00:50:54,122 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-10 00:50:54,122 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 00:50:54,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 00:50:54,138 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-10 00:50:54,139 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-10 00:50:54,193 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-01-10 00:50:54,194 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 00:50:54,195 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 52 conjunts are in the unsatisfiable core [2022-01-10 00:50:54,200 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 00:50:54,797 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 25 [2022-01-10 00:50:54,841 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 21 proven. 22 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2022-01-10 00:50:54,841 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 00:50:54,990 INFO L353 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-01-10 00:50:54,991 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 31 [2022-01-10 00:50:55,148 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-01-10 00:50:55,148 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [571412644] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 00:50:55,148 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 00:50:55,148 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 11] total 44 [2022-01-10 00:50:55,149 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012110879] [2022-01-10 00:50:55,149 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 00:50:55,149 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-01-10 00:50:55,149 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 00:50:55,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-01-10 00:50:55,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=1712, Unknown=0, NotChecked=0, Total=1892 [2022-01-10 00:50:55,150 INFO L87 Difference]: Start difference. First operand 47 states and 50 transitions. Second operand has 44 states, 42 states have (on average 1.8571428571428572) internal successors, (78), 40 states have internal predecessors, (78), 6 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (9), 7 states have call predecessors, (9), 6 states have call successors, (9) [2022-01-10 00:50:56,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 00:50:56,592 INFO L93 Difference]: Finished difference Result 47 states and 50 transitions. [2022-01-10 00:50:56,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-01-10 00:50:56,593 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 42 states have (on average 1.8571428571428572) internal successors, (78), 40 states have internal predecessors, (78), 6 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (9), 7 states have call predecessors, (9), 6 states have call successors, (9) Word has length 51 [2022-01-10 00:50:56,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 00:50:56,593 INFO L225 Difference]: With dead ends: 47 [2022-01-10 00:50:56,593 INFO L226 Difference]: Without dead ends: 0 [2022-01-10 00:50:56,594 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 85 SyntacticMatches, 1 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 863 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=939, Invalid=4173, Unknown=0, NotChecked=0, Total=5112 [2022-01-10 00:50:56,595 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 24 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 731 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 758 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 731 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-10 00:50:56,595 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 202 Invalid, 758 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 731 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-10 00:50:56,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-01-10 00:50:56,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-01-10 00:50:56,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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-10 00:50:56,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-01-10 00:50:56,596 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 51 [2022-01-10 00:50:56,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 00:50:56,596 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-01-10 00:50:56,596 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 42 states have (on average 1.8571428571428572) internal successors, (78), 40 states have internal predecessors, (78), 6 states have call successors, (8), 2 states have call predecessors, (8), 4 states have return successors, (9), 7 states have call predecessors, (9), 6 states have call successors, (9) [2022-01-10 00:50:56,596 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-01-10 00:50:56,596 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-01-10 00:50:56,598 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-01-10 00:50:56,615 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-10 00:50:56,807 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 00:50:56,809 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-01-10 00:50:58,140 INFO L858 garLoopResultBuilder]: For program point get_dummyFINAL(lines 22 25) no Hoare annotation was computed. [2022-01-10 00:50:58,140 INFO L861 garLoopResultBuilder]: At program point get_dummyENTRY(lines 22 25) the Hoare annotation is: true [2022-01-10 00:50:58,140 INFO L858 garLoopResultBuilder]: For program point L24-1(line 24) no Hoare annotation was computed. [2022-01-10 00:50:58,140 INFO L858 garLoopResultBuilder]: For program point get_dummyEXIT(lines 22 25) no Hoare annotation was computed. [2022-01-10 00:50:58,140 INFO L854 garLoopResultBuilder]: At program point L35-2(line 35) the Hoare annotation is: (let ((.cse0 (= |~#d1~0.offset| 0))) (or (and (= |~#d1~0.offset| |ULTIMATE.start_main_~pd1~0#1.offset|) (= 4 |ULTIMATE.start_main_~pd1~0#1.base|) (= |~#d1~0.base| |ULTIMATE.start_main_~pd1~0#1.base|) .cse0 (<= 5 |~#d2~0.base|)) (and (= |~#d2~0.offset| |ULTIMATE.start_main_~pd1~0#1.offset|) (= |~#d2~0.offset| 0) (= |~#d1~0.base| 4) (= 5 |ULTIMATE.start_main_~pd1~0#1.base|) (= 5 |~#d2~0.base|) .cse0))) [2022-01-10 00:50:58,140 INFO L858 garLoopResultBuilder]: For program point L37-4(lines 37 46) no Hoare annotation was computed. [2022-01-10 00:50:58,140 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-01-10 00:50:58,140 INFO L858 garLoopResultBuilder]: For program point L35-3(line 35) no Hoare annotation was computed. [2022-01-10 00:50:58,141 INFO L854 garLoopResultBuilder]: At program point L35-4(line 35) the Hoare annotation is: (let ((.cse1 (= |~#d1~0.base| 4)) (.cse2 (= 5 |ULTIMATE.start_main_~pd1~0#1.base|)) (.cse3 (= 5 |~#d2~0.base|)) (.cse0 (not (= |~#d1~0.base| |~#d2~0.base|))) (.cse6 (= |ULTIMATE.start_main_~pd2~0#1.base| |ULTIMATE.start_main_~pd1~0#1.base|)) (.cse4 (= 4 |ULTIMATE.start_main_~pd2~0#1.base|)) (.cse5 (= |~#d1~0.offset| 0)) (.cse7 (= |ULTIMATE.start_main_~pd1~0#1.offset| 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 (<= |ULTIMATE.start_main_~pd1~0#1.base| 4) .cse1 .cse5 (<= 5 |~#d2~0.base|) (<= 5 |ULTIMATE.start_main_~pd2~0#1.base|)) (and .cse0 (= |~#d2~0.offset| 0) .cse1 .cse2 .cse3 (= |ULTIMATE.start_main_~pd1~0#1.offset| |ULTIMATE.start_main_~pd2~0#1.offset|) .cse6 .cse5 .cse7) (and .cse0 (= |~#d1~0.offset| |ULTIMATE.start_main_~pd2~0#1.offset|) .cse6 .cse4 (= |~#d1~0.base| |ULTIMATE.start_main_~pd1~0#1.base|) .cse5 .cse7))) [2022-01-10 00:50:58,141 INFO L858 garLoopResultBuilder]: For program point L35-5(line 35) no Hoare annotation was computed. [2022-01-10 00:50:58,141 INFO L854 garLoopResultBuilder]: At program point L29(lines 27 30) the Hoare annotation is: (and (not (= |~#d1~0.base| |~#d2~0.base|)) (= (select (select |#memory_int| |ULTIMATE.start_main_~pd2~0#1.base|) |ULTIMATE.start_main_~pd2~0#1.offset|) |ULTIMATE.start_main_~i~0#1|) (= |~#d1~0.base| 4) (<= 1 |ULTIMATE.start_check_#res#1|) (= |ULTIMATE.start_main_~pd1~0#1.offset| |ULTIMATE.start_main_~pd2~0#1.offset|) (= |ULTIMATE.start_main_~pd2~0#1.base| |ULTIMATE.start_main_~pd1~0#1.base|) (= |~#d1~0.offset| 0)) [2022-01-10 00:50:58,141 INFO L858 garLoopResultBuilder]: For program point L13(lines 13 20) no Hoare annotation was computed. [2022-01-10 00:50:58,141 INFO L854 garLoopResultBuilder]: At program point L44(lines 33 52) the Hoare annotation is: false [2022-01-10 00:50:58,141 INFO L858 garLoopResultBuilder]: For program point L40-1(lines 40 42) no Hoare annotation was computed. [2022-01-10 00:50:58,141 INFO L854 garLoopResultBuilder]: At program point L40-3(lines 40 42) the Hoare annotation is: (let ((.cse25 (+ 7 |ULTIMATE.start_main_~i~0#1|)) (.cse26 (+ 9 |ULTIMATE.start_main_~i~0#1|)) (.cse5 (select (select |#memory_int| |ULTIMATE.start_main_~pd2~0#1.base|) |ULTIMATE.start_main_~pd2~0#1.offset|))) (let ((.cse17 (< |ULTIMATE.start_main_~i~0#1| (+ (select (select |#memory_int| |ULTIMATE.start_main_~pa~0#1.base|) |ULTIMATE.start_main_~pa~0#1.offset|) 1))) (.cse24 (= .cse5 (+ |ULTIMATE.start_main_~i~0#1| 10))) (.cse19 (= .cse5 .cse26)) (.cse10 (= |~#d2~0.offset| 0)) (.cse12 (= 5 |ULTIMATE.start_main_~pd1~0#1.base|)) (.cse13 (= 5 |~#d2~0.base|)) (.cse20 (<= .cse26 .cse5)) (.cse22 (<= .cse25 .cse5)) (.cse23 (= .cse5 .cse25)) (.cse1 (= |~#d1~0.offset| |ULTIMATE.start_main_~pd2~0#1.offset|)) (.cse2 (= 4 |ULTIMATE.start_main_~pd1~0#1.base|)) (.cse3 (= 4 |ULTIMATE.start_main_~pd2~0#1.base|)) (.cse16 (+ 6 |ULTIMATE.start_main_~i~0#1|)) (.cse18 (= |ULTIMATE.start_main_~pa~0#1.base| |ULTIMATE.start_main_~pd2~0#1.base|)) (.cse21 (= .cse5 (+ |ULTIMATE.start_main_~i~0#1| 8))) (.cse0 (not (= |~#d1~0.base| |~#d2~0.base|))) (.cse11 (= |~#d1~0.base| 4)) (.cse14 (= |ULTIMATE.start_main_~pd1~0#1.offset| |ULTIMATE.start_main_~pd2~0#1.offset|)) (.cse15 (= |ULTIMATE.start_main_~pd2~0#1.base| |ULTIMATE.start_main_~pd1~0#1.base|)) (.cse4 (= |~#d1~0.base| |ULTIMATE.start_main_~pd1~0#1.base|)) (.cse6 (= |~#d1~0.offset| 0)) (.cse7 (= |ULTIMATE.start_main_~pa~0#1.base| 4)) (.cse8 (= |ULTIMATE.start_main_~pd2~0#1.offset| |ULTIMATE.start_main_~pa~0#1.offset|)) (.cse9 (= |ULTIMATE.start_main_~pd1~0#1.offset| 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= (+ 5 |ULTIMATE.start_main_~i~0#1|) .cse5) .cse6 .cse7 .cse8 .cse9) (and .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (<= .cse5 .cse16) .cse17 .cse6 .cse18 .cse8 .cse9) (and .cse0 .cse19 .cse11 .cse14 .cse15 .cse6 .cse18 .cse20 .cse7 .cse8 .cse9) (and .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse6 .cse18 .cse21 .cse8 .cse9) (and .cse22 .cse23 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse6 .cse18 .cse8 .cse9) (and .cse0 .cse11 .cse14 .cse15 (= (+ 3 |ULTIMATE.start_main_~i~0#1|) .cse5) .cse4 .cse6 .cse7 .cse8 .cse9) (and .cse24 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse6 .cse18 .cse8 .cse9) (and .cse0 (= .cse5 (+ |ULTIMATE.start_main_~i~0#1| 1)) .cse11 .cse14 .cse15 .cse4 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse17 .cse4 .cse6 .cse7 (<= (select (select |#memory_int| 4) 0) |ULTIMATE.start_main_~i~0#1|) .cse8 .cse9) (and .cse0 .cse24 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9) (and .cse19 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse6 .cse18 .cse20 .cse8 .cse9) (and .cse0 (= .cse5 (+ 2 |ULTIMATE.start_main_~i~0#1|)) .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse22 .cse23 .cse11 .cse14 .cse15 .cse6 .cse18 .cse7 .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 (= .cse5 .cse16) .cse8 .cse9) (and .cse0 .cse11 .cse14 .cse15 .cse6 .cse18 .cse7 .cse21 .cse8 .cse9) (and .cse0 .cse11 .cse14 .cse15 .cse4 (= (+ |ULTIMATE.start_main_~i~0#1| 4) .cse5) .cse6 .cse7 .cse8 .cse9)))) [2022-01-10 00:50:58,141 INFO L858 garLoopResultBuilder]: For program point L40-4(lines 40 42) no Hoare annotation was computed. [2022-01-10 00:50:58,141 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-01-10 00:50:58,141 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-01-10 00:50:58,141 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-01-10 00:50:58,142 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 50) no Hoare annotation was computed. [2022-01-10 00:50:58,142 INFO L861 garLoopResultBuilder]: At program point L51(lines 32 52) the Hoare annotation is: true [2022-01-10 00:50:58,142 INFO L858 garLoopResultBuilder]: For program point L43(lines 43 45) no Hoare annotation was computed. [2022-01-10 00:50:58,142 INFO L858 garLoopResultBuilder]: For program point L37(line 37) no Hoare annotation was computed. [2022-01-10 00:50:58,142 INFO L854 garLoopResultBuilder]: At program point L35(line 35) the Hoare annotation is: (and (= |~#d2~0.offset| 0) (= |~#d1~0.base| 4) (= 5 |~#d2~0.base|) (= |~#d1~0.offset| 0)) [2022-01-10 00:50:58,142 INFO L858 garLoopResultBuilder]: For program point L37-2(lines 37 46) no Hoare annotation was computed. [2022-01-10 00:50:58,142 INFO L858 garLoopResultBuilder]: For program point L35-1(line 35) no Hoare annotation was computed. [2022-01-10 00:50:58,144 INFO L732 BasicCegarLoop]: Path program histogram: [3, 3, 1, 1] [2022-01-10 00:50:58,145 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2022-01-10 00:50:58,200 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 12:50:58 BoogieIcfgContainer [2022-01-10 00:50:58,201 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-10 00:50:58,201 INFO L158 Benchmark]: Toolchain (without parser) took 17798.29ms. Allocated memory was 173.0MB in the beginning and 299.9MB in the end (delta: 126.9MB). Free memory was 117.9MB in the beginning and 107.6MB in the end (delta: 10.3MB). Peak memory consumption was 146.1MB. Max. memory is 8.0GB. [2022-01-10 00:50:58,201 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 173.0MB. Free memory was 134.4MB in the beginning and 134.3MB in the end (delta: 67.9kB). There was no memory consumed. Max. memory is 8.0GB. [2022-01-10 00:50:58,201 INFO L158 Benchmark]: CACSL2BoogieTranslator took 231.25ms. Allocated memory is still 173.0MB. Free memory was 117.7MB in the beginning and 145.9MB in the end (delta: -28.2MB). Peak memory consumption was 6.7MB. Max. memory is 8.0GB. [2022-01-10 00:50:58,202 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.08ms. Allocated memory is still 173.0MB. Free memory was 145.9MB in the beginning and 144.2MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-01-10 00:50:58,202 INFO L158 Benchmark]: Boogie Preprocessor took 28.06ms. Allocated memory is still 173.0MB. Free memory was 144.2MB in the beginning and 142.8MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-01-10 00:50:58,202 INFO L158 Benchmark]: RCFGBuilder took 280.09ms. Allocated memory is still 173.0MB. Free memory was 142.8MB in the beginning and 131.7MB in the end (delta: 11.1MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-01-10 00:50:58,202 INFO L158 Benchmark]: TraceAbstraction took 17219.69ms. Allocated memory was 173.0MB in the beginning and 299.9MB in the end (delta: 126.9MB). Free memory was 131.3MB in the beginning and 107.6MB in the end (delta: 23.7MB). Peak memory consumption was 159.3MB. Max. memory is 8.0GB. [2022-01-10 00:50:58,203 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 173.0MB. Free memory was 134.4MB in the beginning and 134.3MB in the end (delta: 67.9kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 231.25ms. Allocated memory is still 173.0MB. Free memory was 117.7MB in the beginning and 145.9MB in the end (delta: -28.2MB). Peak memory consumption was 6.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 35.08ms. Allocated memory is still 173.0MB. Free memory was 145.9MB in the beginning and 144.2MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 28.06ms. Allocated memory is still 173.0MB. Free memory was 144.2MB in the beginning and 142.8MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 280.09ms. Allocated memory is still 173.0MB. Free memory was 142.8MB in the beginning and 131.7MB in the end (delta: 11.1MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 17219.69ms. Allocated memory was 173.0MB in the beginning and 299.9MB in the end (delta: 126.9MB). Free memory was 131.3MB in the beginning and 107.6MB in the end (delta: 23.7MB). Peak memory consumption was 159.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 50]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 26 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 17.1s, OverallIterations: 8, TraceHistogramMax: 12, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 7.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.3s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 692 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 678 mSDsluCounter, 1691 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1538 mSDsCounter, 479 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4283 IncrementalHoareTripleChecker+Invalid, 4762 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 479 mSolverCounterUnsat, 153 mSDtfsCounter, 4283 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 932 GetRequests, 520 SyntacticMatches, 2 SemanticMatches, 410 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6143 ImplicationChecksByTransitivity, 7.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=51occurred in iteration=4, InterpolantAutomatonStates: 222, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 125 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 14 PreInvPairs, 45 NumberOfFragments, 843 HoareAnnotationTreeSize, 14 FomulaSimplifications, 170 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 8 FomulaSimplificationsInter, 8539 FormulaSimplificationTreeSizeReductionInter, 1.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 6.0s InterpolantComputationTime, 626 NumberOfCodeBlocks, 592 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 903 ConstructedInterpolants, 0 QuantifiedInterpolants, 4606 SizeOfPredicates, 83 NumberOfNonLiveVariables, 1398 ConjunctsInSsa, 250 ConjunctsInUnsatCore, 22 InterpolantComputations, 2 PerfectInterpolantSequences, 1436/1848 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 40]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((!(d1 == d2) && d1 == pd2) && 4 == pd1) && 4 == pd2) && d1 == pd1) && 5 + i == unknown-#memory_int-unknown[pd2][pd2]) && d1 == 0) && pa == 4) && pd2 == pa) && pd1 == 0) || (((((((((((d2 == 0 && d1 == 4) && 5 == pd1) && 5 == d2) && pd1 == pd2) && pd2 == pd1) && unknown-#memory_int-unknown[pd2][pd2] <= 6 + i) && i < unknown-#memory_int-unknown[pa][pa] + 1) && d1 == 0) && pa == pd2) && pd2 == pa) && pd1 == 0)) || ((((((((((!(d1 == d2) && unknown-#memory_int-unknown[pd2][pd2] == 9 + i) && d1 == 4) && pd1 == pd2) && pd2 == pd1) && d1 == 0) && pa == pd2) && 9 + i <= unknown-#memory_int-unknown[pd2][pd2]) && pa == 4) && pd2 == pa) && pd1 == 0)) || ((((((((((d2 == 0 && d1 == 4) && 5 == pd1) && 5 == d2) && pd1 == pd2) && pd2 == pd1) && d1 == 0) && pa == pd2) && unknown-#memory_int-unknown[pd2][pd2] == i + 8) && pd2 == pa) && pd1 == 0)) || (((((((((((7 + i <= unknown-#memory_int-unknown[pd2][pd2] && unknown-#memory_int-unknown[pd2][pd2] == 7 + i) && d2 == 0) && d1 == 4) && 5 == pd1) && 5 == d2) && pd1 == pd2) && pd2 == pd1) && d1 == 0) && pa == pd2) && pd2 == pa) && pd1 == 0)) || (((((((((!(d1 == d2) && d1 == 4) && pd1 == pd2) && pd2 == pd1) && 3 + i == unknown-#memory_int-unknown[pd2][pd2]) && d1 == pd1) && d1 == 0) && pa == 4) && pd2 == pa) && pd1 == 0)) || ((((((((((unknown-#memory_int-unknown[pd2][pd2] == i + 10 && d2 == 0) && d1 == 4) && 5 == pd1) && 5 == d2) && pd1 == pd2) && pd2 == pd1) && d1 == 0) && pa == pd2) && pd2 == pa) && pd1 == 0)) || (((((((((!(d1 == d2) && unknown-#memory_int-unknown[pd2][pd2] == i + 1) && d1 == 4) && pd1 == pd2) && pd2 == pd1) && d1 == pd1) && d1 == 0) && pa == 4) && pd2 == pa) && pd1 == 0)) || ((((((((((!(d1 == d2) && d1 == pd2) && 4 == pd1) && 4 == pd2) && i < unknown-#memory_int-unknown[pa][pa] + 1) && d1 == pd1) && d1 == 0) && pa == 4) && unknown-#memory_int-unknown[4][0] <= i) && pd2 == pa) && pd1 == 0)) || (((((((((!(d1 == d2) && unknown-#memory_int-unknown[pd2][pd2] == i + 10) && d1 == pd2) && 4 == pd1) && 4 == pd2) && d1 == pd1) && d1 == 0) && pa == 4) && pd2 == pa) && pd1 == 0)) || (((((((((((unknown-#memory_int-unknown[pd2][pd2] == 9 + i && d2 == 0) && d1 == 4) && 5 == pd1) && 5 == d2) && pd1 == pd2) && pd2 == pd1) && d1 == 0) && pa == pd2) && 9 + i <= unknown-#memory_int-unknown[pd2][pd2]) && pd2 == pa) && pd1 == 0)) || (((((((((!(d1 == d2) && unknown-#memory_int-unknown[pd2][pd2] == 2 + i) && d1 == pd2) && 4 == pd1) && 4 == pd2) && d1 == pd1) && d1 == 0) && pa == 4) && pd2 == pa) && pd1 == 0)) || ((((((((((!(d1 == d2) && 7 + i <= unknown-#memory_int-unknown[pd2][pd2]) && unknown-#memory_int-unknown[pd2][pd2] == 7 + i) && d1 == 4) && pd1 == pd2) && pd2 == pd1) && d1 == 0) && pa == pd2) && pa == 4) && pd2 == pa) && pd1 == 0)) || (((((((((!(d1 == d2) && d1 == pd2) && 4 == pd1) && 4 == pd2) && d1 == pd1) && d1 == 0) && pa == 4) && unknown-#memory_int-unknown[pd2][pd2] == 6 + i) && pd2 == pa) && pd1 == 0)) || (((((((((!(d1 == d2) && d1 == 4) && pd1 == pd2) && pd2 == pd1) && d1 == 0) && pa == pd2) && pa == 4) && unknown-#memory_int-unknown[pd2][pd2] == i + 8) && pd2 == pa) && pd1 == 0)) || (((((((((!(d1 == d2) && d1 == 4) && pd1 == pd2) && pd2 == pd1) && d1 == pd1) && i + 4 == unknown-#memory_int-unknown[pd2][pd2]) && d1 == 0) && pa == 4) && pd2 == pa) && pd1 == 0) - InvariantResult [Line: 32]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 33]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: (((((!(d1 == d2) && unknown-#memory_int-unknown[pd2][pd2] == i) && d1 == 4) && 1 <= \result) && pd1 == pd2) && pd2 == pd1) && d1 == 0 RESULT: Ultimate proved your program to be correct! [2022-01-10 00:50:58,252 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...