/usr/bin/java -ea -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/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/geo3-ll_unwindbound10.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 09:10:14,626 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 09:10:14,627 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 09:10:14,664 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 09:10:14,665 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 09:10:14,665 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 09:10:14,666 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 09:10:14,667 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 09:10:14,668 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 09:10:14,669 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 09:10:14,669 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 09:10:14,670 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 09:10:14,670 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 09:10:14,671 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 09:10:14,671 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 09:10:14,672 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 09:10:14,672 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 09:10:14,673 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 09:10:14,676 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 09:10:14,677 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 09:10:14,678 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 09:10:14,681 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 09:10:14,682 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 09:10:14,682 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 09:10:14,683 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 09:10:14,684 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 09:10:14,684 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 09:10:14,685 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 09:10:14,685 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 09:10:14,685 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 09:10:14,686 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 09:10:14,686 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 09:10:14,686 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 09:10:14,687 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 09:10:14,687 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 09:10:14,688 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 09:10:14,688 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 09:10:14,688 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 09:10:14,689 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 09:10:14,689 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 09:10:14,689 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 09:10:14,690 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 09:10:14,690 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-15 09:10:14,696 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 09:10:14,696 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 09:10:14,697 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 09:10:14,697 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-15 09:10:14,698 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 09:10:14,698 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-15 09:10:14,698 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 09:10:14,698 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 09:10:14,698 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 09:10:14,698 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 09:10:14,698 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-15 09:10:14,699 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 09:10:14,699 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 09:10:14,699 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 09:10:14,699 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 09:10:14,699 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 09:10:14,699 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 09:10:14,700 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 09:10:14,700 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 09:10:14,700 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 09:10:14,700 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 09:10:14,700 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 09:10:14,700 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 09:10:14,700 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 09:10:14,701 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-15 09:10:14,701 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-04-15 09:10:14,886 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 09:10:14,914 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 09:10:14,916 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 09:10:14,917 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 09:10:14,917 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 09:10:14,918 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/geo3-ll_unwindbound10.c [2022-04-15 09:10:14,985 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1324da4b2/1c5a90632da1409aae0b7ea0b13e9545/FLAG0642ca94e [2022-04-15 09:10:15,264 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 09:10:15,265 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/geo3-ll_unwindbound10.c [2022-04-15 09:10:15,269 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1324da4b2/1c5a90632da1409aae0b7ea0b13e9545/FLAG0642ca94e [2022-04-15 09:10:15,711 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1324da4b2/1c5a90632da1409aae0b7ea0b13e9545 [2022-04-15 09:10:15,713 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 09:10:15,714 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 09:10:15,716 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 09:10:15,716 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 09:10:15,719 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 09:10:15,719 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 09:10:15" (1/1) ... [2022-04-15 09:10:15,722 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49fb3ba8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 09:10:15, skipping insertion in model container [2022-04-15 09:10:15,722 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 09:10:15" (1/1) ... [2022-04-15 09:10:15,727 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 09:10:15,736 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 09:10:15,869 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/geo3-ll_unwindbound10.c[525,538] [2022-04-15 09:10:15,893 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 09:10:15,899 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 09:10:15,912 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/geo3-ll_unwindbound10.c[525,538] [2022-04-15 09:10:15,928 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 09:10:15,936 INFO L208 MainTranslator]: Completed translation [2022-04-15 09:10:15,936 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 09:10:15 WrapperNode [2022-04-15 09:10:15,936 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 09:10:15,937 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 09:10:15,937 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 09:10:15,937 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 09:10:15,944 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 09:10:15" (1/1) ... [2022-04-15 09:10:15,944 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 09:10:15" (1/1) ... [2022-04-15 09:10:15,949 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 09:10:15" (1/1) ... [2022-04-15 09:10:15,950 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 09:10:15" (1/1) ... [2022-04-15 09:10:15,959 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 09:10:15" (1/1) ... [2022-04-15 09:10:15,963 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 09:10:15" (1/1) ... [2022-04-15 09:10:15,966 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 09:10:15" (1/1) ... [2022-04-15 09:10:15,968 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 09:10:15,969 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 09:10:15,969 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 09:10:15,969 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 09:10:15,970 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 09:10:15" (1/1) ... [2022-04-15 09:10:15,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 09:10:15,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 09:10:15,995 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-04-15 09:10:16,009 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-04-15 09:10:16,029 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 09:10:16,030 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 09:10:16,030 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 09:10:16,030 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-15 09:10:16,031 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 09:10:16,031 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 09:10:16,031 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 09:10:16,031 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 09:10:16,031 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 09:10:16,031 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 09:10:16,031 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-15 09:10:16,032 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-15 09:10:16,032 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 09:10:16,032 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 09:10:16,032 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 09:10:16,032 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 09:10:16,032 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 09:10:16,033 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 09:10:16,033 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 09:10:16,033 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 09:10:16,072 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 09:10:16,074 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 09:10:16,192 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 09:10:16,197 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 09:10:16,197 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-15 09:10:16,198 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 09:10:16 BoogieIcfgContainer [2022-04-15 09:10:16,198 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 09:10:16,204 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 09:10:16,204 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 09:10:16,206 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 09:10:16,206 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 09:10:15" (1/3) ... [2022-04-15 09:10:16,207 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@392735b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 09:10:16, skipping insertion in model container [2022-04-15 09:10:16,207 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 09:10:15" (2/3) ... [2022-04-15 09:10:16,207 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@392735b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 09:10:16, skipping insertion in model container [2022-04-15 09:10:16,207 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 09:10:16" (3/3) ... [2022-04-15 09:10:16,208 INFO L111 eAbstractionObserver]: Analyzing ICFG geo3-ll_unwindbound10.c [2022-04-15 09:10:16,211 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 09:10:16,211 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 09:10:16,252 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 09:10:16,258 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-04-15 09:10:16,258 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 09:10:16,278 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 09:10:16,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-15 09:10:16,282 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 09:10:16,283 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 09:10:16,283 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 09:10:16,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 09:10:16,286 INFO L85 PathProgramCache]: Analyzing trace with hash 1665267581, now seen corresponding path program 1 times [2022-04-15 09:10:16,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 09:10:16,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1672285354] [2022-04-15 09:10:16,299 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 09:10:16,299 INFO L85 PathProgramCache]: Analyzing trace with hash 1665267581, now seen corresponding path program 2 times [2022-04-15 09:10:16,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 09:10:16,302 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446137967] [2022-04-15 09:10:16,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 09:10:16,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 09:10:16,384 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 09:10:16,385 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1464247965] [2022-04-15 09:10:16,385 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 09:10:16,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 09:10:16,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 09:10:16,386 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-04-15 09:10:16,387 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-04-15 09:10:16,446 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-15 09:10:16,447 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 09:10:16,448 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 1 conjunts are in the unsatisfiable core [2022-04-15 09:10:16,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 09:10:16,455 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 09:10:16,499 INFO L272 TraceCheckUtils]: 0: Hoare triple {25#true} call ULTIMATE.init(); {25#true} is VALID [2022-04-15 09:10:16,500 INFO L290 TraceCheckUtils]: 1: Hoare triple {25#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {25#true} is VALID [2022-04-15 09:10:16,500 INFO L290 TraceCheckUtils]: 2: Hoare triple {25#true} assume true; {25#true} is VALID [2022-04-15 09:10:16,500 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25#true} {25#true} #54#return; {25#true} is VALID [2022-04-15 09:10:16,500 INFO L272 TraceCheckUtils]: 4: Hoare triple {25#true} call #t~ret8 := main(); {25#true} is VALID [2022-04-15 09:10:16,500 INFO L290 TraceCheckUtils]: 5: Hoare triple {25#true} havoc ~z~0;havoc ~a~0;havoc ~k~0;havoc ~x~0;havoc ~y~0;havoc ~c~0;havoc ~az~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~z~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~a~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~k~0 := #t~nondet6;havoc #t~nondet6;~x~0 := ~a~0;~y~0 := 1;~c~0 := 1;~az~0 := ~a~0 * ~z~0; {25#true} is VALID [2022-04-15 09:10:16,501 INFO L290 TraceCheckUtils]: 6: Hoare triple {25#true} assume !true; {26#false} is VALID [2022-04-15 09:10:16,501 INFO L272 TraceCheckUtils]: 7: Hoare triple {26#false} call __VERIFIER_assert((if 0 == ~z~0 * ~x~0 - ~x~0 + ~a~0 - ~az~0 * ~y~0 then 1 else 0)); {26#false} is VALID [2022-04-15 09:10:16,501 INFO L290 TraceCheckUtils]: 8: Hoare triple {26#false} ~cond := #in~cond; {26#false} is VALID [2022-04-15 09:10:16,501 INFO L290 TraceCheckUtils]: 9: Hoare triple {26#false} assume 0 == ~cond; {26#false} is VALID [2022-04-15 09:10:16,502 INFO L290 TraceCheckUtils]: 10: Hoare triple {26#false} assume !false; {26#false} is VALID [2022-04-15 09:10:16,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 09:10:16,502 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 09:10:16,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 09:10:16,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446137967] [2022-04-15 09:10:16,503 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 09:10:16,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1464247965] [2022-04-15 09:10:16,503 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1464247965] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 09:10:16,503 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 09:10:16,504 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-15 09:10:16,505 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 09:10:16,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1672285354] [2022-04-15 09:10:16,506 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1672285354] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 09:10:16,506 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 09:10:16,506 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-15 09:10:16,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73489360] [2022-04-15 09:10:16,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 09:10:16,509 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-15 09:10:16,510 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 09:10:16,512 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 09:10:16,522 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 09:10:16,522 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-04-15 09:10:16,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 09:10:16,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-04-15 09:10:16,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-04-15 09:10:16,536 INFO L87 Difference]: Start difference. First operand has 22 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 09:10:16,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:10:16,564 INFO L93 Difference]: Finished difference Result 38 states and 48 transitions. [2022-04-15 09:10:16,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-15 09:10:16,565 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-15 09:10:16,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 09:10:16,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 09:10:16,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 48 transitions. [2022-04-15 09:10:16,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 09:10:16,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 48 transitions. [2022-04-15 09:10:16,573 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 2 states and 48 transitions. [2022-04-15 09:10:16,615 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 09:10:16,620 INFO L225 Difference]: With dead ends: 38 [2022-04-15 09:10:16,620 INFO L226 Difference]: Without dead ends: 17 [2022-04-15 09:10:16,621 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-04-15 09:10:16,627 INFO L913 BasicCegarLoop]: 24 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 09:10:16,628 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 09:10:16,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-15 09:10:16,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-04-15 09:10:16,648 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 09:10:16,648 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 17 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 09:10:16,649 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 17 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 09:10:16,649 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 17 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 09:10:16,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:10:16,651 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-04-15 09:10:16,651 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-15 09:10:16,652 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:10:16,652 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:10:16,652 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 17 states. [2022-04-15 09:10:16,652 INFO L87 Difference]: Start difference. First operand has 17 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 17 states. [2022-04-15 09:10:16,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:10:16,654 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-04-15 09:10:16,654 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-15 09:10:16,654 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:10:16,655 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:10:16,655 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 09:10:16,655 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 09:10:16,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 09:10:16,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2022-04-15 09:10:16,657 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 11 [2022-04-15 09:10:16,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 09:10:16,657 INFO L478 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2022-04-15 09:10:16,658 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 09:10:16,658 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 19 transitions. [2022-04-15 09:10:16,678 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 09:10:16,678 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-15 09:10:16,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-15 09:10:16,679 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 09:10:16,679 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 09:10:16,695 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-15 09:10:16,894 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2022-04-15 09:10:16,895 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 09:10:16,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 09:10:16,895 INFO L85 PathProgramCache]: Analyzing trace with hash -318583316, now seen corresponding path program 1 times [2022-04-15 09:10:16,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 09:10:16,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1900215710] [2022-04-15 09:10:16,896 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 09:10:16,896 INFO L85 PathProgramCache]: Analyzing trace with hash -318583316, now seen corresponding path program 2 times [2022-04-15 09:10:16,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 09:10:16,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531558192] [2022-04-15 09:10:16,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 09:10:16,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 09:10:16,909 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 09:10:16,909 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1165541524] [2022-04-15 09:10:16,909 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 09:10:16,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 09:10:16,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 09:10:16,912 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-04-15 09:10:16,914 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-04-15 09:10:16,957 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-15 09:10:16,957 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 09:10:16,972 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-15 09:10:16,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 09:10:16,985 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 09:10:17,135 INFO L272 TraceCheckUtils]: 0: Hoare triple {203#true} call ULTIMATE.init(); {203#true} is VALID [2022-04-15 09:10:17,138 INFO L290 TraceCheckUtils]: 1: Hoare triple {203#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {211#(<= ~counter~0 0)} is VALID [2022-04-15 09:10:17,139 INFO L290 TraceCheckUtils]: 2: Hoare triple {211#(<= ~counter~0 0)} assume true; {211#(<= ~counter~0 0)} is VALID [2022-04-15 09:10:17,139 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {211#(<= ~counter~0 0)} {203#true} #54#return; {211#(<= ~counter~0 0)} is VALID [2022-04-15 09:10:17,140 INFO L272 TraceCheckUtils]: 4: Hoare triple {211#(<= ~counter~0 0)} call #t~ret8 := main(); {211#(<= ~counter~0 0)} is VALID [2022-04-15 09:10:17,141 INFO L290 TraceCheckUtils]: 5: Hoare triple {211#(<= ~counter~0 0)} havoc ~z~0;havoc ~a~0;havoc ~k~0;havoc ~x~0;havoc ~y~0;havoc ~c~0;havoc ~az~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~z~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~a~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~k~0 := #t~nondet6;havoc #t~nondet6;~x~0 := ~a~0;~y~0 := 1;~c~0 := 1;~az~0 := ~a~0 * ~z~0; {211#(<= ~counter~0 0)} is VALID [2022-04-15 09:10:17,141 INFO L290 TraceCheckUtils]: 6: Hoare triple {211#(<= ~counter~0 0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {227#(<= |main_#t~post7| 0)} is VALID [2022-04-15 09:10:17,142 INFO L290 TraceCheckUtils]: 7: Hoare triple {227#(<= |main_#t~post7| 0)} assume !(#t~post7 < 10);havoc #t~post7; {204#false} is VALID [2022-04-15 09:10:17,142 INFO L272 TraceCheckUtils]: 8: Hoare triple {204#false} call __VERIFIER_assert((if 0 == ~z~0 * ~x~0 - ~x~0 + ~a~0 - ~az~0 * ~y~0 then 1 else 0)); {204#false} is VALID [2022-04-15 09:10:17,142 INFO L290 TraceCheckUtils]: 9: Hoare triple {204#false} ~cond := #in~cond; {204#false} is VALID [2022-04-15 09:10:17,142 INFO L290 TraceCheckUtils]: 10: Hoare triple {204#false} assume 0 == ~cond; {204#false} is VALID [2022-04-15 09:10:17,143 INFO L290 TraceCheckUtils]: 11: Hoare triple {204#false} assume !false; {204#false} is VALID [2022-04-15 09:10:17,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 09:10:17,143 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 09:10:17,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 09:10:17,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531558192] [2022-04-15 09:10:17,143 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 09:10:17,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1165541524] [2022-04-15 09:10:17,144 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1165541524] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 09:10:17,144 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 09:10:17,144 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 09:10:17,144 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 09:10:17,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1900215710] [2022-04-15 09:10:17,145 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1900215710] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 09:10:17,145 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 09:10:17,145 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 09:10:17,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609292549] [2022-04-15 09:10:17,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 09:10:17,146 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-15 09:10:17,146 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 09:10:17,146 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 09:10:17,159 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 09:10:17,160 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 09:10:17,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 09:10:17,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 09:10:17,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 09:10:17,162 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 09:10:17,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:10:17,213 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2022-04-15 09:10:17,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 09:10:17,213 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-15 09:10:17,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 09:10:17,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 09:10:17,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 28 transitions. [2022-04-15 09:10:17,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 09:10:17,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 28 transitions. [2022-04-15 09:10:17,217 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 28 transitions. [2022-04-15 09:10:17,236 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 09:10:17,237 INFO L225 Difference]: With dead ends: 26 [2022-04-15 09:10:17,237 INFO L226 Difference]: Without dead ends: 19 [2022-04-15 09:10:17,238 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 09:10:17,238 INFO L913 BasicCegarLoop]: 17 mSDtfsCounter, 0 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 09:10:17,239 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 45 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 09:10:17,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-04-15 09:10:17,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-04-15 09:10:17,252 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 09:10:17,252 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand has 19 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 09:10:17,252 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand has 19 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 09:10:17,253 INFO L87 Difference]: Start difference. First operand 19 states. Second operand has 19 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 09:10:17,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:10:17,254 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2022-04-15 09:10:17,254 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-04-15 09:10:17,254 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:10:17,254 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:10:17,255 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 19 states. [2022-04-15 09:10:17,255 INFO L87 Difference]: Start difference. First operand has 19 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 19 states. [2022-04-15 09:10:17,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:10:17,256 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2022-04-15 09:10:17,256 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-04-15 09:10:17,256 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:10:17,256 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:10:17,257 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 09:10:17,257 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 09:10:17,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 09:10:17,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2022-04-15 09:10:17,258 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 12 [2022-04-15 09:10:17,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 09:10:17,258 INFO L478 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2022-04-15 09:10:17,258 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 09:10:17,258 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 21 transitions. [2022-04-15 09:10:17,272 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 09:10:17,273 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-04-15 09:10:17,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-15 09:10:17,273 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 09:10:17,273 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 09:10:17,289 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-04-15 09:10:17,489 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,SelfDestructingSolverStorable1 [2022-04-15 09:10:17,490 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 09:10:17,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 09:10:17,490 INFO L85 PathProgramCache]: Analyzing trace with hash -316795856, now seen corresponding path program 1 times [2022-04-15 09:10:17,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 09:10:17,491 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1176694929] [2022-04-15 09:10:17,502 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 09:10:17,502 INFO L85 PathProgramCache]: Analyzing trace with hash -316795856, now seen corresponding path program 2 times [2022-04-15 09:10:17,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 09:10:17,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240075575] [2022-04-15 09:10:17,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 09:10:17,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 09:10:17,519 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 09:10:17,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1828586703] [2022-04-15 09:10:17,520 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 09:10:17,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 09:10:17,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 09:10:17,525 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-04-15 09:10:17,526 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-04-15 09:10:17,564 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-15 09:10:17,564 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 09:10:17,565 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-15 09:10:17,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 09:10:17,572 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 09:10:17,666 INFO L272 TraceCheckUtils]: 0: Hoare triple {370#true} call ULTIMATE.init(); {370#true} is VALID [2022-04-15 09:10:17,666 INFO L290 TraceCheckUtils]: 1: Hoare triple {370#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {370#true} is VALID [2022-04-15 09:10:17,667 INFO L290 TraceCheckUtils]: 2: Hoare triple {370#true} assume true; {370#true} is VALID [2022-04-15 09:10:17,667 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {370#true} {370#true} #54#return; {370#true} is VALID [2022-04-15 09:10:17,667 INFO L272 TraceCheckUtils]: 4: Hoare triple {370#true} call #t~ret8 := main(); {370#true} is VALID [2022-04-15 09:10:17,668 INFO L290 TraceCheckUtils]: 5: Hoare triple {370#true} havoc ~z~0;havoc ~a~0;havoc ~k~0;havoc ~x~0;havoc ~y~0;havoc ~c~0;havoc ~az~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~z~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~a~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~k~0 := #t~nondet6;havoc #t~nondet6;~x~0 := ~a~0;~y~0 := 1;~c~0 := 1;~az~0 := ~a~0 * ~z~0; {390#(and (= main_~y~0 1) (= main_~a~0 main_~x~0) (= (* main_~a~0 main_~z~0) main_~az~0))} is VALID [2022-04-15 09:10:17,668 INFO L290 TraceCheckUtils]: 6: Hoare triple {390#(and (= main_~y~0 1) (= main_~a~0 main_~x~0) (= (* main_~a~0 main_~z~0) main_~az~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {390#(and (= main_~y~0 1) (= main_~a~0 main_~x~0) (= (* main_~a~0 main_~z~0) main_~az~0))} is VALID [2022-04-15 09:10:17,669 INFO L290 TraceCheckUtils]: 7: Hoare triple {390#(and (= main_~y~0 1) (= main_~a~0 main_~x~0) (= (* main_~a~0 main_~z~0) main_~az~0))} assume !!(#t~post7 < 10);havoc #t~post7; {390#(and (= main_~y~0 1) (= main_~a~0 main_~x~0) (= (* main_~a~0 main_~z~0) main_~az~0))} is VALID [2022-04-15 09:10:17,670 INFO L272 TraceCheckUtils]: 8: Hoare triple {390#(and (= main_~y~0 1) (= main_~a~0 main_~x~0) (= (* main_~a~0 main_~z~0) main_~az~0))} call __VERIFIER_assert((if 0 == ~z~0 * ~x~0 - ~x~0 + ~a~0 - ~az~0 * ~y~0 then 1 else 0)); {400#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 09:10:17,671 INFO L290 TraceCheckUtils]: 9: Hoare triple {400#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {404#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 09:10:17,671 INFO L290 TraceCheckUtils]: 10: Hoare triple {404#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {371#false} is VALID [2022-04-15 09:10:17,671 INFO L290 TraceCheckUtils]: 11: Hoare triple {371#false} assume !false; {371#false} is VALID [2022-04-15 09:10:17,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 09:10:17,672 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 09:10:17,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 09:10:17,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240075575] [2022-04-15 09:10:17,672 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 09:10:17,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1828586703] [2022-04-15 09:10:17,672 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1828586703] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 09:10:17,672 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 09:10:17,673 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 09:10:17,673 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 09:10:17,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1176694929] [2022-04-15 09:10:17,673 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1176694929] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 09:10:17,673 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 09:10:17,674 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 09:10:17,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484002155] [2022-04-15 09:10:17,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 09:10:17,674 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-15 09:10:17,674 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 09:10:17,674 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 09:10:17,683 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 09:10:17,684 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 09:10:17,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 09:10:17,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 09:10:17,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 09:10:17,684 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 09:10:17,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:10:17,781 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2022-04-15 09:10:17,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 09:10:17,781 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-15 09:10:17,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 09:10:17,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 09:10:17,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 31 transitions. [2022-04-15 09:10:17,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 09:10:17,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 31 transitions. [2022-04-15 09:10:17,791 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 31 transitions. [2022-04-15 09:10:17,813 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 09:10:17,816 INFO L225 Difference]: With dead ends: 28 [2022-04-15 09:10:17,816 INFO L226 Difference]: Without dead ends: 25 [2022-04-15 09:10:17,818 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 09:10:17,821 INFO L913 BasicCegarLoop]: 16 mSDtfsCounter, 6 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 09:10:17,821 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 57 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 09:10:17,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-15 09:10:17,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-04-15 09:10:17,832 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 09:10:17,832 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand has 25 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 09:10:17,833 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand has 25 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 09:10:17,833 INFO L87 Difference]: Start difference. First operand 25 states. Second operand has 25 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 09:10:17,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:10:17,834 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2022-04-15 09:10:17,835 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2022-04-15 09:10:17,835 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:10:17,835 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:10:17,835 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 25 states. [2022-04-15 09:10:17,835 INFO L87 Difference]: Start difference. First operand has 25 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 25 states. [2022-04-15 09:10:17,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:10:17,836 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2022-04-15 09:10:17,837 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2022-04-15 09:10:17,837 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:10:17,837 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:10:17,837 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 09:10:17,837 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 09:10:17,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 09:10:17,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2022-04-15 09:10:17,838 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 12 [2022-04-15 09:10:17,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 09:10:17,839 INFO L478 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2022-04-15 09:10:17,839 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 09:10:17,839 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 27 transitions. [2022-04-15 09:10:17,864 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 09:10:17,864 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2022-04-15 09:10:17,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-15 09:10:17,866 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 09:10:17,866 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 09:10:17,883 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-04-15 09:10:18,079 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 09:10:18,079 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 09:10:18,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 09:10:18,080 INFO L85 PathProgramCache]: Analyzing trace with hash -2089867248, now seen corresponding path program 1 times [2022-04-15 09:10:18,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 09:10:18,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1515098986] [2022-04-15 09:10:20,297 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 09:10:20,297 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-15 09:10:20,298 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 09:10:20,298 INFO L85 PathProgramCache]: Analyzing trace with hash -2089867248, now seen corresponding path program 2 times [2022-04-15 09:10:20,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 09:10:20,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853321483] [2022-04-15 09:10:20,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 09:10:20,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 09:10:20,319 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 09:10:20,319 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [194501169] [2022-04-15 09:10:20,319 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 09:10:20,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 09:10:20,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 09:10:20,322 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-04-15 09:10:20,326 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-04-15 09:10:20,380 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 09:10:20,380 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 09:10:20,381 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 09:10:20,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 09:10:20,389 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 09:10:20,493 INFO L272 TraceCheckUtils]: 0: Hoare triple {568#true} call ULTIMATE.init(); {568#true} is VALID [2022-04-15 09:10:20,494 INFO L290 TraceCheckUtils]: 1: Hoare triple {568#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {576#(<= ~counter~0 0)} is VALID [2022-04-15 09:10:20,495 INFO L290 TraceCheckUtils]: 2: Hoare triple {576#(<= ~counter~0 0)} assume true; {576#(<= ~counter~0 0)} is VALID [2022-04-15 09:10:20,495 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {576#(<= ~counter~0 0)} {568#true} #54#return; {576#(<= ~counter~0 0)} is VALID [2022-04-15 09:10:20,495 INFO L272 TraceCheckUtils]: 4: Hoare triple {576#(<= ~counter~0 0)} call #t~ret8 := main(); {576#(<= ~counter~0 0)} is VALID [2022-04-15 09:10:20,496 INFO L290 TraceCheckUtils]: 5: Hoare triple {576#(<= ~counter~0 0)} havoc ~z~0;havoc ~a~0;havoc ~k~0;havoc ~x~0;havoc ~y~0;havoc ~c~0;havoc ~az~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~z~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~a~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~k~0 := #t~nondet6;havoc #t~nondet6;~x~0 := ~a~0;~y~0 := 1;~c~0 := 1;~az~0 := ~a~0 * ~z~0; {576#(<= ~counter~0 0)} is VALID [2022-04-15 09:10:20,496 INFO L290 TraceCheckUtils]: 6: Hoare triple {576#(<= ~counter~0 0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {592#(<= ~counter~0 1)} is VALID [2022-04-15 09:10:20,497 INFO L290 TraceCheckUtils]: 7: Hoare triple {592#(<= ~counter~0 1)} assume !!(#t~post7 < 10);havoc #t~post7; {592#(<= ~counter~0 1)} is VALID [2022-04-15 09:10:20,498 INFO L272 TraceCheckUtils]: 8: Hoare triple {592#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == ~z~0 * ~x~0 - ~x~0 + ~a~0 - ~az~0 * ~y~0 then 1 else 0)); {592#(<= ~counter~0 1)} is VALID [2022-04-15 09:10:20,498 INFO L290 TraceCheckUtils]: 9: Hoare triple {592#(<= ~counter~0 1)} ~cond := #in~cond; {592#(<= ~counter~0 1)} is VALID [2022-04-15 09:10:20,499 INFO L290 TraceCheckUtils]: 10: Hoare triple {592#(<= ~counter~0 1)} assume !(0 == ~cond); {592#(<= ~counter~0 1)} is VALID [2022-04-15 09:10:20,499 INFO L290 TraceCheckUtils]: 11: Hoare triple {592#(<= ~counter~0 1)} assume true; {592#(<= ~counter~0 1)} is VALID [2022-04-15 09:10:20,500 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {592#(<= ~counter~0 1)} {592#(<= ~counter~0 1)} #50#return; {592#(<= ~counter~0 1)} is VALID [2022-04-15 09:10:20,501 INFO L290 TraceCheckUtils]: 13: Hoare triple {592#(<= ~counter~0 1)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~x~0 := ~x~0 * ~z~0 + ~a~0;~y~0 := ~y~0 * ~z~0; {592#(<= ~counter~0 1)} is VALID [2022-04-15 09:10:20,501 INFO L290 TraceCheckUtils]: 14: Hoare triple {592#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {617#(<= |main_#t~post7| 1)} is VALID [2022-04-15 09:10:20,504 INFO L290 TraceCheckUtils]: 15: Hoare triple {617#(<= |main_#t~post7| 1)} assume !(#t~post7 < 10);havoc #t~post7; {569#false} is VALID [2022-04-15 09:10:20,504 INFO L272 TraceCheckUtils]: 16: Hoare triple {569#false} call __VERIFIER_assert((if 0 == ~z~0 * ~x~0 - ~x~0 + ~a~0 - ~az~0 * ~y~0 then 1 else 0)); {569#false} is VALID [2022-04-15 09:10:20,505 INFO L290 TraceCheckUtils]: 17: Hoare triple {569#false} ~cond := #in~cond; {569#false} is VALID [2022-04-15 09:10:20,505 INFO L290 TraceCheckUtils]: 18: Hoare triple {569#false} assume 0 == ~cond; {569#false} is VALID [2022-04-15 09:10:20,505 INFO L290 TraceCheckUtils]: 19: Hoare triple {569#false} assume !false; {569#false} is VALID [2022-04-15 09:10:20,505 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 09:10:20,505 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 09:10:20,626 INFO L290 TraceCheckUtils]: 19: Hoare triple {569#false} assume !false; {569#false} is VALID [2022-04-15 09:10:20,626 INFO L290 TraceCheckUtils]: 18: Hoare triple {569#false} assume 0 == ~cond; {569#false} is VALID [2022-04-15 09:10:20,626 INFO L290 TraceCheckUtils]: 17: Hoare triple {569#false} ~cond := #in~cond; {569#false} is VALID [2022-04-15 09:10:20,626 INFO L272 TraceCheckUtils]: 16: Hoare triple {569#false} call __VERIFIER_assert((if 0 == ~z~0 * ~x~0 - ~x~0 + ~a~0 - ~az~0 * ~y~0 then 1 else 0)); {569#false} is VALID [2022-04-15 09:10:20,627 INFO L290 TraceCheckUtils]: 15: Hoare triple {645#(< |main_#t~post7| 10)} assume !(#t~post7 < 10);havoc #t~post7; {569#false} is VALID [2022-04-15 09:10:20,627 INFO L290 TraceCheckUtils]: 14: Hoare triple {649#(< ~counter~0 10)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {645#(< |main_#t~post7| 10)} is VALID [2022-04-15 09:10:20,627 INFO L290 TraceCheckUtils]: 13: Hoare triple {649#(< ~counter~0 10)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~x~0 := ~x~0 * ~z~0 + ~a~0;~y~0 := ~y~0 * ~z~0; {649#(< ~counter~0 10)} is VALID [2022-04-15 09:10:20,628 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {568#true} {649#(< ~counter~0 10)} #50#return; {649#(< ~counter~0 10)} is VALID [2022-04-15 09:10:20,628 INFO L290 TraceCheckUtils]: 11: Hoare triple {568#true} assume true; {568#true} is VALID [2022-04-15 09:10:20,628 INFO L290 TraceCheckUtils]: 10: Hoare triple {568#true} assume !(0 == ~cond); {568#true} is VALID [2022-04-15 09:10:20,628 INFO L290 TraceCheckUtils]: 9: Hoare triple {568#true} ~cond := #in~cond; {568#true} is VALID [2022-04-15 09:10:20,629 INFO L272 TraceCheckUtils]: 8: Hoare triple {649#(< ~counter~0 10)} call __VERIFIER_assert((if 0 == ~z~0 * ~x~0 - ~x~0 + ~a~0 - ~az~0 * ~y~0 then 1 else 0)); {568#true} is VALID [2022-04-15 09:10:20,629 INFO L290 TraceCheckUtils]: 7: Hoare triple {649#(< ~counter~0 10)} assume !!(#t~post7 < 10);havoc #t~post7; {649#(< ~counter~0 10)} is VALID [2022-04-15 09:10:20,629 INFO L290 TraceCheckUtils]: 6: Hoare triple {674#(< ~counter~0 9)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {649#(< ~counter~0 10)} is VALID [2022-04-15 09:10:20,630 INFO L290 TraceCheckUtils]: 5: Hoare triple {674#(< ~counter~0 9)} havoc ~z~0;havoc ~a~0;havoc ~k~0;havoc ~x~0;havoc ~y~0;havoc ~c~0;havoc ~az~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~z~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~a~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~k~0 := #t~nondet6;havoc #t~nondet6;~x~0 := ~a~0;~y~0 := 1;~c~0 := 1;~az~0 := ~a~0 * ~z~0; {674#(< ~counter~0 9)} is VALID [2022-04-15 09:10:20,630 INFO L272 TraceCheckUtils]: 4: Hoare triple {674#(< ~counter~0 9)} call #t~ret8 := main(); {674#(< ~counter~0 9)} is VALID [2022-04-15 09:10:20,631 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {674#(< ~counter~0 9)} {568#true} #54#return; {674#(< ~counter~0 9)} is VALID [2022-04-15 09:10:20,631 INFO L290 TraceCheckUtils]: 2: Hoare triple {674#(< ~counter~0 9)} assume true; {674#(< ~counter~0 9)} is VALID [2022-04-15 09:10:20,631 INFO L290 TraceCheckUtils]: 1: Hoare triple {568#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {674#(< ~counter~0 9)} is VALID [2022-04-15 09:10:20,632 INFO L272 TraceCheckUtils]: 0: Hoare triple {568#true} call ULTIMATE.init(); {568#true} is VALID [2022-04-15 09:10:20,632 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 09:10:20,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 09:10:20,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853321483] [2022-04-15 09:10:20,632 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 09:10:20,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [194501169] [2022-04-15 09:10:20,632 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [194501169] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 09:10:20,632 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 09:10:20,632 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-04-15 09:10:20,633 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 09:10:20,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1515098986] [2022-04-15 09:10:20,633 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1515098986] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 09:10:20,633 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 09:10:20,633 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 09:10:20,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115438208] [2022-04-15 09:10:20,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 09:10:20,633 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2022-04-15 09:10:20,634 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 09:10:20,634 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 09:10:20,647 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 09:10:20,647 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 09:10:20,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 09:10:20,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 09:10:20,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-04-15 09:10:20,648 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 09:10:20,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:10:20,704 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2022-04-15 09:10:20,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 09:10:20,704 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2022-04-15 09:10:20,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 09:10:20,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 09:10:20,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 36 transitions. [2022-04-15 09:10:20,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 09:10:20,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 36 transitions. [2022-04-15 09:10:20,707 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 36 transitions. [2022-04-15 09:10:20,728 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 09:10:20,730 INFO L225 Difference]: With dead ends: 34 [2022-04-15 09:10:20,730 INFO L226 Difference]: Without dead ends: 27 [2022-04-15 09:10:20,730 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-04-15 09:10:20,731 INFO L913 BasicCegarLoop]: 18 mSDtfsCounter, 2 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 09:10:20,731 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 51 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 09:10:20,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-15 09:10:20,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-04-15 09:10:20,743 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 09:10:20,743 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 27 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 09:10:20,743 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 27 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 09:10:20,747 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 27 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 09:10:20,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:10:20,751 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2022-04-15 09:10:20,751 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2022-04-15 09:10:20,754 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:10:20,754 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:10:20,755 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 27 states. [2022-04-15 09:10:20,755 INFO L87 Difference]: Start difference. First operand has 27 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 27 states. [2022-04-15 09:10:20,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:10:20,759 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2022-04-15 09:10:20,759 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2022-04-15 09:10:20,760 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:10:20,760 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:10:20,760 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 09:10:20,760 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 09:10:20,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 09:10:20,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2022-04-15 09:10:20,763 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 20 [2022-04-15 09:10:20,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 09:10:20,763 INFO L478 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2022-04-15 09:10:20,764 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 09:10:20,764 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 29 transitions. [2022-04-15 09:10:20,783 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 09:10:20,783 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2022-04-15 09:10:20,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-15 09:10:20,784 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 09:10:20,784 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 09:10:20,803 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-04-15 09:10:20,997 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 09:10:20,998 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 09:10:20,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 09:10:20,998 INFO L85 PathProgramCache]: Analyzing trace with hash -2088079788, now seen corresponding path program 1 times [2022-04-15 09:10:20,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 09:10:20,998 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1793436803] [2022-04-15 09:10:23,057 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 09:10:23,057 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-15 09:10:23,058 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 09:10:23,058 INFO L85 PathProgramCache]: Analyzing trace with hash -2088079788, now seen corresponding path program 2 times [2022-04-15 09:10:23,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 09:10:23,058 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482814367] [2022-04-15 09:10:23,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 09:10:23,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 09:10:23,078 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 09:10:23,078 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1388879529] [2022-04-15 09:10:23,078 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 09:10:23,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 09:10:23,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 09:10:23,084 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-04-15 09:10:23,085 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-04-15 09:10:23,117 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 09:10:23,117 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 09:10:23,118 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 22 conjunts are in the unsatisfiable core [2022-04-15 09:10:23,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 09:10:23,168 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 09:10:23,354 INFO L272 TraceCheckUtils]: 0: Hoare triple {873#true} call ULTIMATE.init(); {873#true} is VALID [2022-04-15 09:10:23,355 INFO L290 TraceCheckUtils]: 1: Hoare triple {873#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {873#true} is VALID [2022-04-15 09:10:23,355 INFO L290 TraceCheckUtils]: 2: Hoare triple {873#true} assume true; {873#true} is VALID [2022-04-15 09:10:23,355 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {873#true} {873#true} #54#return; {873#true} is VALID [2022-04-15 09:10:23,355 INFO L272 TraceCheckUtils]: 4: Hoare triple {873#true} call #t~ret8 := main(); {873#true} is VALID [2022-04-15 09:10:23,356 INFO L290 TraceCheckUtils]: 5: Hoare triple {873#true} havoc ~z~0;havoc ~a~0;havoc ~k~0;havoc ~x~0;havoc ~y~0;havoc ~c~0;havoc ~az~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~z~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~a~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~k~0 := #t~nondet6;havoc #t~nondet6;~x~0 := ~a~0;~y~0 := 1;~c~0 := 1;~az~0 := ~a~0 * ~z~0; {893#(and (= main_~y~0 1) (= main_~a~0 main_~x~0) (= (* main_~a~0 main_~z~0) main_~az~0))} is VALID [2022-04-15 09:10:23,356 INFO L290 TraceCheckUtils]: 6: Hoare triple {893#(and (= main_~y~0 1) (= main_~a~0 main_~x~0) (= (* main_~a~0 main_~z~0) main_~az~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {893#(and (= main_~y~0 1) (= main_~a~0 main_~x~0) (= (* main_~a~0 main_~z~0) main_~az~0))} is VALID [2022-04-15 09:10:23,357 INFO L290 TraceCheckUtils]: 7: Hoare triple {893#(and (= main_~y~0 1) (= main_~a~0 main_~x~0) (= (* main_~a~0 main_~z~0) main_~az~0))} assume !!(#t~post7 < 10);havoc #t~post7; {893#(and (= main_~y~0 1) (= main_~a~0 main_~x~0) (= (* main_~a~0 main_~z~0) main_~az~0))} is VALID [2022-04-15 09:10:23,357 INFO L272 TraceCheckUtils]: 8: Hoare triple {893#(and (= main_~y~0 1) (= main_~a~0 main_~x~0) (= (* main_~a~0 main_~z~0) main_~az~0))} call __VERIFIER_assert((if 0 == ~z~0 * ~x~0 - ~x~0 + ~a~0 - ~az~0 * ~y~0 then 1 else 0)); {873#true} is VALID [2022-04-15 09:10:23,357 INFO L290 TraceCheckUtils]: 9: Hoare triple {873#true} ~cond := #in~cond; {906#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 09:10:23,357 INFO L290 TraceCheckUtils]: 10: Hoare triple {906#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {910#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 09:10:23,358 INFO L290 TraceCheckUtils]: 11: Hoare triple {910#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {910#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 09:10:23,359 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {910#(not (= |__VERIFIER_assert_#in~cond| 0))} {893#(and (= main_~y~0 1) (= main_~a~0 main_~x~0) (= (* main_~a~0 main_~z~0) main_~az~0))} #50#return; {893#(and (= main_~y~0 1) (= main_~a~0 main_~x~0) (= (* main_~a~0 main_~z~0) main_~az~0))} is VALID [2022-04-15 09:10:23,359 INFO L290 TraceCheckUtils]: 13: Hoare triple {893#(and (= main_~y~0 1) (= main_~a~0 main_~x~0) (= (* main_~a~0 main_~z~0) main_~az~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~x~0 := ~x~0 * ~z~0 + ~a~0;~y~0 := ~y~0 * ~z~0; {920#(and (= main_~z~0 main_~y~0) (= main_~x~0 (+ (* main_~a~0 main_~z~0) main_~a~0)) (= (* main_~a~0 main_~z~0) main_~az~0))} is VALID [2022-04-15 09:10:23,360 INFO L290 TraceCheckUtils]: 14: Hoare triple {920#(and (= main_~z~0 main_~y~0) (= main_~x~0 (+ (* main_~a~0 main_~z~0) main_~a~0)) (= (* main_~a~0 main_~z~0) main_~az~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {920#(and (= main_~z~0 main_~y~0) (= main_~x~0 (+ (* main_~a~0 main_~z~0) main_~a~0)) (= (* main_~a~0 main_~z~0) main_~az~0))} is VALID [2022-04-15 09:10:23,360 INFO L290 TraceCheckUtils]: 15: Hoare triple {920#(and (= main_~z~0 main_~y~0) (= main_~x~0 (+ (* main_~a~0 main_~z~0) main_~a~0)) (= (* main_~a~0 main_~z~0) main_~az~0))} assume !!(#t~post7 < 10);havoc #t~post7; {920#(and (= main_~z~0 main_~y~0) (= main_~x~0 (+ (* main_~a~0 main_~z~0) main_~a~0)) (= (* main_~a~0 main_~z~0) main_~az~0))} is VALID [2022-04-15 09:10:23,417 INFO L272 TraceCheckUtils]: 16: Hoare triple {920#(and (= main_~z~0 main_~y~0) (= main_~x~0 (+ (* main_~a~0 main_~z~0) main_~a~0)) (= (* main_~a~0 main_~z~0) main_~az~0))} call __VERIFIER_assert((if 0 == ~z~0 * ~x~0 - ~x~0 + ~a~0 - ~az~0 * ~y~0 then 1 else 0)); {930#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 09:10:23,418 INFO L290 TraceCheckUtils]: 17: Hoare triple {930#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {934#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 09:10:23,418 INFO L290 TraceCheckUtils]: 18: Hoare triple {934#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {874#false} is VALID [2022-04-15 09:10:23,418 INFO L290 TraceCheckUtils]: 19: Hoare triple {874#false} assume !false; {874#false} is VALID [2022-04-15 09:10:23,418 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 09:10:23,419 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 09:10:35,839 INFO L290 TraceCheckUtils]: 19: Hoare triple {874#false} assume !false; {874#false} is VALID [2022-04-15 09:10:35,839 INFO L290 TraceCheckUtils]: 18: Hoare triple {934#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {874#false} is VALID [2022-04-15 09:10:35,840 INFO L290 TraceCheckUtils]: 17: Hoare triple {930#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {934#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 09:10:35,840 INFO L272 TraceCheckUtils]: 16: Hoare triple {950#(= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0))} call __VERIFIER_assert((if 0 == ~z~0 * ~x~0 - ~x~0 + ~a~0 - ~az~0 * ~y~0 then 1 else 0)); {930#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 09:10:35,841 INFO L290 TraceCheckUtils]: 15: Hoare triple {950#(= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0))} assume !!(#t~post7 < 10);havoc #t~post7; {950#(= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0))} is VALID [2022-04-15 09:10:35,841 INFO L290 TraceCheckUtils]: 14: Hoare triple {950#(= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {950#(= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0))} is VALID [2022-04-15 09:10:35,938 INFO L290 TraceCheckUtils]: 13: Hoare triple {960#(= (+ (* main_~z~0 main_~x~0) main_~a~0 (* main_~az~0 (* main_~z~0 main_~y~0))) (+ main_~a~0 (* main_~z~0 (+ (* main_~z~0 main_~x~0) main_~a~0))))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~x~0 := ~x~0 * ~z~0 + ~a~0;~y~0 := ~y~0 * ~z~0; {950#(= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0))} is VALID [2022-04-15 09:10:35,941 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {910#(not (= |__VERIFIER_assert_#in~cond| 0))} {873#true} #50#return; {960#(= (+ (* main_~z~0 main_~x~0) main_~a~0 (* main_~az~0 (* main_~z~0 main_~y~0))) (+ main_~a~0 (* main_~z~0 (+ (* main_~z~0 main_~x~0) main_~a~0))))} is VALID [2022-04-15 09:10:35,941 INFO L290 TraceCheckUtils]: 11: Hoare triple {910#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {910#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 09:10:35,944 INFO L290 TraceCheckUtils]: 10: Hoare triple {973#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {910#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 09:10:35,944 INFO L290 TraceCheckUtils]: 9: Hoare triple {873#true} ~cond := #in~cond; {973#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 09:10:35,944 INFO L272 TraceCheckUtils]: 8: Hoare triple {873#true} call __VERIFIER_assert((if 0 == ~z~0 * ~x~0 - ~x~0 + ~a~0 - ~az~0 * ~y~0 then 1 else 0)); {873#true} is VALID [2022-04-15 09:10:35,944 INFO L290 TraceCheckUtils]: 7: Hoare triple {873#true} assume !!(#t~post7 < 10);havoc #t~post7; {873#true} is VALID [2022-04-15 09:10:35,944 INFO L290 TraceCheckUtils]: 6: Hoare triple {873#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {873#true} is VALID [2022-04-15 09:10:35,944 INFO L290 TraceCheckUtils]: 5: Hoare triple {873#true} havoc ~z~0;havoc ~a~0;havoc ~k~0;havoc ~x~0;havoc ~y~0;havoc ~c~0;havoc ~az~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~z~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~a~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~k~0 := #t~nondet6;havoc #t~nondet6;~x~0 := ~a~0;~y~0 := 1;~c~0 := 1;~az~0 := ~a~0 * ~z~0; {873#true} is VALID [2022-04-15 09:10:35,945 INFO L272 TraceCheckUtils]: 4: Hoare triple {873#true} call #t~ret8 := main(); {873#true} is VALID [2022-04-15 09:10:35,945 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {873#true} {873#true} #54#return; {873#true} is VALID [2022-04-15 09:10:35,945 INFO L290 TraceCheckUtils]: 2: Hoare triple {873#true} assume true; {873#true} is VALID [2022-04-15 09:10:35,945 INFO L290 TraceCheckUtils]: 1: Hoare triple {873#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {873#true} is VALID [2022-04-15 09:10:35,945 INFO L272 TraceCheckUtils]: 0: Hoare triple {873#true} call ULTIMATE.init(); {873#true} is VALID [2022-04-15 09:10:35,945 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 09:10:35,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 09:10:35,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482814367] [2022-04-15 09:10:35,946 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 09:10:35,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1388879529] [2022-04-15 09:10:35,946 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1388879529] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 09:10:35,946 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 09:10:35,946 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2022-04-15 09:10:35,946 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 09:10:35,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1793436803] [2022-04-15 09:10:35,946 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1793436803] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 09:10:35,946 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 09:10:35,946 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 09:10:35,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623120067] [2022-04-15 09:10:35,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 09:10:35,947 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2022-04-15 09:10:35,947 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 09:10:35,947 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 09:10:35,979 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 09:10:35,980 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 09:10:35,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 09:10:35,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 09:10:35,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-04-15 09:10:35,980 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 09:10:36,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:10:36,679 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2022-04-15 09:10:36,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 09:10:36,679 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2022-04-15 09:10:36,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 09:10:36,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 09:10:36,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 36 transitions. [2022-04-15 09:10:36,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 09:10:36,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 36 transitions. [2022-04-15 09:10:36,681 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 36 transitions. [2022-04-15 09:10:36,761 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 09:10:36,762 INFO L225 Difference]: With dead ends: 36 [2022-04-15 09:10:36,762 INFO L226 Difference]: Without dead ends: 33 [2022-04-15 09:10:36,762 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2022-04-15 09:10:36,763 INFO L913 BasicCegarLoop]: 17 mSDtfsCounter, 13 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 09:10:36,763 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 79 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 09:10:36,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-15 09:10:36,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-04-15 09:10:36,777 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 09:10:36,778 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 33 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 09:10:36,778 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 33 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 09:10:36,778 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 33 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 09:10:36,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:10:36,779 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2022-04-15 09:10:36,779 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2022-04-15 09:10:36,779 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:10:36,779 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:10:36,779 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 33 states. [2022-04-15 09:10:36,780 INFO L87 Difference]: Start difference. First operand has 33 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 33 states. [2022-04-15 09:10:36,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:10:36,781 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2022-04-15 09:10:36,781 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2022-04-15 09:10:36,781 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:10:36,781 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:10:36,781 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 09:10:36,781 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 09:10:36,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 09:10:36,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2022-04-15 09:10:36,782 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 20 [2022-04-15 09:10:36,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 09:10:36,782 INFO L478 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2022-04-15 09:10:36,782 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 09:10:36,782 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 35 transitions. [2022-04-15 09:10:36,906 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 09:10:36,906 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2022-04-15 09:10:36,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-15 09:10:36,907 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 09:10:36,907 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 09:10:36,929 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-04-15 09:10:37,107 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 09:10:37,107 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 09:10:37,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 09:10:37,108 INFO L85 PathProgramCache]: Analyzing trace with hash -696181196, now seen corresponding path program 3 times [2022-04-15 09:10:37,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 09:10:37,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1912114482] [2022-04-15 09:10:39,610 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 09:10:39,610 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-15 09:10:39,610 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 09:10:39,610 INFO L85 PathProgramCache]: Analyzing trace with hash -696181196, now seen corresponding path program 4 times [2022-04-15 09:10:39,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 09:10:39,610 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565174804] [2022-04-15 09:10:39,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 09:10:39,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 09:10:39,633 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 09:10:39,633 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [764081526] [2022-04-15 09:10:39,633 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 09:10:39,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 09:10:39,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 09:10:39,634 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-04-15 09:10:39,635 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-04-15 09:11:09,326 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 09:11:09,327 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 09:11:09,328 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-15 09:11:09,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 09:11:09,823 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 09:11:24,641 WARN L914 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-15 09:11:34,681 WARN L914 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-15 09:11:44,708 WARN L914 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-15 09:11:58,784 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (= c_main_~z~0 0)) (.cse0 (+ (* (- 1) c_main_~a~0) c_main_~x~0))) (or (and (= (mod .cse0 c_main_~z~0) 0) (let ((.cse1 (= c_main_~az~0 0)) (.cse2 (let ((.cse3 (div .cse0 c_main_~z~0))) (+ (* .cse3 c_main_~z~0) (* (- 1) .cse3) c_main_~a~0)))) (or (and (= (mod c_main_~y~0 c_main_~z~0) 0) .cse1 (= .cse2 0)) (and (= (* (div .cse2 c_main_~az~0) c_main_~z~0) c_main_~y~0) (not .cse1) (= (mod .cse2 c_main_~az~0) 0)))) (not .cse4)) (and (= c_main_~y~0 0) (exists ((v_main_~x~0_29 Int) (v_main_~y~0_28 Int)) (= (+ c_main_~a~0 (* v_main_~x~0_29 c_main_~z~0)) (+ v_main_~x~0_29 (* v_main_~y~0_28 c_main_~az~0)))) .cse4 (= 0 .cse0)))) is different from false [2022-04-15 09:13:30,681 WARN L232 SmtUtils]: Spent 41.52s on a formula simplification. DAG size of input: 47 DAG size of output: 39 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-15 09:13:42,730 WARN L914 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-15 09:13:52,613 WARN L914 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-15 09:13:56,707 WARN L914 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-15 09:14:00,824 WARN L914 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-15 09:14:13,738 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse4 (* (- 1) c_main_~a~0))) (let ((.cse6 (+ .cse4 c_main_~x~0))) (or (and (let ((.cse5 (div .cse6 c_main_~z~0))) (let ((.cse1 (= c_main_~az~0 0)) (.cse2 (+ (* .cse5 c_main_~z~0) (* (- 1) .cse5) c_main_~a~0))) (or (let ((.cse0 (div .cse2 c_main_~az~0))) (and (= (* .cse0 c_main_~z~0) c_main_~y~0) (not .cse1) (= (mod .cse2 c_main_~az~0) 0) (= (* (div (let ((.cse3 (div (+ .cse4 .cse5) c_main_~z~0))) (+ (* .cse3 c_main_~z~0) (* (- 1) .cse3) c_main_~a~0)) c_main_~az~0) c_main_~z~0) .cse0))) (and (= (mod c_main_~y~0 c_main_~z~0) 0) .cse1 (= 0 (mod (div c_main_~y~0 c_main_~z~0) c_main_~z~0)) (= .cse2 0))))) (= (mod .cse6 c_main_~z~0) 0) (not (= c_main_~z~0 0))) (and (= (+ (* c_main_~a~0 c_main_~z~0) c_main_~a~0) c_main_~a~0) (= c_main_~y~0 0) (= 0 .cse6))))) is different from false [2022-04-15 09:14:26,953 INFO L272 TraceCheckUtils]: 0: Hoare triple {1211#true} call ULTIMATE.init(); {1211#true} is VALID [2022-04-15 09:14:26,953 INFO L290 TraceCheckUtils]: 1: Hoare triple {1211#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1211#true} is VALID [2022-04-15 09:14:26,954 INFO L290 TraceCheckUtils]: 2: Hoare triple {1211#true} assume true; {1211#true} is VALID [2022-04-15 09:14:26,954 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1211#true} {1211#true} #54#return; {1211#true} is VALID [2022-04-15 09:14:26,954 INFO L272 TraceCheckUtils]: 4: Hoare triple {1211#true} call #t~ret8 := main(); {1211#true} is VALID [2022-04-15 09:14:26,954 INFO L290 TraceCheckUtils]: 5: Hoare triple {1211#true} havoc ~z~0;havoc ~a~0;havoc ~k~0;havoc ~x~0;havoc ~y~0;havoc ~c~0;havoc ~az~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~z~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~a~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~k~0 := #t~nondet6;havoc #t~nondet6;~x~0 := ~a~0;~y~0 := 1;~c~0 := 1;~az~0 := ~a~0 * ~z~0; {1211#true} is VALID [2022-04-15 09:14:26,954 INFO L290 TraceCheckUtils]: 6: Hoare triple {1211#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {1211#true} is VALID [2022-04-15 09:14:26,954 INFO L290 TraceCheckUtils]: 7: Hoare triple {1211#true} assume !!(#t~post7 < 10);havoc #t~post7; {1211#true} is VALID [2022-04-15 09:14:26,954 INFO L272 TraceCheckUtils]: 8: Hoare triple {1211#true} call __VERIFIER_assert((if 0 == ~z~0 * ~x~0 - ~x~0 + ~a~0 - ~az~0 * ~y~0 then 1 else 0)); {1211#true} is VALID [2022-04-15 09:14:26,962 INFO L290 TraceCheckUtils]: 9: Hoare triple {1211#true} ~cond := #in~cond; {1243#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 09:14:26,963 INFO L290 TraceCheckUtils]: 10: Hoare triple {1243#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {1247#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 09:14:26,963 INFO L290 TraceCheckUtils]: 11: Hoare triple {1247#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1247#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 09:14:26,964 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1247#(not (= |__VERIFIER_assert_#in~cond| 0))} {1211#true} #50#return; {1254#(= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0))} is VALID [2022-04-15 09:14:28,966 WARN L290 TraceCheckUtils]: 13: Hoare triple {1254#(= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~x~0 := ~x~0 * ~z~0 + ~a~0;~y~0 := ~y~0 * ~z~0; {1258#(or (and (= main_~z~0 0) (exists ((v_main_~x~0_29 Int) (v_main_~y~0_28 Int)) (= (+ main_~a~0 (* v_main_~x~0_29 main_~z~0)) (+ v_main_~x~0_29 (* v_main_~y~0_28 main_~az~0)))) (= main_~y~0 0) (= (+ (* (- 1) main_~a~0) main_~x~0) 0)) (and (or (and (= (mod main_~y~0 main_~z~0) 0) (= main_~az~0 0) (= 0 (+ (* (- 1) (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0)))) (and (= (mod (+ (* (- 1) (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0)) main_~az~0) 0) (not (= main_~az~0 0)) (= (* (div (+ (* (- 1) (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0)) main_~az~0) main_~z~0) main_~y~0))) (= 0 (mod (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) (not (= main_~z~0 0))))} is UNKNOWN [2022-04-15 09:14:28,968 INFO L290 TraceCheckUtils]: 14: Hoare triple {1258#(or (and (= main_~z~0 0) (exists ((v_main_~x~0_29 Int) (v_main_~y~0_28 Int)) (= (+ main_~a~0 (* v_main_~x~0_29 main_~z~0)) (+ v_main_~x~0_29 (* v_main_~y~0_28 main_~az~0)))) (= main_~y~0 0) (= (+ (* (- 1) main_~a~0) main_~x~0) 0)) (and (or (and (= (mod main_~y~0 main_~z~0) 0) (= main_~az~0 0) (= 0 (+ (* (- 1) (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0)))) (and (= (mod (+ (* (- 1) (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0)) main_~az~0) 0) (not (= main_~az~0 0)) (= (* (div (+ (* (- 1) (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0)) main_~az~0) main_~z~0) main_~y~0))) (= 0 (mod (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) (not (= main_~z~0 0))))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {1258#(or (and (= main_~z~0 0) (exists ((v_main_~x~0_29 Int) (v_main_~y~0_28 Int)) (= (+ main_~a~0 (* v_main_~x~0_29 main_~z~0)) (+ v_main_~x~0_29 (* v_main_~y~0_28 main_~az~0)))) (= main_~y~0 0) (= (+ (* (- 1) main_~a~0) main_~x~0) 0)) (and (or (and (= (mod main_~y~0 main_~z~0) 0) (= main_~az~0 0) (= 0 (+ (* (- 1) (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0)))) (and (= (mod (+ (* (- 1) (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0)) main_~az~0) 0) (not (= main_~az~0 0)) (= (* (div (+ (* (- 1) (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0)) main_~az~0) main_~z~0) main_~y~0))) (= 0 (mod (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) (not (= main_~z~0 0))))} is VALID [2022-04-15 09:14:28,979 INFO L290 TraceCheckUtils]: 15: Hoare triple {1258#(or (and (= main_~z~0 0) (exists ((v_main_~x~0_29 Int) (v_main_~y~0_28 Int)) (= (+ main_~a~0 (* v_main_~x~0_29 main_~z~0)) (+ v_main_~x~0_29 (* v_main_~y~0_28 main_~az~0)))) (= main_~y~0 0) (= (+ (* (- 1) main_~a~0) main_~x~0) 0)) (and (or (and (= (mod main_~y~0 main_~z~0) 0) (= main_~az~0 0) (= 0 (+ (* (- 1) (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0)))) (and (= (mod (+ (* (- 1) (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0)) main_~az~0) 0) (not (= main_~az~0 0)) (= (* (div (+ (* (- 1) (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0)) main_~az~0) main_~z~0) main_~y~0))) (= 0 (mod (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) (not (= main_~z~0 0))))} assume !!(#t~post7 < 10);havoc #t~post7; {1258#(or (and (= main_~z~0 0) (exists ((v_main_~x~0_29 Int) (v_main_~y~0_28 Int)) (= (+ main_~a~0 (* v_main_~x~0_29 main_~z~0)) (+ v_main_~x~0_29 (* v_main_~y~0_28 main_~az~0)))) (= main_~y~0 0) (= (+ (* (- 1) main_~a~0) main_~x~0) 0)) (and (or (and (= (mod main_~y~0 main_~z~0) 0) (= main_~az~0 0) (= 0 (+ (* (- 1) (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0)))) (and (= (mod (+ (* (- 1) (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0)) main_~az~0) 0) (not (= main_~az~0 0)) (= (* (div (+ (* (- 1) (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0)) main_~az~0) main_~z~0) main_~y~0))) (= 0 (mod (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) (not (= main_~z~0 0))))} is VALID [2022-04-15 09:14:28,980 INFO L272 TraceCheckUtils]: 16: Hoare triple {1258#(or (and (= main_~z~0 0) (exists ((v_main_~x~0_29 Int) (v_main_~y~0_28 Int)) (= (+ main_~a~0 (* v_main_~x~0_29 main_~z~0)) (+ v_main_~x~0_29 (* v_main_~y~0_28 main_~az~0)))) (= main_~y~0 0) (= (+ (* (- 1) main_~a~0) main_~x~0) 0)) (and (or (and (= (mod main_~y~0 main_~z~0) 0) (= main_~az~0 0) (= 0 (+ (* (- 1) (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0)))) (and (= (mod (+ (* (- 1) (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0)) main_~az~0) 0) (not (= main_~az~0 0)) (= (* (div (+ (* (- 1) (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0)) main_~az~0) main_~z~0) main_~y~0))) (= 0 (mod (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) (not (= main_~z~0 0))))} call __VERIFIER_assert((if 0 == ~z~0 * ~x~0 - ~x~0 + ~a~0 - ~az~0 * ~y~0 then 1 else 0)); {1211#true} is VALID [2022-04-15 09:14:28,980 INFO L290 TraceCheckUtils]: 17: Hoare triple {1211#true} ~cond := #in~cond; {1243#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 09:14:28,980 INFO L290 TraceCheckUtils]: 18: Hoare triple {1243#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {1247#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 09:14:28,981 INFO L290 TraceCheckUtils]: 19: Hoare triple {1247#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1247#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 09:14:28,983 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {1247#(not (= |__VERIFIER_assert_#in~cond| 0))} {1258#(or (and (= main_~z~0 0) (exists ((v_main_~x~0_29 Int) (v_main_~y~0_28 Int)) (= (+ main_~a~0 (* v_main_~x~0_29 main_~z~0)) (+ v_main_~x~0_29 (* v_main_~y~0_28 main_~az~0)))) (= main_~y~0 0) (= (+ (* (- 1) main_~a~0) main_~x~0) 0)) (and (or (and (= (mod main_~y~0 main_~z~0) 0) (= main_~az~0 0) (= 0 (+ (* (- 1) (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0)))) (and (= (mod (+ (* (- 1) (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0)) main_~az~0) 0) (not (= main_~az~0 0)) (= (* (div (+ (* (- 1) (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0)) main_~az~0) main_~z~0) main_~y~0))) (= 0 (mod (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) (not (= main_~z~0 0))))} #50#return; {1280#(and (or (and (or (and (= (mod main_~y~0 main_~z~0) 0) (= (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) (+ main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0)))) (and (not (= main_~az~0 0)) (= (* (div (+ (* (- 1) (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0)) main_~az~0) main_~z~0) main_~y~0))) (= 0 (mod (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) (not (= main_~z~0 0))) (and (= main_~y~0 0) (= main_~a~0 main_~x~0))) (= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0)))} is VALID [2022-04-15 09:14:30,985 WARN L290 TraceCheckUtils]: 21: Hoare triple {1280#(and (or (and (or (and (= (mod main_~y~0 main_~z~0) 0) (= (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) (+ main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0)))) (and (not (= main_~az~0 0)) (= (* (div (+ (* (- 1) (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0)) main_~az~0) main_~z~0) main_~y~0))) (= 0 (mod (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) (not (= main_~z~0 0))) (and (= main_~y~0 0) (= main_~a~0 main_~x~0))) (= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~x~0 := ~x~0 * ~z~0 + ~a~0;~y~0 := ~y~0 * ~z~0; {1284#(or (and (= main_~a~0 (+ (* main_~a~0 main_~z~0) main_~a~0)) (= main_~y~0 0) (= (+ (* (- 1) main_~a~0) main_~x~0) 0)) (and (= 0 (mod (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) (or (and (= (div (+ (* (- 1) (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0)) main_~az~0) (* main_~z~0 (div (+ (* (- 1) (div (+ (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) (* (- 1) main_~a~0)) main_~z~0)) main_~a~0 (* main_~z~0 (div (+ (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) (* (- 1) main_~a~0)) main_~z~0))) main_~az~0))) (= (mod (+ (* (- 1) (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0)) main_~az~0) 0) (not (= main_~az~0 0)) (= (* (div (+ (* (- 1) (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0)) main_~az~0) main_~z~0) main_~y~0)) (and (= (mod main_~y~0 main_~z~0) 0) (= (mod (div main_~y~0 main_~z~0) main_~z~0) 0) (= main_~az~0 0) (= 0 (+ (* (- 1) (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0))))) (not (= main_~z~0 0))))} is UNKNOWN [2022-04-15 09:14:30,988 INFO L290 TraceCheckUtils]: 22: Hoare triple {1284#(or (and (= main_~a~0 (+ (* main_~a~0 main_~z~0) main_~a~0)) (= main_~y~0 0) (= (+ (* (- 1) main_~a~0) main_~x~0) 0)) (and (= 0 (mod (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) (or (and (= (div (+ (* (- 1) (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0)) main_~az~0) (* main_~z~0 (div (+ (* (- 1) (div (+ (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) (* (- 1) main_~a~0)) main_~z~0)) main_~a~0 (* main_~z~0 (div (+ (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) (* (- 1) main_~a~0)) main_~z~0))) main_~az~0))) (= (mod (+ (* (- 1) (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0)) main_~az~0) 0) (not (= main_~az~0 0)) (= (* (div (+ (* (- 1) (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0)) main_~az~0) main_~z~0) main_~y~0)) (and (= (mod main_~y~0 main_~z~0) 0) (= (mod (div main_~y~0 main_~z~0) main_~z~0) 0) (= main_~az~0 0) (= 0 (+ (* (- 1) (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0))))) (not (= main_~z~0 0))))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {1284#(or (and (= main_~a~0 (+ (* main_~a~0 main_~z~0) main_~a~0)) (= main_~y~0 0) (= (+ (* (- 1) main_~a~0) main_~x~0) 0)) (and (= 0 (mod (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) (or (and (= (div (+ (* (- 1) (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0)) main_~az~0) (* main_~z~0 (div (+ (* (- 1) (div (+ (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) (* (- 1) main_~a~0)) main_~z~0)) main_~a~0 (* main_~z~0 (div (+ (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) (* (- 1) main_~a~0)) main_~z~0))) main_~az~0))) (= (mod (+ (* (- 1) (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0)) main_~az~0) 0) (not (= main_~az~0 0)) (= (* (div (+ (* (- 1) (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0)) main_~az~0) main_~z~0) main_~y~0)) (and (= (mod main_~y~0 main_~z~0) 0) (= (mod (div main_~y~0 main_~z~0) main_~z~0) 0) (= main_~az~0 0) (= 0 (+ (* (- 1) (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0))))) (not (= main_~z~0 0))))} is VALID [2022-04-15 09:14:30,989 INFO L290 TraceCheckUtils]: 23: Hoare triple {1284#(or (and (= main_~a~0 (+ (* main_~a~0 main_~z~0) main_~a~0)) (= main_~y~0 0) (= (+ (* (- 1) main_~a~0) main_~x~0) 0)) (and (= 0 (mod (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) (or (and (= (div (+ (* (- 1) (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0)) main_~az~0) (* main_~z~0 (div (+ (* (- 1) (div (+ (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) (* (- 1) main_~a~0)) main_~z~0)) main_~a~0 (* main_~z~0 (div (+ (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) (* (- 1) main_~a~0)) main_~z~0))) main_~az~0))) (= (mod (+ (* (- 1) (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0)) main_~az~0) 0) (not (= main_~az~0 0)) (= (* (div (+ (* (- 1) (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0)) main_~az~0) main_~z~0) main_~y~0)) (and (= (mod main_~y~0 main_~z~0) 0) (= (mod (div main_~y~0 main_~z~0) main_~z~0) 0) (= main_~az~0 0) (= 0 (+ (* (- 1) (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0))))) (not (= main_~z~0 0))))} assume !(#t~post7 < 10);havoc #t~post7; {1284#(or (and (= main_~a~0 (+ (* main_~a~0 main_~z~0) main_~a~0)) (= main_~y~0 0) (= (+ (* (- 1) main_~a~0) main_~x~0) 0)) (and (= 0 (mod (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) (or (and (= (div (+ (* (- 1) (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0)) main_~az~0) (* main_~z~0 (div (+ (* (- 1) (div (+ (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) (* (- 1) main_~a~0)) main_~z~0)) main_~a~0 (* main_~z~0 (div (+ (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) (* (- 1) main_~a~0)) main_~z~0))) main_~az~0))) (= (mod (+ (* (- 1) (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0)) main_~az~0) 0) (not (= main_~az~0 0)) (= (* (div (+ (* (- 1) (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0)) main_~az~0) main_~z~0) main_~y~0)) (and (= (mod main_~y~0 main_~z~0) 0) (= (mod (div main_~y~0 main_~z~0) main_~z~0) 0) (= main_~az~0 0) (= 0 (+ (* (- 1) (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0))))) (not (= main_~z~0 0))))} is VALID [2022-04-15 09:14:32,994 WARN L272 TraceCheckUtils]: 24: Hoare triple {1284#(or (and (= main_~a~0 (+ (* main_~a~0 main_~z~0) main_~a~0)) (= main_~y~0 0) (= (+ (* (- 1) main_~a~0) main_~x~0) 0)) (and (= 0 (mod (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) (or (and (= (div (+ (* (- 1) (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0)) main_~az~0) (* main_~z~0 (div (+ (* (- 1) (div (+ (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) (* (- 1) main_~a~0)) main_~z~0)) main_~a~0 (* main_~z~0 (div (+ (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) (* (- 1) main_~a~0)) main_~z~0))) main_~az~0))) (= (mod (+ (* (- 1) (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0)) main_~az~0) 0) (not (= main_~az~0 0)) (= (* (div (+ (* (- 1) (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0)) main_~az~0) main_~z~0) main_~y~0)) (and (= (mod main_~y~0 main_~z~0) 0) (= (mod (div main_~y~0 main_~z~0) main_~z~0) 0) (= main_~az~0 0) (= 0 (+ (* (- 1) (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0))))) (not (= main_~z~0 0))))} call __VERIFIER_assert((if 0 == ~z~0 * ~x~0 - ~x~0 + ~a~0 - ~az~0 * ~y~0 then 1 else 0)); {1294#(<= 1 |__VERIFIER_assert_#in~cond|)} is UNKNOWN [2022-04-15 09:14:32,995 INFO L290 TraceCheckUtils]: 25: Hoare triple {1294#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1298#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 09:14:33,011 INFO L290 TraceCheckUtils]: 26: Hoare triple {1298#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1212#false} is VALID [2022-04-15 09:14:33,011 INFO L290 TraceCheckUtils]: 27: Hoare triple {1212#false} assume !false; {1212#false} is VALID [2022-04-15 09:14:33,012 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 2 not checked. [2022-04-15 09:14:33,012 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 09:14:43,569 INFO L290 TraceCheckUtils]: 27: Hoare triple {1212#false} assume !false; {1212#false} is VALID [2022-04-15 09:14:43,569 INFO L290 TraceCheckUtils]: 26: Hoare triple {1298#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1212#false} is VALID [2022-04-15 09:14:43,570 INFO L290 TraceCheckUtils]: 25: Hoare triple {1294#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1298#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 09:14:43,571 INFO L272 TraceCheckUtils]: 24: Hoare triple {1254#(= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0))} call __VERIFIER_assert((if 0 == ~z~0 * ~x~0 - ~x~0 + ~a~0 - ~az~0 * ~y~0 then 1 else 0)); {1294#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 09:14:43,571 INFO L290 TraceCheckUtils]: 23: Hoare triple {1254#(= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0))} assume !(#t~post7 < 10);havoc #t~post7; {1254#(= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0))} is VALID [2022-04-15 09:14:43,572 INFO L290 TraceCheckUtils]: 22: Hoare triple {1254#(= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {1254#(= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0))} is VALID [2022-04-15 09:14:43,660 INFO L290 TraceCheckUtils]: 21: Hoare triple {1323#(= (+ (* main_~z~0 main_~x~0) main_~a~0 (* main_~az~0 (* main_~z~0 main_~y~0))) (+ main_~a~0 (* main_~z~0 (+ (* main_~z~0 main_~x~0) main_~a~0))))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~x~0 := ~x~0 * ~z~0 + ~a~0;~y~0 := ~y~0 * ~z~0; {1254#(= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0))} is VALID [2022-04-15 09:14:43,663 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {1247#(not (= |__VERIFIER_assert_#in~cond| 0))} {1211#true} #50#return; {1323#(= (+ (* main_~z~0 main_~x~0) main_~a~0 (* main_~az~0 (* main_~z~0 main_~y~0))) (+ main_~a~0 (* main_~z~0 (+ (* main_~z~0 main_~x~0) main_~a~0))))} is VALID [2022-04-15 09:14:43,663 INFO L290 TraceCheckUtils]: 19: Hoare triple {1247#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1247#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 09:14:43,664 INFO L290 TraceCheckUtils]: 18: Hoare triple {1336#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {1247#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 09:14:43,664 INFO L290 TraceCheckUtils]: 17: Hoare triple {1211#true} ~cond := #in~cond; {1336#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 09:14:43,664 INFO L272 TraceCheckUtils]: 16: Hoare triple {1211#true} call __VERIFIER_assert((if 0 == ~z~0 * ~x~0 - ~x~0 + ~a~0 - ~az~0 * ~y~0 then 1 else 0)); {1211#true} is VALID [2022-04-15 09:14:43,664 INFO L290 TraceCheckUtils]: 15: Hoare triple {1211#true} assume !!(#t~post7 < 10);havoc #t~post7; {1211#true} is VALID [2022-04-15 09:14:43,664 INFO L290 TraceCheckUtils]: 14: Hoare triple {1211#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {1211#true} is VALID [2022-04-15 09:14:43,665 INFO L290 TraceCheckUtils]: 13: Hoare triple {1211#true} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~x~0 := ~x~0 * ~z~0 + ~a~0;~y~0 := ~y~0 * ~z~0; {1211#true} is VALID [2022-04-15 09:14:43,665 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1211#true} {1211#true} #50#return; {1211#true} is VALID [2022-04-15 09:14:43,665 INFO L290 TraceCheckUtils]: 11: Hoare triple {1211#true} assume true; {1211#true} is VALID [2022-04-15 09:14:43,665 INFO L290 TraceCheckUtils]: 10: Hoare triple {1211#true} assume !(0 == ~cond); {1211#true} is VALID [2022-04-15 09:14:43,665 INFO L290 TraceCheckUtils]: 9: Hoare triple {1211#true} ~cond := #in~cond; {1211#true} is VALID [2022-04-15 09:14:43,665 INFO L272 TraceCheckUtils]: 8: Hoare triple {1211#true} call __VERIFIER_assert((if 0 == ~z~0 * ~x~0 - ~x~0 + ~a~0 - ~az~0 * ~y~0 then 1 else 0)); {1211#true} is VALID [2022-04-15 09:14:43,665 INFO L290 TraceCheckUtils]: 7: Hoare triple {1211#true} assume !!(#t~post7 < 10);havoc #t~post7; {1211#true} is VALID [2022-04-15 09:14:43,665 INFO L290 TraceCheckUtils]: 6: Hoare triple {1211#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {1211#true} is VALID [2022-04-15 09:14:43,665 INFO L290 TraceCheckUtils]: 5: Hoare triple {1211#true} havoc ~z~0;havoc ~a~0;havoc ~k~0;havoc ~x~0;havoc ~y~0;havoc ~c~0;havoc ~az~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~z~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~a~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~k~0 := #t~nondet6;havoc #t~nondet6;~x~0 := ~a~0;~y~0 := 1;~c~0 := 1;~az~0 := ~a~0 * ~z~0; {1211#true} is VALID [2022-04-15 09:14:43,665 INFO L272 TraceCheckUtils]: 4: Hoare triple {1211#true} call #t~ret8 := main(); {1211#true} is VALID [2022-04-15 09:14:43,666 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1211#true} {1211#true} #54#return; {1211#true} is VALID [2022-04-15 09:14:43,666 INFO L290 TraceCheckUtils]: 2: Hoare triple {1211#true} assume true; {1211#true} is VALID [2022-04-15 09:14:43,666 INFO L290 TraceCheckUtils]: 1: Hoare triple {1211#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1211#true} is VALID [2022-04-15 09:14:43,666 INFO L272 TraceCheckUtils]: 0: Hoare triple {1211#true} call ULTIMATE.init(); {1211#true} is VALID [2022-04-15 09:14:43,666 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 09:14:43,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 09:14:43,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565174804] [2022-04-15 09:14:43,666 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 09:14:43,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [764081526] [2022-04-15 09:14:43,666 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [764081526] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 09:14:43,667 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 09:14:43,667 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 12 [2022-04-15 09:14:43,667 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 09:14:43,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1912114482] [2022-04-15 09:14:43,667 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1912114482] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 09:14:43,667 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 09:14:43,667 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-15 09:14:43,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874370019] [2022-04-15 09:14:43,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 09:14:43,668 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.7) internal successors, (17), 7 states have internal predecessors, (17), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 28 [2022-04-15 09:14:43,668 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 09:14:43,668 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 1.7) internal successors, (17), 7 states have internal predecessors, (17), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 09:14:48,255 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 23 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-15 09:14:48,255 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-15 09:14:48,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 09:14:48,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-15 09:14:48,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=68, Unknown=2, NotChecked=34, Total=132 [2022-04-15 09:14:48,256 INFO L87 Difference]: Start difference. First operand 33 states and 35 transitions. Second operand has 10 states, 10 states have (on average 1.7) internal successors, (17), 7 states have internal predecessors, (17), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 09:14:54,509 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-04-15 09:15:28,895 WARN L232 SmtUtils]: Spent 30.15s on a formula simplification. DAG size of input: 64 DAG size of output: 49 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-15 09:15:40,784 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-04-15 09:15:46,995 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse10 (* (- 1) c_main_~a~0))) (let ((.cse13 (+ .cse10 c_main_~x~0))) (let ((.cse4 (div .cse13 c_main_~z~0))) (let ((.cse3 (* .cse4 c_main_~z~0))) (let ((.cse8 (+ .cse3 (* (- 1) .cse4) c_main_~a~0))) (let ((.cse12 (= c_main_~az~0 0)) (.cse11 (div .cse8 c_main_~az~0))) (let ((.cse5 (= (* .cse11 c_main_~z~0) c_main_~y~0)) (.cse6 (not .cse12)) (.cse2 (= (mod c_main_~y~0 c_main_~z~0) 0)) (.cse1 (= (mod .cse13 c_main_~z~0) 0)) (.cse7 (not (= c_main_~z~0 0))) (.cse0 (= c_main_~y~0 0))) (and (or (and (= c_main_~x~0 c_main_~a~0) .cse0) (and .cse1 (or (and .cse2 (= (+ .cse3 c_main_~a~0) .cse4)) (and .cse5 .cse6)) .cse7)) (or (and (or (and .cse5 .cse6 (= (mod .cse8 c_main_~az~0) 0) (= (* (div (let ((.cse9 (div (+ .cse10 .cse4) c_main_~z~0))) (+ (* .cse9 c_main_~z~0) (* (- 1) .cse9) c_main_~a~0)) c_main_~az~0) c_main_~z~0) .cse11)) (and .cse2 .cse12 (= 0 (mod (div c_main_~y~0 c_main_~z~0) c_main_~z~0)) (= .cse8 0))) .cse1 .cse7) (and (= (+ (* c_main_~a~0 c_main_~z~0) c_main_~a~0) c_main_~a~0) .cse0 (= 0 .cse13))) (= (+ (* c_main_~x~0 c_main_~z~0) c_main_~a~0) (+ (* c_main_~y~0 c_main_~az~0) c_main_~x~0)))))))))) is different from false [2022-04-15 09:15:55,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:15:55,779 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2022-04-15 09:15:55,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-15 09:15:55,779 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.7) internal successors, (17), 7 states have internal predecessors, (17), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 28 [2022-04-15 09:15:55,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 09:15:55,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.7) internal successors, (17), 7 states have internal predecessors, (17), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 09:15:55,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 32 transitions. [2022-04-15 09:15:55,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.7) internal successors, (17), 7 states have internal predecessors, (17), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 09:15:55,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 32 transitions. [2022-04-15 09:15:55,781 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 32 transitions. [2022-04-15 09:16:00,027 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 30 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-15 09:16:00,027 INFO L225 Difference]: With dead ends: 34 [2022-04-15 09:16:00,027 INFO L226 Difference]: Without dead ends: 0 [2022-04-15 09:16:00,027 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 44 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 86.6s TimeCoverageRelationStatistics Valid=48, Invalid=115, Unknown=5, NotChecked=72, Total=240 [2022-04-15 09:16:00,028 INFO L913 BasicCegarLoop]: 16 mSDtfsCounter, 15 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 3 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 31 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2022-04-15 09:16:00,028 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 89 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 47 Invalid, 2 Unknown, 31 Unchecked, 4.3s Time] [2022-04-15 09:16:00,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-15 09:16:00,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-15 09:16:00,028 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 09:16:00,028 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second 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-04-15 09:16:00,028 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second 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-04-15 09:16:00,029 INFO L87 Difference]: Start difference. First operand 0 states. Second 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-04-15 09:16:00,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:16:00,029 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 09:16:00,029 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 09:16:00,029 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:16:00,029 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:16:00,029 INFO L74 IsIncluded]: Start isIncluded. First 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) Second operand 0 states. [2022-04-15 09:16:00,029 INFO L87 Difference]: Start difference. First 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) Second operand 0 states. [2022-04-15 09:16:00,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 09:16:00,029 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 09:16:00,029 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 09:16:00,029 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:16:00,029 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 09:16:00,029 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 09:16:00,029 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 09:16:00,030 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-04-15 09:16:00,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-15 09:16:00,030 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 28 [2022-04-15 09:16:00,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 09:16:00,030 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-15 09:16:00,030 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.7) internal successors, (17), 7 states have internal predecessors, (17), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 09:16:00,030 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-15 09:16:00,030 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 09:16:00,030 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 09:16:00,030 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 09:16:00,032 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-15 09:16:00,044 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-04-15 09:16:00,237 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 09:16:00,239 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-15 09:16:32,647 WARN L232 SmtUtils]: Spent 32.36s on a formula simplification. DAG size of input: 84 DAG size of output: 68 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-04-15 09:17:22,896 WARN L232 SmtUtils]: Spent 50.23s on a formula simplification. DAG size of input: 73 DAG size of output: 51 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-04-15 09:17:46,595 WARN L232 SmtUtils]: Spent 23.69s on a formula simplification. DAG size of input: 84 DAG size of output: 70 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-04-15 09:18:47,653 WARN L232 SmtUtils]: Spent 1.02m on a formula simplification. DAG size of input: 76 DAG size of output: 53 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-04-15 09:19:49,988 WARN L232 SmtUtils]: Spent 1.04m on a formula simplification. DAG size of input: 55 DAG size of output: 51 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-04-15 09:19:50,021 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 8) no Hoare annotation was computed. [2022-04-15 09:19:50,021 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 8) no Hoare annotation was computed. [2022-04-15 09:19:50,021 INFO L882 garLoopResultBuilder]: For program point reach_errorFINAL(line 8) no Hoare annotation was computed. [2022-04-15 09:19:50,021 INFO L882 garLoopResultBuilder]: For program point assume_abort_if_notENTRY(lines 11 13) no Hoare annotation was computed. [2022-04-15 09:19:50,021 INFO L882 garLoopResultBuilder]: For program point L12(line 12) no Hoare annotation was computed. [2022-04-15 09:19:50,021 INFO L882 garLoopResultBuilder]: For program point L12-2(lines 11 13) no Hoare annotation was computed. [2022-04-15 09:19:50,021 INFO L882 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 11 13) no Hoare annotation was computed. [2022-04-15 09:19:50,021 INFO L878 garLoopResultBuilder]: At program point L34-1(lines 34 43) the Hoare annotation is: (let ((.cse1 (* main_~a~0 main_~z~0))) (let ((.cse0 (= .cse1 main_~az~0))) (or (and (<= ~counter~0 1) (= main_~y~0 1) (<= |main_#t~post7| 0) (= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0)) .cse0) (and (= .cse1 0) (= main_~y~0 0) (= main_~a~0 main_~x~0)) (not (<= |old(~counter~0)| 0)) (and (<= |main_#t~post7| 1) (= main_~z~0 main_~y~0) (= main_~x~0 (+ .cse1 main_~a~0)) .cse0) (let ((.cse6 (* (- 1) main_~a~0))) (let ((.cse2 (+ .cse6 main_~x~0))) (and (= 0 (mod .cse2 main_~z~0)) (let ((.cse5 (div .cse2 main_~z~0))) (let ((.cse9 (* .cse5 main_~z~0)) (.cse8 (= main_~az~0 0))) (or (let ((.cse7 (+ (* (- 1) .cse5) main_~a~0 .cse9))) (let ((.cse3 (div .cse7 main_~az~0))) (and (= .cse3 (* main_~z~0 (div (let ((.cse4 (div (+ .cse5 .cse6) main_~z~0))) (+ (* (- 1) .cse4) main_~a~0 (* main_~z~0 .cse4))) main_~az~0))) (= (mod .cse7 main_~az~0) 0) (not .cse8) (= (* .cse3 main_~z~0) main_~y~0)))) (and (= (mod main_~y~0 main_~z~0) 0) (= (mod (div main_~y~0 main_~z~0) main_~z~0) 0) (= .cse5 (+ main_~a~0 .cse9)) .cse8)))) (not (= main_~z~0 0)))))))) [2022-04-15 09:19:50,022 INFO L878 garLoopResultBuilder]: At program point L34-3(lines 34 43) the Hoare annotation is: (let ((.cse0 (* main_~a~0 main_~z~0))) (let ((.cse9 (= .cse0 main_~az~0))) (or (and (= .cse0 0) (= main_~y~0 0) (= main_~a~0 main_~x~0)) (not (<= |old(~counter~0)| 0)) (let ((.cse5 (* (- 1) main_~a~0))) (let ((.cse1 (+ .cse5 main_~x~0))) (and (= 0 (mod .cse1 main_~z~0)) (let ((.cse4 (div .cse1 main_~z~0))) (let ((.cse8 (* .cse4 main_~z~0)) (.cse7 (= main_~az~0 0))) (or (let ((.cse6 (+ (* (- 1) .cse4) main_~a~0 .cse8))) (let ((.cse2 (div .cse6 main_~az~0))) (and (= .cse2 (* main_~z~0 (div (let ((.cse3 (div (+ .cse4 .cse5) main_~z~0))) (+ (* (- 1) .cse3) main_~a~0 (* main_~z~0 .cse3))) main_~az~0))) (= (mod .cse6 main_~az~0) 0) (not .cse7) (= (* .cse2 main_~z~0) main_~y~0)))) (and (= (mod main_~y~0 main_~z~0) 0) (= (mod (div main_~y~0 main_~z~0) main_~z~0) 0) (= .cse4 (+ main_~a~0 .cse8)) .cse7)))) (not (= main_~z~0 0))))) (and (= main_~y~0 1) (<= ~counter~0 0) (= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0)) .cse9) (and (= main_~z~0 main_~y~0) (<= ~counter~0 1) (= main_~x~0 (+ .cse0 main_~a~0)) .cse9)))) [2022-04-15 09:19:50,022 INFO L878 garLoopResultBuilder]: At program point L34-4(lines 34 43) the Hoare annotation is: (let ((.cse5 (* main_~a~0 main_~z~0))) (let ((.cse3 (= main_~a~0 main_~x~0)) (.cse4 (= .cse5 main_~az~0))) (or (and (or (let ((.cse2 (+ (* (- 1) main_~a~0) main_~x~0))) (and (let ((.cse0 (div .cse2 main_~z~0))) (let ((.cse1 (* .cse0 main_~z~0))) (or (and (= (mod main_~y~0 main_~z~0) 0) (= .cse0 (+ main_~a~0 .cse1))) (and (not (= main_~az~0 0)) (= (* (div (+ (* (- 1) .cse0) main_~a~0 .cse1) main_~az~0) main_~z~0) main_~y~0))))) (= 0 (mod .cse2 main_~z~0)) (not (= main_~z~0 0)))) (and (= main_~y~0 0) .cse3)) (= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0))) (and (= main_~y~0 1) .cse3 .cse4) (not (<= |old(~counter~0)| 0)) (and (= main_~z~0 main_~y~0) (= main_~x~0 (+ .cse5 main_~a~0)) .cse4)))) [2022-04-15 09:19:50,022 INFO L878 garLoopResultBuilder]: At program point mainENTRY(lines 22 46) the Hoare annotation is: (or (not (<= |old(~counter~0)| 0)) (<= ~counter~0 0)) [2022-04-15 09:19:50,022 INFO L885 garLoopResultBuilder]: At program point mainEXIT(lines 22 46) the Hoare annotation is: true [2022-04-15 09:19:50,022 INFO L885 garLoopResultBuilder]: At program point mainFINAL(lines 22 46) the Hoare annotation is: true [2022-04-15 09:19:50,022 INFO L885 garLoopResultBuilder]: At program point L44(line 44) the Hoare annotation is: true [2022-04-15 09:19:50,022 INFO L878 garLoopResultBuilder]: At program point L35(line 35) the Hoare annotation is: (let ((.cse3 (= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0)))) (or (and (or (let ((.cse2 (+ (* (- 1) main_~a~0) main_~x~0))) (and (let ((.cse0 (div .cse2 main_~z~0))) (let ((.cse1 (* .cse0 main_~z~0))) (or (and (= (mod main_~y~0 main_~z~0) 0) (= .cse0 (+ main_~a~0 .cse1))) (and (not (= main_~az~0 0)) (= (* (div (+ (* (- 1) .cse0) main_~a~0 .cse1) main_~az~0) main_~z~0) main_~y~0))))) (= 0 (mod .cse2 main_~z~0)) (not (= main_~z~0 0)))) (and (= main_~y~0 0) (= main_~a~0 main_~x~0))) .cse3) (not (<= |old(~counter~0)| 0)) (and (<= ~counter~0 1) (= main_~y~0 1) .cse3 (= (* main_~a~0 main_~z~0) main_~az~0)))) [2022-04-15 09:19:50,022 INFO L878 garLoopResultBuilder]: At program point L35-1(lines 34 43) the Hoare annotation is: (let ((.cse3 (= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0)))) (or (and (or (let ((.cse2 (+ (* (- 1) main_~a~0) main_~x~0))) (and (let ((.cse0 (div .cse2 main_~z~0))) (let ((.cse1 (* .cse0 main_~z~0))) (or (and (= (mod main_~y~0 main_~z~0) 0) (= .cse0 (+ main_~a~0 .cse1))) (and (not (= main_~az~0 0)) (= (* (div (+ (* (- 1) .cse0) main_~a~0 .cse1) main_~az~0) main_~z~0) main_~y~0))))) (= 0 (mod .cse2 main_~z~0)) (not (= main_~z~0 0)))) (and (= main_~y~0 0) (= main_~a~0 main_~x~0))) .cse3) (not (<= |old(~counter~0)| 0)) (and (<= ~counter~0 1) (= main_~y~0 1) .cse3 (= (* main_~a~0 main_~z~0) main_~az~0)))) [2022-04-15 09:19:50,022 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: (<= ~counter~0 0) [2022-04-15 09:19:50,022 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2022-04-15 09:19:50,022 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: (<= ~counter~0 0) [2022-04-15 09:19:50,022 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-15 09:19:50,022 INFO L878 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: (<= ~counter~0 0) [2022-04-15 09:19:50,023 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-15 09:19:50,023 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-15 09:19:50,023 INFO L878 garLoopResultBuilder]: At program point L16(lines 16 17) the Hoare annotation is: (not (<= 1 |__VERIFIER_assert_#in~cond|)) [2022-04-15 09:19:50,023 INFO L878 garLoopResultBuilder]: At program point L15(lines 15 18) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (not (<= 1 |__VERIFIER_assert_#in~cond|))) [2022-04-15 09:19:50,023 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 14 20) the Hoare annotation is: true [2022-04-15 09:19:50,023 INFO L878 garLoopResultBuilder]: At program point L15-2(lines 14 20) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (not (<= 1 |__VERIFIER_assert_#in~cond|))) [2022-04-15 09:19:50,023 INFO L878 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 14 20) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (not (<= 1 |__VERIFIER_assert_#in~cond|))) [2022-04-15 09:19:50,023 INFO L878 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 17) the Hoare annotation is: (not (<= 1 |__VERIFIER_assert_#in~cond|)) [2022-04-15 09:19:50,025 INFO L719 BasicCegarLoop]: Path program histogram: [4, 2, 2, 2, 2] [2022-04-15 09:19:50,025 INFO L177 ceAbstractionStarter]: Computing trace abstraction results [2022-04-15 09:19:50,027 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-15 09:19:50,028 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-15 09:19:50,030 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-15 09:19:50,030 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-15 09:19:50,030 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-15 09:19:50,035 WARN L170 areAnnotationChecker]: L12-2 has no Hoare annotation [2022-04-15 09:19:54,011 INFO L163 areAnnotationChecker]: CFG has 26 edges. 25 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-15 09:19:54,035 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 09:19:54 BoogieIcfgContainer [2022-04-15 09:19:54,035 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-15 09:19:54,036 INFO L158 Benchmark]: Toolchain (without parser) took 578322.06ms. Allocated memory was 217.1MB in the beginning and 296.7MB in the end (delta: 79.7MB). Free memory was 168.3MB in the beginning and 258.0MB in the end (delta: -89.7MB). Peak memory consumption was 146.5MB. Max. memory is 8.0GB. [2022-04-15 09:19:54,036 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 217.1MB. Free memory is still 184.3MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 09:19:54,036 INFO L158 Benchmark]: CACSL2BoogieTranslator took 220.54ms. Allocated memory is still 217.1MB. Free memory was 168.0MB in the beginning and 192.7MB in the end (delta: -24.7MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-15 09:19:54,037 INFO L158 Benchmark]: Boogie Preprocessor took 31.75ms. Allocated memory is still 217.1MB. Free memory was 192.6MB in the beginning and 191.1MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-15 09:19:54,037 INFO L158 Benchmark]: RCFGBuilder took 228.92ms. Allocated memory is still 217.1MB. Free memory was 191.1MB in the beginning and 180.2MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-15 09:19:54,037 INFO L158 Benchmark]: TraceAbstraction took 577831.50ms. Allocated memory was 217.1MB in the beginning and 296.7MB in the end (delta: 79.7MB). Free memory was 179.6MB in the beginning and 258.0MB in the end (delta: -78.4MB). Peak memory consumption was 157.5MB. Max. memory is 8.0GB. [2022-04-15 09:19:54,038 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 217.1MB. Free memory is still 184.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 220.54ms. Allocated memory is still 217.1MB. Free memory was 168.0MB in the beginning and 192.7MB in the end (delta: -24.7MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 31.75ms. Allocated memory is still 217.1MB. Free memory was 192.6MB in the beginning and 191.1MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 228.92ms. Allocated memory is still 217.1MB. Free memory was 191.1MB in the beginning and 180.2MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 577831.50ms. Allocated memory was 217.1MB in the beginning and 296.7MB in the end (delta: 79.7MB). Free memory was 179.6MB in the beginning and 258.0MB in the end (delta: -78.4MB). Peak memory consumption was 157.5MB. 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: 17]: 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, 29 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 573.8s, OverallIterations: 6, TraceHistogramMax: 3, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 73.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 229.8s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 2 mSolverCounterUnknown, 38 SdHoareTripleChecker+Valid, 4.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 36 mSDsluCounter, 345 SdHoareTripleChecker+Invalid, 4.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 31 IncrementalHoareTripleChecker+Unchecked, 237 mSDsCounter, 12 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 143 IncrementalHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 108 mSDtfsCounter, 143 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 175 GetRequests, 133 SyntacticMatches, 4 SemanticMatches, 38 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 86.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=33occurred in iteration=5, InterpolantAutomatonStates: 36, 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, 6 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 22 LocationsWithAnnotation, 82 PreInvPairs, 133 NumberOfFragments, 868 HoareAnnotationTreeSize, 82 FomulaSimplifications, 10 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 22 FomulaSimplificationsInter, 924 FormulaSimplificationTreeSizeReductionInter, 229.7s 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: 34]: Loop Invariant Derived loop invariant: (((((a * z == 0 && y == 0) && a == x) || !(\old(counter) <= 0)) || ((0 == (-1 * a + x) % z && (((((-1 * ((-1 * a + x) / z) + a + (-1 * a + x) / z * z) / az == z * ((-1 * (((-1 * a + x) / z + -1 * a) / z) + a + z * (((-1 * a + x) / z + -1 * a) / z)) / az) && (-1 * ((-1 * a + x) / z) + a + (-1 * a + x) / z * z) % az == 0) && !(az == 0)) && (-1 * ((-1 * a + x) / z) + a + (-1 * a + x) / z * z) / az * z == y) || (((y % z == 0 && y / z % z == 0) && (-1 * a + x) / z == a + (-1 * a + x) / z * z) && az == 0))) && !(z == 0))) || (((y == 1 && counter <= 0) && y * az + x == z * x + a) && a * z == az)) || (((z == y && counter <= 1) && x == a * z + a) && a * z == az) - ProcedureContractResult [Line: 22]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 14]: 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-04-15 09:19:54,110 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...