/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/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/bresenham-ll_valuebound1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-b030c9e [2022-03-20 19:41:28,908 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-03-20 19:41:28,917 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-03-20 19:41:28,952 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-03-20 19:41:28,952 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-03-20 19:41:28,953 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-03-20 19:41:28,956 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-03-20 19:41:28,961 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-03-20 19:41:28,963 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-03-20 19:41:28,967 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-03-20 19:41:28,968 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-03-20 19:41:28,969 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-03-20 19:41:28,969 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-03-20 19:41:28,971 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-03-20 19:41:28,972 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-03-20 19:41:28,973 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-03-20 19:41:28,973 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-03-20 19:41:28,974 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-03-20 19:41:28,978 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-03-20 19:41:28,983 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-03-20 19:41:28,984 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-03-20 19:41:28,985 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-03-20 19:41:28,986 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-03-20 19:41:28,986 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-03-20 19:41:28,987 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-03-20 19:41:28,993 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-03-20 19:41:28,993 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-03-20 19:41:28,994 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-03-20 19:41:28,994 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-03-20 19:41:28,994 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-03-20 19:41:28,996 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-03-20 19:41:28,996 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-03-20 19:41:28,997 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-03-20 19:41:28,998 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-03-20 19:41:28,998 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-03-20 19:41:28,999 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-03-20 19:41:28,999 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-03-20 19:41:29,000 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-03-20 19:41:29,000 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-03-20 19:41:29,000 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-03-20 19:41:29,001 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-03-20 19:41:29,002 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-03-20 19:41:29,003 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-03-20 19:41:29,012 INFO L113 SettingsManager]: Loading preferences was successful [2022-03-20 19:41:29,013 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-03-20 19:41:29,014 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-03-20 19:41:29,014 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-03-20 19:41:29,014 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-03-20 19:41:29,014 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-03-20 19:41:29,014 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-03-20 19:41:29,014 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-03-20 19:41:29,014 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-03-20 19:41:29,015 INFO L138 SettingsManager]: * Use constant arrays=true [2022-03-20 19:41:29,015 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-03-20 19:41:29,015 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-03-20 19:41:29,015 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-03-20 19:41:29,015 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-03-20 19:41:29,016 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-03-20 19:41:29,016 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-20 19:41:29,016 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-03-20 19:41:29,016 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-03-20 19:41:29,016 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-03-20 19:41:29,016 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-03-20 19:41:29,016 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-03-20 19:41:29,016 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-03-20 19:41:29,016 INFO L138 SettingsManager]: * Use separate solver for trace checks=false 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-03-20 19:41:29,261 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-03-20 19:41:29,286 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-03-20 19:41:29,288 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-03-20 19:41:29,289 INFO L271 PluginConnector]: Initializing CDTParser... [2022-03-20 19:41:29,289 INFO L275 PluginConnector]: CDTParser initialized [2022-03-20 19:41:29,290 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/bresenham-ll_valuebound1.c [2022-03-20 19:41:29,339 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6b0b72e1/8b29fbe4036f4ff2a6baddb920eb6698/FLAGda9319582 [2022-03-20 19:41:29,663 INFO L306 CDTParser]: Found 1 translation units. [2022-03-20 19:41:29,664 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/bresenham-ll_valuebound1.c [2022-03-20 19:41:29,668 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6b0b72e1/8b29fbe4036f4ff2a6baddb920eb6698/FLAGda9319582 [2022-03-20 19:41:29,678 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6b0b72e1/8b29fbe4036f4ff2a6baddb920eb6698 [2022-03-20 19:41:29,680 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-03-20 19:41:29,681 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-03-20 19:41:29,683 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-03-20 19:41:29,683 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-03-20 19:41:29,685 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-03-20 19:41:29,686 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.03 07:41:29" (1/1) ... [2022-03-20 19:41:29,687 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@783298e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 07:41:29, skipping insertion in model container [2022-03-20 19:41:29,687 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.03 07:41:29" (1/1) ... [2022-03-20 19:41:29,692 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-03-20 19:41:29,703 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-03-20 19:41:29,868 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/bresenham-ll_valuebound1.c[597,610] [2022-03-20 19:41:29,892 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-20 19:41:29,899 INFO L203 MainTranslator]: Completed pre-run [2022-03-20 19:41:29,909 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/bresenham-ll_valuebound1.c[597,610] [2022-03-20 19:41:29,928 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-03-20 19:41:29,938 INFO L208 MainTranslator]: Completed translation [2022-03-20 19:41:29,938 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 07:41:29 WrapperNode [2022-03-20 19:41:29,939 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-03-20 19:41:29,942 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-03-20 19:41:29,942 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-03-20 19:41:29,943 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-03-20 19:41:29,951 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 07:41:29" (1/1) ... [2022-03-20 19:41:29,951 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 07:41:29" (1/1) ... [2022-03-20 19:41:29,956 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 07:41:29" (1/1) ... [2022-03-20 19:41:29,957 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 07:41:29" (1/1) ... [2022-03-20 19:41:29,967 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 07:41:29" (1/1) ... [2022-03-20 19:41:29,971 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 07:41:29" (1/1) ... [2022-03-20 19:41:29,976 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 07:41:29" (1/1) ... [2022-03-20 19:41:29,979 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-03-20 19:41:29,980 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-03-20 19:41:29,980 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-03-20 19:41:29,980 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-03-20 19:41:29,981 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 07:41:29" (1/1) ... [2022-03-20 19:41:29,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-03-20 19:41:29,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 19:41:30,013 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-03-20 19:41:30,025 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-03-20 19:41:30,046 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-03-20 19:41:30,047 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-03-20 19:41:30,047 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-03-20 19:41:30,047 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-03-20 19:41:30,047 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-03-20 19:41:30,047 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-03-20 19:41:30,047 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-03-20 19:41:30,047 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-03-20 19:41:30,048 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-03-20 19:41:30,048 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-03-20 19:41:30,048 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-03-20 19:41:30,048 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-03-20 19:41:30,048 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-03-20 19:41:30,049 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-03-20 19:41:30,049 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-03-20 19:41:30,050 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-03-20 19:41:30,050 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-03-20 19:41:30,050 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-03-20 19:41:30,050 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-03-20 19:41:30,050 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-03-20 19:41:30,105 INFO L234 CfgBuilder]: Building ICFG [2022-03-20 19:41:30,107 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-03-20 19:41:30,256 INFO L275 CfgBuilder]: Performing block encoding [2022-03-20 19:41:30,260 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-03-20 19:41:30,260 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-03-20 19:41:30,262 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.03 07:41:30 BoogieIcfgContainer [2022-03-20 19:41:30,262 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-03-20 19:41:30,263 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-03-20 19:41:30,263 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-03-20 19:41:30,281 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-03-20 19:41:30,281 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.03 07:41:29" (1/3) ... [2022-03-20 19:41:30,282 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5722d35e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.03 07:41:30, skipping insertion in model container [2022-03-20 19:41:30,282 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.03 07:41:29" (2/3) ... [2022-03-20 19:41:30,282 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5722d35e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.03 07:41:30, skipping insertion in model container [2022-03-20 19:41:30,282 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.03 07:41:30" (3/3) ... [2022-03-20 19:41:30,283 INFO L111 eAbstractionObserver]: Analyzing ICFG bresenham-ll_valuebound1.c [2022-03-20 19:41:30,287 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-03-20 19:41:30,287 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-03-20 19:41:30,331 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-03-20 19:41:30,340 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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 [2022-03-20 19:41:30,340 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-03-20 19:41:30,355 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 20 states have (on average 1.35) internal successors, (27), 21 states have internal predecessors, (27), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-03-20 19:41:30,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-03-20 19:41:30,360 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 19:41:30,361 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 19:41:30,361 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 19:41:30,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 19:41:30,365 INFO L85 PathProgramCache]: Analyzing trace with hash -1867489771, now seen corresponding path program 1 times [2022-03-20 19:41:30,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-20 19:41:30,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [195483842] [2022-03-20 19:41:30,381 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-20 19:41:30,381 INFO L85 PathProgramCache]: Analyzing trace with hash -1867489771, now seen corresponding path program 2 times [2022-03-20 19:41:30,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 19:41:30,383 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888428283] [2022-03-20 19:41:30,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 19:41:30,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 19:41:30,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 19:41:30,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-03-20 19:41:30,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 19:41:30,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-03-20 19:41:30,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 19:41:30,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-03-20 19:41:30,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-03-20 19:41:30,547 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-03-20 19:41:30,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 19:41:30,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888428283] [2022-03-20 19:41:30,548 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888428283] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 19:41:30,548 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 19:41:30,549 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-20 19:41:30,550 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-20 19:41:30,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [195483842] [2022-03-20 19:41:30,551 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [195483842] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 19:41:30,551 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 19:41:30,551 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-03-20 19:41:30,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341687828] [2022-03-20 19:41:30,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 19:41:30,555 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-03-20 19:41:30,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-20 19:41:30,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-03-20 19:41:30,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-20 19:41:30,577 INFO L87 Difference]: Start difference. First operand has 32 states, 20 states have (on average 1.35) internal successors, (27), 21 states have internal predecessors, (27), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-03-20 19:41:30,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 19:41:30,652 INFO L93 Difference]: Finished difference Result 57 states and 74 transitions. [2022-03-20 19:41:30,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-03-20 19:41:30,654 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-03-20 19:41:30,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 19:41:30,660 INFO L225 Difference]: With dead ends: 57 [2022-03-20 19:41:30,660 INFO L226 Difference]: Without dead ends: 27 [2022-03-20 19:41:30,662 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-03-20 19:41:30,665 INFO L913 BasicCegarLoop]: 31 mSDtfsCounter, 20 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-03-20 19:41:30,666 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 34 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-03-20 19:41:30,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-03-20 19:41:30,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-03-20 19:41:30,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 18 states have internal predecessors, (20), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-03-20 19:41:30,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2022-03-20 19:41:30,709 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 23 [2022-03-20 19:41:30,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 19:41:30,709 INFO L478 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2022-03-20 19:41:30,710 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-03-20 19:41:30,710 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2022-03-20 19:41:30,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-03-20 19:41:30,711 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 19:41:30,712 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 19:41:30,712 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-03-20 19:41:30,712 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 19:41:30,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 19:41:30,714 INFO L85 PathProgramCache]: Analyzing trace with hash 1827672217, now seen corresponding path program 1 times [2022-03-20 19:41:30,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-20 19:41:30,715 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1258841277] [2022-03-20 19:41:30,719 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-20 19:41:30,720 INFO L85 PathProgramCache]: Analyzing trace with hash 1827672217, now seen corresponding path program 2 times [2022-03-20 19:41:30,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 19:41:30,721 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389415837] [2022-03-20 19:41:30,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 19:41:30,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 19:41:30,739 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-20 19:41:30,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [979378045] [2022-03-20 19:41:30,740 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-20 19:41:30,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 19:41:30,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 19:41:30,748 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-03-20 19:41:30,749 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-03-20 19:41:30,796 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-03-20 19:41:30,796 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-20 19:41:30,798 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 13 conjunts are in the unsatisfiable core [2022-03-20 19:41:30,803 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 19:41:30,938 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-03-20 19:41:30,938 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-03-20 19:41:30,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 19:41:30,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389415837] [2022-03-20 19:41:30,939 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-20 19:41:30,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [979378045] [2022-03-20 19:41:30,939 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [979378045] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 19:41:30,939 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 19:41:30,940 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-20 19:41:30,940 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-20 19:41:30,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1258841277] [2022-03-20 19:41:30,941 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1258841277] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 19:41:30,941 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 19:41:30,941 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-03-20 19:41:30,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659783508] [2022-03-20 19:41:30,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 19:41:30,942 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-03-20 19:41:30,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-20 19:41:30,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-03-20 19:41:30,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-03-20 19:41:30,943 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-03-20 19:41:31,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 19:41:31,037 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2022-03-20 19:41:31,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-03-20 19:41:31,038 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 23 [2022-03-20 19:41:31,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 19:41:31,039 INFO L225 Difference]: With dead ends: 39 [2022-03-20 19:41:31,039 INFO L226 Difference]: Without dead ends: 35 [2022-03-20 19:41:31,040 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-03-20 19:41:31,041 INFO L913 BasicCegarLoop]: 22 mSDtfsCounter, 10 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-20 19:41:31,041 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 101 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-20 19:41:31,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-03-20 19:41:31,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2022-03-20 19:41:31,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-03-20 19:41:31,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2022-03-20 19:41:31,051 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 23 [2022-03-20 19:41:31,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 19:41:31,052 INFO L478 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2022-03-20 19:41:31,053 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-03-20 19:41:31,053 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2022-03-20 19:41:31,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-03-20 19:41:31,054 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 19:41:31,054 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 19:41:31,080 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-03-20 19:41:31,276 WARN L460 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-03-20 19:41:31,277 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 19:41:31,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 19:41:31,278 INFO L85 PathProgramCache]: Analyzing trace with hash -1419291471, now seen corresponding path program 1 times [2022-03-20 19:41:31,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-20 19:41:31,278 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1887456968] [2022-03-20 19:41:31,279 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-20 19:41:31,279 INFO L85 PathProgramCache]: Analyzing trace with hash -1419291471, now seen corresponding path program 2 times [2022-03-20 19:41:31,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 19:41:31,279 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071810120] [2022-03-20 19:41:31,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 19:41:31,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 19:41:31,304 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-20 19:41:31,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [561118949] [2022-03-20 19:41:31,304 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-20 19:41:31,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 19:41:31,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 19:41:31,308 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-03-20 19:41:31,309 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-03-20 19:41:31,363 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-20 19:41:31,363 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-20 19:41:31,364 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 23 conjunts are in the unsatisfiable core [2022-03-20 19:41:31,375 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 19:41:31,860 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-03-20 19:41:31,860 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 19:41:32,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 19:41:32,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071810120] [2022-03-20 19:41:32,017 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-20 19:41:32,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [561118949] [2022-03-20 19:41:32,017 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [561118949] provided 0 perfect and 1 imperfect interpolant sequences [2022-03-20 19:41:32,018 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-03-20 19:41:32,018 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2022-03-20 19:41:32,018 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-20 19:41:32,018 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1887456968] [2022-03-20 19:41:32,018 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1887456968] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 19:41:32,018 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 19:41:32,018 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-03-20 19:41:32,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874273237] [2022-03-20 19:41:32,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 19:41:32,019 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-03-20 19:41:32,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-20 19:41:32,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-03-20 19:41:32,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2022-03-20 19:41:32,020 INFO L87 Difference]: Start difference. First operand 34 states and 37 transitions. Second operand has 11 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-03-20 19:41:32,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 19:41:32,164 INFO L93 Difference]: Finished difference Result 61 states and 70 transitions. [2022-03-20 19:41:32,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-03-20 19:41:32,165 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 32 [2022-03-20 19:41:32,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 19:41:32,166 INFO L225 Difference]: With dead ends: 61 [2022-03-20 19:41:32,166 INFO L226 Difference]: Without dead ends: 35 [2022-03-20 19:41:32,166 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2022-03-20 19:41:32,167 INFO L913 BasicCegarLoop]: 24 mSDtfsCounter, 27 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-20 19:41:32,168 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 141 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-20 19:41:32,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-03-20 19:41:32,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2022-03-20 19:41:32,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 23 states have (on average 1.1304347826086956) internal successors, (26), 24 states have internal predecessors, (26), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-03-20 19:41:32,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2022-03-20 19:41:32,176 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 32 [2022-03-20 19:41:32,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 19:41:32,176 INFO L478 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2022-03-20 19:41:32,176 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-03-20 19:41:32,177 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2022-03-20 19:41:32,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-03-20 19:41:32,177 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 19:41:32,177 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 19:41:32,208 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-03-20 19:41:32,391 WARN L460 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-03-20 19:41:32,392 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 19:41:32,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 19:41:32,392 INFO L85 PathProgramCache]: Analyzing trace with hash 355715891, now seen corresponding path program 1 times [2022-03-20 19:41:32,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-20 19:41:32,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1155991357] [2022-03-20 19:41:32,393 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-20 19:41:32,393 INFO L85 PathProgramCache]: Analyzing trace with hash 355715891, now seen corresponding path program 2 times [2022-03-20 19:41:32,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 19:41:32,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849720683] [2022-03-20 19:41:32,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 19:41:32,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 19:41:32,407 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-20 19:41:32,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1378436394] [2022-03-20 19:41:32,408 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-20 19:41:32,408 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 19:41:32,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 19:41:32,411 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-03-20 19:41:32,412 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-03-20 19:41:32,461 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-20 19:41:32,462 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-20 19:41:32,463 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 33 conjunts are in the unsatisfiable core [2022-03-20 19:41:32,465 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 19:41:32,823 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-03-20 19:41:32,824 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 19:41:33,033 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-03-20 19:41:33,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 19:41:33,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849720683] [2022-03-20 19:41:33,034 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-20 19:41:33,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1378436394] [2022-03-20 19:41:33,034 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1378436394] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-20 19:41:33,034 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-03-20 19:41:33,034 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 17 [2022-03-20 19:41:33,034 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-20 19:41:33,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1155991357] [2022-03-20 19:41:33,035 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1155991357] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 19:41:33,035 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 19:41:33,035 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-03-20 19:41:33,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134708489] [2022-03-20 19:41:33,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 19:41:33,036 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-03-20 19:41:33,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-20 19:41:33,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-03-20 19:41:33,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2022-03-20 19:41:33,037 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand has 12 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 states have internal predecessors, (19), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-03-20 19:41:33,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 19:41:33,193 INFO L93 Difference]: Finished difference Result 59 states and 67 transitions. [2022-03-20 19:41:33,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-03-20 19:41:33,193 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 states have internal predecessors, (19), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 32 [2022-03-20 19:41:33,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 19:41:33,194 INFO L225 Difference]: With dead ends: 59 [2022-03-20 19:41:33,194 INFO L226 Difference]: Without dead ends: 46 [2022-03-20 19:41:33,195 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 46 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=311, Unknown=0, NotChecked=0, Total=380 [2022-03-20 19:41:33,196 INFO L913 BasicCegarLoop]: 22 mSDtfsCounter, 38 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-20 19:41:33,196 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 111 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-20 19:41:33,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-03-20 19:41:33,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 44. [2022-03-20 19:41:33,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 30 states have (on average 1.1333333333333333) internal successors, (34), 31 states have internal predecessors, (34), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-03-20 19:41:33,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2022-03-20 19:41:33,206 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 32 [2022-03-20 19:41:33,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 19:41:33,206 INFO L478 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2022-03-20 19:41:33,206 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 10 states have internal predecessors, (19), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-03-20 19:41:33,206 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2022-03-20 19:41:33,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-03-20 19:41:33,207 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 19:41:33,207 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 19:41:33,229 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-03-20 19:41:33,427 WARN L460 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-03-20 19:41:33,428 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 19:41:33,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 19:41:33,428 INFO L85 PathProgramCache]: Analyzing trace with hash 125050924, now seen corresponding path program 1 times [2022-03-20 19:41:33,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-20 19:41:33,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [902723297] [2022-03-20 19:41:33,429 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-20 19:41:33,429 INFO L85 PathProgramCache]: Analyzing trace with hash 125050924, now seen corresponding path program 2 times [2022-03-20 19:41:33,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 19:41:33,429 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283015474] [2022-03-20 19:41:33,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 19:41:33,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 19:41:33,441 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-20 19:41:33,442 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [463009374] [2022-03-20 19:41:33,442 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-03-20 19:41:33,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 19:41:33,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 19:41:33,451 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-03-20 19:41:33,465 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-03-20 19:41:33,495 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-03-20 19:41:33,495 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-20 19:41:33,496 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 30 conjunts are in the unsatisfiable core [2022-03-20 19:41:33,498 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 19:41:33,692 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-03-20 19:41:33,695 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-03-20 19:41:33,697 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-03-20 19:41:33,943 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-03-20 19:41:33,944 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 19:41:34,412 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-03-20 19:41:34,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 19:41:34,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283015474] [2022-03-20 19:41:34,413 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-20 19:41:34,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [463009374] [2022-03-20 19:41:34,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [463009374] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-20 19:41:34,413 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-03-20 19:41:34,413 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 22 [2022-03-20 19:41:34,413 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-20 19:41:34,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [902723297] [2022-03-20 19:41:34,414 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [902723297] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 19:41:34,414 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 19:41:34,414 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-03-20 19:41:34,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994796076] [2022-03-20 19:41:34,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 19:41:34,414 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-03-20 19:41:34,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-20 19:41:34,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-03-20 19:41:34,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=388, Unknown=0, NotChecked=0, Total=462 [2022-03-20 19:41:34,416 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand has 14 states, 12 states have (on average 1.75) internal successors, (21), 12 states have internal predecessors, (21), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-03-20 19:41:36,822 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-03-20 19:41:36,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 19:41:36,924 INFO L93 Difference]: Finished difference Result 52 states and 55 transitions. [2022-03-20 19:41:36,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-03-20 19:41:36,924 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 1.75) internal successors, (21), 12 states have internal predecessors, (21), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 39 [2022-03-20 19:41:36,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 19:41:36,925 INFO L225 Difference]: With dead ends: 52 [2022-03-20 19:41:36,925 INFO L226 Difference]: Without dead ends: 44 [2022-03-20 19:41:36,925 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=116, Invalid=586, Unknown=0, NotChecked=0, Total=702 [2022-03-20 19:41:36,926 INFO L913 BasicCegarLoop]: 23 mSDtfsCounter, 16 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-03-20 19:41:36,926 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 198 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 171 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-03-20 19:41:36,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-03-20 19:41:36,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2022-03-20 19:41:36,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 30 states have (on average 1.1) internal successors, (33), 31 states have internal predecessors, (33), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-03-20 19:41:36,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 47 transitions. [2022-03-20 19:41:36,935 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 47 transitions. Word has length 39 [2022-03-20 19:41:36,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 19:41:36,935 INFO L478 AbstractCegarLoop]: Abstraction has 44 states and 47 transitions. [2022-03-20 19:41:36,935 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 1.75) internal successors, (21), 12 states have internal predecessors, (21), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-03-20 19:41:36,935 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 47 transitions. [2022-03-20 19:41:36,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-03-20 19:41:36,936 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 19:41:36,936 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 19:41:36,987 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-03-20 19:41:37,166 WARN L460 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-03-20 19:41:37,167 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 19:41:37,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 19:41:37,167 INFO L85 PathProgramCache]: Analyzing trace with hash 1487887833, now seen corresponding path program 3 times [2022-03-20 19:41:37,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-20 19:41:37,167 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1416421348] [2022-03-20 19:41:37,168 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-20 19:41:37,168 INFO L85 PathProgramCache]: Analyzing trace with hash 1487887833, now seen corresponding path program 4 times [2022-03-20 19:41:37,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 19:41:37,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894243453] [2022-03-20 19:41:37,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 19:41:37,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 19:41:37,178 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-20 19:41:37,178 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [174643674] [2022-03-20 19:41:37,178 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-20 19:41:37,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 19:41:37,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 19:41:37,180 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-03-20 19:41:37,181 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-03-20 19:41:37,221 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-20 19:41:37,222 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-20 19:41:37,223 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 41 conjunts are in the unsatisfiable core [2022-03-20 19:41:37,225 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 19:41:37,904 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-03-20 19:41:38,047 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-03-20 19:41:38,047 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 19:41:38,439 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-03-20 19:41:38,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 19:41:38,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894243453] [2022-03-20 19:41:38,439 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-20 19:41:38,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [174643674] [2022-03-20 19:41:38,440 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [174643674] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-20 19:41:38,440 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-03-20 19:41:38,440 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 12] total 25 [2022-03-20 19:41:38,440 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-20 19:41:38,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1416421348] [2022-03-20 19:41:38,440 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1416421348] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 19:41:38,440 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 19:41:38,440 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-03-20 19:41:38,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962608552] [2022-03-20 19:41:38,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 19:41:38,441 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-03-20 19:41:38,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-20 19:41:38,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-03-20 19:41:38,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=510, Unknown=0, NotChecked=0, Total=600 [2022-03-20 19:41:38,442 INFO L87 Difference]: Start difference. First operand 44 states and 47 transitions. Second operand has 18 states, 16 states have (on average 1.8125) internal successors, (29), 15 states have internal predecessors, (29), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-03-20 19:41:38,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 19:41:38,837 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2022-03-20 19:41:38,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-03-20 19:41:38,838 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 1.8125) internal successors, (29), 15 states have internal predecessors, (29), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 41 [2022-03-20 19:41:38,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 19:41:38,839 INFO L225 Difference]: With dead ends: 60 [2022-03-20 19:41:38,839 INFO L226 Difference]: Without dead ends: 45 [2022-03-20 19:41:38,839 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=141, Invalid=789, Unknown=0, NotChecked=0, Total=930 [2022-03-20 19:41:38,840 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 23 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-03-20 19:41:38,840 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 175 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 284 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-03-20 19:41:38,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-03-20 19:41:38,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2022-03-20 19:41:38,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 31 states have (on average 1.0) internal successors, (31), 31 states have internal predecessors, (31), 8 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-03-20 19:41:38,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2022-03-20 19:41:38,855 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 41 [2022-03-20 19:41:38,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 19:41:38,855 INFO L478 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2022-03-20 19:41:38,855 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 1.8125) internal successors, (29), 15 states have internal predecessors, (29), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-03-20 19:41:38,855 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2022-03-20 19:41:38,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-03-20 19:41:38,859 INFO L491 BasicCegarLoop]: Found error trace [2022-03-20 19:41:38,859 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-03-20 19:41:38,884 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-03-20 19:41:39,073 WARN L460 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-03-20 19:41:39,074 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-03-20 19:41:39,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-03-20 19:41:39,074 INFO L85 PathProgramCache]: Analyzing trace with hash -1154259258, now seen corresponding path program 3 times [2022-03-20 19:41:39,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-03-20 19:41:39,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1262350964] [2022-03-20 19:41:39,075 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-03-20 19:41:39,075 INFO L85 PathProgramCache]: Analyzing trace with hash -1154259258, now seen corresponding path program 4 times [2022-03-20 19:41:39,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-03-20 19:41:39,075 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360184067] [2022-03-20 19:41:39,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-03-20 19:41:39,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-03-20 19:41:39,084 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-03-20 19:41:39,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1169826757] [2022-03-20 19:41:39,084 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-03-20 19:41:39,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-03-20 19:41:39,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-03-20 19:41:39,086 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-03-20 19:41:39,086 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-03-20 19:41:39,129 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-03-20 19:41:39,130 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-03-20 19:41:39,131 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 33 conjunts are in the unsatisfiable core [2022-03-20 19:41:39,133 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-03-20 19:41:39,635 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 9 proven. 11 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-03-20 19:41:39,635 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-03-20 19:41:40,010 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-03-20 19:41:40,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-03-20 19:41:40,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360184067] [2022-03-20 19:41:40,012 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-03-20 19:41:40,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1169826757] [2022-03-20 19:41:40,012 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1169826757] provided 0 perfect and 2 imperfect interpolant sequences [2022-03-20 19:41:40,012 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-03-20 19:41:40,013 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12] total 23 [2022-03-20 19:41:40,013 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-03-20 19:41:40,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1262350964] [2022-03-20 19:41:40,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1262350964] provided 1 perfect and 0 imperfect interpolant sequences [2022-03-20 19:41:40,013 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-03-20 19:41:40,013 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-03-20 19:41:40,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988273601] [2022-03-20 19:41:40,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-03-20 19:41:40,014 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-03-20 19:41:40,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-03-20 19:41:40,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-03-20 19:41:40,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=426, Unknown=0, NotChecked=0, Total=506 [2022-03-20 19:41:40,016 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand has 15 states, 14 states have (on average 2.0) internal successors, (28), 13 states have internal predecessors, (28), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2022-03-20 19:41:40,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-03-20 19:41:40,210 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2022-03-20 19:41:40,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-03-20 19:41:40,211 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.0) internal successors, (28), 13 states have internal predecessors, (28), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) Word has length 48 [2022-03-20 19:41:40,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-03-20 19:41:40,211 INFO L225 Difference]: With dead ends: 45 [2022-03-20 19:41:40,211 INFO L226 Difference]: Without dead ends: 0 [2022-03-20 19:41:40,212 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 73 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=100, Invalid=550, Unknown=0, NotChecked=0, Total=650 [2022-03-20 19:41:40,213 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 12 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-03-20 19:41:40,213 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 186 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-03-20 19:41:40,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-03-20 19:41:40,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-03-20 19:41:40,214 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-03-20 19:41:40,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-03-20 19:41:40,214 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 48 [2022-03-20 19:41:40,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-03-20 19:41:40,214 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-03-20 19:41:40,214 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.0) internal successors, (28), 13 states have internal predecessors, (28), 5 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2022-03-20 19:41:40,214 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-03-20 19:41:40,214 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-03-20 19:41:40,216 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-03-20 19:41:40,247 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-03-20 19:41:40,431 WARN L460 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-03-20 19:41:40,433 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-03-20 19:41:41,847 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 7) no Hoare annotation was computed. [2022-03-20 19:41:41,847 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 7) no Hoare annotation was computed. [2022-03-20 19:41:41,847 INFO L882 garLoopResultBuilder]: For program point reach_errorFINAL(line 7) no Hoare annotation was computed. [2022-03-20 19:41:41,848 INFO L885 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 10 12) the Hoare annotation is: true [2022-03-20 19:41:41,848 INFO L878 garLoopResultBuilder]: At program point L11(line 11) the Hoare annotation is: (= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|) [2022-03-20 19:41:41,848 INFO L878 garLoopResultBuilder]: At program point L11-2(lines 10 12) the Hoare annotation is: (and (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)) [2022-03-20 19:41:41,848 INFO L878 garLoopResultBuilder]: At program point assume_abort_if_notEXIT(lines 10 12) the Hoare annotation is: (and (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)) [2022-03-20 19:41:41,848 INFO L878 garLoopResultBuilder]: At program point L27(line 27) the Hoare annotation is: (and (<= 0 main_~X~0) (<= main_~X~0 1)) [2022-03-20 19:41:41,848 INFO L878 garLoopResultBuilder]: At program point L27-1(line 27) the Hoare annotation is: (and (<= main_~Y~0 1) (<= 0 main_~Y~0) (<= 0 main_~X~0) (<= main_~X~0 1)) [2022-03-20 19:41:41,848 INFO L885 garLoopResultBuilder]: At program point L25(line 25) the Hoare annotation is: true [2022-03-20 19:41:41,848 INFO L885 garLoopResultBuilder]: At program point mainEXIT(lines 21 53) the Hoare annotation is: true [2022-03-20 19:41:41,848 INFO L878 garLoopResultBuilder]: At program point L25-1(line 25) the Hoare annotation is: (and (<= 0 main_~X~0) (<= main_~X~0 1)) [2022-03-20 19:41:41,849 INFO L878 garLoopResultBuilder]: At program point L50(line 50) the Hoare annotation is: (let ((.cse2 (<= main_~Y~0 1)) (.cse4 (<= 0 main_~X~0)) (.cse1 (* main_~X~0 main_~y~0)) (.cse13 (= main_~xy~0 0)) (.cse12 (+ main_~X~0 main_~v~0)) (.cse0 (* main_~Y~0 2)) (.cse3 (<= 0 main_~Y~0)) (.cse5 (<= main_~X~0 1)) (.cse14 (= main_~y~0 0)) (.cse11 (= main_~yx~0 0))) (or (and (= (* main_~y~0 2) main_~xy~0) (= .cse0 main_~yx~0) (= (+ .cse0 (* 2 (* main_~Y~0 main_~x~0))) (+ (* .cse1 2) main_~X~0 main_~v~0)) .cse2 .cse3 .cse4 .cse5 (<= .cse0 (+ main_~v~0 (* main_~X~0 2))) (= main_~x~0 2) (<= main_~x~0 (+ main_~X~0 1)) (= (+ main_~v~0 (* 5 main_~X~0)) (* main_~Y~0 6))) (and (= main_~y~0 1) (<= main_~x~0 1) .cse2 .cse3 .cse4 .cse5 (let ((.cse7 (= (mod (+ (* main_~X~0 main_~y~0 2) main_~X~0 main_~v~0) 2) 0)) (.cse9 (div .cse12 2)) (.cse8 (= main_~Y~0 0))) (or (let ((.cse6 (div (+ .cse1 .cse9 (* (- 1) main_~Y~0)) main_~Y~0))) (and (= (* main_~y~0 .cse6) main_~xy~0) .cse7 (<= .cse6 1) (not (<= .cse6 main_~X~0)) (not .cse8) (= main_~yx~0 (* main_~Y~0 .cse6)))) (let ((.cse10 (div main_~xy~0 main_~y~0))) (and .cse7 (= (+ .cse1 .cse9) main_~Y~0) (< main_~X~0 .cse10) .cse11 (<= .cse10 1) .cse8)))) (not (<= main_~x~0 main_~X~0))) (and (= main_~x~0 0) .cse13 (= .cse12 .cse0) .cse14 .cse11) (and .cse13 (<= (* main_~Y~0 4) .cse12) (< main_~v~0 .cse0) .cse3 .cse5 .cse14 .cse11))) [2022-03-20 19:41:41,849 INFO L885 garLoopResultBuilder]: At program point L50-1(line 50) the Hoare annotation is: true [2022-03-20 19:41:41,849 INFO L885 garLoopResultBuilder]: At program point mainFINAL(lines 21 53) the Hoare annotation is: true [2022-03-20 19:41:41,849 INFO L878 garLoopResultBuilder]: At program point L40(lines 40 45) the Hoare annotation is: (let ((.cse3 (<= main_~Y~0 1)) (.cse6 (+ main_~X~0 main_~v~0)) (.cse0 (* main_~Y~0 2)) (.cse5 (<= 0 main_~Y~0)) (.cse4 (<= main_~X~0 1)) (.cse7 (= main_~y~0 0))) (or (let ((.cse2 (* main_~X~0 main_~y~0)) (.cse1 (* main_~Y~0 main_~x~0))) (and (<= main_~x~0 main_~X~0) (<= main_~X~0 .cse0) (= (+ .cse0 (* 2 .cse1)) (+ (* .cse2 2) main_~X~0 main_~v~0)) (= main_~x~0 1) .cse3 (= main_~X~0 main_~xy~0) .cse4 (= .cse2 main_~xy~0) (= main_~yx~0 .cse1))) (and (= main_~x~0 0) .cse3 .cse5 (<= 0 main_~X~0) .cse4 (= .cse6 .cse0) .cse7) (and (= main_~xy~0 0) (<= (* main_~Y~0 4) .cse6) (< main_~v~0 .cse0) .cse5 .cse4 .cse7 (= main_~yx~0 0)))) [2022-03-20 19:41:41,849 INFO L878 garLoopResultBuilder]: At program point L40-2(lines 40 45) the Hoare annotation is: (let ((.cse2 (* main_~Y~0 4)) (.cse1 (* main_~Y~0 2)) (.cse0 (<= main_~Y~0 1)) (.cse3 (<= main_~X~0 1))) (or (and (<= main_~x~0 main_~X~0) (= main_~x~0 1) .cse0 (<= .cse1 (+ main_~v~0 (* main_~X~0 2))) (= (+ .cse2 (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) (= (+ main_~v~0 (* 5 main_~X~0)) (* main_~Y~0 6))) (and (<= .cse2 (+ main_~X~0 main_~v~0)) (< main_~v~0 .cse1) (<= 0 main_~Y~0) .cse3 (= main_~y~0 0)) (and (= (+ main_~v~0 (* main_~X~0 3)) .cse2) (= main_~x~0 0) (= main_~y~0 1) (<= main_~X~0 .cse1) .cse0 (<= 0 main_~X~0) .cse3))) [2022-03-20 19:41:41,849 INFO L878 garLoopResultBuilder]: At program point L32-2(lines 32 47) the Hoare annotation is: (let ((.cse0 (* main_~Y~0 4)) (.cse2 (<= main_~Y~0 1)) (.cse6 (<= 0 main_~Y~0)) (.cse3 (<= 0 main_~X~0)) (.cse4 (<= main_~X~0 1)) (.cse5 (+ main_~X~0 main_~v~0)) (.cse1 (* main_~Y~0 2)) (.cse7 (= main_~y~0 0))) (or (and (= (+ main_~v~0 (* main_~X~0 3)) .cse0) (= main_~y~0 1) (<= main_~X~0 .cse1) (= main_~x~0 1) .cse2 .cse3 .cse4) (and (= (+ .cse1 (* 2 (* main_~Y~0 main_~x~0))) (+ (* (* main_~X~0 main_~y~0) 2) main_~X~0 main_~v~0)) .cse2 (<= .cse1 (+ main_~v~0 (* main_~X~0 2))) (= main_~x~0 2) (<= main_~x~0 (+ main_~X~0 1)) (= (+ main_~v~0 (* 5 main_~X~0)) (* main_~Y~0 6))) (and (<= .cse0 .cse5) (< main_~v~0 .cse1) .cse6 .cse4 .cse7) (and (= main_~x~0 0) .cse2 .cse6 .cse3 .cse4 (= .cse5 .cse1) .cse7))) [2022-03-20 19:41:41,849 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 21 53) the Hoare annotation is: true [2022-03-20 19:41:41,850 INFO L878 garLoopResultBuilder]: At program point L32-3(lines 32 47) the Hoare annotation is: (let ((.cse1 (* main_~Y~0 2)) (.cse6 (* main_~Y~0 main_~x~0)) (.cse5 (* main_~X~0 main_~y~0))) (let ((.cse2 (= (+ .cse1 (* 2 .cse6)) (+ (* .cse5 2) main_~X~0 main_~v~0))) (.cse3 (<= main_~Y~0 1)) (.cse7 (= main_~xy~0 0)) (.cse8 (+ main_~X~0 main_~v~0)) (.cse4 (<= 0 main_~Y~0)) (.cse9 (= main_~y~0 0)) (.cse10 (= main_~yx~0 0))) (or (let ((.cse0 (* main_~Y~0 6))) (and (= (+ main_~X~0 main_~v~0 (* (* (div main_~xy~0 main_~X~0) main_~X~0) 2)) .cse0) (= .cse1 main_~yx~0) .cse2 .cse3 (<= .cse1 (+ main_~v~0 (* main_~X~0 2))) (= main_~x~0 2) (<= main_~x~0 (+ main_~X~0 1)) (= (+ main_~v~0 (* 5 main_~X~0)) .cse0))) (and (= main_~y~0 1) (<= main_~x~0 1) .cse2 .cse3 .cse4 (<= 0 main_~X~0) (= .cse5 main_~xy~0) (not (<= main_~x~0 main_~X~0)) (= main_~yx~0 .cse6)) (and (= main_~x~0 0) .cse7 (= .cse8 .cse1) .cse9 .cse10) (and .cse7 (<= (* main_~Y~0 4) .cse8) (< main_~v~0 .cse1) .cse4 (<= main_~X~0 1) .cse9 .cse10)))) [2022-03-20 19:41:41,850 INFO L878 garLoopResultBuilder]: At program point L35(line 35) the Hoare annotation is: (let ((.cse4 (<= main_~Y~0 1)) (.cse7 (<= 0 main_~X~0)) (.cse3 (* main_~X~0 main_~y~0)) (.cse2 (* main_~Y~0 main_~x~0)) (.cse5 (= main_~xy~0 0)) (.cse12 (* main_~Y~0 4)) (.cse9 (+ main_~X~0 main_~v~0)) (.cse1 (* main_~Y~0 2)) (.cse6 (<= 0 main_~Y~0)) (.cse8 (<= main_~X~0 1)) (.cse10 (= main_~y~0 0)) (.cse11 (= main_~yx~0 0))) (or (let ((.cse0 (* main_~Y~0 6))) (and (= (+ main_~X~0 main_~v~0 (* (* (div main_~xy~0 main_~X~0) main_~X~0) 2)) .cse0) (= .cse1 main_~yx~0) (= (+ .cse1 (* 2 .cse2)) (+ (* .cse3 2) main_~X~0 main_~v~0)) .cse4 (<= .cse1 (+ main_~v~0 (* main_~X~0 2))) (= main_~x~0 2) (<= main_~x~0 (+ main_~X~0 1)) (= (+ main_~v~0 (* 5 main_~X~0)) .cse0))) (and (= main_~x~0 0) .cse5 .cse4 .cse6 .cse7 .cse8 (= .cse9 .cse1) .cse10 .cse11) (and (= (+ main_~v~0 (* main_~X~0 3)) .cse12) (= main_~y~0 1) (<= main_~X~0 .cse1) (= main_~x~0 1) .cse4 .cse7 .cse8 (= .cse3 main_~xy~0) (= main_~yx~0 .cse2)) (and .cse5 (<= .cse12 .cse9) (< main_~v~0 .cse1) .cse6 .cse8 .cse10 .cse11))) [2022-03-20 19:41:41,850 INFO L878 garLoopResultBuilder]: At program point L35-1(lines 32 47) the Hoare annotation is: (let ((.cse0 (* main_~Y~0 2)) (.cse6 (* main_~Y~0 main_~x~0)) (.cse5 (* main_~X~0 main_~y~0))) (let ((.cse1 (= (+ .cse0 (* 2 .cse6)) (+ (* .cse5 2) main_~X~0 main_~v~0))) (.cse2 (<= main_~Y~0 1)) (.cse3 (<= 0 main_~X~0)) (.cse8 (= main_~xy~0 0)) (.cse10 (+ main_~X~0 main_~v~0)) (.cse9 (<= 0 main_~Y~0)) (.cse4 (<= main_~X~0 1)) (.cse11 (= main_~y~0 0)) (.cse12 (= main_~yx~0 0))) (or (and (= main_~y~0 1) (<= main_~X~0 .cse0) .cse1 (= main_~x~0 1) .cse2 .cse3 .cse4 (= .cse5 main_~xy~0) (= main_~yx~0 .cse6)) (let ((.cse7 (* main_~Y~0 6))) (and (= (+ main_~X~0 main_~v~0 (* (* (div main_~xy~0 main_~X~0) main_~X~0) 2)) .cse7) (= .cse0 main_~yx~0) .cse1 .cse2 (<= .cse0 (+ main_~v~0 (* main_~X~0 2))) (= main_~x~0 2) (<= main_~x~0 (+ main_~X~0 1)) (= (+ main_~v~0 (* 5 main_~X~0)) .cse7))) (and (= main_~x~0 0) .cse8 .cse2 .cse9 .cse3 .cse4 (= .cse10 .cse0) .cse11 .cse12) (and .cse8 (<= (* main_~Y~0 4) .cse10) (< main_~v~0 .cse0) .cse9 .cse4 .cse11 .cse12)))) [2022-03-20 19:41:41,850 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-03-20 19:41:41,850 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-03-20 19:41:41,850 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-03-20 19:41:41,850 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-03-20 19:41:41,850 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-03-20 19:41:41,851 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-03-20 19:41:41,851 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-03-20 19:41:41,851 INFO L878 garLoopResultBuilder]: At program point L15(lines 15 16) the Hoare annotation is: (not (<= 1 |__VERIFIER_assert_#in~cond|)) [2022-03-20 19:41:41,851 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 13 19) the Hoare annotation is: true [2022-03-20 19:41:41,851 INFO L878 garLoopResultBuilder]: At program point L14(lines 14 17) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (not (<= 1 |__VERIFIER_assert_#in~cond|))) [2022-03-20 19:41:41,851 INFO L878 garLoopResultBuilder]: At program point L14-2(lines 13 19) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (not (<= 1 |__VERIFIER_assert_#in~cond|))) [2022-03-20 19:41:41,851 INFO L878 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 13 19) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (not (<= 1 |__VERIFIER_assert_#in~cond|))) [2022-03-20 19:41:41,851 INFO L878 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 16) the Hoare annotation is: (not (<= 1 |__VERIFIER_assert_#in~cond|)) [2022-03-20 19:41:41,854 INFO L719 BasicCegarLoop]: Path program histogram: [4, 4, 2, 2, 2] [2022-03-20 19:41:41,855 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-03-20 19:41:41,877 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.03 07:41:41 BoogieIcfgContainer [2022-03-20 19:41:41,878 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-03-20 19:41:41,878 INFO L158 Benchmark]: Toolchain (without parser) took 12196.87ms. Allocated memory was 183.5MB in the beginning and 243.3MB in the end (delta: 59.8MB). Free memory was 133.9MB in the beginning and 187.8MB in the end (delta: -54.0MB). Peak memory consumption was 114.2MB. Max. memory is 8.0GB. [2022-03-20 19:41:41,878 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 183.5MB. Free memory was 150.1MB in the beginning and 150.0MB in the end (delta: 73.3kB). There was no memory consumed. Max. memory is 8.0GB. [2022-03-20 19:41:41,878 INFO L158 Benchmark]: CACSL2BoogieTranslator took 257.86ms. Allocated memory is still 183.5MB. Free memory was 133.7MB in the beginning and 159.3MB in the end (delta: -25.6MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-03-20 19:41:41,879 INFO L158 Benchmark]: Boogie Preprocessor took 36.94ms. Allocated memory is still 183.5MB. Free memory was 159.3MB in the beginning and 157.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-03-20 19:41:41,879 INFO L158 Benchmark]: RCFGBuilder took 281.90ms. Allocated memory is still 183.5MB. Free memory was 157.7MB in the beginning and 147.2MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-03-20 19:41:41,879 INFO L158 Benchmark]: TraceAbstraction took 11614.62ms. Allocated memory was 183.5MB in the beginning and 243.3MB in the end (delta: 59.8MB). Free memory was 146.7MB in the beginning and 187.8MB in the end (delta: -41.1MB). Peak memory consumption was 127.2MB. Max. memory is 8.0GB. [2022-03-20 19:41:41,880 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.13ms. Allocated memory is still 183.5MB. Free memory was 150.1MB in the beginning and 150.0MB in the end (delta: 73.3kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 257.86ms. Allocated memory is still 183.5MB. Free memory was 133.7MB in the beginning and 159.3MB in the end (delta: -25.6MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 36.94ms. Allocated memory is still 183.5MB. Free memory was 159.3MB in the beginning and 157.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 281.90ms. Allocated memory is still 183.5MB. Free memory was 157.7MB in the beginning and 147.2MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 11614.62ms. Allocated memory was 183.5MB in the beginning and 243.3MB in the end (delta: 59.8MB). Free memory was 146.7MB in the beginning and 187.8MB in the end (delta: -41.1MB). Peak memory consumption was 127.2MB. 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: 16]: 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 6 procedures, 35 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 11.5s, OverallIterations: 7, TraceHistogramMax: 4, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 3.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.4s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 1 mSolverCounterUnknown, 156 SdHoareTripleChecker+Valid, 2.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 146 mSDsluCounter, 946 SdHoareTripleChecker+Invalid, 2.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 784 mSDsCounter, 64 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 993 IncrementalHoareTripleChecker+Invalid, 1058 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 64 mSolverCounterUnsat, 162 mSDtfsCounter, 993 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 410 GetRequests, 286 SyntacticMatches, 6 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 554 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=45occurred in iteration=6, InterpolantAutomatonStates: 79, 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, 7 MinimizatonAttempts, 3 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 32 LocationsWithAnnotation, 130 PreInvPairs, 202 NumberOfFragments, 1201 HoareAnnotationTreeSize, 130 FomulaSimplifications, 246 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 32 FomulaSimplificationsInter, 508 FormulaSimplificationTreeSizeReductionInter, 1.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, 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: 32]: Loop Invariant Derived loop invariant: ((((((((v + X * 3 == Y * 4 && y == 1) && X <= Y * 2) && x == 1) && Y <= 1) && 0 <= X) && X <= 1) || (((((Y * 2 + 2 * (Y * x) == X * y * 2 + X + v && Y <= 1) && Y * 2 <= v + X * 2) && x == 2) && x <= X + 1) && v + 5 * X == Y * 6)) || ((((Y * 4 <= X + v && v < Y * 2) && 0 <= Y) && X <= 1) && y == 0)) || ((((((x == 0 && Y <= 1) && 0 <= Y) && 0 <= X) && X <= 1) && X + v == Y * 2) && y == 0) - ProcedureContractResult [Line: 10]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not: !(\old(cond) == 0) && cond == \old(cond) - ProcedureContractResult [Line: 21]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 13]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: \old(cond) == cond || !(1 <= \old(cond)) RESULT: Ultimate proved your program to be correct! [2022-03-20 19:41:41,896 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...