/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/nla-digbench/geo3-ll.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 04:20:00,281 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 04:20:00,283 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 04:20:00,345 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 04:20:00,346 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 04:20:00,347 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 04:20:00,350 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 04:20:00,354 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 04:20:00,356 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 04:20:00,361 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 04:20:00,361 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 04:20:00,363 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 04:20:00,363 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 04:20:00,367 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 04:20:00,368 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 04:20:00,371 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 04:20:00,371 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 04:20:00,372 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 04:20:00,374 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 04:20:00,379 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 04:20:00,381 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 04:20:00,382 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 04:20:00,383 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 04:20:00,383 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 04:20:00,385 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 04:20:00,391 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 04:20:00,391 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 04:20:00,391 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 04:20:00,392 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 04:20:00,392 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 04:20:00,393 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 04:20:00,393 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 04:20:00,395 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 04:20:00,395 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 04:20:00,396 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 04:20:00,396 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 04:20:00,397 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 04:20:00,397 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 04:20:00,397 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 04:20:00,397 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 04:20:00,398 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 04:20:00,399 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 04:20:00,400 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-28 04:20:00,412 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 04:20:00,413 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 04:20:00,414 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 04:20:00,414 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-28 04:20:00,414 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 04:20:00,414 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-28 04:20:00,414 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 04:20:00,414 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 04:20:00,414 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 04:20:00,415 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 04:20:00,415 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-28 04:20:00,415 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 04:20:00,416 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 04:20:00,416 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 04:20:00,416 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 04:20:00,416 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 04:20:00,416 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 04:20:00,416 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 04:20:00,416 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 04:20:00,416 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 04:20:00,416 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 04:20:00,417 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 04:20:00,417 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 04:20:00,417 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 04:20:00,417 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-28 04:20:00,417 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-28 04:20:00,618 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 04:20:00,639 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 04:20:00,641 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 04:20:00,642 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 04:20:00,642 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 04:20:00,643 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench/geo3-ll.c [2022-04-28 04:20:00,701 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/56aa72c07/145943a5540243b2a5a87373ef106820/FLAG2e8910da5 [2022-04-28 04:20:01,056 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 04:20:01,057 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench/geo3-ll.c [2022-04-28 04:20:01,062 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/56aa72c07/145943a5540243b2a5a87373ef106820/FLAG2e8910da5 [2022-04-28 04:20:01,488 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/56aa72c07/145943a5540243b2a5a87373ef106820 [2022-04-28 04:20:01,489 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 04:20:01,490 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 04:20:01,493 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 04:20:01,493 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 04:20:01,495 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 04:20:01,496 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 04:20:01" (1/1) ... [2022-04-28 04:20:01,497 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ca15312 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:20:01, skipping insertion in model container [2022-04-28 04:20:01,497 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 04:20:01" (1/1) ... [2022-04-28 04:20:01,502 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 04:20:01,516 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 04:20:01,640 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/geo3-ll.c[525,538] [2022-04-28 04:20:01,652 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 04:20:01,659 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 04:20:01,669 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/geo3-ll.c[525,538] [2022-04-28 04:20:01,682 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 04:20:01,691 INFO L208 MainTranslator]: Completed translation [2022-04-28 04:20:01,691 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:20:01 WrapperNode [2022-04-28 04:20:01,692 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 04:20:01,692 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 04:20:01,692 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 04:20:01,692 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 04:20:01,699 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:20:01" (1/1) ... [2022-04-28 04:20:01,699 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:20:01" (1/1) ... [2022-04-28 04:20:01,704 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:20:01" (1/1) ... [2022-04-28 04:20:01,705 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:20:01" (1/1) ... [2022-04-28 04:20:01,709 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:20:01" (1/1) ... [2022-04-28 04:20:01,712 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:20:01" (1/1) ... [2022-04-28 04:20:01,713 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:20:01" (1/1) ... [2022-04-28 04:20:01,715 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 04:20:01,716 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 04:20:01,716 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 04:20:01,716 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 04:20:01,717 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:20:01" (1/1) ... [2022-04-28 04:20:01,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 04:20:01,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:20:01,747 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-28 04:20:01,771 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-28 04:20:01,793 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 04:20:01,793 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 04:20:01,793 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 04:20:01,794 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-28 04:20:01,794 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 04:20:01,794 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 04:20:01,794 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 04:20:01,794 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 04:20:01,795 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 04:20:01,795 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 04:20:01,795 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-28 04:20:01,796 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-28 04:20:01,796 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 04:20:01,796 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 04:20:01,796 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 04:20:01,797 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 04:20:01,797 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 04:20:01,797 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 04:20:01,797 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 04:20:01,797 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 04:20:01,848 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 04:20:01,849 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 04:20:01,981 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 04:20:01,988 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 04:20:01,988 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 04:20:01,990 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 04:20:01 BoogieIcfgContainer [2022-04-28 04:20:01,990 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 04:20:01,993 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 04:20:01,993 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 04:20:02,011 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 04:20:02,011 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 04:20:01" (1/3) ... [2022-04-28 04:20:02,012 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4194f36f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 04:20:02, skipping insertion in model container [2022-04-28 04:20:02,012 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:20:01" (2/3) ... [2022-04-28 04:20:02,012 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4194f36f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 04:20:02, skipping insertion in model container [2022-04-28 04:20:02,012 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 04:20:01" (3/3) ... [2022-04-28 04:20:02,014 INFO L111 eAbstractionObserver]: Analyzing ICFG geo3-ll.c [2022-04-28 04:20:02,024 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 04:20:02,025 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 04:20:02,067 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 04:20:02,073 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@246e87ee, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@397cd3fa [2022-04-28 04:20:02,073 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 04:20:02,090 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 04:20:02,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-28 04:20:02,096 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:20:02,097 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:20:02,097 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:20:02,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:20:02,107 INFO L85 PathProgramCache]: Analyzing trace with hash -1469283919, now seen corresponding path program 1 times [2022-04-28 04:20:02,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:20:02,116 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1244703381] [2022-04-28 04:20:02,126 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 04:20:02,127 INFO L85 PathProgramCache]: Analyzing trace with hash -1469283919, now seen corresponding path program 2 times [2022-04-28 04:20:02,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:20:02,130 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534928837] [2022-04-28 04:20:02,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:20:02,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:20:02,217 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 04:20:02,218 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1656600914] [2022-04-28 04:20:02,218 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 04:20:02,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:20:02,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:20:02,223 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 04:20:02,272 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-28 04:20:02,317 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-28 04:20:02,318 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 04:20:02,320 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 1 conjunts are in the unsatisfiable core [2022-04-28 04:20:02,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:20:02,333 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 04:20:02,409 INFO L272 TraceCheckUtils]: 0: Hoare triple {24#true} call ULTIMATE.init(); {24#true} is VALID [2022-04-28 04:20:02,409 INFO L290 TraceCheckUtils]: 1: Hoare triple {24#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {24#true} is VALID [2022-04-28 04:20:02,411 INFO L290 TraceCheckUtils]: 2: Hoare triple {24#true} assume true; {24#true} is VALID [2022-04-28 04:20:02,411 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24#true} {24#true} #53#return; {24#true} is VALID [2022-04-28 04:20:02,411 INFO L272 TraceCheckUtils]: 4: Hoare triple {24#true} call #t~ret7 := main(); {24#true} is VALID [2022-04-28 04:20:02,411 INFO L290 TraceCheckUtils]: 5: Hoare triple {24#true} havoc ~z~0;havoc ~a~0;havoc ~k~0;havoc ~x~0;havoc ~y~0;havoc ~c~0;havoc ~az~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~z~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~a~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~k~0 := #t~nondet6;havoc #t~nondet6;~x~0 := ~a~0;~y~0 := 1;~c~0 := 1;~az~0 := ~a~0 * ~z~0; {24#true} is VALID [2022-04-28 04:20:02,412 INFO L290 TraceCheckUtils]: 6: Hoare triple {24#true} assume false; {25#false} is VALID [2022-04-28 04:20:02,413 INFO L272 TraceCheckUtils]: 7: Hoare triple {25#false} call __VERIFIER_assert((if 0 == ~z~0 * ~x~0 - ~x~0 + ~a~0 - ~az~0 * ~y~0 then 1 else 0)); {25#false} is VALID [2022-04-28 04:20:02,413 INFO L290 TraceCheckUtils]: 8: Hoare triple {25#false} ~cond := #in~cond; {25#false} is VALID [2022-04-28 04:20:02,413 INFO L290 TraceCheckUtils]: 9: Hoare triple {25#false} assume 0 == ~cond; {25#false} is VALID [2022-04-28 04:20:02,414 INFO L290 TraceCheckUtils]: 10: Hoare triple {25#false} assume !false; {25#false} is VALID [2022-04-28 04:20:02,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 04:20:02,414 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 04:20:02,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:20:02,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534928837] [2022-04-28 04:20:02,416 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 04:20:02,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1656600914] [2022-04-28 04:20:02,417 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1656600914] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:20:02,417 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:20:02,417 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-28 04:20:02,421 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:20:02,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1244703381] [2022-04-28 04:20:02,421 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1244703381] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:20:02,422 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:20:02,422 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-28 04:20:02,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132140170] [2022-04-28 04:20:02,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:20:02,427 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-28 04:20:02,428 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:20:02,430 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:20:02,450 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:20:02,450 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-04-28 04:20:02,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:20:02,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-04-28 04:20:02,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-04-28 04:20:02,478 INFO L87 Difference]: Start difference. First operand has 21 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 13 states have internal predecessors, (17), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:20:02,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:20:02,538 INFO L93 Difference]: Finished difference Result 36 states and 46 transitions. [2022-04-28 04:20:02,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-28 04:20:02,540 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-28 04:20:02,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:20:02,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:20:02,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 46 transitions. [2022-04-28 04:20:02,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:20:02,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 46 transitions. [2022-04-28 04:20:02,555 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 2 states and 46 transitions. [2022-04-28 04:20:02,624 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:20:02,630 INFO L225 Difference]: With dead ends: 36 [2022-04-28 04:20:02,630 INFO L226 Difference]: Without dead ends: 16 [2022-04-28 04:20:02,633 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-04-28 04:20:02,636 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 04:20:02,637 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 04:20:02,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-04-28 04:20:02,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2022-04-28 04:20:02,660 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:20:02,661 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand has 16 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 10 states have internal predecessors, (11), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 04:20:02,662 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand has 16 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 10 states have internal predecessors, (11), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 04:20:02,662 INFO L87 Difference]: Start difference. First operand 16 states. Second operand has 16 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 10 states have internal predecessors, (11), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 04:20:02,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:20:02,665 INFO L93 Difference]: Finished difference Result 16 states and 17 transitions. [2022-04-28 04:20:02,665 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2022-04-28 04:20:02,665 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:20:02,666 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:20:02,666 INFO L74 IsIncluded]: Start isIncluded. First operand has 16 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 10 states have internal predecessors, (11), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 16 states. [2022-04-28 04:20:02,666 INFO L87 Difference]: Start difference. First operand has 16 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 10 states have internal predecessors, (11), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 16 states. [2022-04-28 04:20:02,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:20:02,668 INFO L93 Difference]: Finished difference Result 16 states and 17 transitions. [2022-04-28 04:20:02,669 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2022-04-28 04:20:02,669 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:20:02,669 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:20:02,669 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:20:02,669 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:20:02,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 10 states have internal predecessors, (11), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 04:20:02,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2022-04-28 04:20:02,672 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 11 [2022-04-28 04:20:02,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:20:02,673 INFO L495 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2022-04-28 04:20:02,673 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:20:02,673 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 17 transitions. [2022-04-28 04:20:02,690 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:20:02,690 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2022-04-28 04:20:02,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-28 04:20:02,701 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:20:02,702 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:20:02,752 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-28 04:20:02,951 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2022-04-28 04:20:02,952 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:20:02,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:20:02,953 INFO L85 PathProgramCache]: Analyzing trace with hash -1467496459, now seen corresponding path program 1 times [2022-04-28 04:20:02,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:20:02,953 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [253029838] [2022-04-28 04:20:02,954 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 04:20:02,954 INFO L85 PathProgramCache]: Analyzing trace with hash -1467496459, now seen corresponding path program 2 times [2022-04-28 04:20:02,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:20:02,955 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154232279] [2022-04-28 04:20:02,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:20:02,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:20:02,970 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 04:20:02,970 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [151406696] [2022-04-28 04:20:02,970 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 04:20:02,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:20:02,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:20:02,976 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 04:20:02,978 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-28 04:20:03,028 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-28 04:20:03,029 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 04:20:03,029 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-28 04:20:03,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:20:03,037 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 04:20:03,202 INFO L272 TraceCheckUtils]: 0: Hoare triple {194#true} call ULTIMATE.init(); {194#true} is VALID [2022-04-28 04:20:03,203 INFO L290 TraceCheckUtils]: 1: Hoare triple {194#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {194#true} is VALID [2022-04-28 04:20:03,203 INFO L290 TraceCheckUtils]: 2: Hoare triple {194#true} assume true; {194#true} is VALID [2022-04-28 04:20:03,203 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {194#true} {194#true} #53#return; {194#true} is VALID [2022-04-28 04:20:03,203 INFO L272 TraceCheckUtils]: 4: Hoare triple {194#true} call #t~ret7 := main(); {194#true} is VALID [2022-04-28 04:20:03,205 INFO L290 TraceCheckUtils]: 5: Hoare triple {194#true} havoc ~z~0;havoc ~a~0;havoc ~k~0;havoc ~x~0;havoc ~y~0;havoc ~c~0;havoc ~az~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~z~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~a~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~k~0 := #t~nondet6;havoc #t~nondet6;~x~0 := ~a~0;~y~0 := 1;~c~0 := 1;~az~0 := ~a~0 * ~z~0; {214#(and (= main_~y~0 1) (= main_~a~0 main_~x~0) (= (* main_~a~0 main_~z~0) main_~az~0))} is VALID [2022-04-28 04:20:03,205 INFO L290 TraceCheckUtils]: 6: Hoare triple {214#(and (= main_~y~0 1) (= main_~a~0 main_~x~0) (= (* main_~a~0 main_~z~0) main_~az~0))} assume !false; {214#(and (= main_~y~0 1) (= main_~a~0 main_~x~0) (= (* main_~a~0 main_~z~0) main_~az~0))} is VALID [2022-04-28 04:20:03,207 INFO L272 TraceCheckUtils]: 7: Hoare triple {214#(and (= main_~y~0 1) (= main_~a~0 main_~x~0) (= (* main_~a~0 main_~z~0) main_~az~0))} call __VERIFIER_assert((if 0 == ~z~0 * ~x~0 - ~x~0 + ~a~0 - ~az~0 * ~y~0 then 1 else 0)); {221#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 04:20:03,209 INFO L290 TraceCheckUtils]: 8: Hoare triple {221#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {225#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:20:03,211 INFO L290 TraceCheckUtils]: 9: Hoare triple {225#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {195#false} is VALID [2022-04-28 04:20:03,211 INFO L290 TraceCheckUtils]: 10: Hoare triple {195#false} assume !false; {195#false} is VALID [2022-04-28 04:20:03,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 04:20:03,212 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 04:20:03,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:20:03,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154232279] [2022-04-28 04:20:03,212 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 04:20:03,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [151406696] [2022-04-28 04:20:03,213 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [151406696] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:20:03,213 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:20:03,213 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 04:20:03,213 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:20:03,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [253029838] [2022-04-28 04:20:03,215 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [253029838] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:20:03,215 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:20:03,215 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 04:20:03,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818941640] [2022-04-28 04:20:03,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:20:03,217 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-28 04:20:03,217 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:20:03,217 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:20:03,229 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:20:03,230 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 04:20:03,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:20:03,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 04:20:03,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 04:20:03,231 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:20:03,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:20:03,365 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2022-04-28 04:20:03,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 04:20:03,365 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-28 04:20:03,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:20:03,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:20:03,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 28 transitions. [2022-04-28 04:20:03,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:20:03,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 28 transitions. [2022-04-28 04:20:03,370 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 28 transitions. [2022-04-28 04:20:03,396 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-28 04:20:03,398 INFO L225 Difference]: With dead ends: 26 [2022-04-28 04:20:03,398 INFO L226 Difference]: Without dead ends: 23 [2022-04-28 04:20:03,399 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 04:20:03,400 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 6 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 04:20:03,400 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 49 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 04:20:03,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-28 04:20:03,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-04-28 04:20:03,409 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:20:03,410 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 23 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 15 states have internal predecessors, (16), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 04:20:03,410 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 23 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 15 states have internal predecessors, (16), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 04:20:03,410 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 23 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 15 states have internal predecessors, (16), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 04:20:03,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:20:03,412 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2022-04-28 04:20:03,412 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2022-04-28 04:20:03,413 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:20:03,413 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:20:03,413 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 15 states have internal predecessors, (16), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 23 states. [2022-04-28 04:20:03,413 INFO L87 Difference]: Start difference. First operand has 23 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 15 states have internal predecessors, (16), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 23 states. [2022-04-28 04:20:03,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:20:03,415 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2022-04-28 04:20:03,415 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2022-04-28 04:20:03,415 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:20:03,416 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:20:03,416 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:20:03,416 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:20:03,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 15 states have internal predecessors, (16), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 04:20:03,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2022-04-28 04:20:03,418 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 11 [2022-04-28 04:20:03,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:20:03,418 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2022-04-28 04:20:03,418 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:20:03,418 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 24 transitions. [2022-04-28 04:20:03,440 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-28 04:20:03,441 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2022-04-28 04:20:03,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-28 04:20:03,441 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:20:03,441 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:20:03,468 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-04-28 04:20:03,655 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2022-04-28 04:20:03,656 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:20:03,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:20:03,656 INFO L85 PathProgramCache]: Analyzing trace with hash -1366100723, now seen corresponding path program 1 times [2022-04-28 04:20:03,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:20:03,657 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [777768930] [2022-04-28 04:20:06,968 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 04:20:06,968 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 04:20:06,969 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 04:20:06,969 INFO L85 PathProgramCache]: Analyzing trace with hash -1366100723, now seen corresponding path program 2 times [2022-04-28 04:20:06,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:20:06,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532576738] [2022-04-28 04:20:06,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:20:06,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:20:06,991 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 04:20:06,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2140855469] [2022-04-28 04:20:06,992 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 04:20:06,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:20:06,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:20:07,000 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 04:20:07,005 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-28 04:20:07,058 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 04:20:07,059 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 04:20:07,060 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 22 conjunts are in the unsatisfiable core [2022-04-28 04:20:07,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:20:07,141 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 04:20:07,441 INFO L272 TraceCheckUtils]: 0: Hoare triple {377#true} call ULTIMATE.init(); {377#true} is VALID [2022-04-28 04:20:07,441 INFO L290 TraceCheckUtils]: 1: Hoare triple {377#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {377#true} is VALID [2022-04-28 04:20:07,441 INFO L290 TraceCheckUtils]: 2: Hoare triple {377#true} assume true; {377#true} is VALID [2022-04-28 04:20:07,441 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {377#true} {377#true} #53#return; {377#true} is VALID [2022-04-28 04:20:07,442 INFO L272 TraceCheckUtils]: 4: Hoare triple {377#true} call #t~ret7 := main(); {377#true} is VALID [2022-04-28 04:20:07,442 INFO L290 TraceCheckUtils]: 5: Hoare triple {377#true} havoc ~z~0;havoc ~a~0;havoc ~k~0;havoc ~x~0;havoc ~y~0;havoc ~c~0;havoc ~az~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~z~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~a~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~k~0 := #t~nondet6;havoc #t~nondet6;~x~0 := ~a~0;~y~0 := 1;~c~0 := 1;~az~0 := ~a~0 * ~z~0; {397#(and (= main_~y~0 1) (= main_~a~0 main_~x~0) (= (* main_~a~0 main_~z~0) main_~az~0))} is VALID [2022-04-28 04:20:07,443 INFO L290 TraceCheckUtils]: 6: Hoare triple {397#(and (= main_~y~0 1) (= main_~a~0 main_~x~0) (= (* main_~a~0 main_~z~0) main_~az~0))} assume !false; {397#(and (= main_~y~0 1) (= main_~a~0 main_~x~0) (= (* main_~a~0 main_~z~0) main_~az~0))} is VALID [2022-04-28 04:20:07,443 INFO L272 TraceCheckUtils]: 7: Hoare triple {397#(and (= main_~y~0 1) (= main_~a~0 main_~x~0) (= (* main_~a~0 main_~z~0) main_~az~0))} call __VERIFIER_assert((if 0 == ~z~0 * ~x~0 - ~x~0 + ~a~0 - ~az~0 * ~y~0 then 1 else 0)); {377#true} is VALID [2022-04-28 04:20:07,444 INFO L290 TraceCheckUtils]: 8: Hoare triple {377#true} ~cond := #in~cond; {407#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:20:07,444 INFO L290 TraceCheckUtils]: 9: Hoare triple {407#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {411#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 04:20:07,445 INFO L290 TraceCheckUtils]: 10: Hoare triple {411#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {411#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 04:20:07,446 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {411#(not (= |__VERIFIER_assert_#in~cond| 0))} {397#(and (= main_~y~0 1) (= main_~a~0 main_~x~0) (= (* main_~a~0 main_~z~0) main_~az~0))} #49#return; {397#(and (= main_~y~0 1) (= main_~a~0 main_~x~0) (= (* main_~a~0 main_~z~0) main_~az~0))} is VALID [2022-04-28 04:20:07,448 INFO L290 TraceCheckUtils]: 12: Hoare triple {397#(and (= main_~y~0 1) (= main_~a~0 main_~x~0) (= (* main_~a~0 main_~z~0) main_~az~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~x~0 := ~x~0 * ~z~0 + ~a~0;~y~0 := ~y~0 * ~z~0; {421#(and (= main_~z~0 main_~y~0) (= main_~x~0 (+ (* main_~a~0 main_~z~0) main_~a~0)) (= (* main_~a~0 main_~z~0) main_~az~0))} is VALID [2022-04-28 04:20:07,448 INFO L290 TraceCheckUtils]: 13: Hoare triple {421#(and (= main_~z~0 main_~y~0) (= main_~x~0 (+ (* main_~a~0 main_~z~0) main_~a~0)) (= (* main_~a~0 main_~z~0) main_~az~0))} assume !false; {421#(and (= main_~z~0 main_~y~0) (= main_~x~0 (+ (* main_~a~0 main_~z~0) main_~a~0)) (= (* main_~a~0 main_~z~0) main_~az~0))} is VALID [2022-04-28 04:20:07,468 INFO L272 TraceCheckUtils]: 14: Hoare triple {421#(and (= main_~z~0 main_~y~0) (= main_~x~0 (+ (* main_~a~0 main_~z~0) main_~a~0)) (= (* main_~a~0 main_~z~0) main_~az~0))} call __VERIFIER_assert((if 0 == ~z~0 * ~x~0 - ~x~0 + ~a~0 - ~az~0 * ~y~0 then 1 else 0)); {428#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 04:20:07,468 INFO L290 TraceCheckUtils]: 15: Hoare triple {428#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {432#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:20:07,469 INFO L290 TraceCheckUtils]: 16: Hoare triple {432#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {378#false} is VALID [2022-04-28 04:20:07,469 INFO L290 TraceCheckUtils]: 17: Hoare triple {378#false} assume !false; {378#false} is VALID [2022-04-28 04:20:07,469 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 04:20:07,469 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 04:20:38,936 INFO L290 TraceCheckUtils]: 17: Hoare triple {378#false} assume !false; {378#false} is VALID [2022-04-28 04:20:38,936 INFO L290 TraceCheckUtils]: 16: Hoare triple {432#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {378#false} is VALID [2022-04-28 04:20:38,937 INFO L290 TraceCheckUtils]: 15: Hoare triple {428#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {432#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:20:38,938 INFO L272 TraceCheckUtils]: 14: Hoare triple {448#(= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0))} call __VERIFIER_assert((if 0 == ~z~0 * ~x~0 - ~x~0 + ~a~0 - ~az~0 * ~y~0 then 1 else 0)); {428#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 04:20:38,938 INFO L290 TraceCheckUtils]: 13: Hoare triple {448#(= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0))} assume !false; {448#(= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0))} is VALID [2022-04-28 04:20:38,996 INFO L290 TraceCheckUtils]: 12: Hoare triple {455#(= (+ (* main_~z~0 main_~x~0) main_~a~0 (* main_~az~0 (* main_~z~0 main_~y~0))) (+ main_~a~0 (* main_~z~0 (+ (* main_~z~0 main_~x~0) main_~a~0))))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~x~0 := ~x~0 * ~z~0 + ~a~0;~y~0 := ~y~0 * ~z~0; {448#(= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0))} is VALID [2022-04-28 04:20:39,000 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {411#(not (= |__VERIFIER_assert_#in~cond| 0))} {377#true} #49#return; {455#(= (+ (* main_~z~0 main_~x~0) main_~a~0 (* main_~az~0 (* main_~z~0 main_~y~0))) (+ main_~a~0 (* main_~z~0 (+ (* main_~z~0 main_~x~0) main_~a~0))))} is VALID [2022-04-28 04:20:39,000 INFO L290 TraceCheckUtils]: 10: Hoare triple {411#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {411#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 04:20:39,001 INFO L290 TraceCheckUtils]: 9: Hoare triple {468#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {411#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 04:20:39,004 INFO L290 TraceCheckUtils]: 8: Hoare triple {377#true} ~cond := #in~cond; {468#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 04:20:39,005 INFO L272 TraceCheckUtils]: 7: Hoare triple {377#true} call __VERIFIER_assert((if 0 == ~z~0 * ~x~0 - ~x~0 + ~a~0 - ~az~0 * ~y~0 then 1 else 0)); {377#true} is VALID [2022-04-28 04:20:39,005 INFO L290 TraceCheckUtils]: 6: Hoare triple {377#true} assume !false; {377#true} is VALID [2022-04-28 04:20:39,005 INFO L290 TraceCheckUtils]: 5: Hoare triple {377#true} havoc ~z~0;havoc ~a~0;havoc ~k~0;havoc ~x~0;havoc ~y~0;havoc ~c~0;havoc ~az~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~z~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~a~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~k~0 := #t~nondet6;havoc #t~nondet6;~x~0 := ~a~0;~y~0 := 1;~c~0 := 1;~az~0 := ~a~0 * ~z~0; {377#true} is VALID [2022-04-28 04:20:39,005 INFO L272 TraceCheckUtils]: 4: Hoare triple {377#true} call #t~ret7 := main(); {377#true} is VALID [2022-04-28 04:20:39,005 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {377#true} {377#true} #53#return; {377#true} is VALID [2022-04-28 04:20:39,005 INFO L290 TraceCheckUtils]: 2: Hoare triple {377#true} assume true; {377#true} is VALID [2022-04-28 04:20:39,005 INFO L290 TraceCheckUtils]: 1: Hoare triple {377#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {377#true} is VALID [2022-04-28 04:20:39,006 INFO L272 TraceCheckUtils]: 0: Hoare triple {377#true} call ULTIMATE.init(); {377#true} is VALID [2022-04-28 04:20:39,006 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 04:20:39,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:20:39,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532576738] [2022-04-28 04:20:39,006 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 04:20:39,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2140855469] [2022-04-28 04:20:39,007 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2140855469] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 04:20:39,007 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 04:20:39,007 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2022-04-28 04:20:39,007 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:20:39,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [777768930] [2022-04-28 04:20:39,008 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [777768930] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:20:39,008 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:20:39,008 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 04:20:39,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175100714] [2022-04-28 04:20:39,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:20:39,008 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.5) internal successors, (12), 7 states have internal predecessors, (12), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2022-04-28 04:20:39,009 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:20:39,009 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 1.5) internal successors, (12), 7 states have internal predecessors, (12), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 04:20:39,048 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:20:39,048 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 04:20:39,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:20:39,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 04:20:39,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-04-28 04:20:39,050 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand has 8 states, 8 states have (on average 1.5) internal successors, (12), 7 states have internal predecessors, (12), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 04:20:39,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:20:39,676 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2022-04-28 04:20:39,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 04:20:39,676 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.5) internal successors, (12), 7 states have internal predecessors, (12), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2022-04-28 04:20:39,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:20:39,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.5) internal successors, (12), 7 states have internal predecessors, (12), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 04:20:39,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 32 transitions. [2022-04-28 04:20:39,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.5) internal successors, (12), 7 states have internal predecessors, (12), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 04:20:39,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 32 transitions. [2022-04-28 04:20:39,681 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 32 transitions. [2022-04-28 04:20:39,774 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:20:39,775 INFO L225 Difference]: With dead ends: 33 [2022-04-28 04:20:39,775 INFO L226 Difference]: Without dead ends: 30 [2022-04-28 04:20:39,776 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2022-04-28 04:20:39,777 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 12 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 04:20:39,777 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 73 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 04:20:39,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-04-28 04:20:39,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-04-28 04:20:39,789 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:20:39,790 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand has 30 states, 19 states have (on average 1.105263157894737) internal successors, (21), 20 states have internal predecessors, (21), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 04:20:39,790 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand has 30 states, 19 states have (on average 1.105263157894737) internal successors, (21), 20 states have internal predecessors, (21), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 04:20:39,791 INFO L87 Difference]: Start difference. First operand 30 states. Second operand has 30 states, 19 states have (on average 1.105263157894737) internal successors, (21), 20 states have internal predecessors, (21), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 04:20:39,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:20:39,792 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2022-04-28 04:20:39,792 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2022-04-28 04:20:39,793 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:20:39,793 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:20:39,793 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 19 states have (on average 1.105263157894737) internal successors, (21), 20 states have internal predecessors, (21), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 30 states. [2022-04-28 04:20:39,794 INFO L87 Difference]: Start difference. First operand has 30 states, 19 states have (on average 1.105263157894737) internal successors, (21), 20 states have internal predecessors, (21), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 30 states. [2022-04-28 04:20:39,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:20:39,795 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2022-04-28 04:20:39,796 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2022-04-28 04:20:39,796 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:20:39,796 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:20:39,796 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:20:39,796 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:20:39,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 19 states have (on average 1.105263157894737) internal successors, (21), 20 states have internal predecessors, (21), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 04:20:39,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2022-04-28 04:20:39,798 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 18 [2022-04-28 04:20:39,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:20:39,799 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2022-04-28 04:20:39,799 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.5) internal successors, (12), 7 states have internal predecessors, (12), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 04:20:39,799 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 31 transitions. [2022-04-28 04:20:39,852 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:20:39,852 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2022-04-28 04:20:39,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-28 04:20:39,853 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:20:39,853 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:20:39,878 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-28 04:20:40,053 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:20:40,054 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:20:40,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:20:40,055 INFO L85 PathProgramCache]: Analyzing trace with hash 673668341, now seen corresponding path program 3 times [2022-04-28 04:20:40,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:20:40,055 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [483138432] [2022-04-28 04:20:41,954 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 3 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 04:20:41,954 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 04:20:41,954 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 04:20:41,955 INFO L85 PathProgramCache]: Analyzing trace with hash 673668341, now seen corresponding path program 4 times [2022-04-28 04:20:41,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:20:41,955 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740436293] [2022-04-28 04:20:41,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:20:41,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:20:41,974 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 04:20:41,974 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1062830907] [2022-04-28 04:20:41,974 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 04:20:41,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:20:41,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:20:41,983 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 04:20:41,998 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-28 04:20:44,180 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 04:20:44,180 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 04:20:44,182 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-28 04:20:44,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:20:44,955 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 04:20:59,917 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 04:21:06,193 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 04:21:08,143 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 04:21:25,730 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 04:21:31,744 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 04:21:45,218 INFO L272 TraceCheckUtils]: 0: Hoare triple {685#true} call ULTIMATE.init(); {685#true} is VALID [2022-04-28 04:21:45,218 INFO L290 TraceCheckUtils]: 1: Hoare triple {685#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {685#true} is VALID [2022-04-28 04:21:45,219 INFO L290 TraceCheckUtils]: 2: Hoare triple {685#true} assume true; {685#true} is VALID [2022-04-28 04:21:45,219 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {685#true} {685#true} #53#return; {685#true} is VALID [2022-04-28 04:21:45,219 INFO L272 TraceCheckUtils]: 4: Hoare triple {685#true} call #t~ret7 := main(); {685#true} is VALID [2022-04-28 04:21:45,219 INFO L290 TraceCheckUtils]: 5: Hoare triple {685#true} havoc ~z~0;havoc ~a~0;havoc ~k~0;havoc ~x~0;havoc ~y~0;havoc ~c~0;havoc ~az~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~z~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~a~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~k~0 := #t~nondet6;havoc #t~nondet6;~x~0 := ~a~0;~y~0 := 1;~c~0 := 1;~az~0 := ~a~0 * ~z~0; {685#true} is VALID [2022-04-28 04:21:45,219 INFO L290 TraceCheckUtils]: 6: Hoare triple {685#true} assume !false; {685#true} is VALID [2022-04-28 04:21:45,219 INFO L272 TraceCheckUtils]: 7: Hoare triple {685#true} call __VERIFIER_assert((if 0 == ~z~0 * ~x~0 - ~x~0 + ~a~0 - ~az~0 * ~y~0 then 1 else 0)); {685#true} is VALID [2022-04-28 04:21:45,219 INFO L290 TraceCheckUtils]: 8: Hoare triple {685#true} ~cond := #in~cond; {714#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:21:45,220 INFO L290 TraceCheckUtils]: 9: Hoare triple {714#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {718#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 04:21:45,220 INFO L290 TraceCheckUtils]: 10: Hoare triple {718#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {718#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 04:21:45,221 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {718#(not (= |__VERIFIER_assert_#in~cond| 0))} {685#true} #49#return; {725#(= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0))} is VALID [2022-04-28 04:21:47,223 WARN L290 TraceCheckUtils]: 12: Hoare triple {725#(= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~x~0 := ~x~0 * ~z~0 + ~a~0;~y~0 := ~y~0 * ~z~0; {729#(or (and (= (mod main_~y~0 main_~z~0) 0) (= 0 (mod (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) (not (= main_~z~0 0)) (= (+ main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0)) (+ (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) (* main_~az~0 (div main_~y~0 main_~z~0))))) (and (= main_~z~0 0) (= main_~y~0 0) (= main_~a~0 main_~x~0)))} is UNKNOWN [2022-04-28 04:21:47,225 INFO L290 TraceCheckUtils]: 13: Hoare triple {729#(or (and (= (mod main_~y~0 main_~z~0) 0) (= 0 (mod (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) (not (= main_~z~0 0)) (= (+ main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0)) (+ (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) (* main_~az~0 (div main_~y~0 main_~z~0))))) (and (= main_~z~0 0) (= main_~y~0 0) (= main_~a~0 main_~x~0)))} assume !false; {729#(or (and (= (mod main_~y~0 main_~z~0) 0) (= 0 (mod (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) (not (= main_~z~0 0)) (= (+ main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0)) (+ (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) (* main_~az~0 (div main_~y~0 main_~z~0))))) (and (= main_~z~0 0) (= main_~y~0 0) (= main_~a~0 main_~x~0)))} is VALID [2022-04-28 04:21:47,225 INFO L272 TraceCheckUtils]: 14: Hoare triple {729#(or (and (= (mod main_~y~0 main_~z~0) 0) (= 0 (mod (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) (not (= main_~z~0 0)) (= (+ main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0)) (+ (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) (* main_~az~0 (div main_~y~0 main_~z~0))))) (and (= main_~z~0 0) (= main_~y~0 0) (= main_~a~0 main_~x~0)))} call __VERIFIER_assert((if 0 == ~z~0 * ~x~0 - ~x~0 + ~a~0 - ~az~0 * ~y~0 then 1 else 0)); {685#true} is VALID [2022-04-28 04:21:47,235 INFO L290 TraceCheckUtils]: 15: Hoare triple {685#true} ~cond := #in~cond; {714#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:21:47,236 INFO L290 TraceCheckUtils]: 16: Hoare triple {714#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {718#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 04:21:47,237 INFO L290 TraceCheckUtils]: 17: Hoare triple {718#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {718#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 04:21:47,238 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {718#(not (= |__VERIFIER_assert_#in~cond| 0))} {729#(or (and (= (mod main_~y~0 main_~z~0) 0) (= 0 (mod (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) (not (= main_~z~0 0)) (= (+ main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0)) (+ (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) (* main_~az~0 (div main_~y~0 main_~z~0))))) (and (= main_~z~0 0) (= main_~y~0 0) (= main_~a~0 main_~x~0)))} #49#return; {729#(or (and (= (mod main_~y~0 main_~z~0) 0) (= 0 (mod (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) (not (= main_~z~0 0)) (= (+ main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0)) (+ (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) (* main_~az~0 (div main_~y~0 main_~z~0))))) (and (= main_~z~0 0) (= main_~y~0 0) (= main_~a~0 main_~x~0)))} is VALID [2022-04-28 04:21:49,241 WARN L290 TraceCheckUtils]: 19: Hoare triple {729#(or (and (= (mod main_~y~0 main_~z~0) 0) (= 0 (mod (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) (not (= main_~z~0 0)) (= (+ main_~a~0 (* (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) main_~z~0)) (+ (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) (* main_~az~0 (div main_~y~0 main_~z~0))))) (and (= main_~z~0 0) (= main_~y~0 0) (= main_~a~0 main_~x~0)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~x~0 := ~x~0 * ~z~0 + ~a~0;~y~0 := ~y~0 * ~z~0; {751#(or (and (= (mod main_~y~0 main_~z~0) 0) (= 0 (mod (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) (= (mod (div main_~y~0 main_~z~0) main_~z~0) 0) (= (mod (+ (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) (* (- 1) main_~a~0)) main_~z~0) 0) (= (+ (* (div (div main_~y~0 main_~z~0) main_~z~0) main_~az~0) (div (+ (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) (* (- 1) main_~a~0)) main_~z~0)) (+ main_~a~0 (* main_~z~0 (div (+ (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) (* (- 1) main_~a~0)) main_~z~0)))) (not (= main_~z~0 0))) (and (= main_~z~0 0) (= main_~y~0 0) (= main_~x~0 (+ (* main_~a~0 main_~z~0) main_~a~0))))} is UNKNOWN [2022-04-28 04:21:49,243 INFO L290 TraceCheckUtils]: 20: Hoare triple {751#(or (and (= (mod main_~y~0 main_~z~0) 0) (= 0 (mod (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) (= (mod (div main_~y~0 main_~z~0) main_~z~0) 0) (= (mod (+ (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) (* (- 1) main_~a~0)) main_~z~0) 0) (= (+ (* (div (div main_~y~0 main_~z~0) main_~z~0) main_~az~0) (div (+ (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) (* (- 1) main_~a~0)) main_~z~0)) (+ main_~a~0 (* main_~z~0 (div (+ (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) (* (- 1) main_~a~0)) main_~z~0)))) (not (= main_~z~0 0))) (and (= main_~z~0 0) (= main_~y~0 0) (= main_~x~0 (+ (* main_~a~0 main_~z~0) main_~a~0))))} assume !false; {751#(or (and (= (mod main_~y~0 main_~z~0) 0) (= 0 (mod (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) (= (mod (div main_~y~0 main_~z~0) main_~z~0) 0) (= (mod (+ (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) (* (- 1) main_~a~0)) main_~z~0) 0) (= (+ (* (div (div main_~y~0 main_~z~0) main_~z~0) main_~az~0) (div (+ (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) (* (- 1) main_~a~0)) main_~z~0)) (+ main_~a~0 (* main_~z~0 (div (+ (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) (* (- 1) main_~a~0)) main_~z~0)))) (not (= main_~z~0 0))) (and (= main_~z~0 0) (= main_~y~0 0) (= main_~x~0 (+ (* main_~a~0 main_~z~0) main_~a~0))))} is VALID [2022-04-28 04:21:49,273 INFO L272 TraceCheckUtils]: 21: Hoare triple {751#(or (and (= (mod main_~y~0 main_~z~0) 0) (= 0 (mod (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0)) (= (mod (div main_~y~0 main_~z~0) main_~z~0) 0) (= (mod (+ (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) (* (- 1) main_~a~0)) main_~z~0) 0) (= (+ (* (div (div main_~y~0 main_~z~0) main_~z~0) main_~az~0) (div (+ (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) (* (- 1) main_~a~0)) main_~z~0)) (+ main_~a~0 (* main_~z~0 (div (+ (div (+ (* (- 1) main_~a~0) main_~x~0) main_~z~0) (* (- 1) main_~a~0)) main_~z~0)))) (not (= main_~z~0 0))) (and (= main_~z~0 0) (= main_~y~0 0) (= main_~x~0 (+ (* main_~a~0 main_~z~0) main_~a~0))))} call __VERIFIER_assert((if 0 == ~z~0 * ~x~0 - ~x~0 + ~a~0 - ~az~0 * ~y~0 then 1 else 0)); {758#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 04:21:49,274 INFO L290 TraceCheckUtils]: 22: Hoare triple {758#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {762#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:21:49,274 INFO L290 TraceCheckUtils]: 23: Hoare triple {762#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {686#false} is VALID [2022-04-28 04:21:49,274 INFO L290 TraceCheckUtils]: 24: Hoare triple {686#false} assume !false; {686#false} is VALID [2022-04-28 04:21:49,275 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 04:21:49,275 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 04:22:20,803 INFO L290 TraceCheckUtils]: 24: Hoare triple {686#false} assume !false; {686#false} is VALID [2022-04-28 04:22:20,804 INFO L290 TraceCheckUtils]: 23: Hoare triple {762#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {686#false} is VALID [2022-04-28 04:22:20,804 INFO L290 TraceCheckUtils]: 22: Hoare triple {758#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {762#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 04:22:20,805 INFO L272 TraceCheckUtils]: 21: Hoare triple {725#(= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0))} call __VERIFIER_assert((if 0 == ~z~0 * ~x~0 - ~x~0 + ~a~0 - ~az~0 * ~y~0 then 1 else 0)); {758#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 04:22:20,806 INFO L290 TraceCheckUtils]: 20: Hoare triple {725#(= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0))} assume !false; {725#(= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0))} is VALID [2022-04-28 04:22:20,940 INFO L290 TraceCheckUtils]: 19: Hoare triple {784#(= (+ (* main_~z~0 main_~x~0) main_~a~0 (* main_~az~0 (* main_~z~0 main_~y~0))) (+ main_~a~0 (* main_~z~0 (+ (* main_~z~0 main_~x~0) main_~a~0))))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~x~0 := ~x~0 * ~z~0 + ~a~0;~y~0 := ~y~0 * ~z~0; {725#(= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0))} is VALID [2022-04-28 04:22:20,945 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {718#(not (= |__VERIFIER_assert_#in~cond| 0))} {685#true} #49#return; {784#(= (+ (* main_~z~0 main_~x~0) main_~a~0 (* main_~az~0 (* main_~z~0 main_~y~0))) (+ main_~a~0 (* main_~z~0 (+ (* main_~z~0 main_~x~0) main_~a~0))))} is VALID [2022-04-28 04:22:20,945 INFO L290 TraceCheckUtils]: 17: Hoare triple {718#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {718#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 04:22:20,946 INFO L290 TraceCheckUtils]: 16: Hoare triple {797#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {718#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 04:22:20,946 INFO L290 TraceCheckUtils]: 15: Hoare triple {685#true} ~cond := #in~cond; {797#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 04:22:20,946 INFO L272 TraceCheckUtils]: 14: Hoare triple {685#true} call __VERIFIER_assert((if 0 == ~z~0 * ~x~0 - ~x~0 + ~a~0 - ~az~0 * ~y~0 then 1 else 0)); {685#true} is VALID [2022-04-28 04:22:20,946 INFO L290 TraceCheckUtils]: 13: Hoare triple {685#true} assume !false; {685#true} is VALID [2022-04-28 04:22:20,946 INFO L290 TraceCheckUtils]: 12: Hoare triple {685#true} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~x~0 := ~x~0 * ~z~0 + ~a~0;~y~0 := ~y~0 * ~z~0; {685#true} is VALID [2022-04-28 04:22:20,947 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {685#true} {685#true} #49#return; {685#true} is VALID [2022-04-28 04:22:20,947 INFO L290 TraceCheckUtils]: 10: Hoare triple {685#true} assume true; {685#true} is VALID [2022-04-28 04:22:20,947 INFO L290 TraceCheckUtils]: 9: Hoare triple {685#true} assume !(0 == ~cond); {685#true} is VALID [2022-04-28 04:22:20,947 INFO L290 TraceCheckUtils]: 8: Hoare triple {685#true} ~cond := #in~cond; {685#true} is VALID [2022-04-28 04:22:20,947 INFO L272 TraceCheckUtils]: 7: Hoare triple {685#true} call __VERIFIER_assert((if 0 == ~z~0 * ~x~0 - ~x~0 + ~a~0 - ~az~0 * ~y~0 then 1 else 0)); {685#true} is VALID [2022-04-28 04:22:20,947 INFO L290 TraceCheckUtils]: 6: Hoare triple {685#true} assume !false; {685#true} is VALID [2022-04-28 04:22:20,948 INFO L290 TraceCheckUtils]: 5: Hoare triple {685#true} havoc ~z~0;havoc ~a~0;havoc ~k~0;havoc ~x~0;havoc ~y~0;havoc ~c~0;havoc ~az~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~z~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~a~0 := #t~nondet5;havoc #t~nondet5;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~k~0 := #t~nondet6;havoc #t~nondet6;~x~0 := ~a~0;~y~0 := 1;~c~0 := 1;~az~0 := ~a~0 * ~z~0; {685#true} is VALID [2022-04-28 04:22:20,948 INFO L272 TraceCheckUtils]: 4: Hoare triple {685#true} call #t~ret7 := main(); {685#true} is VALID [2022-04-28 04:22:20,948 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {685#true} {685#true} #53#return; {685#true} is VALID [2022-04-28 04:22:20,948 INFO L290 TraceCheckUtils]: 2: Hoare triple {685#true} assume true; {685#true} is VALID [2022-04-28 04:22:20,948 INFO L290 TraceCheckUtils]: 1: Hoare triple {685#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3); {685#true} is VALID [2022-04-28 04:22:20,948 INFO L272 TraceCheckUtils]: 0: Hoare triple {685#true} call ULTIMATE.init(); {685#true} is VALID [2022-04-28 04:22:20,948 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-28 04:22:20,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:22:20,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740436293] [2022-04-28 04:22:20,949 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 04:22:20,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1062830907] [2022-04-28 04:22:20,949 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1062830907] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 04:22:20,949 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 04:22:20,949 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 11 [2022-04-28 04:22:20,950 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:22:20,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [483138432] [2022-04-28 04:22:20,950 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [483138432] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:22:20,950 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:22:20,950 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 04:22:20,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785922356] [2022-04-28 04:22:20,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:22:20,951 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 7 states have internal predecessors, (14), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 25 [2022-04-28 04:22:20,951 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:22:20,951 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 7 states have internal predecessors, (14), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 04:22:25,016 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 20 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-28 04:22:25,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 04:22:25,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:22:25,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 04:22:25,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-04-28 04:22:25,017 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand has 9 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 7 states have internal predecessors, (14), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 04:22:27,342 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.23s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 04:22:29,676 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 04:22:30,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:22:30,627 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2022-04-28 04:22:30,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 04:22:30,627 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 7 states have internal predecessors, (14), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 25 [2022-04-28 04:22:30,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:22:30,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 7 states have internal predecessors, (14), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 04:22:30,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 25 transitions. [2022-04-28 04:22:30,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 7 states have internal predecessors, (14), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 04:22:30,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 25 transitions. [2022-04-28 04:22:30,631 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 25 transitions. [2022-04-28 04:22:38,724 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 21 inductive. 0 not inductive. 4 times theorem prover too weak to decide inductivity. [2022-04-28 04:22:38,724 INFO L225 Difference]: With dead ends: 30 [2022-04-28 04:22:38,724 INFO L226 Difference]: Without dead ends: 0 [2022-04-28 04:22:38,725 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-04-28 04:22:38,726 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 10 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 3 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2022-04-28 04:22:38,726 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 69 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 54 Invalid, 2 Unknown, 0 Unchecked, 4.9s Time] [2022-04-28 04:22:38,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-28 04:22:38,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-28 04:22:38,728 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:22:38,728 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 04:22:38,728 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 04:22:38,729 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 04:22:38,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:22:38,729 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 04:22:38,729 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 04:22:38,729 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:22:38,729 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:22:38,729 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-28 04:22:38,730 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-28 04:22:38,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:22:38,731 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 04:22:38,731 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 04:22:38,731 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:22:38,731 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:22:38,731 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:22:38,731 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:22:38,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 04:22:38,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-28 04:22:38,731 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 25 [2022-04-28 04:22:38,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:22:38,732 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-28 04:22:38,732 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 7 states have internal predecessors, (14), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 04:22:38,732 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-28 04:22:38,732 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:22:38,732 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 04:22:38,732 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:22:38,734 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-28 04:22:38,742 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-28 04:22:38,934 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 04:22:38,936 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-28 04:22:41,480 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 8) no Hoare annotation was computed. [2022-04-28 04:22:41,481 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 8) no Hoare annotation was computed. [2022-04-28 04:22:41,481 INFO L899 garLoopResultBuilder]: For program point reach_errorFINAL(line 8) no Hoare annotation was computed. [2022-04-28 04:22:41,481 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notENTRY(lines 11 13) no Hoare annotation was computed. [2022-04-28 04:22:41,481 INFO L899 garLoopResultBuilder]: For program point L12(line 12) no Hoare annotation was computed. [2022-04-28 04:22:41,481 INFO L899 garLoopResultBuilder]: For program point L12-2(lines 11 13) no Hoare annotation was computed. [2022-04-28 04:22:41,481 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 11 13) no Hoare annotation was computed. [2022-04-28 04:22:41,481 INFO L895 garLoopResultBuilder]: At program point L34-1(lines 33 42) the Hoare annotation is: (let ((.cse8 (* main_~a~0 main_~z~0))) (let ((.cse0 (= .cse8 main_~az~0)) (.cse5 (= main_~z~0 0)) (.cse7 (= main_~x~0 (+ .cse8 main_~a~0)))) (or (and (= main_~y~0 1) (= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0)) .cse0) (let ((.cse6 (* (- 1) main_~a~0))) (let ((.cse1 (+ .cse6 main_~x~0))) (let ((.cse2 (div main_~y~0 main_~z~0)) (.cse3 (+ (div .cse1 main_~z~0) .cse6))) (and (= (mod main_~y~0 main_~z~0) 0) (= 0 (mod .cse1 main_~z~0)) (= (mod .cse2 main_~z~0) 0) (= (mod .cse3 main_~z~0) 0) (let ((.cse4 (div .cse3 main_~z~0))) (= (+ (* (div .cse2 main_~z~0) main_~az~0) .cse4) (+ main_~a~0 (* main_~z~0 .cse4)))) (not .cse5))))) (and (= main_~z~0 main_~y~0) .cse7 .cse0) (and .cse5 (= main_~y~0 0) .cse7)))) [2022-04-28 04:22:41,482 INFO L895 garLoopResultBuilder]: At program point L33-2(lines 33 42) the Hoare annotation is: (let ((.cse8 (* main_~a~0 main_~z~0))) (let ((.cse0 (= .cse8 main_~az~0)) (.cse5 (= main_~z~0 0)) (.cse7 (= main_~x~0 (+ .cse8 main_~a~0)))) (or (and (= main_~y~0 1) (= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0)) .cse0) (let ((.cse6 (* (- 1) main_~a~0))) (let ((.cse1 (+ .cse6 main_~x~0))) (let ((.cse2 (div main_~y~0 main_~z~0)) (.cse3 (+ (div .cse1 main_~z~0) .cse6))) (and (= (mod main_~y~0 main_~z~0) 0) (= 0 (mod .cse1 main_~z~0)) (= (mod .cse2 main_~z~0) 0) (= (mod .cse3 main_~z~0) 0) (let ((.cse4 (div .cse3 main_~z~0))) (= (+ (* (div .cse2 main_~z~0) main_~az~0) .cse4) (+ main_~a~0 (* main_~z~0 .cse4)))) (not .cse5))))) (and (= main_~z~0 main_~y~0) .cse7 .cse0) (and .cse5 (= main_~y~0 0) .cse7)))) [2022-04-28 04:22:41,482 INFO L895 garLoopResultBuilder]: At program point L33-3(lines 33 42) the Hoare annotation is: (let ((.cse8 (* main_~a~0 main_~z~0))) (let ((.cse0 (= .cse8 main_~az~0)) (.cse5 (= main_~z~0 0)) (.cse7 (= main_~x~0 (+ .cse8 main_~a~0)))) (or (and (= main_~y~0 1) (= main_~a~0 main_~x~0) .cse0) (let ((.cse6 (* (- 1) main_~a~0))) (let ((.cse1 (+ .cse6 main_~x~0))) (let ((.cse2 (div main_~y~0 main_~z~0)) (.cse3 (+ (div .cse1 main_~z~0) .cse6))) (and (= (mod main_~y~0 main_~z~0) 0) (= 0 (mod .cse1 main_~z~0)) (= (mod .cse2 main_~z~0) 0) (= (mod .cse3 main_~z~0) 0) (let ((.cse4 (div .cse3 main_~z~0))) (= (+ (* (div .cse2 main_~z~0) main_~az~0) .cse4) (+ main_~a~0 (* main_~z~0 .cse4)))) (not .cse5))))) (and (= main_~z~0 main_~y~0) .cse7 .cse0) (and .cse5 (= main_~y~0 0) .cse7)))) [2022-04-28 04:22:41,482 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 21 45) the Hoare annotation is: true [2022-04-28 04:22:41,482 INFO L902 garLoopResultBuilder]: At program point mainEXIT(lines 21 45) the Hoare annotation is: true [2022-04-28 04:22:41,482 INFO L902 garLoopResultBuilder]: At program point mainFINAL(lines 21 45) the Hoare annotation is: true [2022-04-28 04:22:41,482 INFO L902 garLoopResultBuilder]: At program point L43(line 43) the Hoare annotation is: true [2022-04-28 04:22:41,482 INFO L895 garLoopResultBuilder]: At program point L34(line 34) the Hoare annotation is: (let ((.cse8 (* main_~a~0 main_~z~0))) (let ((.cse0 (= .cse8 main_~az~0)) (.cse5 (= main_~z~0 0)) (.cse7 (= main_~x~0 (+ .cse8 main_~a~0)))) (or (and (= main_~y~0 1) (= (+ (* main_~y~0 main_~az~0) main_~x~0) (+ (* main_~z~0 main_~x~0) main_~a~0)) .cse0) (let ((.cse6 (* (- 1) main_~a~0))) (let ((.cse1 (+ .cse6 main_~x~0))) (let ((.cse2 (div main_~y~0 main_~z~0)) (.cse3 (+ (div .cse1 main_~z~0) .cse6))) (and (= (mod main_~y~0 main_~z~0) 0) (= 0 (mod .cse1 main_~z~0)) (= (mod .cse2 main_~z~0) 0) (= (mod .cse3 main_~z~0) 0) (let ((.cse4 (div .cse3 main_~z~0))) (= (+ (* (div .cse2 main_~z~0) main_~az~0) .cse4) (+ main_~a~0 (* main_~z~0 .cse4)))) (not .cse5))))) (and (= main_~z~0 main_~y~0) .cse7 .cse0) (and .cse5 (= main_~y~0 0) .cse7)))) [2022-04-28 04:22:41,482 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-28 04:22:41,482 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2022-04-28 04:22:41,483 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-28 04:22:41,483 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-28 04:22:41,483 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-28 04:22:41,483 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-28 04:22:41,483 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-28 04:22:41,483 INFO L895 garLoopResultBuilder]: At program point L16(lines 16 17) the Hoare annotation is: (not (<= 1 |__VERIFIER_assert_#in~cond|)) [2022-04-28 04:22:41,483 INFO L895 garLoopResultBuilder]: At program point L15(lines 15 18) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (not (<= 1 |__VERIFIER_assert_#in~cond|))) [2022-04-28 04:22:41,483 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 14 20) the Hoare annotation is: true [2022-04-28 04:22:41,483 INFO L895 garLoopResultBuilder]: At program point L15-2(lines 14 20) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (not (<= 1 |__VERIFIER_assert_#in~cond|))) [2022-04-28 04:22:41,483 INFO L895 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 14 20) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (not (<= 1 |__VERIFIER_assert_#in~cond|))) [2022-04-28 04:22:41,484 INFO L895 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 17) the Hoare annotation is: (not (<= 1 |__VERIFIER_assert_#in~cond|)) [2022-04-28 04:22:41,486 INFO L356 BasicCegarLoop]: Path program histogram: [4, 2, 2] [2022-04-28 04:22:41,487 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-28 04:22:41,490 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-28 04:22:41,490 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-28 04:22:41,492 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-28 04:22:41,492 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-28 04:22:41,492 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-28 04:22:41,496 WARN L170 areAnnotationChecker]: L12-2 has no Hoare annotation [2022-04-28 04:22:43,513 INFO L163 areAnnotationChecker]: CFG has 25 edges. 24 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-28 04:22:43,522 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 04:22:43 BoogieIcfgContainer [2022-04-28 04:22:43,522 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-28 04:22:43,523 INFO L158 Benchmark]: Toolchain (without parser) took 162032.77ms. Allocated memory was 190.8MB in the beginning and 229.6MB in the end (delta: 38.8MB). Free memory was 141.4MB in the beginning and 134.2MB in the end (delta: 7.2MB). Peak memory consumption was 46.7MB. Max. memory is 8.0GB. [2022-04-28 04:22:43,523 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 190.8MB. Free memory is still 157.9MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 04:22:43,524 INFO L158 Benchmark]: CACSL2BoogieTranslator took 199.21ms. Allocated memory is still 190.8MB. Free memory was 141.2MB in the beginning and 165.8MB in the end (delta: -24.6MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-28 04:22:43,524 INFO L158 Benchmark]: Boogie Preprocessor took 22.81ms. Allocated memory is still 190.8MB. Free memory was 165.8MB in the beginning and 164.3MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-28 04:22:43,524 INFO L158 Benchmark]: RCFGBuilder took 274.19ms. Allocated memory is still 190.8MB. Free memory was 164.3MB in the beginning and 153.5MB in the end (delta: 10.7MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-28 04:22:43,525 INFO L158 Benchmark]: TraceAbstraction took 161529.43ms. Allocated memory was 190.8MB in the beginning and 229.6MB in the end (delta: 38.8MB). Free memory was 153.0MB in the beginning and 134.2MB in the end (delta: 18.8MB). Peak memory consumption was 58.6MB. Max. memory is 8.0GB. [2022-04-28 04:22:43,526 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 190.8MB. Free memory is still 157.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 199.21ms. Allocated memory is still 190.8MB. Free memory was 141.2MB in the beginning and 165.8MB in the end (delta: -24.6MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 22.81ms. Allocated memory is still 190.8MB. Free memory was 165.8MB in the beginning and 164.3MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 274.19ms. Allocated memory is still 190.8MB. Free memory was 164.3MB in the beginning and 153.5MB in the end (delta: 10.7MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 161529.43ms. Allocated memory was 190.8MB in the beginning and 229.6MB in the end (delta: 38.8MB). Free memory was 153.0MB in the beginning and 134.2MB in the end (delta: 18.8MB). Peak memory consumption was 58.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 17]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 28 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 159.4s, OverallIterations: 4, TraceHistogramMax: 3, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 14.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.5s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2 mSolverCounterUnknown, 31 SdHoareTripleChecker+Valid, 5.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 28 mSDsluCounter, 213 SdHoareTripleChecker+Invalid, 5.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 148 mSDsCounter, 7 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 141 IncrementalHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7 mSolverCounterUnsat, 65 mSDtfsCounter, 141 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 108 GetRequests, 80 SyntacticMatches, 3 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=30occurred in iteration=3, InterpolantAutomatonStates: 22, 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, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 21 LocationsWithAnnotation, 63 PreInvPairs, 100 NumberOfFragments, 560 HoareAnnotationTreeSize, 63 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 21 FomulaSimplificationsInter, 278 FormulaSimplificationTreeSizeReductionInter, 2.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 33]: Loop Invariant Derived loop invariant: ((((y == 1 && y * az + x == z * x + a) && a * z == az) || (((((y % z == 0 && 0 == (-1 * a + x) % z) && y / z % z == 0) && ((-1 * a + x) / z + -1 * a) % z == 0) && y / z / z * az + ((-1 * a + x) / z + -1 * a) / z == a + z * (((-1 * a + x) / z + -1 * a) / z)) && !(z == 0))) || ((z == y && x == a * z + a) && a * z == az)) || ((z == 0 && y == 0) && x == a * z + a) - ProcedureContractResult [Line: 21]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 14]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: \old(cond) == cond || !(1 <= \old(cond)) RESULT: Ultimate proved your program to be correct! [2022-04-28 04:22:43,561 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...