/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/prod4br-ll_valuebound5.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 07:22:31,453 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 07:22:31,454 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 07:22:31,512 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 07:22:31,512 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 07:22:31,512 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 07:22:31,513 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 07:22:31,515 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 07:22:31,516 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 07:22:31,522 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 07:22:31,523 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 07:22:31,525 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 07:22:31,525 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 07:22:31,527 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 07:22:31,527 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 07:22:31,529 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 07:22:31,529 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 07:22:31,530 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 07:22:31,534 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 07:22:31,535 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 07:22:31,535 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 07:22:31,539 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 07:22:31,539 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 07:22:31,540 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 07:22:31,540 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 07:22:31,542 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 07:22:31,542 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 07:22:31,546 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 07:22:31,547 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 07:22:31,547 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 07:22:31,548 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 07:22:31,548 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 07:22:31,548 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 07:22:31,549 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 07:22:31,549 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 07:22:31,550 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 07:22:31,550 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 07:22:31,550 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 07:22:31,550 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 07:22:31,550 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 07:22:31,551 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 07:22:31,553 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 07:22:31,554 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-28 07:22:31,563 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 07:22:31,564 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 07:22:31,565 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 07:22:31,565 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-28 07:22:31,565 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 07:22:31,565 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-28 07:22:31,565 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 07:22:31,565 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 07:22:31,565 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 07:22:31,566 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 07:22:31,566 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-28 07:22:31,566 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 07:22:31,566 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 07:22:31,566 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 07:22:31,566 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 07:22:31,566 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 07:22:31,566 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 07:22:31,567 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 07:22:31,567 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 07:22:31,567 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 07:22:31,567 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 07:22:31,567 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 07:22:31,567 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 07:22:31,567 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 07:22:31,567 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-28 07:22:31,567 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-28 07:22:31,753 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 07:22:31,768 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 07:22:31,770 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 07:22:31,770 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 07:22:31,771 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 07:22:31,772 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/prod4br-ll_valuebound5.c [2022-04-28 07:22:31,811 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/23fa3dcfd/bb0bbff9938042268a3f068fc68b252a/FLAG0979ce37f [2022-04-28 07:22:32,167 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 07:22:32,168 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/prod4br-ll_valuebound5.c [2022-04-28 07:22:32,172 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/23fa3dcfd/bb0bbff9938042268a3f068fc68b252a/FLAG0979ce37f [2022-04-28 07:22:32,181 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/23fa3dcfd/bb0bbff9938042268a3f068fc68b252a [2022-04-28 07:22:32,183 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 07:22:32,185 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 07:22:32,186 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 07:22:32,186 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 07:22:32,189 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 07:22:32,190 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 07:22:32" (1/1) ... [2022-04-28 07:22:32,190 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@165c4656 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:22:32, skipping insertion in model container [2022-04-28 07:22:32,191 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 07:22:32" (1/1) ... [2022-04-28 07:22:32,195 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 07:22:32,205 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 07:22:32,304 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/prod4br-ll_valuebound5.c[524,537] [2022-04-28 07:22:32,316 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 07:22:32,321 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 07:22:32,332 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/prod4br-ll_valuebound5.c[524,537] [2022-04-28 07:22:32,339 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 07:22:32,347 INFO L208 MainTranslator]: Completed translation [2022-04-28 07:22:32,347 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:22:32 WrapperNode [2022-04-28 07:22:32,347 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 07:22:32,348 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 07:22:32,348 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 07:22:32,348 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 07:22:32,354 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:22:32" (1/1) ... [2022-04-28 07:22:32,355 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:22:32" (1/1) ... [2022-04-28 07:22:32,358 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:22:32" (1/1) ... [2022-04-28 07:22:32,359 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:22:32" (1/1) ... [2022-04-28 07:22:32,363 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:22:32" (1/1) ... [2022-04-28 07:22:32,365 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:22:32" (1/1) ... [2022-04-28 07:22:32,366 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:22:32" (1/1) ... [2022-04-28 07:22:32,367 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 07:22:32,368 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 07:22:32,368 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 07:22:32,368 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 07:22:32,368 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:22:32" (1/1) ... [2022-04-28 07:22:32,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 07:22:32,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:22:32,402 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-28 07:22:32,429 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 07:22:32,429 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 07:22:32,429 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 07:22:32,430 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-28 07:22:32,430 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 07:22:32,430 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 07:22:32,430 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 07:22:32,430 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 07:22:32,430 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 07:22:32,430 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 07:22:32,430 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-28 07:22:32,430 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-28 07:22:32,431 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 07:22:32,431 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 07:22:32,431 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 07:22:32,431 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 07:22:32,432 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 07:22:32,432 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 07:22:32,432 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 07:22:32,432 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 07:22:32,410 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-28 07:22:32,476 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 07:22:32,477 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 07:22:32,697 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 07:22:32,702 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 07:22:32,702 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 07:22:32,703 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 07:22:32 BoogieIcfgContainer [2022-04-28 07:22:32,703 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 07:22:32,704 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 07:22:32,705 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 07:22:32,721 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 07:22:32,721 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 07:22:32" (1/3) ... [2022-04-28 07:22:32,722 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7488b870 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 07:22:32, skipping insertion in model container [2022-04-28 07:22:32,722 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 07:22:32" (2/3) ... [2022-04-28 07:22:32,722 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7488b870 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 07:22:32, skipping insertion in model container [2022-04-28 07:22:32,722 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 07:22:32" (3/3) ... [2022-04-28 07:22:32,723 INFO L111 eAbstractionObserver]: Analyzing ICFG prod4br-ll_valuebound5.c [2022-04-28 07:22:32,732 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 07:22:32,732 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 07:22:32,784 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 07:22:32,793 INFO L357 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@119b1457, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@73be373c [2022-04-28 07:22:32,794 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 07:22:32,807 INFO L276 IsEmpty]: Start isEmpty. Operand has 34 states, 20 states have (on average 1.45) internal successors, (29), 21 states have internal predecessors, (29), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 07:22:32,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-28 07:22:32,812 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:22:32,812 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 07:22:32,812 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:22:32,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:22:32,818 INFO L85 PathProgramCache]: Analyzing trace with hash 1738134960, now seen corresponding path program 1 times [2022-04-28 07:22:32,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:22:32,823 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1263651730] [2022-04-28 07:22:32,836 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 07:22:32,836 INFO L85 PathProgramCache]: Analyzing trace with hash 1738134960, now seen corresponding path program 2 times [2022-04-28 07:22:32,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:22:32,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140955377] [2022-04-28 07:22:32,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:22:32,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:22:32,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:22:32,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 07:22:32,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:22:33,000 INFO L290 TraceCheckUtils]: 0: Hoare triple {54#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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(13, 2);call #Ultimate.allocInit(12, 3); {37#true} is VALID [2022-04-28 07:22:33,000 INFO L290 TraceCheckUtils]: 1: Hoare triple {37#true} assume true; {37#true} is VALID [2022-04-28 07:22:33,000 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {37#true} {37#true} #83#return; {37#true} is VALID [2022-04-28 07:22:33,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-28 07:22:33,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:22:33,020 INFO L290 TraceCheckUtils]: 0: Hoare triple {37#true} ~cond := #in~cond; {37#true} is VALID [2022-04-28 07:22:33,020 INFO L290 TraceCheckUtils]: 1: Hoare triple {37#true} assume 0 == ~cond;assume false; {38#false} is VALID [2022-04-28 07:22:33,020 INFO L290 TraceCheckUtils]: 2: Hoare triple {38#false} assume true; {38#false} is VALID [2022-04-28 07:22:33,021 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38#false} {37#true} #71#return; {38#false} is VALID [2022-04-28 07:22:33,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-28 07:22:33,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:22:33,029 INFO L290 TraceCheckUtils]: 0: Hoare triple {37#true} ~cond := #in~cond; {37#true} is VALID [2022-04-28 07:22:33,030 INFO L290 TraceCheckUtils]: 1: Hoare triple {37#true} assume 0 == ~cond;assume false; {38#false} is VALID [2022-04-28 07:22:33,030 INFO L290 TraceCheckUtils]: 2: Hoare triple {38#false} assume true; {38#false} is VALID [2022-04-28 07:22:33,031 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38#false} {38#false} #73#return; {38#false} is VALID [2022-04-28 07:22:33,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-28 07:22:33,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:22:33,037 INFO L290 TraceCheckUtils]: 0: Hoare triple {37#true} ~cond := #in~cond; {37#true} is VALID [2022-04-28 07:22:33,038 INFO L290 TraceCheckUtils]: 1: Hoare triple {37#true} assume 0 == ~cond;assume false; {38#false} is VALID [2022-04-28 07:22:33,038 INFO L290 TraceCheckUtils]: 2: Hoare triple {38#false} assume true; {38#false} is VALID [2022-04-28 07:22:33,038 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38#false} {38#false} #75#return; {38#false} is VALID [2022-04-28 07:22:33,039 INFO L272 TraceCheckUtils]: 0: Hoare triple {37#true} call ULTIMATE.init(); {54#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 07:22:33,039 INFO L290 TraceCheckUtils]: 1: Hoare triple {54#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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(13, 2);call #Ultimate.allocInit(12, 3); {37#true} is VALID [2022-04-28 07:22:33,039 INFO L290 TraceCheckUtils]: 2: Hoare triple {37#true} assume true; {37#true} is VALID [2022-04-28 07:22:33,040 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37#true} {37#true} #83#return; {37#true} is VALID [2022-04-28 07:22:33,040 INFO L272 TraceCheckUtils]: 4: Hoare triple {37#true} call #t~ret6 := main(); {37#true} is VALID [2022-04-28 07:22:33,040 INFO L290 TraceCheckUtils]: 5: Hoare triple {37#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {37#true} is VALID [2022-04-28 07:22:33,040 INFO L272 TraceCheckUtils]: 6: Hoare triple {37#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 5 then 1 else 0)); {37#true} is VALID [2022-04-28 07:22:33,041 INFO L290 TraceCheckUtils]: 7: Hoare triple {37#true} ~cond := #in~cond; {37#true} is VALID [2022-04-28 07:22:33,041 INFO L290 TraceCheckUtils]: 8: Hoare triple {37#true} assume 0 == ~cond;assume false; {38#false} is VALID [2022-04-28 07:22:33,041 INFO L290 TraceCheckUtils]: 9: Hoare triple {38#false} assume true; {38#false} is VALID [2022-04-28 07:22:33,041 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {38#false} {37#true} #71#return; {38#false} is VALID [2022-04-28 07:22:33,041 INFO L290 TraceCheckUtils]: 11: Hoare triple {38#false} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {38#false} is VALID [2022-04-28 07:22:33,042 INFO L272 TraceCheckUtils]: 12: Hoare triple {38#false} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 5 then 1 else 0)); {37#true} is VALID [2022-04-28 07:22:33,042 INFO L290 TraceCheckUtils]: 13: Hoare triple {37#true} ~cond := #in~cond; {37#true} is VALID [2022-04-28 07:22:33,042 INFO L290 TraceCheckUtils]: 14: Hoare triple {37#true} assume 0 == ~cond;assume false; {38#false} is VALID [2022-04-28 07:22:33,043 INFO L290 TraceCheckUtils]: 15: Hoare triple {38#false} assume true; {38#false} is VALID [2022-04-28 07:22:33,043 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {38#false} {38#false} #73#return; {38#false} is VALID [2022-04-28 07:22:33,043 INFO L272 TraceCheckUtils]: 17: Hoare triple {38#false} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {37#true} is VALID [2022-04-28 07:22:33,043 INFO L290 TraceCheckUtils]: 18: Hoare triple {37#true} ~cond := #in~cond; {37#true} is VALID [2022-04-28 07:22:33,044 INFO L290 TraceCheckUtils]: 19: Hoare triple {37#true} assume 0 == ~cond;assume false; {38#false} is VALID [2022-04-28 07:22:33,044 INFO L290 TraceCheckUtils]: 20: Hoare triple {38#false} assume true; {38#false} is VALID [2022-04-28 07:22:33,045 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {38#false} {38#false} #75#return; {38#false} is VALID [2022-04-28 07:22:33,045 INFO L290 TraceCheckUtils]: 22: Hoare triple {38#false} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {38#false} is VALID [2022-04-28 07:22:33,046 INFO L290 TraceCheckUtils]: 23: Hoare triple {38#false} assume !true; {38#false} is VALID [2022-04-28 07:22:33,046 INFO L272 TraceCheckUtils]: 24: Hoare triple {38#false} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {38#false} is VALID [2022-04-28 07:22:33,046 INFO L290 TraceCheckUtils]: 25: Hoare triple {38#false} ~cond := #in~cond; {38#false} is VALID [2022-04-28 07:22:33,046 INFO L290 TraceCheckUtils]: 26: Hoare triple {38#false} assume 0 == ~cond; {38#false} is VALID [2022-04-28 07:22:33,046 INFO L290 TraceCheckUtils]: 27: Hoare triple {38#false} assume !false; {38#false} is VALID [2022-04-28 07:22:33,047 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-28 07:22:33,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:22:33,048 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140955377] [2022-04-28 07:22:33,048 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140955377] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:22:33,048 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:22:33,048 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 07:22:33,051 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:22:33,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1263651730] [2022-04-28 07:22:33,051 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1263651730] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:22:33,051 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:22:33,051 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 07:22:33,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117203919] [2022-04-28 07:22:33,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:22:33,056 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 28 [2022-04-28 07:22:33,057 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:22:33,060 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 07:22:33,088 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:22:33,089 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 07:22:33,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:22:33,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 07:22:33,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 07:22:33,108 INFO L87 Difference]: Start difference. First operand has 34 states, 20 states have (on average 1.45) internal successors, (29), 21 states have internal predecessors, (29), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 07:22:33,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:22:33,238 INFO L93 Difference]: Finished difference Result 61 states and 88 transitions. [2022-04-28 07:22:33,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 07:22:33,238 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 28 [2022-04-28 07:22:33,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:22:33,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 07:22:33,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 88 transitions. [2022-04-28 07:22:33,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 07:22:33,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 88 transitions. [2022-04-28 07:22:33,255 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 88 transitions. [2022-04-28 07:22:33,341 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:22:33,348 INFO L225 Difference]: With dead ends: 61 [2022-04-28 07:22:33,348 INFO L226 Difference]: Without dead ends: 29 [2022-04-28 07:22:33,351 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 07:22:33,355 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 22 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 07:22:33,356 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 38 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 07:22:33,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-04-28 07:22:33,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-04-28 07:22:33,381 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:22:33,382 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 29 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 18 states have internal predecessors, (22), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 07:22:33,383 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 29 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 18 states have internal predecessors, (22), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 07:22:33,383 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 29 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 18 states have internal predecessors, (22), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 07:22:33,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:22:33,388 INFO L93 Difference]: Finished difference Result 29 states and 36 transitions. [2022-04-28 07:22:33,388 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2022-04-28 07:22:33,389 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:22:33,389 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:22:33,389 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 18 states have internal predecessors, (22), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 29 states. [2022-04-28 07:22:33,390 INFO L87 Difference]: Start difference. First operand has 29 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 18 states have internal predecessors, (22), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 29 states. [2022-04-28 07:22:33,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:22:33,400 INFO L93 Difference]: Finished difference Result 29 states and 36 transitions. [2022-04-28 07:22:33,400 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2022-04-28 07:22:33,401 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:22:33,401 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:22:33,401 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:22:33,401 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:22:33,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 18 states have internal predecessors, (22), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 07:22:33,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2022-04-28 07:22:33,405 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 36 transitions. Word has length 28 [2022-04-28 07:22:33,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:22:33,405 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 36 transitions. [2022-04-28 07:22:33,406 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 07:22:33,406 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 36 transitions. [2022-04-28 07:22:33,440 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-28 07:22:33,440 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2022-04-28 07:22:33,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-28 07:22:33,441 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:22:33,441 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 07:22:33,441 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 07:22:33,441 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:22:33,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:22:33,442 INFO L85 PathProgramCache]: Analyzing trace with hash 567203544, now seen corresponding path program 1 times [2022-04-28 07:22:33,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:22:33,443 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [652865870] [2022-04-28 07:22:33,443 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 07:22:33,443 INFO L85 PathProgramCache]: Analyzing trace with hash 567203544, now seen corresponding path program 2 times [2022-04-28 07:22:33,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:22:33,446 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884877756] [2022-04-28 07:22:33,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:22:33,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:22:33,478 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:22:33,479 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1758175356] [2022-04-28 07:22:33,479 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 07:22:33,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:22:33,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:22:33,482 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-28 07:22:33,483 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-28 07:22:33,521 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-28 07:22:33,522 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:22:33,523 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-28 07:22:33,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:22:33,549 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:22:33,718 INFO L272 TraceCheckUtils]: 0: Hoare triple {295#true} call ULTIMATE.init(); {295#true} is VALID [2022-04-28 07:22:33,718 INFO L290 TraceCheckUtils]: 1: Hoare triple {295#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(13, 2);call #Ultimate.allocInit(12, 3); {295#true} is VALID [2022-04-28 07:22:33,718 INFO L290 TraceCheckUtils]: 2: Hoare triple {295#true} assume true; {295#true} is VALID [2022-04-28 07:22:33,719 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {295#true} {295#true} #83#return; {295#true} is VALID [2022-04-28 07:22:33,719 INFO L272 TraceCheckUtils]: 4: Hoare triple {295#true} call #t~ret6 := main(); {295#true} is VALID [2022-04-28 07:22:33,722 INFO L290 TraceCheckUtils]: 5: Hoare triple {295#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {295#true} is VALID [2022-04-28 07:22:33,722 INFO L272 TraceCheckUtils]: 6: Hoare triple {295#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 5 then 1 else 0)); {295#true} is VALID [2022-04-28 07:22:33,722 INFO L290 TraceCheckUtils]: 7: Hoare triple {295#true} ~cond := #in~cond; {295#true} is VALID [2022-04-28 07:22:33,722 INFO L290 TraceCheckUtils]: 8: Hoare triple {295#true} assume !(0 == ~cond); {295#true} is VALID [2022-04-28 07:22:33,722 INFO L290 TraceCheckUtils]: 9: Hoare triple {295#true} assume true; {295#true} is VALID [2022-04-28 07:22:33,723 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {295#true} {295#true} #71#return; {295#true} is VALID [2022-04-28 07:22:33,723 INFO L290 TraceCheckUtils]: 11: Hoare triple {295#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {295#true} is VALID [2022-04-28 07:22:33,724 INFO L272 TraceCheckUtils]: 12: Hoare triple {295#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 5 then 1 else 0)); {295#true} is VALID [2022-04-28 07:22:33,725 INFO L290 TraceCheckUtils]: 13: Hoare triple {295#true} ~cond := #in~cond; {295#true} is VALID [2022-04-28 07:22:33,725 INFO L290 TraceCheckUtils]: 14: Hoare triple {295#true} assume !(0 == ~cond); {295#true} is VALID [2022-04-28 07:22:33,725 INFO L290 TraceCheckUtils]: 15: Hoare triple {295#true} assume true; {295#true} is VALID [2022-04-28 07:22:33,725 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {295#true} {295#true} #73#return; {295#true} is VALID [2022-04-28 07:22:33,725 INFO L272 TraceCheckUtils]: 17: Hoare triple {295#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {295#true} is VALID [2022-04-28 07:22:33,725 INFO L290 TraceCheckUtils]: 18: Hoare triple {295#true} ~cond := #in~cond; {295#true} is VALID [2022-04-28 07:22:33,725 INFO L290 TraceCheckUtils]: 19: Hoare triple {295#true} assume !(0 == ~cond); {295#true} is VALID [2022-04-28 07:22:33,726 INFO L290 TraceCheckUtils]: 20: Hoare triple {295#true} assume true; {295#true} is VALID [2022-04-28 07:22:33,726 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {295#true} {295#true} #75#return; {295#true} is VALID [2022-04-28 07:22:33,726 INFO L290 TraceCheckUtils]: 22: Hoare triple {295#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {366#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 07:22:33,727 INFO L290 TraceCheckUtils]: 23: Hoare triple {366#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !false; {366#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 07:22:33,728 INFO L272 TraceCheckUtils]: 24: Hoare triple {366#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {373#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 07:22:33,728 INFO L290 TraceCheckUtils]: 25: Hoare triple {373#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {377#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:22:33,729 INFO L290 TraceCheckUtils]: 26: Hoare triple {377#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {296#false} is VALID [2022-04-28 07:22:33,729 INFO L290 TraceCheckUtils]: 27: Hoare triple {296#false} assume !false; {296#false} is VALID [2022-04-28 07:22:33,730 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-28 07:22:33,730 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 07:22:33,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:22:33,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884877756] [2022-04-28 07:22:33,730 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:22:33,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1758175356] [2022-04-28 07:22:33,731 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1758175356] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:22:33,731 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:22:33,731 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 07:22:33,732 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:22:33,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [652865870] [2022-04-28 07:22:33,732 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [652865870] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:22:33,732 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:22:33,732 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 07:22:33,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040436316] [2022-04-28 07:22:33,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:22:33,733 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 28 [2022-04-28 07:22:33,733 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:22:33,734 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-28 07:22:33,749 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:22:33,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 07:22:33,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:22:33,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 07:22:33,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 07:22:33,751 INFO L87 Difference]: Start difference. First operand 29 states and 36 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-28 07:22:33,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:22:33,920 INFO L93 Difference]: Finished difference Result 43 states and 55 transitions. [2022-04-28 07:22:33,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 07:22:33,920 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 28 [2022-04-28 07:22:33,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:22:33,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-28 07:22:33,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 55 transitions. [2022-04-28 07:22:33,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-28 07:22:33,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 55 transitions. [2022-04-28 07:22:33,927 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 55 transitions. [2022-04-28 07:22:33,987 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:22:33,991 INFO L225 Difference]: With dead ends: 43 [2022-04-28 07:22:33,991 INFO L226 Difference]: Without dead ends: 41 [2022-04-28 07:22:33,994 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 24 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-28 07:22:33,995 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 9 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 07:22:33,995 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 92 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 07:22:33,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-04-28 07:22:34,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 35. [2022-04-28 07:22:34,007 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:22:34,007 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand has 35 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 23 states have internal predecessors, (26), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 07:22:34,007 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand has 35 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 23 states have internal predecessors, (26), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 07:22:34,008 INFO L87 Difference]: Start difference. First operand 41 states. Second operand has 35 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 23 states have internal predecessors, (26), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 07:22:34,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:22:34,010 INFO L93 Difference]: Finished difference Result 41 states and 53 transitions. [2022-04-28 07:22:34,010 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 53 transitions. [2022-04-28 07:22:34,010 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:22:34,010 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:22:34,011 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 23 states have internal predecessors, (26), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) Second operand 41 states. [2022-04-28 07:22:34,011 INFO L87 Difference]: Start difference. First operand has 35 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 23 states have internal predecessors, (26), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) Second operand 41 states. [2022-04-28 07:22:34,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:22:34,013 INFO L93 Difference]: Finished difference Result 41 states and 53 transitions. [2022-04-28 07:22:34,013 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 53 transitions. [2022-04-28 07:22:34,014 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:22:34,014 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:22:34,014 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:22:34,014 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:22:34,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 23 states have internal predecessors, (26), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 07:22:34,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 42 transitions. [2022-04-28 07:22:34,016 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 42 transitions. Word has length 28 [2022-04-28 07:22:34,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:22:34,016 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 42 transitions. [2022-04-28 07:22:34,016 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-28 07:22:34,016 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 42 transitions. [2022-04-28 07:22:34,055 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:22:34,055 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 42 transitions. [2022-04-28 07:22:34,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-28 07:22:34,056 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:22:34,056 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 07:22:34,077 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-28 07:22:34,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:22:34,272 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:22:34,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:22:34,272 INFO L85 PathProgramCache]: Analyzing trace with hash -1139707498, now seen corresponding path program 1 times [2022-04-28 07:22:34,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:22:34,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1477261960] [2022-04-28 07:22:34,273 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 07:22:34,273 INFO L85 PathProgramCache]: Analyzing trace with hash -1139707498, now seen corresponding path program 2 times [2022-04-28 07:22:34,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:22:34,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196793405] [2022-04-28 07:22:34,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:22:34,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:22:34,285 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:22:34,286 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [645966025] [2022-04-28 07:22:34,286 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 07:22:34,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:22:34,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:22:34,287 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-28 07:22:34,297 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-28 07:22:34,333 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 07:22:34,333 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:22:34,334 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-28 07:22:34,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:22:34,352 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:22:44,114 INFO L272 TraceCheckUtils]: 0: Hoare triple {623#true} call ULTIMATE.init(); {623#true} is VALID [2022-04-28 07:22:44,115 INFO L290 TraceCheckUtils]: 1: Hoare triple {623#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(13, 2);call #Ultimate.allocInit(12, 3); {623#true} is VALID [2022-04-28 07:22:44,115 INFO L290 TraceCheckUtils]: 2: Hoare triple {623#true} assume true; {623#true} is VALID [2022-04-28 07:22:44,115 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {623#true} {623#true} #83#return; {623#true} is VALID [2022-04-28 07:22:44,115 INFO L272 TraceCheckUtils]: 4: Hoare triple {623#true} call #t~ret6 := main(); {623#true} is VALID [2022-04-28 07:22:44,115 INFO L290 TraceCheckUtils]: 5: Hoare triple {623#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {623#true} is VALID [2022-04-28 07:22:44,115 INFO L272 TraceCheckUtils]: 6: Hoare triple {623#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 5 then 1 else 0)); {623#true} is VALID [2022-04-28 07:22:44,116 INFO L290 TraceCheckUtils]: 7: Hoare triple {623#true} ~cond := #in~cond; {649#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 07:22:44,116 INFO L290 TraceCheckUtils]: 8: Hoare triple {649#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {653#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 07:22:44,116 INFO L290 TraceCheckUtils]: 9: Hoare triple {653#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {653#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 07:22:44,117 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {653#(not (= |assume_abort_if_not_#in~cond| 0))} {623#true} #71#return; {660#(and (<= 0 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-28 07:22:44,117 INFO L290 TraceCheckUtils]: 11: Hoare triple {660#(and (<= 0 main_~x~0) (<= main_~x~0 5))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {660#(and (<= 0 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-28 07:22:44,117 INFO L272 TraceCheckUtils]: 12: Hoare triple {660#(and (<= 0 main_~x~0) (<= main_~x~0 5))} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 5 then 1 else 0)); {623#true} is VALID [2022-04-28 07:22:44,118 INFO L290 TraceCheckUtils]: 13: Hoare triple {623#true} ~cond := #in~cond; {623#true} is VALID [2022-04-28 07:22:44,118 INFO L290 TraceCheckUtils]: 14: Hoare triple {623#true} assume !(0 == ~cond); {623#true} is VALID [2022-04-28 07:22:44,118 INFO L290 TraceCheckUtils]: 15: Hoare triple {623#true} assume true; {623#true} is VALID [2022-04-28 07:22:44,118 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {623#true} {660#(and (<= 0 main_~x~0) (<= main_~x~0 5))} #73#return; {660#(and (<= 0 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-28 07:22:44,118 INFO L272 TraceCheckUtils]: 17: Hoare triple {660#(and (<= 0 main_~x~0) (<= main_~x~0 5))} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {623#true} is VALID [2022-04-28 07:22:44,119 INFO L290 TraceCheckUtils]: 18: Hoare triple {623#true} ~cond := #in~cond; {649#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 07:22:44,119 INFO L290 TraceCheckUtils]: 19: Hoare triple {649#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {653#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 07:22:44,119 INFO L290 TraceCheckUtils]: 20: Hoare triple {653#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {653#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 07:22:44,120 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {653#(not (= |assume_abort_if_not_#in~cond| 0))} {660#(and (<= 0 main_~x~0) (<= main_~x~0 5))} #75#return; {694#(and (<= 0 main_~x~0) (<= main_~x~0 5) (<= 1 main_~y~0))} is VALID [2022-04-28 07:22:44,120 INFO L290 TraceCheckUtils]: 22: Hoare triple {694#(and (<= 0 main_~x~0) (<= main_~x~0 5) (<= 1 main_~y~0))} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {698#(and (<= 0 main_~x~0) (<= main_~x~0 5) (<= main_~y~0 main_~b~0) (<= main_~x~0 main_~a~0) (<= 1 main_~y~0))} is VALID [2022-04-28 07:22:44,121 INFO L290 TraceCheckUtils]: 23: Hoare triple {698#(and (<= 0 main_~x~0) (<= main_~x~0 5) (<= main_~y~0 main_~b~0) (<= main_~x~0 main_~a~0) (<= 1 main_~y~0))} assume !false; {698#(and (<= 0 main_~x~0) (<= main_~x~0 5) (<= main_~y~0 main_~b~0) (<= main_~x~0 main_~a~0) (<= 1 main_~y~0))} is VALID [2022-04-28 07:22:44,121 INFO L272 TraceCheckUtils]: 24: Hoare triple {698#(and (<= 0 main_~x~0) (<= main_~x~0 5) (<= main_~y~0 main_~b~0) (<= main_~x~0 main_~a~0) (<= 1 main_~y~0))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {623#true} is VALID [2022-04-28 07:22:44,121 INFO L290 TraceCheckUtils]: 25: Hoare triple {623#true} ~cond := #in~cond; {708#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:22:44,122 INFO L290 TraceCheckUtils]: 26: Hoare triple {708#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {712#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 07:22:44,122 INFO L290 TraceCheckUtils]: 27: Hoare triple {712#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {712#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 07:22:46,131 WARN L284 TraceCheckUtils]: 28: Hoare quadruple {712#(not (= |__VERIFIER_assert_#in~cond| 0))} {698#(and (<= 0 main_~x~0) (<= main_~x~0 5) (<= main_~y~0 main_~b~0) (<= main_~x~0 main_~a~0) (<= 1 main_~y~0))} #77#return; {719#(and (<= 0 main_~x~0) (or (and (= (mod (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) (* main_~b~0 main_~a~0)) 0) (not (= main_~a~0 0))) (= (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) 0)) (<= main_~x~0 5) (<= main_~y~0 main_~b~0) (<= main_~x~0 main_~a~0) (<= 1 main_~y~0))} is UNKNOWN [2022-04-28 07:22:46,132 INFO L290 TraceCheckUtils]: 29: Hoare triple {719#(and (<= 0 main_~x~0) (or (and (= (mod (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) (* main_~b~0 main_~a~0)) 0) (not (= main_~a~0 0))) (= (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) 0)) (<= main_~x~0 5) (<= main_~y~0 main_~b~0) (<= main_~x~0 main_~a~0) (<= 1 main_~y~0))} assume !(0 != ~a~0 && 0 != ~b~0); {723#(and (<= main_~x~0 0) (<= 0 main_~x~0) (= main_~q~0 (* main_~y~0 main_~x~0)) (<= 1 main_~y~0))} is VALID [2022-04-28 07:22:46,134 INFO L272 TraceCheckUtils]: 30: Hoare triple {723#(and (<= main_~x~0 0) (<= 0 main_~x~0) (= main_~q~0 (* main_~y~0 main_~x~0)) (<= 1 main_~y~0))} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {727#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 07:22:46,136 INFO L290 TraceCheckUtils]: 31: Hoare triple {727#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {731#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:22:46,136 INFO L290 TraceCheckUtils]: 32: Hoare triple {731#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {624#false} is VALID [2022-04-28 07:22:46,137 INFO L290 TraceCheckUtils]: 33: Hoare triple {624#false} assume !false; {624#false} is VALID [2022-04-28 07:22:46,137 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-28 07:22:46,137 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:23:20,503 INFO L290 TraceCheckUtils]: 33: Hoare triple {624#false} assume !false; {624#false} is VALID [2022-04-28 07:23:20,503 INFO L290 TraceCheckUtils]: 32: Hoare triple {731#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {624#false} is VALID [2022-04-28 07:23:20,504 INFO L290 TraceCheckUtils]: 31: Hoare triple {727#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {731#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:23:20,505 INFO L272 TraceCheckUtils]: 30: Hoare triple {747#(= main_~q~0 (* main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {727#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 07:23:20,505 INFO L290 TraceCheckUtils]: 29: Hoare triple {751#(or (= main_~q~0 (* main_~y~0 main_~x~0)) (and (not (= main_~b~0 0)) (not (= main_~a~0 0))))} assume !(0 != ~a~0 && 0 != ~b~0); {747#(= main_~q~0 (* main_~y~0 main_~x~0))} is VALID [2022-04-28 07:23:20,506 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {712#(not (= |__VERIFIER_assert_#in~cond| 0))} {623#true} #77#return; {751#(or (= main_~q~0 (* main_~y~0 main_~x~0)) (and (not (= main_~b~0 0)) (not (= main_~a~0 0))))} is VALID [2022-04-28 07:23:20,507 INFO L290 TraceCheckUtils]: 27: Hoare triple {712#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {712#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 07:23:20,507 INFO L290 TraceCheckUtils]: 26: Hoare triple {764#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {712#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 07:23:20,507 INFO L290 TraceCheckUtils]: 25: Hoare triple {623#true} ~cond := #in~cond; {764#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 07:23:20,507 INFO L272 TraceCheckUtils]: 24: Hoare triple {623#true} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {623#true} is VALID [2022-04-28 07:23:20,508 INFO L290 TraceCheckUtils]: 23: Hoare triple {623#true} assume !false; {623#true} is VALID [2022-04-28 07:23:20,508 INFO L290 TraceCheckUtils]: 22: Hoare triple {623#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {623#true} is VALID [2022-04-28 07:23:20,508 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {623#true} {623#true} #75#return; {623#true} is VALID [2022-04-28 07:23:20,508 INFO L290 TraceCheckUtils]: 20: Hoare triple {623#true} assume true; {623#true} is VALID [2022-04-28 07:23:20,508 INFO L290 TraceCheckUtils]: 19: Hoare triple {623#true} assume !(0 == ~cond); {623#true} is VALID [2022-04-28 07:23:20,508 INFO L290 TraceCheckUtils]: 18: Hoare triple {623#true} ~cond := #in~cond; {623#true} is VALID [2022-04-28 07:23:20,508 INFO L272 TraceCheckUtils]: 17: Hoare triple {623#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {623#true} is VALID [2022-04-28 07:23:20,508 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {623#true} {623#true} #73#return; {623#true} is VALID [2022-04-28 07:23:20,508 INFO L290 TraceCheckUtils]: 15: Hoare triple {623#true} assume true; {623#true} is VALID [2022-04-28 07:23:20,508 INFO L290 TraceCheckUtils]: 14: Hoare triple {623#true} assume !(0 == ~cond); {623#true} is VALID [2022-04-28 07:23:20,508 INFO L290 TraceCheckUtils]: 13: Hoare triple {623#true} ~cond := #in~cond; {623#true} is VALID [2022-04-28 07:23:20,509 INFO L272 TraceCheckUtils]: 12: Hoare triple {623#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 5 then 1 else 0)); {623#true} is VALID [2022-04-28 07:23:20,509 INFO L290 TraceCheckUtils]: 11: Hoare triple {623#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {623#true} is VALID [2022-04-28 07:23:20,509 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {623#true} {623#true} #71#return; {623#true} is VALID [2022-04-28 07:23:20,509 INFO L290 TraceCheckUtils]: 9: Hoare triple {623#true} assume true; {623#true} is VALID [2022-04-28 07:23:20,509 INFO L290 TraceCheckUtils]: 8: Hoare triple {623#true} assume !(0 == ~cond); {623#true} is VALID [2022-04-28 07:23:20,509 INFO L290 TraceCheckUtils]: 7: Hoare triple {623#true} ~cond := #in~cond; {623#true} is VALID [2022-04-28 07:23:20,509 INFO L272 TraceCheckUtils]: 6: Hoare triple {623#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 5 then 1 else 0)); {623#true} is VALID [2022-04-28 07:23:20,509 INFO L290 TraceCheckUtils]: 5: Hoare triple {623#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {623#true} is VALID [2022-04-28 07:23:20,509 INFO L272 TraceCheckUtils]: 4: Hoare triple {623#true} call #t~ret6 := main(); {623#true} is VALID [2022-04-28 07:23:20,509 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {623#true} {623#true} #83#return; {623#true} is VALID [2022-04-28 07:23:20,510 INFO L290 TraceCheckUtils]: 2: Hoare triple {623#true} assume true; {623#true} is VALID [2022-04-28 07:23:20,510 INFO L290 TraceCheckUtils]: 1: Hoare triple {623#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(13, 2);call #Ultimate.allocInit(12, 3); {623#true} is VALID [2022-04-28 07:23:20,510 INFO L272 TraceCheckUtils]: 0: Hoare triple {623#true} call ULTIMATE.init(); {623#true} is VALID [2022-04-28 07:23:20,510 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-28 07:23:20,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:23:20,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196793405] [2022-04-28 07:23:20,510 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:23:20,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [645966025] [2022-04-28 07:23:20,510 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [645966025] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 07:23:20,510 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 07:23:20,510 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8] total 16 [2022-04-28 07:23:20,511 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:23:20,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1477261960] [2022-04-28 07:23:20,511 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1477261960] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:23:20,511 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:23:20,511 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-28 07:23:20,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800281076] [2022-04-28 07:23:20,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:23:20,511 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 10 states have internal predecessors, (19), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 34 [2022-04-28 07:23:20,512 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:23:20,512 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 10 states have internal predecessors, (19), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-28 07:23:22,536 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 30 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 07:23:22,536 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-28 07:23:22,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:23:22,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-28 07:23:22,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2022-04-28 07:23:22,537 INFO L87 Difference]: Start difference. First operand 35 states and 42 transitions. Second operand has 13 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 10 states have internal predecessors, (19), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-28 07:23:25,012 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-28 07:23:30,023 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-28 07:23:30,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:23:30,187 INFO L93 Difference]: Finished difference Result 47 states and 58 transitions. [2022-04-28 07:23:30,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-28 07:23:30,188 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 10 states have internal predecessors, (19), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 34 [2022-04-28 07:23:30,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:23:30,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 10 states have internal predecessors, (19), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-28 07:23:30,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 55 transitions. [2022-04-28 07:23:30,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 10 states have internal predecessors, (19), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-28 07:23:30,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 55 transitions. [2022-04-28 07:23:30,191 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 55 transitions. [2022-04-28 07:23:30,236 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:23:30,237 INFO L225 Difference]: With dead ends: 47 [2022-04-28 07:23:30,237 INFO L226 Difference]: Without dead ends: 45 [2022-04-28 07:23:30,237 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2022-04-28 07:23:30,238 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 26 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 10 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2022-04-28 07:23:30,238 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 137 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 227 Invalid, 2 Unknown, 0 Unchecked, 4.7s Time] [2022-04-28 07:23:30,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-04-28 07:23:30,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 41. [2022-04-28 07:23:30,299 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:23:30,299 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand has 41 states, 25 states have (on average 1.24) internal successors, (31), 27 states have internal predecessors, (31), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 07:23:30,300 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand has 41 states, 25 states have (on average 1.24) internal successors, (31), 27 states have internal predecessors, (31), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 07:23:30,300 INFO L87 Difference]: Start difference. First operand 45 states. Second operand has 41 states, 25 states have (on average 1.24) internal successors, (31), 27 states have internal predecessors, (31), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 07:23:30,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:23:30,307 INFO L93 Difference]: Finished difference Result 45 states and 56 transitions. [2022-04-28 07:23:30,307 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 56 transitions. [2022-04-28 07:23:30,311 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:23:30,311 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:23:30,312 INFO L74 IsIncluded]: Start isIncluded. First operand has 41 states, 25 states have (on average 1.24) internal successors, (31), 27 states have internal predecessors, (31), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) Second operand 45 states. [2022-04-28 07:23:30,312 INFO L87 Difference]: Start difference. First operand has 41 states, 25 states have (on average 1.24) internal successors, (31), 27 states have internal predecessors, (31), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) Second operand 45 states. [2022-04-28 07:23:30,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:23:30,316 INFO L93 Difference]: Finished difference Result 45 states and 56 transitions. [2022-04-28 07:23:30,316 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 56 transitions. [2022-04-28 07:23:30,317 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:23:30,317 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:23:30,317 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:23:30,317 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:23:30,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 25 states have (on average 1.24) internal successors, (31), 27 states have internal predecessors, (31), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 07:23:30,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 49 transitions. [2022-04-28 07:23:30,322 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 49 transitions. Word has length 34 [2022-04-28 07:23:30,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:23:30,323 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 49 transitions. [2022-04-28 07:23:30,323 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 10 states have internal predecessors, (19), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-28 07:23:30,323 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 41 states and 49 transitions. [2022-04-28 07:23:30,370 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:23:30,370 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 49 transitions. [2022-04-28 07:23:30,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-28 07:23:30,371 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:23:30,372 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 07:23:30,391 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-28 07:23:30,589 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-28 07:23:30,590 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:23:30,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:23:30,590 INFO L85 PathProgramCache]: Analyzing trace with hash 412541489, now seen corresponding path program 1 times [2022-04-28 07:23:30,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:23:30,590 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [838884535] [2022-04-28 07:23:30,591 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 07:23:30,591 INFO L85 PathProgramCache]: Analyzing trace with hash 412541489, now seen corresponding path program 2 times [2022-04-28 07:23:30,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:23:30,591 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084650566] [2022-04-28 07:23:30,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:23:30,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:23:30,606 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:23:30,606 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [456117476] [2022-04-28 07:23:30,606 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 07:23:30,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:23:30,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:23:30,607 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-28 07:23:30,607 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-28 07:23:30,659 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 07:23:30,659 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:23:30,661 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 42 conjunts are in the unsatisfiable core [2022-04-28 07:23:30,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:23:30,675 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:23:32,172 INFO L272 TraceCheckUtils]: 0: Hoare triple {1116#true} call ULTIMATE.init(); {1116#true} is VALID [2022-04-28 07:23:32,172 INFO L290 TraceCheckUtils]: 1: Hoare triple {1116#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(13, 2);call #Ultimate.allocInit(12, 3); {1116#true} is VALID [2022-04-28 07:23:32,172 INFO L290 TraceCheckUtils]: 2: Hoare triple {1116#true} assume true; {1116#true} is VALID [2022-04-28 07:23:32,172 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1116#true} {1116#true} #83#return; {1116#true} is VALID [2022-04-28 07:23:32,172 INFO L272 TraceCheckUtils]: 4: Hoare triple {1116#true} call #t~ret6 := main(); {1116#true} is VALID [2022-04-28 07:23:32,172 INFO L290 TraceCheckUtils]: 5: Hoare triple {1116#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {1116#true} is VALID [2022-04-28 07:23:32,173 INFO L272 TraceCheckUtils]: 6: Hoare triple {1116#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 5 then 1 else 0)); {1116#true} is VALID [2022-04-28 07:23:32,173 INFO L290 TraceCheckUtils]: 7: Hoare triple {1116#true} ~cond := #in~cond; {1142#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 07:23:32,173 INFO L290 TraceCheckUtils]: 8: Hoare triple {1142#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {1146#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 07:23:32,174 INFO L290 TraceCheckUtils]: 9: Hoare triple {1146#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {1146#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 07:23:32,174 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1146#(not (= |assume_abort_if_not_#in~cond| 0))} {1116#true} #71#return; {1153#(and (<= 0 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-28 07:23:32,174 INFO L290 TraceCheckUtils]: 11: Hoare triple {1153#(and (<= 0 main_~x~0) (<= main_~x~0 5))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {1153#(and (<= 0 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-28 07:23:32,175 INFO L272 TraceCheckUtils]: 12: Hoare triple {1153#(and (<= 0 main_~x~0) (<= main_~x~0 5))} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 5 then 1 else 0)); {1116#true} is VALID [2022-04-28 07:23:32,175 INFO L290 TraceCheckUtils]: 13: Hoare triple {1116#true} ~cond := #in~cond; {1142#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 07:23:32,175 INFO L290 TraceCheckUtils]: 14: Hoare triple {1142#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {1146#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 07:23:32,175 INFO L290 TraceCheckUtils]: 15: Hoare triple {1146#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {1146#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 07:23:32,176 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1146#(not (= |assume_abort_if_not_#in~cond| 0))} {1153#(and (<= 0 main_~x~0) (<= main_~x~0 5))} #73#return; {1172#(and (<= 0 main_~y~0) (<= 0 main_~x~0) (<= main_~x~0 5) (<= main_~y~0 5))} is VALID [2022-04-28 07:23:32,176 INFO L272 TraceCheckUtils]: 17: Hoare triple {1172#(and (<= 0 main_~y~0) (<= 0 main_~x~0) (<= main_~x~0 5) (<= main_~y~0 5))} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {1116#true} is VALID [2022-04-28 07:23:32,177 INFO L290 TraceCheckUtils]: 18: Hoare triple {1116#true} ~cond := #in~cond; {1142#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 07:23:32,177 INFO L290 TraceCheckUtils]: 19: Hoare triple {1142#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {1146#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 07:23:32,177 INFO L290 TraceCheckUtils]: 20: Hoare triple {1146#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {1146#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 07:23:32,178 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1146#(not (= |assume_abort_if_not_#in~cond| 0))} {1172#(and (<= 0 main_~y~0) (<= 0 main_~x~0) (<= main_~x~0 5) (<= main_~y~0 5))} #75#return; {1188#(and (<= 0 main_~x~0) (<= main_~x~0 5) (<= 1 main_~y~0) (<= main_~y~0 5))} is VALID [2022-04-28 07:23:32,178 INFO L290 TraceCheckUtils]: 22: Hoare triple {1188#(and (<= 0 main_~x~0) (<= main_~x~0 5) (<= 1 main_~y~0) (<= main_~y~0 5))} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {1192#(and (<= 0 main_~x~0) (<= main_~x~0 5) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (<= main_~y~0 5) (= main_~p~0 1))} is VALID [2022-04-28 07:23:32,179 INFO L290 TraceCheckUtils]: 23: Hoare triple {1192#(and (<= 0 main_~x~0) (<= main_~x~0 5) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (<= main_~y~0 5) (= main_~p~0 1))} assume !false; {1192#(and (<= 0 main_~x~0) (<= main_~x~0 5) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (<= main_~y~0 5) (= main_~p~0 1))} is VALID [2022-04-28 07:23:32,179 INFO L272 TraceCheckUtils]: 24: Hoare triple {1192#(and (<= 0 main_~x~0) (<= main_~x~0 5) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (<= main_~y~0 5) (= main_~p~0 1))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {1116#true} is VALID [2022-04-28 07:23:32,179 INFO L290 TraceCheckUtils]: 25: Hoare triple {1116#true} ~cond := #in~cond; {1202#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:23:32,179 INFO L290 TraceCheckUtils]: 26: Hoare triple {1202#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {1206#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 07:23:32,180 INFO L290 TraceCheckUtils]: 27: Hoare triple {1206#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1206#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 07:23:32,180 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1206#(not (= |__VERIFIER_assert_#in~cond| 0))} {1192#(and (<= 0 main_~x~0) (<= main_~x~0 5) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (<= main_~y~0 5) (= main_~p~0 1))} #77#return; {1192#(and (<= 0 main_~x~0) (<= main_~x~0 5) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (<= main_~y~0 5) (= main_~p~0 1))} is VALID [2022-04-28 07:23:32,181 INFO L290 TraceCheckUtils]: 29: Hoare triple {1192#(and (<= 0 main_~x~0) (<= main_~x~0 5) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (<= main_~y~0 5) (= main_~p~0 1))} assume !!(0 != ~a~0 && 0 != ~b~0); {1216#(and (<= 0 main_~x~0) (<= main_~x~0 5) (= main_~b~0 main_~y~0) (= main_~q~0 0) (not (= main_~a~0 0)) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (<= main_~y~0 5) (= main_~p~0 1))} is VALID [2022-04-28 07:23:32,182 INFO L290 TraceCheckUtils]: 30: Hoare triple {1216#(and (<= 0 main_~x~0) (<= main_~x~0 5) (= main_~b~0 main_~y~0) (= main_~q~0 0) (not (= main_~a~0 0)) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (<= main_~y~0 5) (= main_~p~0 1))} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {1220#(and (= (div main_~y~0 2) main_~b~0) (<= 0 main_~x~0) (<= main_~x~0 5) (<= (mod main_~y~0 2) 0) (= main_~q~0 0) (= main_~p~0 4) (= (div main_~x~0 2) main_~a~0) (<= 1 main_~y~0) (<= main_~y~0 5) (= (mod main_~x~0 2) 0) (not (= main_~x~0 0)))} is VALID [2022-04-28 07:23:32,182 INFO L290 TraceCheckUtils]: 31: Hoare triple {1220#(and (= (div main_~y~0 2) main_~b~0) (<= 0 main_~x~0) (<= main_~x~0 5) (<= (mod main_~y~0 2) 0) (= main_~q~0 0) (= main_~p~0 4) (= (div main_~x~0 2) main_~a~0) (<= 1 main_~y~0) (<= main_~y~0 5) (= (mod main_~x~0 2) 0) (not (= main_~x~0 0)))} assume !false; {1220#(and (= (div main_~y~0 2) main_~b~0) (<= 0 main_~x~0) (<= main_~x~0 5) (<= (mod main_~y~0 2) 0) (= main_~q~0 0) (= main_~p~0 4) (= (div main_~x~0 2) main_~a~0) (<= 1 main_~y~0) (<= main_~y~0 5) (= (mod main_~x~0 2) 0) (not (= main_~x~0 0)))} is VALID [2022-04-28 07:23:32,197 INFO L272 TraceCheckUtils]: 32: Hoare triple {1220#(and (= (div main_~y~0 2) main_~b~0) (<= 0 main_~x~0) (<= main_~x~0 5) (<= (mod main_~y~0 2) 0) (= main_~q~0 0) (= main_~p~0 4) (= (div main_~x~0 2) main_~a~0) (<= 1 main_~y~0) (<= main_~y~0 5) (= (mod main_~x~0 2) 0) (not (= main_~x~0 0)))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {1227#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 07:23:32,198 INFO L290 TraceCheckUtils]: 33: Hoare triple {1227#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1231#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:23:32,198 INFO L290 TraceCheckUtils]: 34: Hoare triple {1231#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1117#false} is VALID [2022-04-28 07:23:32,199 INFO L290 TraceCheckUtils]: 35: Hoare triple {1117#false} assume !false; {1117#false} is VALID [2022-04-28 07:23:32,199 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-28 07:23:32,199 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:25:11,300 INFO L290 TraceCheckUtils]: 35: Hoare triple {1117#false} assume !false; {1117#false} is VALID [2022-04-28 07:25:11,301 INFO L290 TraceCheckUtils]: 34: Hoare triple {1231#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1117#false} is VALID [2022-04-28 07:25:11,301 INFO L290 TraceCheckUtils]: 33: Hoare triple {1227#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1231#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:25:11,302 INFO L272 TraceCheckUtils]: 32: Hoare triple {1247#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {1227#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 07:25:11,303 INFO L290 TraceCheckUtils]: 31: Hoare triple {1247#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} assume !false; {1247#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} is VALID [2022-04-28 07:25:11,306 INFO L290 TraceCheckUtils]: 30: Hoare triple {1254#(or (and (or (not (= (mod main_~b~0 2) 0)) (= (+ (* (div main_~b~0 2) (* main_~p~0 4) (div main_~a~0 2)) main_~q~0) (* main_~y~0 main_~x~0))) (or (= (mod main_~b~0 2) 0) (= (+ main_~q~0 (* (+ (div main_~b~0 2) 1) (* main_~p~0 4) (div main_~a~0 2))) (* main_~y~0 main_~x~0)))) (not (= (mod main_~a~0 2) 0)) (and (not (< main_~b~0 0)) (not (<= (mod main_~b~0 2) 0))))} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {1247#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} is VALID [2022-04-28 07:25:11,308 INFO L290 TraceCheckUtils]: 29: Hoare triple {1258#(or (= main_~a~0 0) (and (or (not (= (mod main_~b~0 2) 0)) (= (+ (* (div main_~b~0 2) (* main_~p~0 4) (div main_~a~0 2)) main_~q~0) (* main_~y~0 main_~x~0))) (or (= (mod main_~b~0 2) 0) (= (+ main_~q~0 (* (+ (div main_~b~0 2) 1) (* main_~p~0 4) (div main_~a~0 2))) (* main_~y~0 main_~x~0)))) (= main_~b~0 0) (not (= (mod main_~a~0 2) 0)) (and (not (< main_~b~0 0)) (not (<= (mod main_~b~0 2) 0))))} assume !!(0 != ~a~0 && 0 != ~b~0); {1254#(or (and (or (not (= (mod main_~b~0 2) 0)) (= (+ (* (div main_~b~0 2) (* main_~p~0 4) (div main_~a~0 2)) main_~q~0) (* main_~y~0 main_~x~0))) (or (= (mod main_~b~0 2) 0) (= (+ main_~q~0 (* (+ (div main_~b~0 2) 1) (* main_~p~0 4) (div main_~a~0 2))) (* main_~y~0 main_~x~0)))) (not (= (mod main_~a~0 2) 0)) (and (not (< main_~b~0 0)) (not (<= (mod main_~b~0 2) 0))))} is VALID [2022-04-28 07:25:11,316 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1206#(not (= |__VERIFIER_assert_#in~cond| 0))} {1262#(or (not (= (mod main_~a~0 2) 0)) (= (mod main_~b~0 2) 0) (not (= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))) (= (+ main_~q~0 (* (+ (div main_~b~0 2) 1) (* main_~p~0 4) (div main_~a~0 2))) (* main_~y~0 main_~x~0)) (<= 0 main_~b~0))} #77#return; {1258#(or (= main_~a~0 0) (and (or (not (= (mod main_~b~0 2) 0)) (= (+ (* (div main_~b~0 2) (* main_~p~0 4) (div main_~a~0 2)) main_~q~0) (* main_~y~0 main_~x~0))) (or (= (mod main_~b~0 2) 0) (= (+ main_~q~0 (* (+ (div main_~b~0 2) 1) (* main_~p~0 4) (div main_~a~0 2))) (* main_~y~0 main_~x~0)))) (= main_~b~0 0) (not (= (mod main_~a~0 2) 0)) (and (not (< main_~b~0 0)) (not (<= (mod main_~b~0 2) 0))))} is VALID [2022-04-28 07:25:11,316 INFO L290 TraceCheckUtils]: 27: Hoare triple {1206#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1206#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 07:25:11,316 INFO L290 TraceCheckUtils]: 26: Hoare triple {1272#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {1206#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 07:25:11,317 INFO L290 TraceCheckUtils]: 25: Hoare triple {1116#true} ~cond := #in~cond; {1272#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 07:25:11,317 INFO L272 TraceCheckUtils]: 24: Hoare triple {1262#(or (not (= (mod main_~a~0 2) 0)) (= (mod main_~b~0 2) 0) (not (= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))) (= (+ main_~q~0 (* (+ (div main_~b~0 2) 1) (* main_~p~0 4) (div main_~a~0 2))) (* main_~y~0 main_~x~0)) (<= 0 main_~b~0))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {1116#true} is VALID [2022-04-28 07:25:11,317 INFO L290 TraceCheckUtils]: 23: Hoare triple {1262#(or (not (= (mod main_~a~0 2) 0)) (= (mod main_~b~0 2) 0) (not (= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))) (= (+ main_~q~0 (* (+ (div main_~b~0 2) 1) (* main_~p~0 4) (div main_~a~0 2))) (* main_~y~0 main_~x~0)) (<= 0 main_~b~0))} assume !false; {1262#(or (not (= (mod main_~a~0 2) 0)) (= (mod main_~b~0 2) 0) (not (= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))) (= (+ main_~q~0 (* (+ (div main_~b~0 2) 1) (* main_~p~0 4) (div main_~a~0 2))) (* main_~y~0 main_~x~0)) (<= 0 main_~b~0))} is VALID [2022-04-28 07:25:11,318 INFO L290 TraceCheckUtils]: 22: Hoare triple {1282#(or (<= 0 main_~y~0) (= (mod main_~y~0 2) 0) (= (* (div main_~x~0 2) (+ (div main_~y~0 2) 1) 4) (* main_~y~0 main_~x~0)) (not (= (mod main_~x~0 2) 0)))} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {1262#(or (not (= (mod main_~a~0 2) 0)) (= (mod main_~b~0 2) 0) (not (= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))) (= (+ main_~q~0 (* (+ (div main_~b~0 2) 1) (* main_~p~0 4) (div main_~a~0 2))) (* main_~y~0 main_~x~0)) (<= 0 main_~b~0))} is VALID [2022-04-28 07:25:11,319 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1146#(not (= |assume_abort_if_not_#in~cond| 0))} {1116#true} #75#return; {1282#(or (<= 0 main_~y~0) (= (mod main_~y~0 2) 0) (= (* (div main_~x~0 2) (+ (div main_~y~0 2) 1) 4) (* main_~y~0 main_~x~0)) (not (= (mod main_~x~0 2) 0)))} is VALID [2022-04-28 07:25:11,319 INFO L290 TraceCheckUtils]: 20: Hoare triple {1146#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {1146#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 07:25:11,320 INFO L290 TraceCheckUtils]: 19: Hoare triple {1295#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} assume !(0 == ~cond); {1146#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 07:25:11,320 INFO L290 TraceCheckUtils]: 18: Hoare triple {1116#true} ~cond := #in~cond; {1295#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} is VALID [2022-04-28 07:25:11,320 INFO L272 TraceCheckUtils]: 17: Hoare triple {1116#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {1116#true} is VALID [2022-04-28 07:25:11,320 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1116#true} {1116#true} #73#return; {1116#true} is VALID [2022-04-28 07:25:11,320 INFO L290 TraceCheckUtils]: 15: Hoare triple {1116#true} assume true; {1116#true} is VALID [2022-04-28 07:25:11,320 INFO L290 TraceCheckUtils]: 14: Hoare triple {1116#true} assume !(0 == ~cond); {1116#true} is VALID [2022-04-28 07:25:11,320 INFO L290 TraceCheckUtils]: 13: Hoare triple {1116#true} ~cond := #in~cond; {1116#true} is VALID [2022-04-28 07:25:11,324 INFO L272 TraceCheckUtils]: 12: Hoare triple {1116#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 5 then 1 else 0)); {1116#true} is VALID [2022-04-28 07:25:11,324 INFO L290 TraceCheckUtils]: 11: Hoare triple {1116#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {1116#true} is VALID [2022-04-28 07:25:11,324 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1116#true} {1116#true} #71#return; {1116#true} is VALID [2022-04-28 07:25:11,324 INFO L290 TraceCheckUtils]: 9: Hoare triple {1116#true} assume true; {1116#true} is VALID [2022-04-28 07:25:11,324 INFO L290 TraceCheckUtils]: 8: Hoare triple {1116#true} assume !(0 == ~cond); {1116#true} is VALID [2022-04-28 07:25:11,324 INFO L290 TraceCheckUtils]: 7: Hoare triple {1116#true} ~cond := #in~cond; {1116#true} is VALID [2022-04-28 07:25:11,324 INFO L272 TraceCheckUtils]: 6: Hoare triple {1116#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 5 then 1 else 0)); {1116#true} is VALID [2022-04-28 07:25:11,324 INFO L290 TraceCheckUtils]: 5: Hoare triple {1116#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {1116#true} is VALID [2022-04-28 07:25:11,324 INFO L272 TraceCheckUtils]: 4: Hoare triple {1116#true} call #t~ret6 := main(); {1116#true} is VALID [2022-04-28 07:25:11,325 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1116#true} {1116#true} #83#return; {1116#true} is VALID [2022-04-28 07:25:11,325 INFO L290 TraceCheckUtils]: 2: Hoare triple {1116#true} assume true; {1116#true} is VALID [2022-04-28 07:25:11,325 INFO L290 TraceCheckUtils]: 1: Hoare triple {1116#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(13, 2);call #Ultimate.allocInit(12, 3); {1116#true} is VALID [2022-04-28 07:25:11,325 INFO L272 TraceCheckUtils]: 0: Hoare triple {1116#true} call ULTIMATE.init(); {1116#true} is VALID [2022-04-28 07:25:11,326 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-28 07:25:11,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:25:11,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084650566] [2022-04-28 07:25:11,326 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:25:11,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [456117476] [2022-04-28 07:25:11,326 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [456117476] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 07:25:11,326 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 07:25:11,326 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 21 [2022-04-28 07:25:11,326 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:25:11,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [838884535] [2022-04-28 07:25:11,327 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [838884535] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:25:11,327 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:25:11,327 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-28 07:25:11,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515837483] [2022-04-28 07:25:11,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:25:11,327 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 11 states have internal predecessors, (18), 5 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 36 [2022-04-28 07:25:11,329 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:25:11,329 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 11 states have internal predecessors, (18), 5 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-28 07:25:11,354 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:25:11,354 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-28 07:25:11,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:25:11,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-28 07:25:11,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=342, Unknown=0, NotChecked=0, Total=420 [2022-04-28 07:25:11,356 INFO L87 Difference]: Start difference. First operand 41 states and 49 transitions. Second operand has 14 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 11 states have internal predecessors, (18), 5 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-28 07:25:12,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:25:12,241 INFO L93 Difference]: Finished difference Result 63 states and 79 transitions. [2022-04-28 07:25:12,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-28 07:25:12,241 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 11 states have internal predecessors, (18), 5 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 36 [2022-04-28 07:25:12,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:25:12,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 11 states have internal predecessors, (18), 5 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-28 07:25:12,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 73 transitions. [2022-04-28 07:25:12,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 11 states have internal predecessors, (18), 5 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-28 07:25:12,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 73 transitions. [2022-04-28 07:25:12,245 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 73 transitions. [2022-04-28 07:25:12,301 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:25:12,302 INFO L225 Difference]: With dead ends: 63 [2022-04-28 07:25:12,302 INFO L226 Difference]: Without dead ends: 55 [2022-04-28 07:25:12,303 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=96, Invalid=456, Unknown=0, NotChecked=0, Total=552 [2022-04-28 07:25:12,303 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 34 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 330 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-28 07:25:12,303 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 148 Invalid, 342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 330 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-28 07:25:12,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-04-28 07:25:12,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 49. [2022-04-28 07:25:12,365 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:25:12,365 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand has 49 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 33 states have internal predecessors, (38), 11 states have call successors, (11), 7 states have call predecessors, (11), 6 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 07:25:12,365 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand has 49 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 33 states have internal predecessors, (38), 11 states have call successors, (11), 7 states have call predecessors, (11), 6 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 07:25:12,365 INFO L87 Difference]: Start difference. First operand 55 states. Second operand has 49 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 33 states have internal predecessors, (38), 11 states have call successors, (11), 7 states have call predecessors, (11), 6 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 07:25:12,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:25:12,367 INFO L93 Difference]: Finished difference Result 55 states and 69 transitions. [2022-04-28 07:25:12,367 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 69 transitions. [2022-04-28 07:25:12,367 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:25:12,367 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:25:12,367 INFO L74 IsIncluded]: Start isIncluded. First operand has 49 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 33 states have internal predecessors, (38), 11 states have call successors, (11), 7 states have call predecessors, (11), 6 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) Second operand 55 states. [2022-04-28 07:25:12,367 INFO L87 Difference]: Start difference. First operand has 49 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 33 states have internal predecessors, (38), 11 states have call successors, (11), 7 states have call predecessors, (11), 6 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) Second operand 55 states. [2022-04-28 07:25:12,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:25:12,369 INFO L93 Difference]: Finished difference Result 55 states and 69 transitions. [2022-04-28 07:25:12,369 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 69 transitions. [2022-04-28 07:25:12,369 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:25:12,369 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:25:12,369 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:25:12,369 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:25:12,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 33 states have internal predecessors, (38), 11 states have call successors, (11), 7 states have call predecessors, (11), 6 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 07:25:12,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 58 transitions. [2022-04-28 07:25:12,371 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 58 transitions. Word has length 36 [2022-04-28 07:25:12,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:25:12,371 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 58 transitions. [2022-04-28 07:25:12,371 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 11 states have internal predecessors, (18), 5 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-28 07:25:12,371 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 49 states and 58 transitions. [2022-04-28 07:25:12,435 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:25:12,436 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 58 transitions. [2022-04-28 07:25:12,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-28 07:25:12,436 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:25:12,436 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 07:25:12,453 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-28 07:25:12,652 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:25:12,652 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:25:12,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:25:12,653 INFO L85 PathProgramCache]: Analyzing trace with hash 2032180221, now seen corresponding path program 1 times [2022-04-28 07:25:12,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:25:12,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1687110798] [2022-04-28 07:25:12,653 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 07:25:12,653 INFO L85 PathProgramCache]: Analyzing trace with hash 2032180221, now seen corresponding path program 2 times [2022-04-28 07:25:12,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:25:12,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748688184] [2022-04-28 07:25:12,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:25:12,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:25:12,668 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:25:12,669 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1003662958] [2022-04-28 07:25:12,669 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 07:25:12,669 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:25:12,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:25:12,672 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-28 07:25:12,673 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-28 07:25:12,713 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 07:25:12,713 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:25:12,714 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 32 conjunts are in the unsatisfiable core [2022-04-28 07:25:12,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:25:12,726 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:25:13,055 INFO L272 TraceCheckUtils]: 0: Hoare triple {1692#true} call ULTIMATE.init(); {1692#true} is VALID [2022-04-28 07:25:13,055 INFO L290 TraceCheckUtils]: 1: Hoare triple {1692#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(13, 2);call #Ultimate.allocInit(12, 3); {1692#true} is VALID [2022-04-28 07:25:13,055 INFO L290 TraceCheckUtils]: 2: Hoare triple {1692#true} assume true; {1692#true} is VALID [2022-04-28 07:25:13,055 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1692#true} {1692#true} #83#return; {1692#true} is VALID [2022-04-28 07:25:13,055 INFO L272 TraceCheckUtils]: 4: Hoare triple {1692#true} call #t~ret6 := main(); {1692#true} is VALID [2022-04-28 07:25:13,056 INFO L290 TraceCheckUtils]: 5: Hoare triple {1692#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {1692#true} is VALID [2022-04-28 07:25:13,056 INFO L272 TraceCheckUtils]: 6: Hoare triple {1692#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 5 then 1 else 0)); {1692#true} is VALID [2022-04-28 07:25:13,056 INFO L290 TraceCheckUtils]: 7: Hoare triple {1692#true} ~cond := #in~cond; {1692#true} is VALID [2022-04-28 07:25:13,056 INFO L290 TraceCheckUtils]: 8: Hoare triple {1692#true} assume !(0 == ~cond); {1692#true} is VALID [2022-04-28 07:25:13,056 INFO L290 TraceCheckUtils]: 9: Hoare triple {1692#true} assume true; {1692#true} is VALID [2022-04-28 07:25:13,056 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1692#true} {1692#true} #71#return; {1692#true} is VALID [2022-04-28 07:25:13,056 INFO L290 TraceCheckUtils]: 11: Hoare triple {1692#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {1692#true} is VALID [2022-04-28 07:25:13,056 INFO L272 TraceCheckUtils]: 12: Hoare triple {1692#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 5 then 1 else 0)); {1692#true} is VALID [2022-04-28 07:25:13,056 INFO L290 TraceCheckUtils]: 13: Hoare triple {1692#true} ~cond := #in~cond; {1692#true} is VALID [2022-04-28 07:25:13,056 INFO L290 TraceCheckUtils]: 14: Hoare triple {1692#true} assume !(0 == ~cond); {1692#true} is VALID [2022-04-28 07:25:13,056 INFO L290 TraceCheckUtils]: 15: Hoare triple {1692#true} assume true; {1692#true} is VALID [2022-04-28 07:25:13,056 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1692#true} {1692#true} #73#return; {1692#true} is VALID [2022-04-28 07:25:13,056 INFO L272 TraceCheckUtils]: 17: Hoare triple {1692#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {1692#true} is VALID [2022-04-28 07:25:13,057 INFO L290 TraceCheckUtils]: 18: Hoare triple {1692#true} ~cond := #in~cond; {1751#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 07:25:13,057 INFO L290 TraceCheckUtils]: 19: Hoare triple {1751#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {1755#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 07:25:13,057 INFO L290 TraceCheckUtils]: 20: Hoare triple {1755#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {1755#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 07:25:13,058 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1755#(not (= |assume_abort_if_not_#in~cond| 0))} {1692#true} #75#return; {1762#(<= 1 main_~y~0)} is VALID [2022-04-28 07:25:13,058 INFO L290 TraceCheckUtils]: 22: Hoare triple {1762#(<= 1 main_~y~0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {1766#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 07:25:13,059 INFO L290 TraceCheckUtils]: 23: Hoare triple {1766#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !false; {1766#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 07:25:13,059 INFO L272 TraceCheckUtils]: 24: Hoare triple {1766#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {1692#true} is VALID [2022-04-28 07:25:13,059 INFO L290 TraceCheckUtils]: 25: Hoare triple {1692#true} ~cond := #in~cond; {1776#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:25:13,059 INFO L290 TraceCheckUtils]: 26: Hoare triple {1776#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {1780#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 07:25:13,060 INFO L290 TraceCheckUtils]: 27: Hoare triple {1780#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1780#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 07:25:13,060 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1780#(not (= |__VERIFIER_assert_#in~cond| 0))} {1766#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #77#return; {1766#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 07:25:13,061 INFO L290 TraceCheckUtils]: 29: Hoare triple {1766#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(0 != ~a~0 && 0 != ~b~0); {1766#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 07:25:13,061 INFO L290 TraceCheckUtils]: 30: Hoare triple {1766#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {1766#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 07:25:13,066 INFO L290 TraceCheckUtils]: 31: Hoare triple {1766#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume 1 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := ~a~0 - 1;~q~0 := ~q~0 + ~b~0 * ~p~0; {1796#(and (= (* main_~b~0 main_~p~0) main_~q~0) (= (mod main_~b~0 2) 0) (= main_~b~0 main_~y~0) (= (+ main_~a~0 1) main_~x~0) (<= 1 main_~y~0) (= main_~p~0 1))} is VALID [2022-04-28 07:25:13,070 INFO L290 TraceCheckUtils]: 32: Hoare triple {1796#(and (= (* main_~b~0 main_~p~0) main_~q~0) (= (mod main_~b~0 2) 0) (= main_~b~0 main_~y~0) (= (+ main_~a~0 1) main_~x~0) (<= 1 main_~y~0) (= main_~p~0 1))} assume !false; {1796#(and (= (* main_~b~0 main_~p~0) main_~q~0) (= (mod main_~b~0 2) 0) (= main_~b~0 main_~y~0) (= (+ main_~a~0 1) main_~x~0) (<= 1 main_~y~0) (= main_~p~0 1))} is VALID [2022-04-28 07:25:13,072 INFO L272 TraceCheckUtils]: 33: Hoare triple {1796#(and (= (* main_~b~0 main_~p~0) main_~q~0) (= (mod main_~b~0 2) 0) (= main_~b~0 main_~y~0) (= (+ main_~a~0 1) main_~x~0) (<= 1 main_~y~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {1803#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 07:25:13,072 INFO L290 TraceCheckUtils]: 34: Hoare triple {1803#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1807#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:25:13,073 INFO L290 TraceCheckUtils]: 35: Hoare triple {1807#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1693#false} is VALID [2022-04-28 07:25:13,073 INFO L290 TraceCheckUtils]: 36: Hoare triple {1693#false} assume !false; {1693#false} is VALID [2022-04-28 07:25:13,073 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-28 07:25:13,073 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:25:25,577 INFO L290 TraceCheckUtils]: 36: Hoare triple {1693#false} assume !false; {1693#false} is VALID [2022-04-28 07:25:25,578 INFO L290 TraceCheckUtils]: 35: Hoare triple {1807#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1693#false} is VALID [2022-04-28 07:25:25,578 INFO L290 TraceCheckUtils]: 34: Hoare triple {1803#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1807#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:25:25,579 INFO L272 TraceCheckUtils]: 33: Hoare triple {1823#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {1803#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 07:25:25,579 INFO L290 TraceCheckUtils]: 32: Hoare triple {1823#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} assume !false; {1823#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} is VALID [2022-04-28 07:25:25,594 INFO L290 TraceCheckUtils]: 31: Hoare triple {1830#(or (not (= (mod main_~b~0 2) 0)) (= (+ (* main_~b~0 main_~p~0) (* (+ (- 1) main_~a~0) main_~b~0 main_~p~0) main_~q~0) (* main_~y~0 main_~x~0)))} assume 1 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := ~a~0 - 1;~q~0 := ~q~0 + ~b~0 * ~p~0; {1823#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} is VALID [2022-04-28 07:25:25,595 INFO L290 TraceCheckUtils]: 30: Hoare triple {1830#(or (not (= (mod main_~b~0 2) 0)) (= (+ (* main_~b~0 main_~p~0) (* (+ (- 1) main_~a~0) main_~b~0 main_~p~0) main_~q~0) (* main_~y~0 main_~x~0)))} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {1830#(or (not (= (mod main_~b~0 2) 0)) (= (+ (* main_~b~0 main_~p~0) (* (+ (- 1) main_~a~0) main_~b~0 main_~p~0) main_~q~0) (* main_~y~0 main_~x~0)))} is VALID [2022-04-28 07:25:25,595 INFO L290 TraceCheckUtils]: 29: Hoare triple {1837#(or (not (= (mod main_~b~0 2) 0)) (= (+ (* main_~b~0 main_~p~0) (* (+ (- 1) main_~a~0) main_~b~0 main_~p~0) main_~q~0) (* main_~y~0 main_~x~0)) (= main_~b~0 0))} assume !!(0 != ~a~0 && 0 != ~b~0); {1830#(or (not (= (mod main_~b~0 2) 0)) (= (+ (* main_~b~0 main_~p~0) (* (+ (- 1) main_~a~0) main_~b~0 main_~p~0) main_~q~0) (* main_~y~0 main_~x~0)))} is VALID [2022-04-28 07:25:25,596 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1780#(not (= |__VERIFIER_assert_#in~cond| 0))} {1692#true} #77#return; {1837#(or (not (= (mod main_~b~0 2) 0)) (= (+ (* main_~b~0 main_~p~0) (* (+ (- 1) main_~a~0) main_~b~0 main_~p~0) main_~q~0) (* main_~y~0 main_~x~0)) (= main_~b~0 0))} is VALID [2022-04-28 07:25:25,596 INFO L290 TraceCheckUtils]: 27: Hoare triple {1780#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1780#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 07:25:25,597 INFO L290 TraceCheckUtils]: 26: Hoare triple {1850#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {1780#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 07:25:25,597 INFO L290 TraceCheckUtils]: 25: Hoare triple {1692#true} ~cond := #in~cond; {1850#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 07:25:25,597 INFO L272 TraceCheckUtils]: 24: Hoare triple {1692#true} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {1692#true} is VALID [2022-04-28 07:25:25,597 INFO L290 TraceCheckUtils]: 23: Hoare triple {1692#true} assume !false; {1692#true} is VALID [2022-04-28 07:25:25,597 INFO L290 TraceCheckUtils]: 22: Hoare triple {1692#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {1692#true} is VALID [2022-04-28 07:25:25,597 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1692#true} {1692#true} #75#return; {1692#true} is VALID [2022-04-28 07:25:25,597 INFO L290 TraceCheckUtils]: 20: Hoare triple {1692#true} assume true; {1692#true} is VALID [2022-04-28 07:25:25,597 INFO L290 TraceCheckUtils]: 19: Hoare triple {1692#true} assume !(0 == ~cond); {1692#true} is VALID [2022-04-28 07:25:25,597 INFO L290 TraceCheckUtils]: 18: Hoare triple {1692#true} ~cond := #in~cond; {1692#true} is VALID [2022-04-28 07:25:25,598 INFO L272 TraceCheckUtils]: 17: Hoare triple {1692#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {1692#true} is VALID [2022-04-28 07:25:25,598 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1692#true} {1692#true} #73#return; {1692#true} is VALID [2022-04-28 07:25:25,598 INFO L290 TraceCheckUtils]: 15: Hoare triple {1692#true} assume true; {1692#true} is VALID [2022-04-28 07:25:25,598 INFO L290 TraceCheckUtils]: 14: Hoare triple {1692#true} assume !(0 == ~cond); {1692#true} is VALID [2022-04-28 07:25:25,598 INFO L290 TraceCheckUtils]: 13: Hoare triple {1692#true} ~cond := #in~cond; {1692#true} is VALID [2022-04-28 07:25:25,598 INFO L272 TraceCheckUtils]: 12: Hoare triple {1692#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 5 then 1 else 0)); {1692#true} is VALID [2022-04-28 07:25:25,598 INFO L290 TraceCheckUtils]: 11: Hoare triple {1692#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {1692#true} is VALID [2022-04-28 07:25:25,598 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1692#true} {1692#true} #71#return; {1692#true} is VALID [2022-04-28 07:25:25,598 INFO L290 TraceCheckUtils]: 9: Hoare triple {1692#true} assume true; {1692#true} is VALID [2022-04-28 07:25:25,598 INFO L290 TraceCheckUtils]: 8: Hoare triple {1692#true} assume !(0 == ~cond); {1692#true} is VALID [2022-04-28 07:25:25,598 INFO L290 TraceCheckUtils]: 7: Hoare triple {1692#true} ~cond := #in~cond; {1692#true} is VALID [2022-04-28 07:25:25,598 INFO L272 TraceCheckUtils]: 6: Hoare triple {1692#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 5 then 1 else 0)); {1692#true} is VALID [2022-04-28 07:25:25,598 INFO L290 TraceCheckUtils]: 5: Hoare triple {1692#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {1692#true} is VALID [2022-04-28 07:25:25,598 INFO L272 TraceCheckUtils]: 4: Hoare triple {1692#true} call #t~ret6 := main(); {1692#true} is VALID [2022-04-28 07:25:25,598 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1692#true} {1692#true} #83#return; {1692#true} is VALID [2022-04-28 07:25:25,599 INFO L290 TraceCheckUtils]: 2: Hoare triple {1692#true} assume true; {1692#true} is VALID [2022-04-28 07:25:25,599 INFO L290 TraceCheckUtils]: 1: Hoare triple {1692#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(13, 2);call #Ultimate.allocInit(12, 3); {1692#true} is VALID [2022-04-28 07:25:25,599 INFO L272 TraceCheckUtils]: 0: Hoare triple {1692#true} call ULTIMATE.init(); {1692#true} is VALID [2022-04-28 07:25:25,599 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-28 07:25:25,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:25:25,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748688184] [2022-04-28 07:25:25,599 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:25:25,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1003662958] [2022-04-28 07:25:25,599 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1003662958] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 07:25:25,599 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 07:25:25,599 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 15 [2022-04-28 07:25:25,599 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:25:25,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1687110798] [2022-04-28 07:25:25,600 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1687110798] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:25:25,600 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:25:25,600 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 07:25:25,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071519182] [2022-04-28 07:25:25,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:25:25,600 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.0) internal successors, (22), 9 states have internal predecessors, (22), 3 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 37 [2022-04-28 07:25:25,600 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:25:25,600 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 2.0) internal successors, (22), 9 states have internal predecessors, (22), 3 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 07:25:25,642 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:25:25,642 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 07:25:25,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:25:25,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 07:25:25,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2022-04-28 07:25:25,642 INFO L87 Difference]: Start difference. First operand 49 states and 58 transitions. Second operand has 11 states, 11 states have (on average 2.0) internal successors, (22), 9 states have internal predecessors, (22), 3 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 07:25:26,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:25:26,519 INFO L93 Difference]: Finished difference Result 78 states and 100 transitions. [2022-04-28 07:25:26,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-28 07:25:26,519 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.0) internal successors, (22), 9 states have internal predecessors, (22), 3 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 37 [2022-04-28 07:25:26,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:25:26,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.0) internal successors, (22), 9 states have internal predecessors, (22), 3 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 07:25:26,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 87 transitions. [2022-04-28 07:25:26,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.0) internal successors, (22), 9 states have internal predecessors, (22), 3 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 07:25:26,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 87 transitions. [2022-04-28 07:25:26,522 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 87 transitions. [2022-04-28 07:25:26,593 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:25:26,595 INFO L225 Difference]: With dead ends: 78 [2022-04-28 07:25:26,595 INFO L226 Difference]: Without dead ends: 64 [2022-04-28 07:25:26,595 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2022-04-28 07:25:26,595 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 33 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 291 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-28 07:25:26,596 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 121 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 291 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-28 07:25:26,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-04-28 07:25:26,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 60. [2022-04-28 07:25:26,681 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:25:26,681 INFO L82 GeneralOperation]: Start isEquivalent. First operand 64 states. Second operand has 60 states, 40 states have (on average 1.275) internal successors, (51), 42 states have internal predecessors, (51), 12 states have call successors, (12), 8 states have call predecessors, (12), 7 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 07:25:26,681 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand has 60 states, 40 states have (on average 1.275) internal successors, (51), 42 states have internal predecessors, (51), 12 states have call successors, (12), 8 states have call predecessors, (12), 7 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 07:25:26,681 INFO L87 Difference]: Start difference. First operand 64 states. Second operand has 60 states, 40 states have (on average 1.275) internal successors, (51), 42 states have internal predecessors, (51), 12 states have call successors, (12), 8 states have call predecessors, (12), 7 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 07:25:26,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:25:26,683 INFO L93 Difference]: Finished difference Result 64 states and 79 transitions. [2022-04-28 07:25:26,683 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 79 transitions. [2022-04-28 07:25:26,684 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:25:26,684 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:25:26,685 INFO L74 IsIncluded]: Start isIncluded. First operand has 60 states, 40 states have (on average 1.275) internal successors, (51), 42 states have internal predecessors, (51), 12 states have call successors, (12), 8 states have call predecessors, (12), 7 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) Second operand 64 states. [2022-04-28 07:25:26,685 INFO L87 Difference]: Start difference. First operand has 60 states, 40 states have (on average 1.275) internal successors, (51), 42 states have internal predecessors, (51), 12 states have call successors, (12), 8 states have call predecessors, (12), 7 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) Second operand 64 states. [2022-04-28 07:25:26,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:25:26,686 INFO L93 Difference]: Finished difference Result 64 states and 79 transitions. [2022-04-28 07:25:26,687 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 79 transitions. [2022-04-28 07:25:26,687 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:25:26,687 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:25:26,687 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:25:26,687 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:25:26,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 40 states have (on average 1.275) internal successors, (51), 42 states have internal predecessors, (51), 12 states have call successors, (12), 8 states have call predecessors, (12), 7 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 07:25:26,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 73 transitions. [2022-04-28 07:25:26,690 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 73 transitions. Word has length 37 [2022-04-28 07:25:26,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:25:26,692 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 73 transitions. [2022-04-28 07:25:26,692 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.0) internal successors, (22), 9 states have internal predecessors, (22), 3 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-28 07:25:26,692 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 60 states and 73 transitions. [2022-04-28 07:25:26,777 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:25:26,777 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 73 transitions. [2022-04-28 07:25:26,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-28 07:25:26,778 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:25:26,778 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 07:25:26,795 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-28 07:25:26,978 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:25:26,979 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:25:26,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:25:26,979 INFO L85 PathProgramCache]: Analyzing trace with hash 262800198, now seen corresponding path program 1 times [2022-04-28 07:25:26,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:25:26,979 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1090229621] [2022-04-28 07:25:26,979 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 07:25:26,979 INFO L85 PathProgramCache]: Analyzing trace with hash 262800198, now seen corresponding path program 2 times [2022-04-28 07:25:26,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:25:26,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415728627] [2022-04-28 07:25:26,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:25:26,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:25:26,989 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:25:26,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [216677075] [2022-04-28 07:25:26,989 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 07:25:26,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:25:26,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:25:26,990 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-28 07:25:27,003 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-28 07:25:27,033 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 07:25:27,033 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:25:27,034 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-28 07:25:27,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:25:27,045 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:25:27,279 INFO L272 TraceCheckUtils]: 0: Hoare triple {2338#true} call ULTIMATE.init(); {2338#true} is VALID [2022-04-28 07:25:27,279 INFO L290 TraceCheckUtils]: 1: Hoare triple {2338#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(13, 2);call #Ultimate.allocInit(12, 3); {2338#true} is VALID [2022-04-28 07:25:27,279 INFO L290 TraceCheckUtils]: 2: Hoare triple {2338#true} assume true; {2338#true} is VALID [2022-04-28 07:25:27,280 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2338#true} {2338#true} #83#return; {2338#true} is VALID [2022-04-28 07:25:27,280 INFO L272 TraceCheckUtils]: 4: Hoare triple {2338#true} call #t~ret6 := main(); {2338#true} is VALID [2022-04-28 07:25:27,280 INFO L290 TraceCheckUtils]: 5: Hoare triple {2338#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {2338#true} is VALID [2022-04-28 07:25:27,280 INFO L272 TraceCheckUtils]: 6: Hoare triple {2338#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 5 then 1 else 0)); {2338#true} is VALID [2022-04-28 07:25:27,280 INFO L290 TraceCheckUtils]: 7: Hoare triple {2338#true} ~cond := #in~cond; {2364#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 07:25:27,280 INFO L290 TraceCheckUtils]: 8: Hoare triple {2364#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {2368#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 07:25:27,281 INFO L290 TraceCheckUtils]: 9: Hoare triple {2368#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {2368#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 07:25:27,281 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2368#(not (= |assume_abort_if_not_#in~cond| 0))} {2338#true} #71#return; {2375#(and (<= 0 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-28 07:25:27,281 INFO L290 TraceCheckUtils]: 11: Hoare triple {2375#(and (<= 0 main_~x~0) (<= main_~x~0 5))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {2375#(and (<= 0 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-28 07:25:27,282 INFO L272 TraceCheckUtils]: 12: Hoare triple {2375#(and (<= 0 main_~x~0) (<= main_~x~0 5))} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 5 then 1 else 0)); {2338#true} is VALID [2022-04-28 07:25:27,282 INFO L290 TraceCheckUtils]: 13: Hoare triple {2338#true} ~cond := #in~cond; {2338#true} is VALID [2022-04-28 07:25:27,282 INFO L290 TraceCheckUtils]: 14: Hoare triple {2338#true} assume !(0 == ~cond); {2338#true} is VALID [2022-04-28 07:25:27,282 INFO L290 TraceCheckUtils]: 15: Hoare triple {2338#true} assume true; {2338#true} is VALID [2022-04-28 07:25:27,283 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2338#true} {2375#(and (<= 0 main_~x~0) (<= main_~x~0 5))} #73#return; {2375#(and (<= 0 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-28 07:25:27,283 INFO L272 TraceCheckUtils]: 17: Hoare triple {2375#(and (<= 0 main_~x~0) (<= main_~x~0 5))} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {2338#true} is VALID [2022-04-28 07:25:27,284 INFO L290 TraceCheckUtils]: 18: Hoare triple {2338#true} ~cond := #in~cond; {2364#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 07:25:27,285 INFO L290 TraceCheckUtils]: 19: Hoare triple {2364#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {2368#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 07:25:27,285 INFO L290 TraceCheckUtils]: 20: Hoare triple {2368#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {2368#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 07:25:27,285 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2368#(not (= |assume_abort_if_not_#in~cond| 0))} {2375#(and (<= 0 main_~x~0) (<= main_~x~0 5))} #75#return; {2409#(and (<= 0 main_~x~0) (<= main_~x~0 5) (<= 1 main_~y~0))} is VALID [2022-04-28 07:25:27,286 INFO L290 TraceCheckUtils]: 22: Hoare triple {2409#(and (<= 0 main_~x~0) (<= main_~x~0 5) (<= 1 main_~y~0))} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {2413#(and (<= 0 main_~a~0) (<= 1 main_~b~0))} is VALID [2022-04-28 07:25:27,286 INFO L290 TraceCheckUtils]: 23: Hoare triple {2413#(and (<= 0 main_~a~0) (<= 1 main_~b~0))} assume !false; {2413#(and (<= 0 main_~a~0) (<= 1 main_~b~0))} is VALID [2022-04-28 07:25:27,286 INFO L272 TraceCheckUtils]: 24: Hoare triple {2413#(and (<= 0 main_~a~0) (<= 1 main_~b~0))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {2338#true} is VALID [2022-04-28 07:25:27,286 INFO L290 TraceCheckUtils]: 25: Hoare triple {2338#true} ~cond := #in~cond; {2338#true} is VALID [2022-04-28 07:25:27,286 INFO L290 TraceCheckUtils]: 26: Hoare triple {2338#true} assume !(0 == ~cond); {2338#true} is VALID [2022-04-28 07:25:27,286 INFO L290 TraceCheckUtils]: 27: Hoare triple {2338#true} assume true; {2338#true} is VALID [2022-04-28 07:25:27,288 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2338#true} {2413#(and (<= 0 main_~a~0) (<= 1 main_~b~0))} #77#return; {2413#(and (<= 0 main_~a~0) (<= 1 main_~b~0))} is VALID [2022-04-28 07:25:27,288 INFO L290 TraceCheckUtils]: 29: Hoare triple {2413#(and (<= 0 main_~a~0) (<= 1 main_~b~0))} assume !(0 != ~a~0 && 0 != ~b~0); {2435#(and (= main_~a~0 0) (<= 1 main_~b~0))} is VALID [2022-04-28 07:25:27,288 INFO L272 TraceCheckUtils]: 30: Hoare triple {2435#(and (= main_~a~0 0) (<= 1 main_~b~0))} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {2338#true} is VALID [2022-04-28 07:25:27,288 INFO L290 TraceCheckUtils]: 31: Hoare triple {2338#true} ~cond := #in~cond; {2338#true} is VALID [2022-04-28 07:25:27,288 INFO L290 TraceCheckUtils]: 32: Hoare triple {2338#true} assume !(0 == ~cond); {2338#true} is VALID [2022-04-28 07:25:27,288 INFO L290 TraceCheckUtils]: 33: Hoare triple {2338#true} assume true; {2338#true} is VALID [2022-04-28 07:25:27,289 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {2338#true} {2435#(and (= main_~a~0 0) (<= 1 main_~b~0))} #79#return; {2435#(and (= main_~a~0 0) (<= 1 main_~b~0))} is VALID [2022-04-28 07:25:27,289 INFO L272 TraceCheckUtils]: 35: Hoare triple {2435#(and (= main_~a~0 0) (<= 1 main_~b~0))} call __VERIFIER_assert((if 0 == ~a~0 * ~b~0 then 1 else 0)); {2454#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 07:25:27,290 INFO L290 TraceCheckUtils]: 36: Hoare triple {2454#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2458#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:25:27,290 INFO L290 TraceCheckUtils]: 37: Hoare triple {2458#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2339#false} is VALID [2022-04-28 07:25:27,290 INFO L290 TraceCheckUtils]: 38: Hoare triple {2339#false} assume !false; {2339#false} is VALID [2022-04-28 07:25:27,290 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-28 07:25:27,290 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:25:27,484 INFO L290 TraceCheckUtils]: 38: Hoare triple {2339#false} assume !false; {2339#false} is VALID [2022-04-28 07:25:27,485 INFO L290 TraceCheckUtils]: 37: Hoare triple {2458#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2339#false} is VALID [2022-04-28 07:25:27,485 INFO L290 TraceCheckUtils]: 36: Hoare triple {2454#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2458#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:25:27,486 INFO L272 TraceCheckUtils]: 35: Hoare triple {2474#(= (* main_~b~0 main_~a~0) 0)} call __VERIFIER_assert((if 0 == ~a~0 * ~b~0 then 1 else 0)); {2454#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 07:25:27,486 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {2338#true} {2474#(= (* main_~b~0 main_~a~0) 0)} #79#return; {2474#(= (* main_~b~0 main_~a~0) 0)} is VALID [2022-04-28 07:25:27,486 INFO L290 TraceCheckUtils]: 33: Hoare triple {2338#true} assume true; {2338#true} is VALID [2022-04-28 07:25:27,487 INFO L290 TraceCheckUtils]: 32: Hoare triple {2338#true} assume !(0 == ~cond); {2338#true} is VALID [2022-04-28 07:25:27,487 INFO L290 TraceCheckUtils]: 31: Hoare triple {2338#true} ~cond := #in~cond; {2338#true} is VALID [2022-04-28 07:25:27,487 INFO L272 TraceCheckUtils]: 30: Hoare triple {2474#(= (* main_~b~0 main_~a~0) 0)} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {2338#true} is VALID [2022-04-28 07:25:27,488 INFO L290 TraceCheckUtils]: 29: Hoare triple {2338#true} assume !(0 != ~a~0 && 0 != ~b~0); {2474#(= (* main_~b~0 main_~a~0) 0)} is VALID [2022-04-28 07:25:27,488 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2338#true} {2338#true} #77#return; {2338#true} is VALID [2022-04-28 07:25:27,488 INFO L290 TraceCheckUtils]: 27: Hoare triple {2338#true} assume true; {2338#true} is VALID [2022-04-28 07:25:27,488 INFO L290 TraceCheckUtils]: 26: Hoare triple {2338#true} assume !(0 == ~cond); {2338#true} is VALID [2022-04-28 07:25:27,488 INFO L290 TraceCheckUtils]: 25: Hoare triple {2338#true} ~cond := #in~cond; {2338#true} is VALID [2022-04-28 07:25:27,488 INFO L272 TraceCheckUtils]: 24: Hoare triple {2338#true} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {2338#true} is VALID [2022-04-28 07:25:27,488 INFO L290 TraceCheckUtils]: 23: Hoare triple {2338#true} assume !false; {2338#true} is VALID [2022-04-28 07:25:27,488 INFO L290 TraceCheckUtils]: 22: Hoare triple {2338#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {2338#true} is VALID [2022-04-28 07:25:27,488 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2338#true} {2338#true} #75#return; {2338#true} is VALID [2022-04-28 07:25:27,488 INFO L290 TraceCheckUtils]: 20: Hoare triple {2338#true} assume true; {2338#true} is VALID [2022-04-28 07:25:27,488 INFO L290 TraceCheckUtils]: 19: Hoare triple {2338#true} assume !(0 == ~cond); {2338#true} is VALID [2022-04-28 07:25:27,488 INFO L290 TraceCheckUtils]: 18: Hoare triple {2338#true} ~cond := #in~cond; {2338#true} is VALID [2022-04-28 07:25:27,489 INFO L272 TraceCheckUtils]: 17: Hoare triple {2338#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {2338#true} is VALID [2022-04-28 07:25:27,489 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2338#true} {2338#true} #73#return; {2338#true} is VALID [2022-04-28 07:25:27,489 INFO L290 TraceCheckUtils]: 15: Hoare triple {2338#true} assume true; {2338#true} is VALID [2022-04-28 07:25:27,489 INFO L290 TraceCheckUtils]: 14: Hoare triple {2338#true} assume !(0 == ~cond); {2338#true} is VALID [2022-04-28 07:25:27,489 INFO L290 TraceCheckUtils]: 13: Hoare triple {2338#true} ~cond := #in~cond; {2338#true} is VALID [2022-04-28 07:25:27,489 INFO L272 TraceCheckUtils]: 12: Hoare triple {2338#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 5 then 1 else 0)); {2338#true} is VALID [2022-04-28 07:25:27,489 INFO L290 TraceCheckUtils]: 11: Hoare triple {2338#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {2338#true} is VALID [2022-04-28 07:25:27,489 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2338#true} {2338#true} #71#return; {2338#true} is VALID [2022-04-28 07:25:27,489 INFO L290 TraceCheckUtils]: 9: Hoare triple {2338#true} assume true; {2338#true} is VALID [2022-04-28 07:25:27,489 INFO L290 TraceCheckUtils]: 8: Hoare triple {2338#true} assume !(0 == ~cond); {2338#true} is VALID [2022-04-28 07:25:27,489 INFO L290 TraceCheckUtils]: 7: Hoare triple {2338#true} ~cond := #in~cond; {2338#true} is VALID [2022-04-28 07:25:27,489 INFO L272 TraceCheckUtils]: 6: Hoare triple {2338#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 5 then 1 else 0)); {2338#true} is VALID [2022-04-28 07:25:27,489 INFO L290 TraceCheckUtils]: 5: Hoare triple {2338#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {2338#true} is VALID [2022-04-28 07:25:27,489 INFO L272 TraceCheckUtils]: 4: Hoare triple {2338#true} call #t~ret6 := main(); {2338#true} is VALID [2022-04-28 07:25:27,489 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2338#true} {2338#true} #83#return; {2338#true} is VALID [2022-04-28 07:25:27,490 INFO L290 TraceCheckUtils]: 2: Hoare triple {2338#true} assume true; {2338#true} is VALID [2022-04-28 07:25:27,490 INFO L290 TraceCheckUtils]: 1: Hoare triple {2338#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(13, 2);call #Ultimate.allocInit(12, 3); {2338#true} is VALID [2022-04-28 07:25:27,490 INFO L272 TraceCheckUtils]: 0: Hoare triple {2338#true} call ULTIMATE.init(); {2338#true} is VALID [2022-04-28 07:25:27,490 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-28 07:25:27,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:25:27,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415728627] [2022-04-28 07:25:27,490 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:25:27,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [216677075] [2022-04-28 07:25:27,490 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [216677075] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-28 07:25:27,490 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-28 07:25:27,490 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 11 [2022-04-28 07:25:27,490 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:25:27,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1090229621] [2022-04-28 07:25:27,491 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1090229621] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:25:27,491 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:25:27,491 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 07:25:27,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301158015] [2022-04-28 07:25:27,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:25:27,491 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 39 [2022-04-28 07:25:27,491 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:25:27,491 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-28 07:25:27,524 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:25:27,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 07:25:27,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:25:27,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 07:25:27,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-04-28 07:25:27,525 INFO L87 Difference]: Start difference. First operand 60 states and 73 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-28 07:25:27,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:25:27,892 INFO L93 Difference]: Finished difference Result 66 states and 78 transitions. [2022-04-28 07:25:27,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 07:25:27,892 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 39 [2022-04-28 07:25:27,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:25:27,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-28 07:25:27,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2022-04-28 07:25:27,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-28 07:25:27,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2022-04-28 07:25:27,894 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 41 transitions. [2022-04-28 07:25:27,920 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:25:27,921 INFO L225 Difference]: With dead ends: 66 [2022-04-28 07:25:27,921 INFO L226 Difference]: Without dead ends: 54 [2022-04-28 07:25:27,922 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 67 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2022-04-28 07:25:27,922 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 5 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 07:25:27,922 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 125 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 07:25:27,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-04-28 07:25:27,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2022-04-28 07:25:27,997 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:25:27,998 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand has 54 states, 37 states have (on average 1.2702702702702702) internal successors, (47), 38 states have internal predecessors, (47), 10 states have call successors, (10), 7 states have call predecessors, (10), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 07:25:27,998 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand has 54 states, 37 states have (on average 1.2702702702702702) internal successors, (47), 38 states have internal predecessors, (47), 10 states have call successors, (10), 7 states have call predecessors, (10), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 07:25:27,998 INFO L87 Difference]: Start difference. First operand 54 states. Second operand has 54 states, 37 states have (on average 1.2702702702702702) internal successors, (47), 38 states have internal predecessors, (47), 10 states have call successors, (10), 7 states have call predecessors, (10), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 07:25:27,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:25:27,999 INFO L93 Difference]: Finished difference Result 54 states and 65 transitions. [2022-04-28 07:25:27,999 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 65 transitions. [2022-04-28 07:25:27,999 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:25:27,999 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:25:28,000 INFO L74 IsIncluded]: Start isIncluded. First operand has 54 states, 37 states have (on average 1.2702702702702702) internal successors, (47), 38 states have internal predecessors, (47), 10 states have call successors, (10), 7 states have call predecessors, (10), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 54 states. [2022-04-28 07:25:28,000 INFO L87 Difference]: Start difference. First operand has 54 states, 37 states have (on average 1.2702702702702702) internal successors, (47), 38 states have internal predecessors, (47), 10 states have call successors, (10), 7 states have call predecessors, (10), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 54 states. [2022-04-28 07:25:28,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:25:28,001 INFO L93 Difference]: Finished difference Result 54 states and 65 transitions. [2022-04-28 07:25:28,001 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 65 transitions. [2022-04-28 07:25:28,001 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:25:28,001 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:25:28,001 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:25:28,001 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:25:28,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 37 states have (on average 1.2702702702702702) internal successors, (47), 38 states have internal predecessors, (47), 10 states have call successors, (10), 7 states have call predecessors, (10), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 07:25:28,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 65 transitions. [2022-04-28 07:25:28,002 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 65 transitions. Word has length 39 [2022-04-28 07:25:28,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:25:28,003 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 65 transitions. [2022-04-28 07:25:28,003 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-28 07:25:28,003 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 54 states and 65 transitions. [2022-04-28 07:25:28,083 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:25:28,084 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 65 transitions. [2022-04-28 07:25:28,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-28 07:25:28,084 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:25:28,084 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 07:25:28,103 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-28 07:25:28,284 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:25:28,285 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:25:28,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:25:28,285 INFO L85 PathProgramCache]: Analyzing trace with hash 844519116, now seen corresponding path program 1 times [2022-04-28 07:25:28,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:25:28,285 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1823213025] [2022-04-28 07:25:28,286 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 07:25:28,286 INFO L85 PathProgramCache]: Analyzing trace with hash 844519116, now seen corresponding path program 2 times [2022-04-28 07:25:28,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:25:28,286 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792899042] [2022-04-28 07:25:28,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:25:28,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:25:28,297 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:25:28,297 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [465458420] [2022-04-28 07:25:28,298 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 07:25:28,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:25:28,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:25:28,300 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-28 07:25:28,301 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-28 07:25:28,334 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 07:25:28,334 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:25:28,335 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 30 conjunts are in the unsatisfiable core [2022-04-28 07:25:28,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:25:28,344 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:25:28,758 INFO L272 TraceCheckUtils]: 0: Hoare triple {2932#true} call ULTIMATE.init(); {2932#true} is VALID [2022-04-28 07:25:28,758 INFO L290 TraceCheckUtils]: 1: Hoare triple {2932#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(13, 2);call #Ultimate.allocInit(12, 3); {2932#true} is VALID [2022-04-28 07:25:28,758 INFO L290 TraceCheckUtils]: 2: Hoare triple {2932#true} assume true; {2932#true} is VALID [2022-04-28 07:25:28,758 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2932#true} {2932#true} #83#return; {2932#true} is VALID [2022-04-28 07:25:28,758 INFO L272 TraceCheckUtils]: 4: Hoare triple {2932#true} call #t~ret6 := main(); {2932#true} is VALID [2022-04-28 07:25:28,758 INFO L290 TraceCheckUtils]: 5: Hoare triple {2932#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {2932#true} is VALID [2022-04-28 07:25:28,758 INFO L272 TraceCheckUtils]: 6: Hoare triple {2932#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 5 then 1 else 0)); {2932#true} is VALID [2022-04-28 07:25:28,759 INFO L290 TraceCheckUtils]: 7: Hoare triple {2932#true} ~cond := #in~cond; {2958#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-28 07:25:28,760 INFO L290 TraceCheckUtils]: 8: Hoare triple {2958#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {2962#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 07:25:28,761 INFO L290 TraceCheckUtils]: 9: Hoare triple {2962#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {2962#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-28 07:25:28,761 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2962#(not (= |assume_abort_if_not_#in~cond| 0))} {2932#true} #71#return; {2969#(and (<= 0 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-28 07:25:28,761 INFO L290 TraceCheckUtils]: 11: Hoare triple {2969#(and (<= 0 main_~x~0) (<= main_~x~0 5))} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {2969#(and (<= 0 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-28 07:25:28,761 INFO L272 TraceCheckUtils]: 12: Hoare triple {2969#(and (<= 0 main_~x~0) (<= main_~x~0 5))} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 5 then 1 else 0)); {2932#true} is VALID [2022-04-28 07:25:28,761 INFO L290 TraceCheckUtils]: 13: Hoare triple {2932#true} ~cond := #in~cond; {2932#true} is VALID [2022-04-28 07:25:28,762 INFO L290 TraceCheckUtils]: 14: Hoare triple {2932#true} assume !(0 == ~cond); {2932#true} is VALID [2022-04-28 07:25:28,762 INFO L290 TraceCheckUtils]: 15: Hoare triple {2932#true} assume true; {2932#true} is VALID [2022-04-28 07:25:28,766 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2932#true} {2969#(and (<= 0 main_~x~0) (<= main_~x~0 5))} #73#return; {2969#(and (<= 0 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-28 07:25:28,767 INFO L272 TraceCheckUtils]: 17: Hoare triple {2969#(and (<= 0 main_~x~0) (<= main_~x~0 5))} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {2932#true} is VALID [2022-04-28 07:25:28,767 INFO L290 TraceCheckUtils]: 18: Hoare triple {2932#true} ~cond := #in~cond; {2932#true} is VALID [2022-04-28 07:25:28,767 INFO L290 TraceCheckUtils]: 19: Hoare triple {2932#true} assume !(0 == ~cond); {2932#true} is VALID [2022-04-28 07:25:28,767 INFO L290 TraceCheckUtils]: 20: Hoare triple {2932#true} assume true; {2932#true} is VALID [2022-04-28 07:25:28,768 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2932#true} {2969#(and (<= 0 main_~x~0) (<= main_~x~0 5))} #75#return; {2969#(and (<= 0 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-28 07:25:28,768 INFO L290 TraceCheckUtils]: 22: Hoare triple {2969#(and (<= 0 main_~x~0) (<= main_~x~0 5))} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {3006#(and (<= 0 main_~x~0) (<= main_~x~0 5) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 07:25:28,768 INFO L290 TraceCheckUtils]: 23: Hoare triple {3006#(and (<= 0 main_~x~0) (<= main_~x~0 5) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !false; {3006#(and (<= 0 main_~x~0) (<= main_~x~0 5) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 07:25:28,768 INFO L272 TraceCheckUtils]: 24: Hoare triple {3006#(and (<= 0 main_~x~0) (<= main_~x~0 5) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {2932#true} is VALID [2022-04-28 07:25:28,769 INFO L290 TraceCheckUtils]: 25: Hoare triple {2932#true} ~cond := #in~cond; {3016#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:25:28,769 INFO L290 TraceCheckUtils]: 26: Hoare triple {3016#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {3020#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 07:25:28,770 INFO L290 TraceCheckUtils]: 27: Hoare triple {3020#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3020#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 07:25:28,770 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {3020#(not (= |__VERIFIER_assert_#in~cond| 0))} {3006#(and (<= 0 main_~x~0) (<= main_~x~0 5) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #77#return; {3006#(and (<= 0 main_~x~0) (<= main_~x~0 5) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 07:25:28,771 INFO L290 TraceCheckUtils]: 29: Hoare triple {3006#(and (<= 0 main_~x~0) (<= main_~x~0 5) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(0 != ~a~0 && 0 != ~b~0); {3006#(and (<= 0 main_~x~0) (<= main_~x~0 5) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 07:25:28,771 INFO L290 TraceCheckUtils]: 30: Hoare triple {3006#(and (<= 0 main_~x~0) (<= main_~x~0 5) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {3006#(and (<= 0 main_~x~0) (<= main_~x~0 5) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 07:25:28,772 INFO L290 TraceCheckUtils]: 31: Hoare triple {3006#(and (<= 0 main_~x~0) (<= main_~x~0 5) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !(1 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {3006#(and (<= 0 main_~x~0) (<= main_~x~0 5) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 07:25:28,772 INFO L290 TraceCheckUtils]: 32: Hoare triple {3006#(and (<= 0 main_~x~0) (<= main_~x~0 5) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 1 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~b~0 := ~b~0 - 1;~q~0 := ~q~0 + ~a~0 * ~p~0; {3039#(and (= main_~b~0 (+ (- 1) main_~y~0)) (<= (mod main_~a~0 2) 0) (<= 0 main_~x~0) (= (* main_~a~0 main_~p~0) main_~q~0) (<= main_~x~0 5) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 07:25:28,773 INFO L290 TraceCheckUtils]: 33: Hoare triple {3039#(and (= main_~b~0 (+ (- 1) main_~y~0)) (<= (mod main_~a~0 2) 0) (<= 0 main_~x~0) (= (* main_~a~0 main_~p~0) main_~q~0) (<= main_~x~0 5) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !false; {3039#(and (= main_~b~0 (+ (- 1) main_~y~0)) (<= (mod main_~a~0 2) 0) (<= 0 main_~x~0) (= (* main_~a~0 main_~p~0) main_~q~0) (<= main_~x~0 5) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-28 07:25:28,774 INFO L272 TraceCheckUtils]: 34: Hoare triple {3039#(and (= main_~b~0 (+ (- 1) main_~y~0)) (<= (mod main_~a~0 2) 0) (<= 0 main_~x~0) (= (* main_~a~0 main_~p~0) main_~q~0) (<= main_~x~0 5) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {3046#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 07:25:28,775 INFO L290 TraceCheckUtils]: 35: Hoare triple {3046#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3050#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:25:28,775 INFO L290 TraceCheckUtils]: 36: Hoare triple {3050#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2933#false} is VALID [2022-04-28 07:25:28,775 INFO L290 TraceCheckUtils]: 37: Hoare triple {2933#false} assume !false; {2933#false} is VALID [2022-04-28 07:25:28,775 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-04-28 07:25:28,775 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 07:25:49,494 INFO L290 TraceCheckUtils]: 37: Hoare triple {2933#false} assume !false; {2933#false} is VALID [2022-04-28 07:25:49,494 INFO L290 TraceCheckUtils]: 36: Hoare triple {3050#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2933#false} is VALID [2022-04-28 07:25:49,494 INFO L290 TraceCheckUtils]: 35: Hoare triple {3046#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3050#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 07:25:49,495 INFO L272 TraceCheckUtils]: 34: Hoare triple {3066#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {3046#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 07:25:49,495 INFO L290 TraceCheckUtils]: 33: Hoare triple {3066#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} assume !false; {3066#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} is VALID [2022-04-28 07:25:49,516 INFO L290 TraceCheckUtils]: 32: Hoare triple {3073#(or (= (* main_~y~0 main_~x~0) (+ (* main_~a~0 main_~p~0) main_~q~0 (* main_~a~0 main_~p~0 (+ (- 1) main_~b~0)))) (and (not (< main_~a~0 0)) (not (<= (mod main_~a~0 2) 0))))} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 1 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~b~0 := ~b~0 - 1;~q~0 := ~q~0 + ~a~0 * ~p~0; {3066#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} is VALID [2022-04-28 07:25:49,516 INFO L290 TraceCheckUtils]: 31: Hoare triple {3073#(or (= (* main_~y~0 main_~x~0) (+ (* main_~a~0 main_~p~0) main_~q~0 (* main_~a~0 main_~p~0 (+ (- 1) main_~b~0)))) (and (not (< main_~a~0 0)) (not (<= (mod main_~a~0 2) 0))))} assume !(1 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {3073#(or (= (* main_~y~0 main_~x~0) (+ (* main_~a~0 main_~p~0) main_~q~0 (* main_~a~0 main_~p~0 (+ (- 1) main_~b~0)))) (and (not (< main_~a~0 0)) (not (<= (mod main_~a~0 2) 0))))} is VALID [2022-04-28 07:25:49,517 INFO L290 TraceCheckUtils]: 30: Hoare triple {3073#(or (= (* main_~y~0 main_~x~0) (+ (* main_~a~0 main_~p~0) main_~q~0 (* main_~a~0 main_~p~0 (+ (- 1) main_~b~0)))) (and (not (< main_~a~0 0)) (not (<= (mod main_~a~0 2) 0))))} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {3073#(or (= (* main_~y~0 main_~x~0) (+ (* main_~a~0 main_~p~0) main_~q~0 (* main_~a~0 main_~p~0 (+ (- 1) main_~b~0)))) (and (not (< main_~a~0 0)) (not (<= (mod main_~a~0 2) 0))))} is VALID [2022-04-28 07:25:49,518 INFO L290 TraceCheckUtils]: 29: Hoare triple {3073#(or (= (* main_~y~0 main_~x~0) (+ (* main_~a~0 main_~p~0) main_~q~0 (* main_~a~0 main_~p~0 (+ (- 1) main_~b~0)))) (and (not (< main_~a~0 0)) (not (<= (mod main_~a~0 2) 0))))} assume !!(0 != ~a~0 && 0 != ~b~0); {3073#(or (= (* main_~y~0 main_~x~0) (+ (* main_~a~0 main_~p~0) main_~q~0 (* main_~a~0 main_~p~0 (+ (- 1) main_~b~0)))) (and (not (< main_~a~0 0)) (not (<= (mod main_~a~0 2) 0))))} is VALID [2022-04-28 07:25:49,518 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {3020#(not (= |__VERIFIER_assert_#in~cond| 0))} {2932#true} #77#return; {3073#(or (= (* main_~y~0 main_~x~0) (+ (* main_~a~0 main_~p~0) main_~q~0 (* main_~a~0 main_~p~0 (+ (- 1) main_~b~0)))) (and (not (< main_~a~0 0)) (not (<= (mod main_~a~0 2) 0))))} is VALID [2022-04-28 07:25:49,518 INFO L290 TraceCheckUtils]: 27: Hoare triple {3020#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3020#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 07:25:49,519 INFO L290 TraceCheckUtils]: 26: Hoare triple {3095#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {3020#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 07:25:49,519 INFO L290 TraceCheckUtils]: 25: Hoare triple {2932#true} ~cond := #in~cond; {3095#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 07:25:49,519 INFO L272 TraceCheckUtils]: 24: Hoare triple {2932#true} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {2932#true} is VALID [2022-04-28 07:25:49,519 INFO L290 TraceCheckUtils]: 23: Hoare triple {2932#true} assume !false; {2932#true} is VALID [2022-04-28 07:25:49,519 INFO L290 TraceCheckUtils]: 22: Hoare triple {2932#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {2932#true} is VALID [2022-04-28 07:25:49,519 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2932#true} {2932#true} #75#return; {2932#true} is VALID [2022-04-28 07:25:49,519 INFO L290 TraceCheckUtils]: 20: Hoare triple {2932#true} assume true; {2932#true} is VALID [2022-04-28 07:25:49,519 INFO L290 TraceCheckUtils]: 19: Hoare triple {2932#true} assume !(0 == ~cond); {2932#true} is VALID [2022-04-28 07:25:49,520 INFO L290 TraceCheckUtils]: 18: Hoare triple {2932#true} ~cond := #in~cond; {2932#true} is VALID [2022-04-28 07:25:49,520 INFO L272 TraceCheckUtils]: 17: Hoare triple {2932#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {2932#true} is VALID [2022-04-28 07:25:49,520 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2932#true} {2932#true} #73#return; {2932#true} is VALID [2022-04-28 07:25:49,520 INFO L290 TraceCheckUtils]: 15: Hoare triple {2932#true} assume true; {2932#true} is VALID [2022-04-28 07:25:49,520 INFO L290 TraceCheckUtils]: 14: Hoare triple {2932#true} assume !(0 == ~cond); {2932#true} is VALID [2022-04-28 07:25:49,520 INFO L290 TraceCheckUtils]: 13: Hoare triple {2932#true} ~cond := #in~cond; {2932#true} is VALID [2022-04-28 07:25:49,520 INFO L272 TraceCheckUtils]: 12: Hoare triple {2932#true} call assume_abort_if_not((if ~y~0 >= 0 && ~y~0 <= 5 then 1 else 0)); {2932#true} is VALID [2022-04-28 07:25:49,520 INFO L290 TraceCheckUtils]: 11: Hoare triple {2932#true} assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {2932#true} is VALID [2022-04-28 07:25:49,520 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2932#true} {2932#true} #71#return; {2932#true} is VALID [2022-04-28 07:25:49,520 INFO L290 TraceCheckUtils]: 9: Hoare triple {2932#true} assume true; {2932#true} is VALID [2022-04-28 07:25:49,520 INFO L290 TraceCheckUtils]: 8: Hoare triple {2932#true} assume !(0 == ~cond); {2932#true} is VALID [2022-04-28 07:25:49,520 INFO L290 TraceCheckUtils]: 7: Hoare triple {2932#true} ~cond := #in~cond; {2932#true} is VALID [2022-04-28 07:25:49,520 INFO L272 TraceCheckUtils]: 6: Hoare triple {2932#true} call assume_abort_if_not((if ~x~0 >= 0 && ~x~0 <= 5 then 1 else 0)); {2932#true} is VALID [2022-04-28 07:25:49,520 INFO L290 TraceCheckUtils]: 5: Hoare triple {2932#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4; {2932#true} is VALID [2022-04-28 07:25:49,520 INFO L272 TraceCheckUtils]: 4: Hoare triple {2932#true} call #t~ret6 := main(); {2932#true} is VALID [2022-04-28 07:25:49,520 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2932#true} {2932#true} #83#return; {2932#true} is VALID [2022-04-28 07:25:49,520 INFO L290 TraceCheckUtils]: 2: Hoare triple {2932#true} assume true; {2932#true} is VALID [2022-04-28 07:25:49,521 INFO L290 TraceCheckUtils]: 1: Hoare triple {2932#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(13, 2);call #Ultimate.allocInit(12, 3); {2932#true} is VALID [2022-04-28 07:25:49,521 INFO L272 TraceCheckUtils]: 0: Hoare triple {2932#true} call ULTIMATE.init(); {2932#true} is VALID [2022-04-28 07:25:49,521 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-28 07:25:49,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:25:49,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792899042] [2022-04-28 07:25:49,521 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:25:49,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [465458420] [2022-04-28 07:25:49,521 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [465458420] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 07:25:49,521 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 07:25:49,521 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 14 [2022-04-28 07:25:49,521 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 07:25:49,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1823213025] [2022-04-28 07:25:49,521 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1823213025] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 07:25:49,521 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 07:25:49,522 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 07:25:49,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237247808] [2022-04-28 07:25:49,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 07:25:49,522 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 10 states have internal predecessors, (23), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 38 [2022-04-28 07:25:49,522 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 07:25:49,522 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 10 states have internal predecessors, (23), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-28 07:25:49,572 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-28 07:25:49,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 07:25:49,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 07:25:49,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 07:25:49,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2022-04-28 07:25:49,572 INFO L87 Difference]: Start difference. First operand 54 states and 65 transitions. Second operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 10 states have internal predecessors, (23), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-28 07:25:50,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:25:50,177 INFO L93 Difference]: Finished difference Result 79 states and 100 transitions. [2022-04-28 07:25:50,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-28 07:25:50,177 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 10 states have internal predecessors, (23), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 38 [2022-04-28 07:25:50,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 07:25:50,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 10 states have internal predecessors, (23), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-28 07:25:50,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 77 transitions. [2022-04-28 07:25:50,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 10 states have internal predecessors, (23), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-28 07:25:50,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 77 transitions. [2022-04-28 07:25:50,180 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 77 transitions. [2022-04-28 07:25:50,243 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:25:50,244 INFO L225 Difference]: With dead ends: 79 [2022-04-28 07:25:50,244 INFO L226 Difference]: Without dead ends: 66 [2022-04-28 07:25:50,245 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2022-04-28 07:25:50,245 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 32 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 07:25:50,245 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 126 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 07:25:50,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-04-28 07:25:50,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2022-04-28 07:25:50,333 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 07:25:50,334 INFO L82 GeneralOperation]: Start isEquivalent. First operand 66 states. Second operand has 64 states, 45 states have (on average 1.288888888888889) internal successors, (58), 46 states have internal predecessors, (58), 11 states have call successors, (11), 8 states have call predecessors, (11), 7 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 07:25:50,334 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand has 64 states, 45 states have (on average 1.288888888888889) internal successors, (58), 46 states have internal predecessors, (58), 11 states have call successors, (11), 8 states have call predecessors, (11), 7 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 07:25:50,334 INFO L87 Difference]: Start difference. First operand 66 states. Second operand has 64 states, 45 states have (on average 1.288888888888889) internal successors, (58), 46 states have internal predecessors, (58), 11 states have call successors, (11), 8 states have call predecessors, (11), 7 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 07:25:50,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:25:50,335 INFO L93 Difference]: Finished difference Result 66 states and 81 transitions. [2022-04-28 07:25:50,335 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 81 transitions. [2022-04-28 07:25:50,335 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:25:50,336 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:25:50,336 INFO L74 IsIncluded]: Start isIncluded. First operand has 64 states, 45 states have (on average 1.288888888888889) internal successors, (58), 46 states have internal predecessors, (58), 11 states have call successors, (11), 8 states have call predecessors, (11), 7 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 66 states. [2022-04-28 07:25:50,336 INFO L87 Difference]: Start difference. First operand has 64 states, 45 states have (on average 1.288888888888889) internal successors, (58), 46 states have internal predecessors, (58), 11 states have call successors, (11), 8 states have call predecessors, (11), 7 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 66 states. [2022-04-28 07:25:50,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 07:25:50,338 INFO L93 Difference]: Finished difference Result 66 states and 81 transitions. [2022-04-28 07:25:50,338 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 81 transitions. [2022-04-28 07:25:50,338 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 07:25:50,338 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 07:25:50,338 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 07:25:50,338 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 07:25:50,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 45 states have (on average 1.288888888888889) internal successors, (58), 46 states have internal predecessors, (58), 11 states have call successors, (11), 8 states have call predecessors, (11), 7 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 07:25:50,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 78 transitions. [2022-04-28 07:25:50,340 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 78 transitions. Word has length 38 [2022-04-28 07:25:50,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 07:25:50,340 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 78 transitions. [2022-04-28 07:25:50,341 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 10 states have internal predecessors, (23), 4 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-28 07:25:50,341 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 64 states and 78 transitions. [2022-04-28 07:25:50,436 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 07:25:50,436 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 78 transitions. [2022-04-28 07:25:50,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-28 07:25:50,437 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 07:25:50,437 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 07:25:50,453 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-28 07:25:50,648 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:25:50,648 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 07:25:50,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 07:25:50,648 INFO L85 PathProgramCache]: Analyzing trace with hash 901777418, now seen corresponding path program 1 times [2022-04-28 07:25:50,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 07:25:50,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1211922735] [2022-04-28 07:25:50,649 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 07:25:50,649 INFO L85 PathProgramCache]: Analyzing trace with hash 901777418, now seen corresponding path program 2 times [2022-04-28 07:25:50,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 07:25:50,649 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472919056] [2022-04-28 07:25:50,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 07:25:50,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 07:25:50,671 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 07:25:50,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [589619146] [2022-04-28 07:25:50,672 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 07:25:50,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:25:50,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 07:25:50,673 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 07:25:50,674 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-28 07:25:50,739 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 07:25:50,740 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 07:25:50,741 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 42 conjunts are in the unsatisfiable core [2022-04-28 07:25:50,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 07:25:50,754 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 07:25:51,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 07:25:51,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472919056] [2022-04-28 07:25:51,848 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 07:25:51,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [589619146] [2022-04-28 07:25:51,848 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2022-04-28 07:25:51,855 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-28 07:25:52,049 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 07:25:52,049 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: transformation to positive normal form unsound at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.polynomials.PolynomialRelation.positiveNormalForm(PolynomialRelation.java:434) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.polynomials.PolynomialRelation.solveForSubject(PolynomialRelation.java:477) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DerScout.transduceAtom(DerScout.java:101) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DerScout.transduceAtom(DerScout.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.CondisTermTransducer.transduceImmediately(CondisTermTransducer.java:67) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.TermTransducer$TermTransducerHelper.convert(TermTransducer.java:76) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.cacheConvert(TermTransformer.java:131) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$Convert.walk(TermTransformer.java:79) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:285) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.TermTransducer.transduce(TermTransducer.java:60) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.computeDerApplicabilityScore(QuantifierPusher.java:605) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.selectBestEliminatee(QuantifierPusher.java:589) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:135) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective2(QuantifierPusher.java:389) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:346) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:175) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:65) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:264) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:250) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:199) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:299) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolationCore.runStrategy(AcceleratedInterpolationCore.java:300) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolationCore.acceleratedInterpolationCoreIsCorrect(AcceleratedInterpolationCore.java:203) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.(AcceleratedInterpolation.java:195) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleAcceleratedInterpolation.construct(IpTcStrategyModuleAcceleratedInterpolation.java:80) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:248) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:409) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:300) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:260) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:152) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-04-28 07:25:52,053 INFO L158 Benchmark]: Toolchain (without parser) took 199867.66ms. Allocated memory was 195.0MB in the beginning and 280.0MB in the end (delta: 84.9MB). Free memory was 147.9MB in the beginning and 182.9MB in the end (delta: -35.0MB). Peak memory consumption was 50.9MB. Max. memory is 8.0GB. [2022-04-28 07:25:52,053 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 195.0MB. Free memory was 164.1MB in the beginning and 163.9MB in the end (delta: 146.9kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 07:25:52,053 INFO L158 Benchmark]: CACSL2BoogieTranslator took 161.57ms. Allocated memory is still 195.0MB. Free memory was 147.8MB in the beginning and 173.5MB in the end (delta: -25.7MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2022-04-28 07:25:52,053 INFO L158 Benchmark]: Boogie Preprocessor took 19.16ms. Allocated memory is still 195.0MB. Free memory was 173.5MB in the beginning and 171.9MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-28 07:25:52,053 INFO L158 Benchmark]: RCFGBuilder took 335.94ms. Allocated memory is still 195.0MB. Free memory was 171.9MB in the beginning and 158.3MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-04-28 07:25:52,054 INFO L158 Benchmark]: TraceAbstraction took 199347.68ms. Allocated memory was 195.0MB in the beginning and 280.0MB in the end (delta: 84.9MB). Free memory was 157.7MB in the beginning and 182.9MB in the end (delta: -25.1MB). Peak memory consumption was 60.3MB. Max. memory is 8.0GB. [2022-04-28 07:25:52,055 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 195.0MB. Free memory was 164.1MB in the beginning and 163.9MB in the end (delta: 146.9kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 161.57ms. Allocated memory is still 195.0MB. Free memory was 147.8MB in the beginning and 173.5MB in the end (delta: -25.7MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * Boogie Preprocessor took 19.16ms. Allocated memory is still 195.0MB. Free memory was 173.5MB in the beginning and 171.9MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 335.94ms. Allocated memory is still 195.0MB. Free memory was 171.9MB in the beginning and 158.3MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * TraceAbstraction took 199347.68ms. Allocated memory was 195.0MB in the beginning and 280.0MB in the end (delta: 84.9MB). Free memory was 157.7MB in the beginning and 182.9MB in the end (delta: -25.1MB). Peak memory consumption was 60.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: transformation to positive normal form unsound de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: transformation to positive normal form unsound: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.polynomials.PolynomialRelation.positiveNormalForm(PolynomialRelation.java:434) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-04-28 07:25:52,092 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...