/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/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/egcd2-ll_unwindbound1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 14:46:23,325 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 14:46:23,328 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 14:46:23,362 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 14:46:23,362 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 14:46:23,363 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 14:46:23,365 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 14:46:23,368 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 14:46:23,369 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 14:46:23,372 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 14:46:23,372 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 14:46:23,373 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 14:46:23,373 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 14:46:23,374 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 14:46:23,374 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 14:46:23,375 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 14:46:23,375 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 14:46:23,376 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 14:46:23,376 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 14:46:23,377 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 14:46:23,378 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 14:46:23,378 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 14:46:23,379 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 14:46:23,380 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 14:46:23,380 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 14:46:23,385 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 14:46:23,385 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 14:46:23,385 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 14:46:23,386 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 14:46:23,386 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 14:46:23,387 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 14:46:23,387 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 14:46:23,387 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 14:46:23,387 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 14:46:23,388 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 14:46:23,388 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 14:46:23,389 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 14:46:23,389 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 14:46:23,389 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 14:46:23,389 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 14:46:23,390 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 14:46:23,393 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 14:46:23,394 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-15 14:46:23,400 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 14:46:23,400 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 14:46:23,401 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 14:46:23,401 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 14:46:23,401 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 14:46:23,401 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 14:46:23,401 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 14:46:23,401 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 14:46:23,401 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 14:46:23,402 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 14:46:23,402 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 14:46:23,402 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 14:46:23,402 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 14:46:23,402 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 14:46:23,402 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 14:46:23,403 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 14:46:23,403 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 14:46:23,403 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 14:46:23,403 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 14:46:23,403 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 14:46:23,403 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 14:46:23,403 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-15 14:46:23,403 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-15 14:46:23,564 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 14:46:23,577 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 14:46:23,578 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 14:46:23,579 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 14:46:23,580 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 14:46:23,581 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/egcd2-ll_unwindbound1.c [2022-04-15 14:46:23,625 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e141643f7/3c8f0ac23c9f4c159a771893e0ddfb31/FLAG9f50e85eb [2022-04-15 14:46:23,970 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 14:46:23,971 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/egcd2-ll_unwindbound1.c [2022-04-15 14:46:23,977 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e141643f7/3c8f0ac23c9f4c159a771893e0ddfb31/FLAG9f50e85eb [2022-04-15 14:46:24,408 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e141643f7/3c8f0ac23c9f4c159a771893e0ddfb31 [2022-04-15 14:46:24,410 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 14:46:24,411 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 14:46:24,412 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 14:46:24,412 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 14:46:24,414 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 14:46:24,415 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 02:46:24" (1/1) ... [2022-04-15 14:46:24,416 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b3b7b86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:46:24, skipping insertion in model container [2022-04-15 14:46:24,416 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 02:46:24" (1/1) ... [2022-04-15 14:46:24,421 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 14:46:24,431 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 14:46:24,552 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/egcd2-ll_unwindbound1.c[490,503] [2022-04-15 14:46:24,567 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 14:46:24,574 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 14:46:24,583 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/egcd2-ll_unwindbound1.c[490,503] [2022-04-15 14:46:24,608 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 14:46:24,620 INFO L208 MainTranslator]: Completed translation [2022-04-15 14:46:24,621 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:46:24 WrapperNode [2022-04-15 14:46:24,621 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 14:46:24,621 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 14:46:24,621 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 14:46:24,621 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 14:46:24,628 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:46:24" (1/1) ... [2022-04-15 14:46:24,628 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:46:24" (1/1) ... [2022-04-15 14:46:24,637 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:46:24" (1/1) ... [2022-04-15 14:46:24,638 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:46:24" (1/1) ... [2022-04-15 14:46:24,643 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:46:24" (1/1) ... [2022-04-15 14:46:24,653 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:46:24" (1/1) ... [2022-04-15 14:46:24,653 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:46:24" (1/1) ... [2022-04-15 14:46:24,655 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 14:46:24,655 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 14:46:24,655 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 14:46:24,655 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 14:46:24,660 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:46:24" (1/1) ... [2022-04-15 14:46:24,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 14:46:24,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 14:46:24,684 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-15 14:46:24,689 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-15 14:46:24,710 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 14:46:24,710 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 14:46:24,710 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 14:46:24,711 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-15 14:46:24,711 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 14:46:24,711 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 14:46:24,711 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 14:46:24,711 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 14:46:24,711 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 14:46:24,711 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 14:46:24,712 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-15 14:46:24,712 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-15 14:46:24,712 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 14:46:24,712 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 14:46:24,713 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 14:46:24,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 14:46:24,714 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 14:46:24,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 14:46:24,714 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 14:46:24,714 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 14:46:24,796 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 14:46:24,798 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 14:46:24,938 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 14:46:24,942 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 14:46:24,942 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-15 14:46:24,944 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 02:46:24 BoogieIcfgContainer [2022-04-15 14:46:24,944 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 14:46:24,945 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 14:46:24,945 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 14:46:24,965 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 14:46:24,965 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 02:46:24" (1/3) ... [2022-04-15 14:46:24,966 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b629bc4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 02:46:24, skipping insertion in model container [2022-04-15 14:46:24,966 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 02:46:24" (2/3) ... [2022-04-15 14:46:24,966 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b629bc4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 02:46:24, skipping insertion in model container [2022-04-15 14:46:24,966 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 02:46:24" (3/3) ... [2022-04-15 14:46:24,967 INFO L111 eAbstractionObserver]: Analyzing ICFG egcd2-ll_unwindbound1.c [2022-04-15 14:46:24,970 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 14:46:24,970 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 14:46:24,995 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 14:46:24,999 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-15 14:46:25,000 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 14:46:25,015 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 23 states have internal predecessors, (30), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-15 14:46:25,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-15 14:46:25,023 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 14:46:25,024 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 14:46:25,026 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 14:46:25,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 14:46:25,036 INFO L85 PathProgramCache]: Analyzing trace with hash 1950618521, now seen corresponding path program 1 times [2022-04-15 14:46:25,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 14:46:25,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1482049883] [2022-04-15 14:46:25,051 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 14:46:25,051 INFO L85 PathProgramCache]: Analyzing trace with hash 1950618521, now seen corresponding path program 2 times [2022-04-15 14:46:25,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 14:46:25,053 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848125270] [2022-04-15 14:46:25,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 14:46:25,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 14:46:25,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 14:46:25,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 14:46:25,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 14:46:25,238 INFO L290 TraceCheckUtils]: 0: Hoare triple {63#(and (= ~counter~0 |old(~counter~0)|) (= |#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {42#true} is VALID [2022-04-15 14:46:25,239 INFO L290 TraceCheckUtils]: 1: Hoare triple {42#true} assume true; {42#true} is VALID [2022-04-15 14:46:25,239 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {42#true} {42#true} #98#return; {42#true} is VALID [2022-04-15 14:46:25,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 14:46:25,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 14:46:25,253 INFO L290 TraceCheckUtils]: 0: Hoare triple {42#true} ~cond := #in~cond; {42#true} is VALID [2022-04-15 14:46:25,253 INFO L290 TraceCheckUtils]: 1: Hoare triple {42#true} assume 0 == ~cond;assume false; {43#false} is VALID [2022-04-15 14:46:25,254 INFO L290 TraceCheckUtils]: 2: Hoare triple {43#false} assume true; {43#false} is VALID [2022-04-15 14:46:25,254 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43#false} {42#true} #78#return; {43#false} is VALID [2022-04-15 14:46:25,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-15 14:46:25,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 14:46:25,268 INFO L290 TraceCheckUtils]: 0: Hoare triple {42#true} ~cond := #in~cond; {42#true} is VALID [2022-04-15 14:46:25,269 INFO L290 TraceCheckUtils]: 1: Hoare triple {42#true} assume 0 == ~cond;assume false; {43#false} is VALID [2022-04-15 14:46:25,269 INFO L290 TraceCheckUtils]: 2: Hoare triple {43#false} assume true; {43#false} is VALID [2022-04-15 14:46:25,270 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43#false} {43#false} #80#return; {43#false} is VALID [2022-04-15 14:46:25,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-15 14:46:25,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 14:46:25,282 INFO L290 TraceCheckUtils]: 0: Hoare triple {42#true} ~cond := #in~cond; {42#true} is VALID [2022-04-15 14:46:25,283 INFO L290 TraceCheckUtils]: 1: Hoare triple {42#true} assume 0 == ~cond;assume false; {43#false} is VALID [2022-04-15 14:46:25,283 INFO L290 TraceCheckUtils]: 2: Hoare triple {43#false} assume true; {43#false} is VALID [2022-04-15 14:46:25,283 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43#false} {43#false} #82#return; {43#false} is VALID [2022-04-15 14:46:25,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-04-15 14:46:25,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 14:46:25,298 INFO L290 TraceCheckUtils]: 0: Hoare triple {42#true} ~cond := #in~cond; {42#true} is VALID [2022-04-15 14:46:25,298 INFO L290 TraceCheckUtils]: 1: Hoare triple {42#true} assume 0 == ~cond;assume false; {43#false} is VALID [2022-04-15 14:46:25,299 INFO L290 TraceCheckUtils]: 2: Hoare triple {43#false} assume true; {43#false} is VALID [2022-04-15 14:46:25,299 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43#false} {43#false} #84#return; {43#false} is VALID [2022-04-15 14:46:25,301 INFO L272 TraceCheckUtils]: 0: Hoare triple {42#true} call ULTIMATE.init(); {63#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 14:46:25,301 INFO L290 TraceCheckUtils]: 1: Hoare triple {63#(and (= ~counter~0 |old(~counter~0)|) (= |#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {42#true} is VALID [2022-04-15 14:46:25,302 INFO L290 TraceCheckUtils]: 2: Hoare triple {42#true} assume true; {42#true} is VALID [2022-04-15 14:46:25,302 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42#true} {42#true} #98#return; {42#true} is VALID [2022-04-15 14:46:25,302 INFO L272 TraceCheckUtils]: 4: Hoare triple {42#true} call #t~ret8 := main(); {42#true} is VALID [2022-04-15 14:46:25,303 INFO L290 TraceCheckUtils]: 5: Hoare triple {42#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {42#true} is VALID [2022-04-15 14:46:25,303 INFO L272 TraceCheckUtils]: 6: Hoare triple {42#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {42#true} is VALID [2022-04-15 14:46:25,303 INFO L290 TraceCheckUtils]: 7: Hoare triple {42#true} ~cond := #in~cond; {42#true} is VALID [2022-04-15 14:46:25,304 INFO L290 TraceCheckUtils]: 8: Hoare triple {42#true} assume 0 == ~cond;assume false; {43#false} is VALID [2022-04-15 14:46:25,304 INFO L290 TraceCheckUtils]: 9: Hoare triple {43#false} assume true; {43#false} is VALID [2022-04-15 14:46:25,304 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {43#false} {42#true} #78#return; {43#false} is VALID [2022-04-15 14:46:25,304 INFO L272 TraceCheckUtils]: 11: Hoare triple {43#false} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {42#true} is VALID [2022-04-15 14:46:25,304 INFO L290 TraceCheckUtils]: 12: Hoare triple {42#true} ~cond := #in~cond; {42#true} is VALID [2022-04-15 14:46:25,305 INFO L290 TraceCheckUtils]: 13: Hoare triple {42#true} assume 0 == ~cond;assume false; {43#false} is VALID [2022-04-15 14:46:25,305 INFO L290 TraceCheckUtils]: 14: Hoare triple {43#false} assume true; {43#false} is VALID [2022-04-15 14:46:25,305 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {43#false} {43#false} #80#return; {43#false} is VALID [2022-04-15 14:46:25,305 INFO L290 TraceCheckUtils]: 16: Hoare triple {43#false} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {43#false} is VALID [2022-04-15 14:46:25,305 INFO L272 TraceCheckUtils]: 17: Hoare triple {43#false} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {42#true} is VALID [2022-04-15 14:46:25,306 INFO L290 TraceCheckUtils]: 18: Hoare triple {42#true} ~cond := #in~cond; {42#true} is VALID [2022-04-15 14:46:25,306 INFO L290 TraceCheckUtils]: 19: Hoare triple {42#true} assume 0 == ~cond;assume false; {43#false} is VALID [2022-04-15 14:46:25,306 INFO L290 TraceCheckUtils]: 20: Hoare triple {43#false} assume true; {43#false} is VALID [2022-04-15 14:46:25,307 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {43#false} {43#false} #82#return; {43#false} is VALID [2022-04-15 14:46:25,307 INFO L272 TraceCheckUtils]: 22: Hoare triple {43#false} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {42#true} is VALID [2022-04-15 14:46:25,307 INFO L290 TraceCheckUtils]: 23: Hoare triple {42#true} ~cond := #in~cond; {42#true} is VALID [2022-04-15 14:46:25,307 INFO L290 TraceCheckUtils]: 24: Hoare triple {42#true} assume 0 == ~cond;assume false; {43#false} is VALID [2022-04-15 14:46:25,308 INFO L290 TraceCheckUtils]: 25: Hoare triple {43#false} assume true; {43#false} is VALID [2022-04-15 14:46:25,309 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {43#false} {43#false} #84#return; {43#false} is VALID [2022-04-15 14:46:25,309 INFO L290 TraceCheckUtils]: 27: Hoare triple {43#false} assume !true; {43#false} is VALID [2022-04-15 14:46:25,311 INFO L272 TraceCheckUtils]: 28: Hoare triple {43#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {43#false} is VALID [2022-04-15 14:46:25,311 INFO L290 TraceCheckUtils]: 29: Hoare triple {43#false} ~cond := #in~cond; {43#false} is VALID [2022-04-15 14:46:25,312 INFO L290 TraceCheckUtils]: 30: Hoare triple {43#false} assume 0 == ~cond; {43#false} is VALID [2022-04-15 14:46:25,312 INFO L290 TraceCheckUtils]: 31: Hoare triple {43#false} assume !false; {43#false} is VALID [2022-04-15 14:46:25,312 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-15 14:46:25,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 14:46:25,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848125270] [2022-04-15 14:46:25,314 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848125270] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 14:46:25,314 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 14:46:25,314 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 14:46:25,317 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 14:46:25,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1482049883] [2022-04-15 14:46:25,318 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1482049883] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 14:46:25,318 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 14:46:25,318 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 14:46:25,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004670986] [2022-04-15 14:46:25,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 14:46:25,323 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 32 [2022-04-15 14:46:25,324 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 14:46:25,326 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-15 14:46:25,353 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:46:25,354 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 14:46:25,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 14:46:25,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 14:46:25,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 14:46:25,378 INFO L87 Difference]: Start difference. First operand has 39 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 23 states have internal predecessors, (30), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-15 14:46:25,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:46:25,564 INFO L93 Difference]: Finished difference Result 72 states and 112 transitions. [2022-04-15 14:46:25,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 14:46:25,567 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 32 [2022-04-15 14:46:25,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 14:46:25,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-15 14:46:25,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 112 transitions. [2022-04-15 14:46:25,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-15 14:46:25,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 112 transitions. [2022-04-15 14:46:25,595 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 112 transitions. [2022-04-15 14:46:25,702 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:46:25,714 INFO L225 Difference]: With dead ends: 72 [2022-04-15 14:46:25,714 INFO L226 Difference]: Without dead ends: 35 [2022-04-15 14:46:25,717 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 15 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-15 14:46:25,720 INFO L913 BasicCegarLoop]: 45 mSDtfsCounter, 10 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 14:46:25,722 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 49 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 14:46:25,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-15 14:46:25,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2022-04-15 14:46:25,745 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 14:46:25,746 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 34 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 20 states have internal predecessors, (23), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 14:46:25,746 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 34 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 20 states have internal predecessors, (23), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 14:46:25,747 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 34 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 20 states have internal predecessors, (23), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 14:46:25,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:46:25,750 INFO L93 Difference]: Finished difference Result 35 states and 46 transitions. [2022-04-15 14:46:25,750 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 46 transitions. [2022-04-15 14:46:25,751 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:46:25,751 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:46:25,751 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 20 states have internal predecessors, (23), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 35 states. [2022-04-15 14:46:25,751 INFO L87 Difference]: Start difference. First operand has 34 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 20 states have internal predecessors, (23), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 35 states. [2022-04-15 14:46:25,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:46:25,754 INFO L93 Difference]: Finished difference Result 35 states and 46 transitions. [2022-04-15 14:46:25,754 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 46 transitions. [2022-04-15 14:46:25,755 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:46:25,755 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:46:25,755 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 14:46:25,755 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 14:46:25,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 20 states have internal predecessors, (23), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 14:46:25,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 45 transitions. [2022-04-15 14:46:25,758 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 45 transitions. Word has length 32 [2022-04-15 14:46:25,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 14:46:25,759 INFO L478 AbstractCegarLoop]: Abstraction has 34 states and 45 transitions. [2022-04-15 14:46:25,759 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-15 14:46:25,759 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 45 transitions. [2022-04-15 14:46:25,796 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:46:25,796 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 45 transitions. [2022-04-15 14:46:25,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-15 14:46:25,797 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 14:46:25,797 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 14:46:25,797 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 14:46:25,797 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 14:46:25,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 14:46:25,798 INFO L85 PathProgramCache]: Analyzing trace with hash -1734391985, now seen corresponding path program 1 times [2022-04-15 14:46:25,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 14:46:25,798 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [429091941] [2022-04-15 14:46:25,798 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 14:46:25,799 INFO L85 PathProgramCache]: Analyzing trace with hash -1734391985, now seen corresponding path program 2 times [2022-04-15 14:46:25,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 14:46:25,799 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229244960] [2022-04-15 14:46:25,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 14:46:25,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 14:46:25,831 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 14:46:25,831 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2049202977] [2022-04-15 14:46:25,831 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 14:46:25,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 14:46:25,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 14:46:25,833 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 14:46:25,834 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-15 14:46:25,876 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-15 14:46:25,876 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 14:46:25,877 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-15 14:46:25,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 14:46:25,903 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 14:46:26,124 INFO L272 TraceCheckUtils]: 0: Hoare triple {348#true} call ULTIMATE.init(); {348#true} is VALID [2022-04-15 14:46:26,125 INFO L290 TraceCheckUtils]: 1: Hoare triple {348#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {356#(<= ~counter~0 0)} is VALID [2022-04-15 14:46:26,125 INFO L290 TraceCheckUtils]: 2: Hoare triple {356#(<= ~counter~0 0)} assume true; {356#(<= ~counter~0 0)} is VALID [2022-04-15 14:46:26,126 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {356#(<= ~counter~0 0)} {348#true} #98#return; {356#(<= ~counter~0 0)} is VALID [2022-04-15 14:46:26,128 INFO L272 TraceCheckUtils]: 4: Hoare triple {356#(<= ~counter~0 0)} call #t~ret8 := main(); {356#(<= ~counter~0 0)} is VALID [2022-04-15 14:46:26,128 INFO L290 TraceCheckUtils]: 5: Hoare triple {356#(<= ~counter~0 0)} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {356#(<= ~counter~0 0)} is VALID [2022-04-15 14:46:26,129 INFO L272 TraceCheckUtils]: 6: Hoare triple {356#(<= ~counter~0 0)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {356#(<= ~counter~0 0)} is VALID [2022-04-15 14:46:26,130 INFO L290 TraceCheckUtils]: 7: Hoare triple {356#(<= ~counter~0 0)} ~cond := #in~cond; {356#(<= ~counter~0 0)} is VALID [2022-04-15 14:46:26,130 INFO L290 TraceCheckUtils]: 8: Hoare triple {356#(<= ~counter~0 0)} assume !(0 == ~cond); {356#(<= ~counter~0 0)} is VALID [2022-04-15 14:46:26,130 INFO L290 TraceCheckUtils]: 9: Hoare triple {356#(<= ~counter~0 0)} assume true; {356#(<= ~counter~0 0)} is VALID [2022-04-15 14:46:26,131 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {356#(<= ~counter~0 0)} {356#(<= ~counter~0 0)} #78#return; {356#(<= ~counter~0 0)} is VALID [2022-04-15 14:46:26,131 INFO L272 TraceCheckUtils]: 11: Hoare triple {356#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {356#(<= ~counter~0 0)} is VALID [2022-04-15 14:46:26,132 INFO L290 TraceCheckUtils]: 12: Hoare triple {356#(<= ~counter~0 0)} ~cond := #in~cond; {356#(<= ~counter~0 0)} is VALID [2022-04-15 14:46:26,132 INFO L290 TraceCheckUtils]: 13: Hoare triple {356#(<= ~counter~0 0)} assume !(0 == ~cond); {356#(<= ~counter~0 0)} is VALID [2022-04-15 14:46:26,132 INFO L290 TraceCheckUtils]: 14: Hoare triple {356#(<= ~counter~0 0)} assume true; {356#(<= ~counter~0 0)} is VALID [2022-04-15 14:46:26,133 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {356#(<= ~counter~0 0)} {356#(<= ~counter~0 0)} #80#return; {356#(<= ~counter~0 0)} is VALID [2022-04-15 14:46:26,133 INFO L290 TraceCheckUtils]: 16: Hoare triple {356#(<= ~counter~0 0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {356#(<= ~counter~0 0)} is VALID [2022-04-15 14:46:26,134 INFO L272 TraceCheckUtils]: 17: Hoare triple {356#(<= ~counter~0 0)} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {356#(<= ~counter~0 0)} is VALID [2022-04-15 14:46:26,134 INFO L290 TraceCheckUtils]: 18: Hoare triple {356#(<= ~counter~0 0)} ~cond := #in~cond; {356#(<= ~counter~0 0)} is VALID [2022-04-15 14:46:26,135 INFO L290 TraceCheckUtils]: 19: Hoare triple {356#(<= ~counter~0 0)} assume !(0 == ~cond); {356#(<= ~counter~0 0)} is VALID [2022-04-15 14:46:26,135 INFO L290 TraceCheckUtils]: 20: Hoare triple {356#(<= ~counter~0 0)} assume true; {356#(<= ~counter~0 0)} is VALID [2022-04-15 14:46:26,135 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {356#(<= ~counter~0 0)} {356#(<= ~counter~0 0)} #82#return; {356#(<= ~counter~0 0)} is VALID [2022-04-15 14:46:26,136 INFO L272 TraceCheckUtils]: 22: Hoare triple {356#(<= ~counter~0 0)} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {356#(<= ~counter~0 0)} is VALID [2022-04-15 14:46:26,136 INFO L290 TraceCheckUtils]: 23: Hoare triple {356#(<= ~counter~0 0)} ~cond := #in~cond; {356#(<= ~counter~0 0)} is VALID [2022-04-15 14:46:26,137 INFO L290 TraceCheckUtils]: 24: Hoare triple {356#(<= ~counter~0 0)} assume !(0 == ~cond); {356#(<= ~counter~0 0)} is VALID [2022-04-15 14:46:26,137 INFO L290 TraceCheckUtils]: 25: Hoare triple {356#(<= ~counter~0 0)} assume true; {356#(<= ~counter~0 0)} is VALID [2022-04-15 14:46:26,137 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {356#(<= ~counter~0 0)} {356#(<= ~counter~0 0)} #84#return; {356#(<= ~counter~0 0)} is VALID [2022-04-15 14:46:26,138 INFO L290 TraceCheckUtils]: 27: Hoare triple {356#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {435#(<= |main_#t~post6| 0)} is VALID [2022-04-15 14:46:26,138 INFO L290 TraceCheckUtils]: 28: Hoare triple {435#(<= |main_#t~post6| 0)} assume !(#t~post6 < 1);havoc #t~post6; {349#false} is VALID [2022-04-15 14:46:26,139 INFO L272 TraceCheckUtils]: 29: Hoare triple {349#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {349#false} is VALID [2022-04-15 14:46:26,139 INFO L290 TraceCheckUtils]: 30: Hoare triple {349#false} ~cond := #in~cond; {349#false} is VALID [2022-04-15 14:46:26,139 INFO L290 TraceCheckUtils]: 31: Hoare triple {349#false} assume 0 == ~cond; {349#false} is VALID [2022-04-15 14:46:26,140 INFO L290 TraceCheckUtils]: 32: Hoare triple {349#false} assume !false; {349#false} is VALID [2022-04-15 14:46:26,140 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-15 14:46:26,140 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 14:46:26,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 14:46:26,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229244960] [2022-04-15 14:46:26,141 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 14:46:26,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2049202977] [2022-04-15 14:46:26,142 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2049202977] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 14:46:26,142 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 14:46:26,142 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 14:46:26,143 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 14:46:26,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [429091941] [2022-04-15 14:46:26,143 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [429091941] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 14:46:26,143 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 14:46:26,143 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 14:46:26,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688487738] [2022-04-15 14:46:26,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 14:46:26,144 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) Word has length 33 [2022-04-15 14:46:26,144 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 14:46:26,144 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-15 14:46:26,161 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:46:26,162 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 14:46:26,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 14:46:26,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 14:46:26,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 14:46:26,166 INFO L87 Difference]: Start difference. First operand 34 states and 45 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-15 14:46:26,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:46:26,269 INFO L93 Difference]: Finished difference Result 44 states and 56 transitions. [2022-04-15 14:46:26,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 14:46:26,269 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) Word has length 33 [2022-04-15 14:46:26,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 14:46:26,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-15 14:46:26,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 56 transitions. [2022-04-15 14:46:26,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-15 14:46:26,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 56 transitions. [2022-04-15 14:46:26,273 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 56 transitions. [2022-04-15 14:46:26,316 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:46:26,317 INFO L225 Difference]: With dead ends: 44 [2022-04-15 14:46:26,317 INFO L226 Difference]: Without dead ends: 36 [2022-04-15 14:46:26,317 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 14:46:26,318 INFO L913 BasicCegarLoop]: 43 mSDtfsCounter, 0 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 14:46:26,319 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 110 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 14:46:26,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-15 14:46:26,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-04-15 14:46:26,331 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 14:46:26,332 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 36 states, 20 states have (on average 1.25) internal successors, (25), 21 states have internal predecessors, (25), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 14:46:26,332 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 36 states, 20 states have (on average 1.25) internal successors, (25), 21 states have internal predecessors, (25), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 14:46:26,332 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 36 states, 20 states have (on average 1.25) internal successors, (25), 21 states have internal predecessors, (25), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 14:46:26,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:46:26,334 INFO L93 Difference]: Finished difference Result 36 states and 47 transitions. [2022-04-15 14:46:26,334 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 47 transitions. [2022-04-15 14:46:26,335 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:46:26,335 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:46:26,335 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 20 states have (on average 1.25) internal successors, (25), 21 states have internal predecessors, (25), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 36 states. [2022-04-15 14:46:26,336 INFO L87 Difference]: Start difference. First operand has 36 states, 20 states have (on average 1.25) internal successors, (25), 21 states have internal predecessors, (25), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 36 states. [2022-04-15 14:46:26,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:46:26,337 INFO L93 Difference]: Finished difference Result 36 states and 47 transitions. [2022-04-15 14:46:26,338 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 47 transitions. [2022-04-15 14:46:26,338 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:46:26,338 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:46:26,338 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 14:46:26,338 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 14:46:26,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 20 states have (on average 1.25) internal successors, (25), 21 states have internal predecessors, (25), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 14:46:26,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 47 transitions. [2022-04-15 14:46:26,340 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 47 transitions. Word has length 33 [2022-04-15 14:46:26,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 14:46:26,341 INFO L478 AbstractCegarLoop]: Abstraction has 36 states and 47 transitions. [2022-04-15 14:46:26,341 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-15 14:46:26,341 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 47 transitions. [2022-04-15 14:46:26,377 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:46:26,377 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 47 transitions. [2022-04-15 14:46:26,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-15 14:46:26,378 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 14:46:26,378 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 14:46:26,401 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-15 14:46:26,596 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 14:46:26,596 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 14:46:26,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 14:46:26,597 INFO L85 PathProgramCache]: Analyzing trace with hash 2066454233, now seen corresponding path program 1 times [2022-04-15 14:46:26,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 14:46:26,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [843452405] [2022-04-15 14:46:26,597 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 14:46:26,597 INFO L85 PathProgramCache]: Analyzing trace with hash 2066454233, now seen corresponding path program 2 times [2022-04-15 14:46:26,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 14:46:26,598 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467545035] [2022-04-15 14:46:26,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 14:46:26,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 14:46:26,616 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 14:46:26,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [790465652] [2022-04-15 14:46:26,616 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 14:46:26,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 14:46:26,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 14:46:26,617 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 14:46:26,619 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-15 14:46:26,656 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 14:46:26,657 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 14:46:26,658 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 14:46:26,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 14:46:26,667 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 14:46:26,768 INFO L272 TraceCheckUtils]: 0: Hoare triple {682#true} call ULTIMATE.init(); {682#true} is VALID [2022-04-15 14:46:26,769 INFO L290 TraceCheckUtils]: 1: Hoare triple {682#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {682#true} is VALID [2022-04-15 14:46:26,769 INFO L290 TraceCheckUtils]: 2: Hoare triple {682#true} assume true; {682#true} is VALID [2022-04-15 14:46:26,769 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {682#true} {682#true} #98#return; {682#true} is VALID [2022-04-15 14:46:26,769 INFO L272 TraceCheckUtils]: 4: Hoare triple {682#true} call #t~ret8 := main(); {682#true} is VALID [2022-04-15 14:46:26,769 INFO L290 TraceCheckUtils]: 5: Hoare triple {682#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {682#true} is VALID [2022-04-15 14:46:26,769 INFO L272 TraceCheckUtils]: 6: Hoare triple {682#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {682#true} is VALID [2022-04-15 14:46:26,769 INFO L290 TraceCheckUtils]: 7: Hoare triple {682#true} ~cond := #in~cond; {682#true} is VALID [2022-04-15 14:46:26,769 INFO L290 TraceCheckUtils]: 8: Hoare triple {682#true} assume !(0 == ~cond); {682#true} is VALID [2022-04-15 14:46:26,770 INFO L290 TraceCheckUtils]: 9: Hoare triple {682#true} assume true; {682#true} is VALID [2022-04-15 14:46:26,770 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {682#true} {682#true} #78#return; {682#true} is VALID [2022-04-15 14:46:26,770 INFO L272 TraceCheckUtils]: 11: Hoare triple {682#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {682#true} is VALID [2022-04-15 14:46:26,770 INFO L290 TraceCheckUtils]: 12: Hoare triple {682#true} ~cond := #in~cond; {723#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-15 14:46:26,770 INFO L290 TraceCheckUtils]: 13: Hoare triple {723#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {727#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 14:46:26,771 INFO L290 TraceCheckUtils]: 14: Hoare triple {727#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {727#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 14:46:26,771 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {727#(not (= |assume_abort_if_not_#in~cond| 0))} {682#true} #80#return; {734#(<= 1 main_~y~0)} is VALID [2022-04-15 14:46:26,772 INFO L290 TraceCheckUtils]: 16: Hoare triple {734#(<= 1 main_~y~0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {738#(<= 1 main_~b~0)} is VALID [2022-04-15 14:46:26,772 INFO L272 TraceCheckUtils]: 17: Hoare triple {738#(<= 1 main_~b~0)} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {682#true} is VALID [2022-04-15 14:46:26,772 INFO L290 TraceCheckUtils]: 18: Hoare triple {682#true} ~cond := #in~cond; {682#true} is VALID [2022-04-15 14:46:26,772 INFO L290 TraceCheckUtils]: 19: Hoare triple {682#true} assume !(0 == ~cond); {682#true} is VALID [2022-04-15 14:46:26,772 INFO L290 TraceCheckUtils]: 20: Hoare triple {682#true} assume true; {682#true} is VALID [2022-04-15 14:46:26,773 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {682#true} {738#(<= 1 main_~b~0)} #82#return; {738#(<= 1 main_~b~0)} is VALID [2022-04-15 14:46:26,773 INFO L272 TraceCheckUtils]: 22: Hoare triple {738#(<= 1 main_~b~0)} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {682#true} is VALID [2022-04-15 14:46:26,773 INFO L290 TraceCheckUtils]: 23: Hoare triple {682#true} ~cond := #in~cond; {682#true} is VALID [2022-04-15 14:46:26,773 INFO L290 TraceCheckUtils]: 24: Hoare triple {682#true} assume !(0 == ~cond); {682#true} is VALID [2022-04-15 14:46:26,773 INFO L290 TraceCheckUtils]: 25: Hoare triple {682#true} assume true; {682#true} is VALID [2022-04-15 14:46:26,774 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {682#true} {738#(<= 1 main_~b~0)} #84#return; {738#(<= 1 main_~b~0)} is VALID [2022-04-15 14:46:26,774 INFO L290 TraceCheckUtils]: 27: Hoare triple {738#(<= 1 main_~b~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {738#(<= 1 main_~b~0)} is VALID [2022-04-15 14:46:26,774 INFO L290 TraceCheckUtils]: 28: Hoare triple {738#(<= 1 main_~b~0)} assume !!(#t~post6 < 1);havoc #t~post6; {738#(<= 1 main_~b~0)} is VALID [2022-04-15 14:46:26,775 INFO L290 TraceCheckUtils]: 29: Hoare triple {738#(<= 1 main_~b~0)} assume !(0 != ~b~0); {683#false} is VALID [2022-04-15 14:46:26,775 INFO L272 TraceCheckUtils]: 30: Hoare triple {683#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {683#false} is VALID [2022-04-15 14:46:26,775 INFO L290 TraceCheckUtils]: 31: Hoare triple {683#false} ~cond := #in~cond; {683#false} is VALID [2022-04-15 14:46:26,775 INFO L290 TraceCheckUtils]: 32: Hoare triple {683#false} assume 0 == ~cond; {683#false} is VALID [2022-04-15 14:46:26,775 INFO L290 TraceCheckUtils]: 33: Hoare triple {683#false} assume !false; {683#false} is VALID [2022-04-15 14:46:26,775 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-15 14:46:26,775 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 14:46:26,996 INFO L290 TraceCheckUtils]: 33: Hoare triple {683#false} assume !false; {683#false} is VALID [2022-04-15 14:46:27,007 INFO L290 TraceCheckUtils]: 32: Hoare triple {683#false} assume 0 == ~cond; {683#false} is VALID [2022-04-15 14:46:27,007 INFO L290 TraceCheckUtils]: 31: Hoare triple {683#false} ~cond := #in~cond; {683#false} is VALID [2022-04-15 14:46:27,008 INFO L272 TraceCheckUtils]: 30: Hoare triple {683#false} call __VERIFIER_assert((if 0 == ~q~0 * ~x~0 + ~s~0 * ~y~0 then 1 else 0)); {683#false} is VALID [2022-04-15 14:46:27,008 INFO L290 TraceCheckUtils]: 29: Hoare triple {738#(<= 1 main_~b~0)} assume !(0 != ~b~0); {683#false} is VALID [2022-04-15 14:46:27,009 INFO L290 TraceCheckUtils]: 28: Hoare triple {738#(<= 1 main_~b~0)} assume !!(#t~post6 < 1);havoc #t~post6; {738#(<= 1 main_~b~0)} is VALID [2022-04-15 14:46:27,009 INFO L290 TraceCheckUtils]: 27: Hoare triple {738#(<= 1 main_~b~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {738#(<= 1 main_~b~0)} is VALID [2022-04-15 14:46:27,009 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {682#true} {738#(<= 1 main_~b~0)} #84#return; {738#(<= 1 main_~b~0)} is VALID [2022-04-15 14:46:27,009 INFO L290 TraceCheckUtils]: 25: Hoare triple {682#true} assume true; {682#true} is VALID [2022-04-15 14:46:27,009 INFO L290 TraceCheckUtils]: 24: Hoare triple {682#true} assume !(0 == ~cond); {682#true} is VALID [2022-04-15 14:46:27,010 INFO L290 TraceCheckUtils]: 23: Hoare triple {682#true} ~cond := #in~cond; {682#true} is VALID [2022-04-15 14:46:27,010 INFO L272 TraceCheckUtils]: 22: Hoare triple {738#(<= 1 main_~b~0)} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {682#true} is VALID [2022-04-15 14:46:27,012 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {682#true} {738#(<= 1 main_~b~0)} #82#return; {738#(<= 1 main_~b~0)} is VALID [2022-04-15 14:46:27,012 INFO L290 TraceCheckUtils]: 20: Hoare triple {682#true} assume true; {682#true} is VALID [2022-04-15 14:46:27,012 INFO L290 TraceCheckUtils]: 19: Hoare triple {682#true} assume !(0 == ~cond); {682#true} is VALID [2022-04-15 14:46:27,012 INFO L290 TraceCheckUtils]: 18: Hoare triple {682#true} ~cond := #in~cond; {682#true} is VALID [2022-04-15 14:46:27,012 INFO L272 TraceCheckUtils]: 17: Hoare triple {738#(<= 1 main_~b~0)} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {682#true} is VALID [2022-04-15 14:46:27,013 INFO L290 TraceCheckUtils]: 16: Hoare triple {734#(<= 1 main_~y~0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {738#(<= 1 main_~b~0)} is VALID [2022-04-15 14:46:27,013 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {727#(not (= |assume_abort_if_not_#in~cond| 0))} {682#true} #80#return; {734#(<= 1 main_~y~0)} is VALID [2022-04-15 14:46:27,014 INFO L290 TraceCheckUtils]: 14: Hoare triple {727#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {727#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 14:46:27,017 INFO L290 TraceCheckUtils]: 13: Hoare triple {853#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} assume !(0 == ~cond); {727#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 14:46:27,018 INFO L290 TraceCheckUtils]: 12: Hoare triple {682#true} ~cond := #in~cond; {853#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} is VALID [2022-04-15 14:46:27,018 INFO L272 TraceCheckUtils]: 11: Hoare triple {682#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {682#true} is VALID [2022-04-15 14:46:27,018 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {682#true} {682#true} #78#return; {682#true} is VALID [2022-04-15 14:46:27,018 INFO L290 TraceCheckUtils]: 9: Hoare triple {682#true} assume true; {682#true} is VALID [2022-04-15 14:46:27,018 INFO L290 TraceCheckUtils]: 8: Hoare triple {682#true} assume !(0 == ~cond); {682#true} is VALID [2022-04-15 14:46:27,018 INFO L290 TraceCheckUtils]: 7: Hoare triple {682#true} ~cond := #in~cond; {682#true} is VALID [2022-04-15 14:46:27,018 INFO L272 TraceCheckUtils]: 6: Hoare triple {682#true} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {682#true} is VALID [2022-04-15 14:46:27,018 INFO L290 TraceCheckUtils]: 5: Hoare triple {682#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {682#true} is VALID [2022-04-15 14:46:27,018 INFO L272 TraceCheckUtils]: 4: Hoare triple {682#true} call #t~ret8 := main(); {682#true} is VALID [2022-04-15 14:46:27,018 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {682#true} {682#true} #98#return; {682#true} is VALID [2022-04-15 14:46:27,018 INFO L290 TraceCheckUtils]: 2: Hoare triple {682#true} assume true; {682#true} is VALID [2022-04-15 14:46:27,018 INFO L290 TraceCheckUtils]: 1: Hoare triple {682#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {682#true} is VALID [2022-04-15 14:46:27,019 INFO L272 TraceCheckUtils]: 0: Hoare triple {682#true} call ULTIMATE.init(); {682#true} is VALID [2022-04-15 14:46:27,019 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-15 14:46:27,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 14:46:27,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467545035] [2022-04-15 14:46:27,019 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 14:46:27,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [790465652] [2022-04-15 14:46:27,019 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [790465652] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 14:46:27,019 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 14:46:27,019 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2022-04-15 14:46:27,020 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 14:46:27,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [843452405] [2022-04-15 14:46:27,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [843452405] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 14:46:27,020 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 14:46:27,020 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 14:46:27,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580434566] [2022-04-15 14:46:27,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 14:46:27,020 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 34 [2022-04-15 14:46:27,021 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 14:46:27,021 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-15 14:46:27,036 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:46:27,036 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 14:46:27,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 14:46:27,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 14:46:27,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-15 14:46:27,037 INFO L87 Difference]: Start difference. First operand 36 states and 47 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-15 14:46:27,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:46:27,300 INFO L93 Difference]: Finished difference Result 53 states and 71 transitions. [2022-04-15 14:46:27,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 14:46:27,300 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 34 [2022-04-15 14:46:27,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 14:46:27,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-15 14:46:27,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 71 transitions. [2022-04-15 14:46:27,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-15 14:46:27,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 71 transitions. [2022-04-15 14:46:27,304 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 71 transitions. [2022-04-15 14:46:27,360 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:46:27,362 INFO L225 Difference]: With dead ends: 53 [2022-04-15 14:46:27,362 INFO L226 Difference]: Without dead ends: 45 [2022-04-15 14:46:27,362 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-04-15 14:46:27,363 INFO L913 BasicCegarLoop]: 39 mSDtfsCounter, 28 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 14:46:27,363 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 135 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 14:46:27,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-04-15 14:46:27,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 37. [2022-04-15 14:46:27,386 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 14:46:27,386 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand has 37 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 22 states have internal predecessors, (26), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 14:46:27,386 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand has 37 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 22 states have internal predecessors, (26), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 14:46:27,387 INFO L87 Difference]: Start difference. First operand 45 states. Second operand has 37 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 22 states have internal predecessors, (26), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 14:46:27,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:46:27,389 INFO L93 Difference]: Finished difference Result 45 states and 62 transitions. [2022-04-15 14:46:27,389 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 62 transitions. [2022-04-15 14:46:27,389 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:46:27,389 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:46:27,390 INFO L74 IsIncluded]: Start isIncluded. First operand has 37 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 22 states have internal predecessors, (26), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 45 states. [2022-04-15 14:46:27,390 INFO L87 Difference]: Start difference. First operand has 37 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 22 states have internal predecessors, (26), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 45 states. [2022-04-15 14:46:27,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:46:27,392 INFO L93 Difference]: Finished difference Result 45 states and 62 transitions. [2022-04-15 14:46:27,392 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 62 transitions. [2022-04-15 14:46:27,392 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:46:27,392 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:46:27,392 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 14:46:27,392 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 14:46:27,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 22 states have internal predecessors, (26), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 14:46:27,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 48 transitions. [2022-04-15 14:46:27,394 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 48 transitions. Word has length 34 [2022-04-15 14:46:27,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 14:46:27,394 INFO L478 AbstractCegarLoop]: Abstraction has 37 states and 48 transitions. [2022-04-15 14:46:27,394 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-15 14:46:27,394 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 48 transitions. [2022-04-15 14:46:27,432 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:46:27,432 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 48 transitions. [2022-04-15 14:46:27,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-15 14:46:27,433 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 14:46:27,433 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 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-15 14:46:27,459 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-15 14:46:27,653 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-15 14:46:27,653 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 14:46:27,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 14:46:27,654 INFO L85 PathProgramCache]: Analyzing trace with hash 1678606280, now seen corresponding path program 1 times [2022-04-15 14:46:27,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 14:46:27,654 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2090580883] [2022-04-15 14:46:27,654 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 14:46:27,654 INFO L85 PathProgramCache]: Analyzing trace with hash 1678606280, now seen corresponding path program 2 times [2022-04-15 14:46:27,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 14:46:27,654 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542328930] [2022-04-15 14:46:27,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 14:46:27,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 14:46:27,684 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 14:46:27,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2071246623] [2022-04-15 14:46:27,685 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 14:46:27,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 14:46:27,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 14:46:27,691 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 14:46:27,691 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-15 14:46:27,736 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-15 14:46:27,736 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 14:46:27,737 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 14:46:27,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 14:46:27,758 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 14:46:27,894 INFO L272 TraceCheckUtils]: 0: Hoare triple {1166#true} call ULTIMATE.init(); {1166#true} is VALID [2022-04-15 14:46:27,895 INFO L290 TraceCheckUtils]: 1: Hoare triple {1166#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(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1174#(<= 0 ~counter~0)} is VALID [2022-04-15 14:46:27,895 INFO L290 TraceCheckUtils]: 2: Hoare triple {1174#(<= 0 ~counter~0)} assume true; {1174#(<= 0 ~counter~0)} is VALID [2022-04-15 14:46:27,895 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1174#(<= 0 ~counter~0)} {1166#true} #98#return; {1174#(<= 0 ~counter~0)} is VALID [2022-04-15 14:46:27,896 INFO L272 TraceCheckUtils]: 4: Hoare triple {1174#(<= 0 ~counter~0)} call #t~ret8 := main(); {1174#(<= 0 ~counter~0)} is VALID [2022-04-15 14:46:27,896 INFO L290 TraceCheckUtils]: 5: Hoare triple {1174#(<= 0 ~counter~0)} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~s~0;havoc ~c~0;havoc ~k~0;havoc ~xy~0;havoc ~yy~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {1174#(<= 0 ~counter~0)} is VALID [2022-04-15 14:46:27,896 INFO L272 TraceCheckUtils]: 6: Hoare triple {1174#(<= 0 ~counter~0)} call assume_abort_if_not((if ~x~0 >= 1 then 1 else 0)); {1174#(<= 0 ~counter~0)} is VALID [2022-04-15 14:46:27,897 INFO L290 TraceCheckUtils]: 7: Hoare triple {1174#(<= 0 ~counter~0)} ~cond := #in~cond; {1174#(<= 0 ~counter~0)} is VALID [2022-04-15 14:46:27,897 INFO L290 TraceCheckUtils]: 8: Hoare triple {1174#(<= 0 ~counter~0)} assume !(0 == ~cond); {1174#(<= 0 ~counter~0)} is VALID [2022-04-15 14:46:27,897 INFO L290 TraceCheckUtils]: 9: Hoare triple {1174#(<= 0 ~counter~0)} assume true; {1174#(<= 0 ~counter~0)} is VALID [2022-04-15 14:46:27,898 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1174#(<= 0 ~counter~0)} {1174#(<= 0 ~counter~0)} #78#return; {1174#(<= 0 ~counter~0)} is VALID [2022-04-15 14:46:27,898 INFO L272 TraceCheckUtils]: 11: Hoare triple {1174#(<= 0 ~counter~0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {1174#(<= 0 ~counter~0)} is VALID [2022-04-15 14:46:27,899 INFO L290 TraceCheckUtils]: 12: Hoare triple {1174#(<= 0 ~counter~0)} ~cond := #in~cond; {1174#(<= 0 ~counter~0)} is VALID [2022-04-15 14:46:27,899 INFO L290 TraceCheckUtils]: 13: Hoare triple {1174#(<= 0 ~counter~0)} assume !(0 == ~cond); {1174#(<= 0 ~counter~0)} is VALID [2022-04-15 14:46:27,899 INFO L290 TraceCheckUtils]: 14: Hoare triple {1174#(<= 0 ~counter~0)} assume true; {1174#(<= 0 ~counter~0)} is VALID [2022-04-15 14:46:27,900 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1174#(<= 0 ~counter~0)} {1174#(<= 0 ~counter~0)} #80#return; {1174#(<= 0 ~counter~0)} is VALID [2022-04-15 14:46:27,900 INFO L290 TraceCheckUtils]: 16: Hoare triple {1174#(<= 0 ~counter~0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0;~r~0 := 0;~s~0 := 1;~c~0 := 0;~k~0 := 0;~xy~0 := ~x~0 * ~y~0;~yy~0 := ~y~0 * ~y~0; {1174#(<= 0 ~counter~0)} is VALID [2022-04-15 14:46:27,900 INFO L272 TraceCheckUtils]: 17: Hoare triple {1174#(<= 0 ~counter~0)} call assume_abort_if_not((if ~xy~0 < 2147483647 then 1 else 0)); {1174#(<= 0 ~counter~0)} is VALID [2022-04-15 14:46:27,901 INFO L290 TraceCheckUtils]: 18: Hoare triple {1174#(<= 0 ~counter~0)} ~cond := #in~cond; {1174#(<= 0 ~counter~0)} is VALID [2022-04-15 14:46:27,901 INFO L290 TraceCheckUtils]: 19: Hoare triple {1174#(<= 0 ~counter~0)} assume !(0 == ~cond); {1174#(<= 0 ~counter~0)} is VALID [2022-04-15 14:46:27,902 INFO L290 TraceCheckUtils]: 20: Hoare triple {1174#(<= 0 ~counter~0)} assume true; {1174#(<= 0 ~counter~0)} is VALID [2022-04-15 14:46:27,902 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1174#(<= 0 ~counter~0)} {1174#(<= 0 ~counter~0)} #82#return; {1174#(<= 0 ~counter~0)} is VALID [2022-04-15 14:46:27,903 INFO L272 TraceCheckUtils]: 22: Hoare triple {1174#(<= 0 ~counter~0)} call assume_abort_if_not((if ~yy~0 < 2147483647 then 1 else 0)); {1174#(<= 0 ~counter~0)} is VALID [2022-04-15 14:46:27,904 INFO L290 TraceCheckUtils]: 23: Hoare triple {1174#(<= 0 ~counter~0)} ~cond := #in~cond; {1174#(<= 0 ~counter~0)} is VALID [2022-04-15 14:46:27,904 INFO L290 TraceCheckUtils]: 24: Hoare triple {1174#(<= 0 ~counter~0)} assume !(0 == ~cond); {1174#(<= 0 ~counter~0)} is VALID [2022-04-15 14:46:27,904 INFO L290 TraceCheckUtils]: 25: Hoare triple {1174#(<= 0 ~counter~0)} assume true; {1174#(<= 0 ~counter~0)} is VALID [2022-04-15 14:46:27,905 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1174#(<= 0 ~counter~0)} {1174#(<= 0 ~counter~0)} #84#return; {1174#(<= 0 ~counter~0)} is VALID [2022-04-15 14:46:27,906 INFO L290 TraceCheckUtils]: 27: Hoare triple {1174#(<= 0 ~counter~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1253#(<= 1 ~counter~0)} is VALID [2022-04-15 14:46:27,906 INFO L290 TraceCheckUtils]: 28: Hoare triple {1253#(<= 1 ~counter~0)} assume !!(#t~post6 < 1);havoc #t~post6; {1253#(<= 1 ~counter~0)} is VALID [2022-04-15 14:46:27,907 INFO L290 TraceCheckUtils]: 29: Hoare triple {1253#(<= 1 ~counter~0)} assume !!(0 != ~b~0);~c~0 := ~a~0;~k~0 := 0; {1253#(<= 1 ~counter~0)} is VALID [2022-04-15 14:46:27,908 INFO L290 TraceCheckUtils]: 30: Hoare triple {1253#(<= 1 ~counter~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {1263#(<= 1 |main_#t~post7|)} is VALID [2022-04-15 14:46:27,908 INFO L290 TraceCheckUtils]: 31: Hoare triple {1263#(<= 1 |main_#t~post7|)} assume !!(#t~post7 < 1);havoc #t~post7; {1167#false} is VALID [2022-04-15 14:46:27,908 INFO L272 TraceCheckUtils]: 32: Hoare triple {1167#false} call __VERIFIER_assert((if ~a~0 == ~k~0 * ~b~0 + ~c~0 then 1 else 0)); {1167#false} is VALID [2022-04-15 14:46:27,908 INFO L290 TraceCheckUtils]: 33: Hoare triple {1167#false} ~cond := #in~cond; {1167#false} is VALID [2022-04-15 14:46:27,909 INFO L290 TraceCheckUtils]: 34: Hoare triple {1167#false} assume 0 == ~cond; {1167#false} is VALID [2022-04-15 14:46:27,909 INFO L290 TraceCheckUtils]: 35: Hoare triple {1167#false} assume !false; {1167#false} is VALID [2022-04-15 14:46:27,909 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-15 14:46:27,909 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 14:46:27,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 14:46:27,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542328930] [2022-04-15 14:46:27,909 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 14:46:27,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2071246623] [2022-04-15 14:46:27,909 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2071246623] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 14:46:27,909 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 14:46:27,909 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 14:46:27,910 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 14:46:27,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2090580883] [2022-04-15 14:46:27,910 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2090580883] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 14:46:27,910 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 14:46:27,910 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 14:46:27,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982307373] [2022-04-15 14:46:27,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 14:46:27,910 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) Word has length 36 [2022-04-15 14:46:27,910 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 14:46:27,911 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-15 14:46:27,927 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:46:27,927 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 14:46:27,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 14:46:27,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 14:46:27,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-15 14:46:27,928 INFO L87 Difference]: Start difference. First operand 37 states and 48 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-15 14:46:28,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:46:28,023 INFO L93 Difference]: Finished difference Result 51 states and 65 transitions. [2022-04-15 14:46:28,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 14:46:28,024 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) Word has length 36 [2022-04-15 14:46:28,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 14:46:28,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-15 14:46:28,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 63 transitions. [2022-04-15 14:46:28,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-15 14:46:28,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 63 transitions. [2022-04-15 14:46:28,026 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 63 transitions. [2022-04-15 14:46:28,070 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:46:28,071 INFO L225 Difference]: With dead ends: 51 [2022-04-15 14:46:28,072 INFO L226 Difference]: Without dead ends: 32 [2022-04-15 14:46:28,072 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-04-15 14:46:28,073 INFO L913 BasicCegarLoop]: 31 mSDtfsCounter, 13 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 14:46:28,073 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 70 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 14:46:28,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-15 14:46:28,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-04-15 14:46:28,109 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 14:46:28,109 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 32 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 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-15 14:46:28,109 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 32 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 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-15 14:46:28,110 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 32 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 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-15 14:46:28,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:46:28,111 INFO L93 Difference]: Finished difference Result 32 states and 37 transitions. [2022-04-15 14:46:28,111 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2022-04-15 14:46:28,111 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:46:28,111 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:46:28,111 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 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 32 states. [2022-04-15 14:46:28,111 INFO L87 Difference]: Start difference. First operand has 32 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 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 32 states. [2022-04-15 14:46:28,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 14:46:28,112 INFO L93 Difference]: Finished difference Result 32 states and 37 transitions. [2022-04-15 14:46:28,113 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2022-04-15 14:46:28,113 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 14:46:28,113 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 14:46:28,113 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 14:46:28,113 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 14:46:28,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 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-15 14:46:28,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2022-04-15 14:46:28,114 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 36 [2022-04-15 14:46:28,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 14:46:28,114 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2022-04-15 14:46:28,114 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-15 14:46:28,114 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 37 transitions. [2022-04-15 14:46:28,143 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 14:46:28,143 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2022-04-15 14:46:28,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-15 14:46:28,144 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 14:46:28,144 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 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-15 14:46:28,165 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-15 14:46:28,358 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 14:46:28,359 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 14:46:28,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 14:46:28,359 INFO L85 PathProgramCache]: Analyzing trace with hash -2124209112, now seen corresponding path program 1 times [2022-04-15 14:46:28,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 14:46:28,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [790956674] [2022-04-15 14:46:28,360 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 14:46:28,360 INFO L85 PathProgramCache]: Analyzing trace with hash -2124209112, now seen corresponding path program 2 times [2022-04-15 14:46:28,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 14:46:28,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139866984] [2022-04-15 14:46:28,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 14:46:28,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 14:46:28,370 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 14:46:28,371 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [961439047] [2022-04-15 14:46:28,371 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 14:46:28,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 14:46:28,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 14:46:28,372 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 14:46:28,372 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-15 14:46:28,416 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 14:46:28,416 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-04-15 14:46:28,416 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-15 14:46:28,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-15 14:46:28,461 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-15 14:46:28,462 INFO L130 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found a feasible trace [2022-04-15 14:46:28,462 INFO L618 BasicCegarLoop]: Counterexample is feasible [2022-04-15 14:46:28,463 INFO L788 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-15 14:46:28,482 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-15 14:46:28,680 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 14:46:28,683 INFO L719 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 2] [2022-04-15 14:46:28,685 INFO L177 ceAbstractionStarter]: Computing trace abstraction results [2022-04-15 14:46:28,692 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-15 14:46:28,693 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2022-04-15 14:46:28,693 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-15 14:46:28,693 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-15 14:46:28,693 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-15 14:46:28,693 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2022-04-15 14:46:28,693 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2022-04-15 14:46:28,693 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-15 14:46:28,693 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-15 14:46:28,693 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-15 14:46:28,693 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-15 14:46:28,693 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2022-04-15 14:46:28,693 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation [2022-04-15 14:46:28,693 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2022-04-15 14:46:28,693 WARN L170 areAnnotationChecker]: L24 has no Hoare annotation [2022-04-15 14:46:28,693 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2022-04-15 14:46:28,693 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2022-04-15 14:46:28,693 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-15 14:46:28,693 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-15 14:46:28,693 WARN L170 areAnnotationChecker]: L8-2 has no Hoare annotation [2022-04-15 14:46:28,693 WARN L170 areAnnotationChecker]: L24-1 has no Hoare annotation [2022-04-15 14:46:28,693 WARN L170 areAnnotationChecker]: L24-1 has no Hoare annotation [2022-04-15 14:46:28,693 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-15 14:46:28,693 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-15 14:46:28,693 WARN L170 areAnnotationChecker]: L11-2 has no Hoare annotation [2022-04-15 14:46:28,693 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-15 14:46:28,693 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-15 14:46:28,693 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-15 14:46:28,693 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-15 14:46:28,694 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2022-04-15 14:46:28,694 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-15 14:46:28,694 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-15 14:46:28,694 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-15 14:46:28,694 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-15 14:46:28,694 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-15 14:46:28,694 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-15 14:46:28,694 WARN L170 areAnnotationChecker]: L37-1 has no Hoare annotation [2022-04-15 14:46:28,694 WARN L170 areAnnotationChecker]: L37-1 has no Hoare annotation [2022-04-15 14:46:28,694 WARN L170 areAnnotationChecker]: L40-2 has no Hoare annotation [2022-04-15 14:46:28,694 WARN L170 areAnnotationChecker]: L40-2 has no Hoare annotation [2022-04-15 14:46:28,694 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2022-04-15 14:46:28,694 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2022-04-15 14:46:28,694 WARN L170 areAnnotationChecker]: L47-1 has no Hoare annotation [2022-04-15 14:46:28,694 WARN L170 areAnnotationChecker]: L47-1 has no Hoare annotation [2022-04-15 14:46:28,694 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2022-04-15 14:46:28,694 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2022-04-15 14:46:28,694 WARN L170 areAnnotationChecker]: L49 has no Hoare annotation [2022-04-15 14:46:28,694 WARN L170 areAnnotationChecker]: L49 has no Hoare annotation [2022-04-15 14:46:28,694 WARN L170 areAnnotationChecker]: L50 has no Hoare annotation [2022-04-15 14:46:28,694 WARN L170 areAnnotationChecker]: L50 has no Hoare annotation [2022-04-15 14:46:28,694 WARN L170 areAnnotationChecker]: L70 has no Hoare annotation [2022-04-15 14:46:28,694 WARN L170 areAnnotationChecker]: L70 has no Hoare annotation [2022-04-15 14:46:28,694 WARN L170 areAnnotationChecker]: L71 has no Hoare annotation [2022-04-15 14:46:28,694 WARN L170 areAnnotationChecker]: L40-3 has no Hoare annotation [2022-04-15 14:46:28,694 WARN L170 areAnnotationChecker]: L40-3 has no Hoare annotation [2022-04-15 14:46:28,694 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2022-04-15 14:46:28,694 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2022-04-15 14:46:28,694 WARN L170 areAnnotationChecker]: L46-4 has no Hoare annotation [2022-04-15 14:46:28,694 WARN L170 areAnnotationChecker]: L46-3 has no Hoare annotation [2022-04-15 14:46:28,694 WARN L170 areAnnotationChecker]: L46-3 has no Hoare annotation [2022-04-15 14:46:28,694 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-15 14:46:28,694 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2022-04-15 14:46:28,695 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2022-04-15 14:46:28,695 WARN L170 areAnnotationChecker]: L46-1 has no Hoare annotation [2022-04-15 14:46:28,695 WARN L170 areAnnotationChecker]: L46-1 has no Hoare annotation [2022-04-15 14:46:28,695 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-15 14:46:28,695 WARN L170 areAnnotationChecker]: L47 has no Hoare annotation [2022-04-15 14:46:28,695 WARN L170 areAnnotationChecker]: L47 has no Hoare annotation [2022-04-15 14:46:28,695 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-15 14:46:28,698 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 02:46:28 BoogieIcfgContainer [2022-04-15 14:46:28,698 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-15 14:46:28,699 INFO L158 Benchmark]: Toolchain (without parser) took 4287.90ms. Allocated memory was 196.1MB in the beginning and 274.7MB in the end (delta: 78.6MB). Free memory was 142.4MB in the beginning and 192.5MB in the end (delta: -50.1MB). Peak memory consumption was 28.2MB. Max. memory is 8.0GB. [2022-04-15 14:46:28,699 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 196.1MB. Free memory is still 158.9MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 14:46:28,699 INFO L158 Benchmark]: CACSL2BoogieTranslator took 208.69ms. Allocated memory is still 196.1MB. Free memory was 142.1MB in the beginning and 170.4MB in the end (delta: -28.3MB). Peak memory consumption was 8.8MB. Max. memory is 8.0GB. [2022-04-15 14:46:28,699 INFO L158 Benchmark]: Boogie Preprocessor took 33.39ms. Allocated memory is still 196.1MB. Free memory was 170.4MB in the beginning and 168.9MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-15 14:46:28,699 INFO L158 Benchmark]: RCFGBuilder took 288.46ms. Allocated memory is still 196.1MB. Free memory was 168.9MB in the beginning and 155.9MB in the end (delta: 13.0MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-15 14:46:28,700 INFO L158 Benchmark]: TraceAbstraction took 3753.22ms. Allocated memory was 196.1MB in the beginning and 274.7MB in the end (delta: 78.6MB). Free memory was 155.7MB in the beginning and 192.5MB in the end (delta: -36.7MB). Peak memory consumption was 43.5MB. Max. memory is 8.0GB. [2022-04-15 14:46:28,700 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.11ms. Allocated memory is still 196.1MB. Free memory is still 158.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 208.69ms. Allocated memory is still 196.1MB. Free memory was 142.1MB in the beginning and 170.4MB in the end (delta: -28.3MB). Peak memory consumption was 8.8MB. Max. memory is 8.0GB. * Boogie Preprocessor took 33.39ms. Allocated memory is still 196.1MB. Free memory was 170.4MB in the beginning and 168.9MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 288.46ms. Allocated memory is still 196.1MB. Free memory was 168.9MB in the beginning and 155.9MB in the end (delta: 13.0MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 3753.22ms. Allocated memory was 196.1MB in the beginning and 274.7MB in the end (delta: 78.6MB). Free memory was 155.7MB in the beginning and 192.5MB in the end (delta: -36.7MB). Peak memory consumption was 43.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 13]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L18] int counter = 0; [L20] int x, y; [L21] long long a, b, p, q, r, s, c, k, xy, yy; [L22] x = __VERIFIER_nondet_int() [L23] y = __VERIFIER_nondet_int() [L24] CALL assume_abort_if_not(x >= 1) [L8] COND FALSE !(!cond) [L24] RET assume_abort_if_not(x >= 1) [L25] CALL assume_abort_if_not(y >= 1) [L8] COND FALSE !(!cond) [L25] RET assume_abort_if_not(y >= 1) [L27] a = x [L28] b = y [L29] p = 1 [L30] q = 0 [L31] r = 0 [L32] s = 1 [L33] c = 0 [L34] k = 0 [L35] xy = (long long) x * y [L36] yy = (long long) y * y [L37] CALL assume_abort_if_not(xy < 2147483647) [L8] COND FALSE !(!cond) [L37] RET assume_abort_if_not(xy < 2147483647) [L38] CALL assume_abort_if_not(yy < 2147483647) [L8] COND FALSE !(!cond) [L38] RET assume_abort_if_not(yy < 2147483647) [L40] EXPR counter++ [L40] COND TRUE counter++<1 [L41] COND FALSE !(!(b != 0)) [L43] c = a [L44] k = 0 [L46] EXPR counter++ [L46] COND FALSE !(counter++<1) [L57] a = b [L58] b = c [L60] long long temp; [L61] temp = p [L62] p = q [L63] q = temp - q * k [L64] temp = r [L65] r = s [L66] s = temp - s * k [L40] EXPR counter++ [L40] COND FALSE !(counter++<1) [L70] CALL __VERIFIER_assert(q*x + s*y == 0) [L11] COND TRUE !(cond) [L13] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 42 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.7s, OverallIterations: 5, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 60 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 51 mSDsluCounter, 364 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 206 mSDsCounter, 25 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 125 IncrementalHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 25 mSolverCounterUnsat, 158 mSDtfsCounter, 125 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 153 GetRequests, 138 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=39occurred in iteration=0, InterpolantAutomatonStates: 18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 9 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-04-15 14:46:28,723 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...