/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/geo2-ll_unwindbound10.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 06:07:02,071 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 06:07:02,072 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 06:07:02,118 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 06:07:02,118 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 06:07:02,119 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 06:07:02,122 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 06:07:02,125 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 06:07:02,126 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 06:07:02,130 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 06:07:02,130 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 06:07:02,131 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 06:07:02,132 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 06:07:02,133 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 06:07:02,134 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 06:07:02,136 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 06:07:02,137 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 06:07:02,137 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 06:07:02,139 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 06:07:02,143 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 06:07:02,144 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 06:07:02,145 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 06:07:02,146 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 06:07:02,146 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 06:07:02,147 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 06:07:02,152 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 06:07:02,152 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 06:07:02,153 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 06:07:02,153 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 06:07:02,154 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 06:07:02,154 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 06:07:02,155 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 06:07:02,159 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 06:07:02,160 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 06:07:02,160 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 06:07:02,161 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 06:07:02,161 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 06:07:02,161 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 06:07:02,161 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 06:07:02,162 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 06:07:02,162 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 06:07:02,163 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 06:07:02,164 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 06:07:02,171 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 06:07:02,171 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 06:07:02,172 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 06:07:02,172 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-28 06:07:02,173 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 06:07:02,173 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-28 06:07:02,173 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 06:07:02,173 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 06:07:02,173 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 06:07:02,173 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 06:07:02,174 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-28 06:07:02,174 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 06:07:02,174 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 06:07:02,174 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 06:07:02,174 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 06:07:02,174 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 06:07:02,174 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 06:07:02,175 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 06:07:02,175 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 06:07:02,175 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 06:07:02,175 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 06:07:02,175 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 06:07:02,175 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 06:07:02,175 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 06:07:02,175 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-28 06:07:02,175 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 06:07:02,350 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 06:07:02,366 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 06:07:02,368 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 06:07:02,369 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 06:07:02,370 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 06:07:02,371 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/geo2-ll_unwindbound10.c [2022-04-28 06:07:02,410 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/35266cbbc/27ac021312124f68afdcbbb6be739cbf/FLAG82ce40692 [2022-04-28 06:07:02,757 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 06:07:02,758 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/geo2-ll_unwindbound10.c [2022-04-28 06:07:02,762 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/35266cbbc/27ac021312124f68afdcbbb6be739cbf/FLAG82ce40692 [2022-04-28 06:07:02,772 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/35266cbbc/27ac021312124f68afdcbbb6be739cbf [2022-04-28 06:07:02,774 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 06:07:02,775 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 06:07:02,777 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 06:07:02,778 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 06:07:02,780 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 06:07:02,781 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 06:07:02" (1/1) ... [2022-04-28 06:07:02,782 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2111a4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 06:07:02, skipping insertion in model container [2022-04-28 06:07:02,782 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 06:07:02" (1/1) ... [2022-04-28 06:07:02,786 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 06:07:02,795 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 06:07:02,956 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/geo2-ll_unwindbound10.c[525,538] [2022-04-28 06:07:02,980 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 06:07:02,985 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 06:07:02,994 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/geo2-ll_unwindbound10.c[525,538] [2022-04-28 06:07:03,005 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 06:07:03,013 INFO L208 MainTranslator]: Completed translation [2022-04-28 06:07:03,013 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 06:07:03 WrapperNode [2022-04-28 06:07:03,013 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 06:07:03,014 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 06:07:03,014 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 06:07:03,014 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 06:07:03,021 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 06:07:03" (1/1) ... [2022-04-28 06:07:03,021 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 06:07:03" (1/1) ... [2022-04-28 06:07:03,027 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 06:07:03" (1/1) ... [2022-04-28 06:07:03,027 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 06:07:03" (1/1) ... [2022-04-28 06:07:03,037 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 06:07:03" (1/1) ... [2022-04-28 06:07:03,042 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 06:07:03" (1/1) ... [2022-04-28 06:07:03,043 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 06:07:03" (1/1) ... [2022-04-28 06:07:03,047 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 06:07:03,049 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 06:07:03,049 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 06:07:03,049 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 06:07:03,050 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 06:07:03" (1/1) ... [2022-04-28 06:07:03,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 06:07:03,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 06:07:03,086 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 06:07:03,103 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 06:07:03,123 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 06:07:03,123 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 06:07:03,123 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 06:07:03,123 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-28 06:07:03,123 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 06:07:03,123 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 06:07:03,124 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 06:07:03,124 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 06:07:03,124 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 06:07:03,124 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 06:07:03,124 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-28 06:07:03,124 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-28 06:07:03,124 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 06:07:03,124 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 06:07:03,125 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 06:07:03,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 06:07:03,125 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 06:07:03,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 06:07:03,125 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 06:07:03,125 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 06:07:03,165 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 06:07:03,166 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 06:07:03,292 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 06:07:03,296 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 06:07:03,296 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 06:07:03,297 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 06:07:03 BoogieIcfgContainer [2022-04-28 06:07:03,297 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 06:07:03,298 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 06:07:03,298 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 06:07:03,301 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 06:07:03,301 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 06:07:02" (1/3) ... [2022-04-28 06:07:03,301 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fc7ed58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 06:07:03, skipping insertion in model container [2022-04-28 06:07:03,301 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 06:07:03" (2/3) ... [2022-04-28 06:07:03,301 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fc7ed58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 06:07:03, skipping insertion in model container [2022-04-28 06:07:03,302 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 06:07:03" (3/3) ... [2022-04-28 06:07:03,302 INFO L111 eAbstractionObserver]: Analyzing ICFG geo2-ll_unwindbound10.c [2022-04-28 06:07:03,314 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 06:07:03,314 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 06:07:03,382 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 06:07:03,386 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@38de7255, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@2afbd0da [2022-04-28 06:07:03,386 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 06:07:03,393 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 06:07:03,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-28 06:07:03,397 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 06:07:03,398 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 06:07:03,399 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 06:07:03,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 06:07:03,404 INFO L85 PathProgramCache]: Analyzing trace with hash 1665267581, now seen corresponding path program 1 times [2022-04-28 06:07:03,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 06:07:03,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1528487860] [2022-04-28 06:07:03,421 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 06:07:03,421 INFO L85 PathProgramCache]: Analyzing trace with hash 1665267581, now seen corresponding path program 2 times [2022-04-28 06:07:03,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 06:07:03,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365008701] [2022-04-28 06:07:03,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 06:07:03,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 06:07:03,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 06:07:03,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 06:07:03,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 06:07:03,586 INFO L290 TraceCheckUtils]: 0: Hoare triple {30#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {25#true} is VALID [2022-04-28 06:07:03,586 INFO L290 TraceCheckUtils]: 1: Hoare triple {25#true} assume true; {25#true} is VALID [2022-04-28 06:07:03,587 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25#true} {25#true} #54#return; {25#true} is VALID [2022-04-28 06:07:03,588 INFO L272 TraceCheckUtils]: 0: Hoare triple {25#true} call ULTIMATE.init(); {30#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 06:07:03,589 INFO L290 TraceCheckUtils]: 1: Hoare triple {30#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {25#true} is VALID [2022-04-28 06:07:03,589 INFO L290 TraceCheckUtils]: 2: Hoare triple {25#true} assume true; {25#true} is VALID [2022-04-28 06:07:03,589 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25#true} {25#true} #54#return; {25#true} is VALID [2022-04-28 06:07:03,589 INFO L272 TraceCheckUtils]: 4: Hoare triple {25#true} call #t~ret7 := main(); {25#true} is VALID [2022-04-28 06:07:03,589 INFO L290 TraceCheckUtils]: 5: Hoare triple {25#true} havoc ~z~0;havoc ~k~0;havoc ~x~0;havoc ~y~0;havoc ~c~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~z~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~k~0 := #t~nondet5;havoc #t~nondet5;~x~0 := 1;~y~0 := 1;~c~0 := 1; {25#true} is VALID [2022-04-28 06:07:03,590 INFO L290 TraceCheckUtils]: 6: Hoare triple {25#true} assume !true; {26#false} is VALID [2022-04-28 06:07:03,591 INFO L272 TraceCheckUtils]: 7: Hoare triple {26#false} call __VERIFIER_assert((if 0 == 1 + ~x~0 * ~z~0 - ~x~0 - ~z~0 * ~y~0 then 1 else 0)); {26#false} is VALID [2022-04-28 06:07:03,591 INFO L290 TraceCheckUtils]: 8: Hoare triple {26#false} ~cond := #in~cond; {26#false} is VALID [2022-04-28 06:07:03,591 INFO L290 TraceCheckUtils]: 9: Hoare triple {26#false} assume 0 == ~cond; {26#false} is VALID [2022-04-28 06:07:03,591 INFO L290 TraceCheckUtils]: 10: Hoare triple {26#false} assume !false; {26#false} is VALID [2022-04-28 06:07:03,592 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 06:07:03,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 06:07:03,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365008701] [2022-04-28 06:07:03,593 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365008701] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 06:07:03,593 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 06:07:03,593 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 06:07:03,595 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 06:07:03,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1528487860] [2022-04-28 06:07:03,595 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1528487860] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 06:07:03,595 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 06:07:03,595 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 06:07:03,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194796730] [2022-04-28 06:07:03,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 06:07:03,599 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-28 06:07:03,600 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 06:07:03,602 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 06:07:03,623 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 06:07:03,623 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 06:07:03,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 06:07:03,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 06:07:03,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 06:07:03,641 INFO L87 Difference]: Start difference. First operand has 22 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 06:07:03,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:07:03,740 INFO L93 Difference]: Finished difference Result 39 states and 50 transitions. [2022-04-28 06:07:03,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 06:07:03,740 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-28 06:07:03,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 06:07:03,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 06:07:03,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 50 transitions. [2022-04-28 06:07:03,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 06:07:03,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 50 transitions. [2022-04-28 06:07:03,751 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 50 transitions. [2022-04-28 06:07:03,815 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:07:03,825 INFO L225 Difference]: With dead ends: 39 [2022-04-28 06:07:03,825 INFO L226 Difference]: Without dead ends: 18 [2022-04-28 06:07:03,827 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 06:07:03,829 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 6 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 06:07:03,830 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 27 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 06:07:03,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-04-28 06:07:03,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2022-04-28 06:07:03,861 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 06:07:03,862 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand has 17 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 06:07:03,863 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand has 17 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 06:07:03,863 INFO L87 Difference]: Start difference. First operand 18 states. Second operand has 17 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 06:07:03,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:07:03,869 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2022-04-28 06:07:03,869 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2022-04-28 06:07:03,870 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:07:03,870 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:07:03,871 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 18 states. [2022-04-28 06:07:03,871 INFO L87 Difference]: Start difference. First operand has 17 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 18 states. [2022-04-28 06:07:03,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:07:03,881 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2022-04-28 06:07:03,881 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2022-04-28 06:07:03,882 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:07:03,882 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:07:03,882 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 06:07:03,882 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 06:07:03,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 06:07:03,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2022-04-28 06:07:03,886 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 11 [2022-04-28 06:07:03,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 06:07:03,887 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2022-04-28 06:07:03,887 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 06:07:03,888 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 19 transitions. [2022-04-28 06:07:03,911 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:07:03,912 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-28 06:07:03,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-28 06:07:03,913 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 06:07:03,913 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 06:07:03,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 06:07:03,913 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 06:07:03,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 06:07:03,914 INFO L85 PathProgramCache]: Analyzing trace with hash -318583316, now seen corresponding path program 1 times [2022-04-28 06:07:03,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 06:07:03,914 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [857380529] [2022-04-28 06:07:03,914 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 06:07:03,914 INFO L85 PathProgramCache]: Analyzing trace with hash -318583316, now seen corresponding path program 2 times [2022-04-28 06:07:03,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 06:07:03,915 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262177922] [2022-04-28 06:07:03,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 06:07:03,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 06:07:03,932 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 06:07:03,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1722760902] [2022-04-28 06:07:03,932 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 06:07:03,932 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 06:07:03,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 06:07:03,934 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 06:07:03,935 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 06:07:03,990 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-28 06:07:03,990 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 06:07:03,992 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-28 06:07:04,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 06:07:04,008 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 06:07:04,123 INFO L272 TraceCheckUtils]: 0: Hoare triple {181#true} call ULTIMATE.init(); {181#true} is VALID [2022-04-28 06:07:04,127 INFO L290 TraceCheckUtils]: 1: Hoare triple {181#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {189#(<= ~counter~0 0)} is VALID [2022-04-28 06:07:04,127 INFO L290 TraceCheckUtils]: 2: Hoare triple {189#(<= ~counter~0 0)} assume true; {189#(<= ~counter~0 0)} is VALID [2022-04-28 06:07:04,128 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {189#(<= ~counter~0 0)} {181#true} #54#return; {189#(<= ~counter~0 0)} is VALID [2022-04-28 06:07:04,128 INFO L272 TraceCheckUtils]: 4: Hoare triple {189#(<= ~counter~0 0)} call #t~ret7 := main(); {189#(<= ~counter~0 0)} is VALID [2022-04-28 06:07:04,130 INFO L290 TraceCheckUtils]: 5: Hoare triple {189#(<= ~counter~0 0)} havoc ~z~0;havoc ~k~0;havoc ~x~0;havoc ~y~0;havoc ~c~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~z~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~k~0 := #t~nondet5;havoc #t~nondet5;~x~0 := 1;~y~0 := 1;~c~0 := 1; {189#(<= ~counter~0 0)} is VALID [2022-04-28 06:07:04,131 INFO L290 TraceCheckUtils]: 6: Hoare triple {189#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {205#(<= |main_#t~post6| 0)} is VALID [2022-04-28 06:07:04,131 INFO L290 TraceCheckUtils]: 7: Hoare triple {205#(<= |main_#t~post6| 0)} assume !(#t~post6 < 10);havoc #t~post6; {182#false} is VALID [2022-04-28 06:07:04,131 INFO L272 TraceCheckUtils]: 8: Hoare triple {182#false} call __VERIFIER_assert((if 0 == 1 + ~x~0 * ~z~0 - ~x~0 - ~z~0 * ~y~0 then 1 else 0)); {182#false} is VALID [2022-04-28 06:07:04,132 INFO L290 TraceCheckUtils]: 9: Hoare triple {182#false} ~cond := #in~cond; {182#false} is VALID [2022-04-28 06:07:04,132 INFO L290 TraceCheckUtils]: 10: Hoare triple {182#false} assume 0 == ~cond; {182#false} is VALID [2022-04-28 06:07:04,132 INFO L290 TraceCheckUtils]: 11: Hoare triple {182#false} assume !false; {182#false} is VALID [2022-04-28 06:07:04,132 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 06:07:04,132 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 06:07:04,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 06:07:04,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262177922] [2022-04-28 06:07:04,133 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 06:07:04,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1722760902] [2022-04-28 06:07:04,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1722760902] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 06:07:04,133 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 06:07:04,133 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 06:07:04,134 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 06:07:04,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [857380529] [2022-04-28 06:07:04,134 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [857380529] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 06:07:04,134 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 06:07:04,134 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 06:07:04,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818754903] [2022-04-28 06:07:04,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 06:07:04,135 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-28 06:07:04,135 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 06:07:04,137 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 06:07:04,148 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:07:04,149 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 06:07:04,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 06:07:04,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 06:07:04,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 06:07:04,151 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 06:07:04,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:07:04,197 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2022-04-28 06:07:04,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 06:07:04,197 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-28 06:07:04,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 06:07:04,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 06:07:04,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 28 transitions. [2022-04-28 06:07:04,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 06:07:04,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 28 transitions. [2022-04-28 06:07:04,205 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 28 transitions. [2022-04-28 06:07:04,226 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 06:07:04,228 INFO L225 Difference]: With dead ends: 26 [2022-04-28 06:07:04,228 INFO L226 Difference]: Without dead ends: 19 [2022-04-28 06:07:04,228 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 06:07:04,229 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 0 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 06:07:04,229 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 45 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 06:07:04,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-04-28 06:07:04,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-04-28 06:07:04,239 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 06:07:04,240 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand has 19 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 06:07:04,240 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand has 19 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 06:07:04,241 INFO L87 Difference]: Start difference. First operand 19 states. Second operand has 19 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 06:07:04,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:07:04,242 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2022-04-28 06:07:04,242 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-04-28 06:07:04,242 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:07:04,242 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:07:04,243 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 19 states. [2022-04-28 06:07:04,243 INFO L87 Difference]: Start difference. First operand has 19 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 19 states. [2022-04-28 06:07:04,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:07:04,244 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2022-04-28 06:07:04,244 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-04-28 06:07:04,244 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:07:04,244 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:07:04,244 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 06:07:04,244 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 06:07:04,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 06:07:04,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2022-04-28 06:07:04,246 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 12 [2022-04-28 06:07:04,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 06:07:04,246 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2022-04-28 06:07:04,246 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 06:07:04,246 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 21 transitions. [2022-04-28 06:07:04,266 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:07:04,266 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-04-28 06:07:04,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-28 06:07:04,267 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 06:07:04,267 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 06:07:04,285 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-28 06:07:04,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 06:07:04,468 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 06:07:04,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 06:07:04,468 INFO L85 PathProgramCache]: Analyzing trace with hash -316795856, now seen corresponding path program 1 times [2022-04-28 06:07:04,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 06:07:04,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [107942333] [2022-04-28 06:07:04,469 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 06:07:04,469 INFO L85 PathProgramCache]: Analyzing trace with hash -316795856, now seen corresponding path program 2 times [2022-04-28 06:07:04,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 06:07:04,469 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665566433] [2022-04-28 06:07:04,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 06:07:04,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 06:07:04,479 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 06:07:04,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2071872770] [2022-04-28 06:07:04,480 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 06:07:04,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 06:07:04,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 06:07:04,486 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 06:07:04,487 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 06:07:04,525 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-28 06:07:04,525 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 06:07:04,526 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 06:07:04,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 06:07:04,552 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 06:07:04,638 INFO L272 TraceCheckUtils]: 0: Hoare triple {348#true} call ULTIMATE.init(); {348#true} is VALID [2022-04-28 06:07:04,638 INFO L290 TraceCheckUtils]: 1: Hoare triple {348#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {348#true} is VALID [2022-04-28 06:07:04,638 INFO L290 TraceCheckUtils]: 2: Hoare triple {348#true} assume true; {348#true} is VALID [2022-04-28 06:07:04,639 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {348#true} {348#true} #54#return; {348#true} is VALID [2022-04-28 06:07:04,639 INFO L272 TraceCheckUtils]: 4: Hoare triple {348#true} call #t~ret7 := main(); {348#true} is VALID [2022-04-28 06:07:04,639 INFO L290 TraceCheckUtils]: 5: Hoare triple {348#true} havoc ~z~0;havoc ~k~0;havoc ~x~0;havoc ~y~0;havoc ~c~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~z~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~k~0 := #t~nondet5;havoc #t~nondet5;~x~0 := 1;~y~0 := 1;~c~0 := 1; {368#(and (= main_~y~0 1) (= main_~x~0 1))} is VALID [2022-04-28 06:07:04,640 INFO L290 TraceCheckUtils]: 6: Hoare triple {368#(and (= main_~y~0 1) (= main_~x~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {368#(and (= main_~y~0 1) (= main_~x~0 1))} is VALID [2022-04-28 06:07:04,640 INFO L290 TraceCheckUtils]: 7: Hoare triple {368#(and (= main_~y~0 1) (= main_~x~0 1))} assume !!(#t~post6 < 10);havoc #t~post6; {368#(and (= main_~y~0 1) (= main_~x~0 1))} is VALID [2022-04-28 06:07:04,641 INFO L272 TraceCheckUtils]: 8: Hoare triple {368#(and (= main_~y~0 1) (= main_~x~0 1))} call __VERIFIER_assert((if 0 == 1 + ~x~0 * ~z~0 - ~x~0 - ~z~0 * ~y~0 then 1 else 0)); {378#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 06:07:04,642 INFO L290 TraceCheckUtils]: 9: Hoare triple {378#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {382#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 06:07:04,642 INFO L290 TraceCheckUtils]: 10: Hoare triple {382#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {349#false} is VALID [2022-04-28 06:07:04,642 INFO L290 TraceCheckUtils]: 11: Hoare triple {349#false} assume !false; {349#false} is VALID [2022-04-28 06:07:04,642 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 06:07:04,642 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 06:07:04,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 06:07:04,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665566433] [2022-04-28 06:07:04,643 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 06:07:04,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2071872770] [2022-04-28 06:07:04,643 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2071872770] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 06:07:04,643 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 06:07:04,643 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 06:07:04,643 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 06:07:04,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [107942333] [2022-04-28 06:07:04,644 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [107942333] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 06:07:04,644 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 06:07:04,644 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 06:07:04,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863603622] [2022-04-28 06:07:04,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 06:07:04,644 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-28 06:07:04,644 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 06:07:04,645 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 06:07:04,653 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:07:04,653 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 06:07:04,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 06:07:04,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 06:07:04,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 06:07:04,654 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 06:07:04,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:07:04,738 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2022-04-28 06:07:04,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 06:07:04,739 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-28 06:07:04,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 06:07:04,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 06:07:04,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 31 transitions. [2022-04-28 06:07:04,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 06:07:04,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 31 transitions. [2022-04-28 06:07:04,741 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 31 transitions. [2022-04-28 06:07:04,766 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 06:07:04,769 INFO L225 Difference]: With dead ends: 28 [2022-04-28 06:07:04,769 INFO L226 Difference]: Without dead ends: 25 [2022-04-28 06:07:04,769 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 06:07:04,779 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 6 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 06:07:04,780 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 57 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 06:07:04,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-28 06:07:04,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-04-28 06:07:04,791 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 06:07:04,791 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand has 25 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 06:07:04,791 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand has 25 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 06:07:04,791 INFO L87 Difference]: Start difference. First operand 25 states. Second operand has 25 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 06:07:04,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:07:04,793 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2022-04-28 06:07:04,793 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2022-04-28 06:07:04,793 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:07:04,793 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:07:04,793 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 25 states. [2022-04-28 06:07:04,793 INFO L87 Difference]: Start difference. First operand has 25 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 25 states. [2022-04-28 06:07:04,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:07:04,794 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2022-04-28 06:07:04,794 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2022-04-28 06:07:04,795 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:07:04,795 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:07:04,795 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 06:07:04,795 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 06:07:04,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 16 states have (on average 1.1875) internal successors, (19), 17 states have internal predecessors, (19), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 06:07:04,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2022-04-28 06:07:04,796 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 12 [2022-04-28 06:07:04,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 06:07:04,796 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2022-04-28 06:07:04,796 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 06:07:04,796 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 27 transitions. [2022-04-28 06:07:04,817 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:07:04,818 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2022-04-28 06:07:04,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-28 06:07:04,818 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 06:07:04,818 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 06:07:04,836 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-28 06:07:05,034 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-28 06:07:05,034 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 06:07:05,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 06:07:05,035 INFO L85 PathProgramCache]: Analyzing trace with hash -2089867248, now seen corresponding path program 1 times [2022-04-28 06:07:05,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 06:07:05,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [254439234] [2022-04-28 06:07:14,771 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 06:07:14,771 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 06:07:14,771 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 06:07:14,771 INFO L85 PathProgramCache]: Analyzing trace with hash -2089867248, now seen corresponding path program 2 times [2022-04-28 06:07:14,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 06:07:14,771 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368777910] [2022-04-28 06:07:14,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 06:07:14,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 06:07:14,796 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 06:07:14,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [20164259] [2022-04-28 06:07:14,797 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 06:07:14,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 06:07:14,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 06:07:14,798 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 06:07:14,799 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 06:07:14,833 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 06:07:14,833 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 06:07:14,834 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 06:07:14,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 06:07:14,841 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 06:07:14,958 INFO L272 TraceCheckUtils]: 0: Hoare triple {546#true} call ULTIMATE.init(); {546#true} is VALID [2022-04-28 06:07:14,959 INFO L290 TraceCheckUtils]: 1: Hoare triple {546#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {554#(<= ~counter~0 0)} is VALID [2022-04-28 06:07:14,960 INFO L290 TraceCheckUtils]: 2: Hoare triple {554#(<= ~counter~0 0)} assume true; {554#(<= ~counter~0 0)} is VALID [2022-04-28 06:07:14,960 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {554#(<= ~counter~0 0)} {546#true} #54#return; {554#(<= ~counter~0 0)} is VALID [2022-04-28 06:07:14,962 INFO L272 TraceCheckUtils]: 4: Hoare triple {554#(<= ~counter~0 0)} call #t~ret7 := main(); {554#(<= ~counter~0 0)} is VALID [2022-04-28 06:07:14,962 INFO L290 TraceCheckUtils]: 5: Hoare triple {554#(<= ~counter~0 0)} havoc ~z~0;havoc ~k~0;havoc ~x~0;havoc ~y~0;havoc ~c~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~z~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~k~0 := #t~nondet5;havoc #t~nondet5;~x~0 := 1;~y~0 := 1;~c~0 := 1; {554#(<= ~counter~0 0)} is VALID [2022-04-28 06:07:14,963 INFO L290 TraceCheckUtils]: 6: Hoare triple {554#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {570#(<= ~counter~0 1)} is VALID [2022-04-28 06:07:14,966 INFO L290 TraceCheckUtils]: 7: Hoare triple {570#(<= ~counter~0 1)} assume !!(#t~post6 < 10);havoc #t~post6; {570#(<= ~counter~0 1)} is VALID [2022-04-28 06:07:14,966 INFO L272 TraceCheckUtils]: 8: Hoare triple {570#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == 1 + ~x~0 * ~z~0 - ~x~0 - ~z~0 * ~y~0 then 1 else 0)); {570#(<= ~counter~0 1)} is VALID [2022-04-28 06:07:14,967 INFO L290 TraceCheckUtils]: 9: Hoare triple {570#(<= ~counter~0 1)} ~cond := #in~cond; {570#(<= ~counter~0 1)} is VALID [2022-04-28 06:07:14,967 INFO L290 TraceCheckUtils]: 10: Hoare triple {570#(<= ~counter~0 1)} assume !(0 == ~cond); {570#(<= ~counter~0 1)} is VALID [2022-04-28 06:07:14,967 INFO L290 TraceCheckUtils]: 11: Hoare triple {570#(<= ~counter~0 1)} assume true; {570#(<= ~counter~0 1)} is VALID [2022-04-28 06:07:14,971 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {570#(<= ~counter~0 1)} {570#(<= ~counter~0 1)} #50#return; {570#(<= ~counter~0 1)} is VALID [2022-04-28 06:07:14,971 INFO L290 TraceCheckUtils]: 13: Hoare triple {570#(<= ~counter~0 1)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~x~0 := 1 + ~x~0 * ~z~0;~y~0 := ~y~0 * ~z~0; {570#(<= ~counter~0 1)} is VALID [2022-04-28 06:07:14,971 INFO L290 TraceCheckUtils]: 14: Hoare triple {570#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {595#(<= |main_#t~post6| 1)} is VALID [2022-04-28 06:07:14,972 INFO L290 TraceCheckUtils]: 15: Hoare triple {595#(<= |main_#t~post6| 1)} assume !(#t~post6 < 10);havoc #t~post6; {547#false} is VALID [2022-04-28 06:07:14,972 INFO L272 TraceCheckUtils]: 16: Hoare triple {547#false} call __VERIFIER_assert((if 0 == 1 + ~x~0 * ~z~0 - ~x~0 - ~z~0 * ~y~0 then 1 else 0)); {547#false} is VALID [2022-04-28 06:07:14,972 INFO L290 TraceCheckUtils]: 17: Hoare triple {547#false} ~cond := #in~cond; {547#false} is VALID [2022-04-28 06:07:14,972 INFO L290 TraceCheckUtils]: 18: Hoare triple {547#false} assume 0 == ~cond; {547#false} is VALID [2022-04-28 06:07:14,972 INFO L290 TraceCheckUtils]: 19: Hoare triple {547#false} assume !false; {547#false} is VALID [2022-04-28 06:07:14,972 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 06:07:14,972 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 06:07:15,100 INFO L290 TraceCheckUtils]: 19: Hoare triple {547#false} assume !false; {547#false} is VALID [2022-04-28 06:07:15,100 INFO L290 TraceCheckUtils]: 18: Hoare triple {547#false} assume 0 == ~cond; {547#false} is VALID [2022-04-28 06:07:15,100 INFO L290 TraceCheckUtils]: 17: Hoare triple {547#false} ~cond := #in~cond; {547#false} is VALID [2022-04-28 06:07:15,101 INFO L272 TraceCheckUtils]: 16: Hoare triple {547#false} call __VERIFIER_assert((if 0 == 1 + ~x~0 * ~z~0 - ~x~0 - ~z~0 * ~y~0 then 1 else 0)); {547#false} is VALID [2022-04-28 06:07:15,101 INFO L290 TraceCheckUtils]: 15: Hoare triple {623#(< |main_#t~post6| 10)} assume !(#t~post6 < 10);havoc #t~post6; {547#false} is VALID [2022-04-28 06:07:15,101 INFO L290 TraceCheckUtils]: 14: Hoare triple {627#(< ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {623#(< |main_#t~post6| 10)} is VALID [2022-04-28 06:07:15,102 INFO L290 TraceCheckUtils]: 13: Hoare triple {627#(< ~counter~0 10)} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~x~0 := 1 + ~x~0 * ~z~0;~y~0 := ~y~0 * ~z~0; {627#(< ~counter~0 10)} is VALID [2022-04-28 06:07:15,102 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {546#true} {627#(< ~counter~0 10)} #50#return; {627#(< ~counter~0 10)} is VALID [2022-04-28 06:07:15,102 INFO L290 TraceCheckUtils]: 11: Hoare triple {546#true} assume true; {546#true} is VALID [2022-04-28 06:07:15,102 INFO L290 TraceCheckUtils]: 10: Hoare triple {546#true} assume !(0 == ~cond); {546#true} is VALID [2022-04-28 06:07:15,103 INFO L290 TraceCheckUtils]: 9: Hoare triple {546#true} ~cond := #in~cond; {546#true} is VALID [2022-04-28 06:07:15,103 INFO L272 TraceCheckUtils]: 8: Hoare triple {627#(< ~counter~0 10)} call __VERIFIER_assert((if 0 == 1 + ~x~0 * ~z~0 - ~x~0 - ~z~0 * ~y~0 then 1 else 0)); {546#true} is VALID [2022-04-28 06:07:15,103 INFO L290 TraceCheckUtils]: 7: Hoare triple {627#(< ~counter~0 10)} assume !!(#t~post6 < 10);havoc #t~post6; {627#(< ~counter~0 10)} is VALID [2022-04-28 06:07:15,104 INFO L290 TraceCheckUtils]: 6: Hoare triple {652#(< ~counter~0 9)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {627#(< ~counter~0 10)} is VALID [2022-04-28 06:07:15,104 INFO L290 TraceCheckUtils]: 5: Hoare triple {652#(< ~counter~0 9)} havoc ~z~0;havoc ~k~0;havoc ~x~0;havoc ~y~0;havoc ~c~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~z~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~k~0 := #t~nondet5;havoc #t~nondet5;~x~0 := 1;~y~0 := 1;~c~0 := 1; {652#(< ~counter~0 9)} is VALID [2022-04-28 06:07:15,104 INFO L272 TraceCheckUtils]: 4: Hoare triple {652#(< ~counter~0 9)} call #t~ret7 := main(); {652#(< ~counter~0 9)} is VALID [2022-04-28 06:07:15,105 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {652#(< ~counter~0 9)} {546#true} #54#return; {652#(< ~counter~0 9)} is VALID [2022-04-28 06:07:15,105 INFO L290 TraceCheckUtils]: 2: Hoare triple {652#(< ~counter~0 9)} assume true; {652#(< ~counter~0 9)} is VALID [2022-04-28 06:07:15,106 INFO L290 TraceCheckUtils]: 1: Hoare triple {546#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {652#(< ~counter~0 9)} is VALID [2022-04-28 06:07:15,106 INFO L272 TraceCheckUtils]: 0: Hoare triple {546#true} call ULTIMATE.init(); {546#true} is VALID [2022-04-28 06:07:15,106 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 06:07:15,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 06:07:15,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368777910] [2022-04-28 06:07:15,106 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 06:07:15,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [20164259] [2022-04-28 06:07:15,106 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [20164259] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 06:07:15,106 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 06:07:15,106 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-04-28 06:07:15,107 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 06:07:15,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [254439234] [2022-04-28 06:07:15,107 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [254439234] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 06:07:15,107 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 06:07:15,107 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 06:07:15,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025746227] [2022-04-28 06:07:15,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 06:07:15,107 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2022-04-28 06:07:15,107 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 06:07:15,108 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 06:07:15,123 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:07:15,123 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 06:07:15,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 06:07:15,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 06:07:15,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-04-28 06:07:15,124 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 06:07:15,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:07:15,192 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2022-04-28 06:07:15,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 06:07:15,192 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2022-04-28 06:07:15,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 06:07:15,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 06:07:15,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 36 transitions. [2022-04-28 06:07:15,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 06:07:15,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 36 transitions. [2022-04-28 06:07:15,195 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 36 transitions. [2022-04-28 06:07:15,220 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:07:15,221 INFO L225 Difference]: With dead ends: 34 [2022-04-28 06:07:15,221 INFO L226 Difference]: Without dead ends: 27 [2022-04-28 06:07:15,221 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-04-28 06:07:15,222 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 2 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 06:07:15,222 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 51 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 06:07:15,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-28 06:07:15,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-04-28 06:07:15,234 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 06:07:15,235 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 27 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 06:07:15,235 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 27 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 06:07:15,243 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 27 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 06:07:15,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:07:15,247 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2022-04-28 06:07:15,247 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2022-04-28 06:07:15,250 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:07:15,250 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:07:15,250 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 27 states. [2022-04-28 06:07:15,251 INFO L87 Difference]: Start difference. First operand has 27 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 27 states. [2022-04-28 06:07:15,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:07:15,255 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2022-04-28 06:07:15,255 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2022-04-28 06:07:15,255 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:07:15,256 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:07:15,256 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 06:07:15,256 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 06:07:15,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 06:07:15,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2022-04-28 06:07:15,257 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 20 [2022-04-28 06:07:15,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 06:07:15,257 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2022-04-28 06:07:15,258 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 06:07:15,258 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 29 transitions. [2022-04-28 06:07:15,277 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:07:15,277 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2022-04-28 06:07:15,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-28 06:07:15,278 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 06:07:15,278 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 06:07:15,295 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-04-28 06:07:15,489 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 06:07:15,489 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 06:07:15,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 06:07:15,490 INFO L85 PathProgramCache]: Analyzing trace with hash -2088079788, now seen corresponding path program 1 times [2022-04-28 06:07:15,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 06:07:15,490 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [29701796] [2022-04-28 06:07:23,981 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 06:07:23,981 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 06:07:23,981 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 06:07:23,981 INFO L85 PathProgramCache]: Analyzing trace with hash -2088079788, now seen corresponding path program 2 times [2022-04-28 06:07:23,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 06:07:23,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001613723] [2022-04-28 06:07:23,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 06:07:23,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 06:07:23,991 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 06:07:23,991 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1955475808] [2022-04-28 06:07:23,991 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 06:07:23,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 06:07:23,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 06:07:23,992 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 06:07:23,993 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 06:07:24,026 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 06:07:24,026 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 06:07:24,027 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-28 06:07:24,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 06:07:24,034 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 06:07:24,198 INFO L272 TraceCheckUtils]: 0: Hoare triple {851#true} call ULTIMATE.init(); {851#true} is VALID [2022-04-28 06:07:24,199 INFO L290 TraceCheckUtils]: 1: Hoare triple {851#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {851#true} is VALID [2022-04-28 06:07:24,199 INFO L290 TraceCheckUtils]: 2: Hoare triple {851#true} assume true; {851#true} is VALID [2022-04-28 06:07:24,199 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {851#true} {851#true} #54#return; {851#true} is VALID [2022-04-28 06:07:24,199 INFO L272 TraceCheckUtils]: 4: Hoare triple {851#true} call #t~ret7 := main(); {851#true} is VALID [2022-04-28 06:07:24,200 INFO L290 TraceCheckUtils]: 5: Hoare triple {851#true} havoc ~z~0;havoc ~k~0;havoc ~x~0;havoc ~y~0;havoc ~c~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~z~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~k~0 := #t~nondet5;havoc #t~nondet5;~x~0 := 1;~y~0 := 1;~c~0 := 1; {871#(and (= main_~y~0 1) (= main_~x~0 1))} is VALID [2022-04-28 06:07:24,201 INFO L290 TraceCheckUtils]: 6: Hoare triple {871#(and (= main_~y~0 1) (= main_~x~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {871#(and (= main_~y~0 1) (= main_~x~0 1))} is VALID [2022-04-28 06:07:24,201 INFO L290 TraceCheckUtils]: 7: Hoare triple {871#(and (= main_~y~0 1) (= main_~x~0 1))} assume !!(#t~post6 < 10);havoc #t~post6; {871#(and (= main_~y~0 1) (= main_~x~0 1))} is VALID [2022-04-28 06:07:24,201 INFO L272 TraceCheckUtils]: 8: Hoare triple {871#(and (= main_~y~0 1) (= main_~x~0 1))} call __VERIFIER_assert((if 0 == 1 + ~x~0 * ~z~0 - ~x~0 - ~z~0 * ~y~0 then 1 else 0)); {851#true} is VALID [2022-04-28 06:07:24,202 INFO L290 TraceCheckUtils]: 9: Hoare triple {851#true} ~cond := #in~cond; {884#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 06:07:24,202 INFO L290 TraceCheckUtils]: 10: Hoare triple {884#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {888#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 06:07:24,202 INFO L290 TraceCheckUtils]: 11: Hoare triple {888#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {888#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 06:07:24,203 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {888#(not (= |__VERIFIER_assert_#in~cond| 0))} {871#(and (= main_~y~0 1) (= main_~x~0 1))} #50#return; {871#(and (= main_~y~0 1) (= main_~x~0 1))} is VALID [2022-04-28 06:07:24,203 INFO L290 TraceCheckUtils]: 13: Hoare triple {871#(and (= main_~y~0 1) (= main_~x~0 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~x~0 := 1 + ~x~0 * ~z~0;~y~0 := ~y~0 * ~z~0; {898#(and (= main_~z~0 main_~y~0) (= main_~x~0 (+ main_~z~0 1)))} is VALID [2022-04-28 06:07:24,204 INFO L290 TraceCheckUtils]: 14: Hoare triple {898#(and (= main_~z~0 main_~y~0) (= main_~x~0 (+ main_~z~0 1)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {898#(and (= main_~z~0 main_~y~0) (= main_~x~0 (+ main_~z~0 1)))} is VALID [2022-04-28 06:07:24,204 INFO L290 TraceCheckUtils]: 15: Hoare triple {898#(and (= main_~z~0 main_~y~0) (= main_~x~0 (+ main_~z~0 1)))} assume !!(#t~post6 < 10);havoc #t~post6; {898#(and (= main_~z~0 main_~y~0) (= main_~x~0 (+ main_~z~0 1)))} is VALID [2022-04-28 06:07:24,206 INFO L272 TraceCheckUtils]: 16: Hoare triple {898#(and (= main_~z~0 main_~y~0) (= main_~x~0 (+ main_~z~0 1)))} call __VERIFIER_assert((if 0 == 1 + ~x~0 * ~z~0 - ~x~0 - ~z~0 * ~y~0 then 1 else 0)); {908#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 06:07:24,206 INFO L290 TraceCheckUtils]: 17: Hoare triple {908#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {912#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 06:07:24,206 INFO L290 TraceCheckUtils]: 18: Hoare triple {912#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {852#false} is VALID [2022-04-28 06:07:24,206 INFO L290 TraceCheckUtils]: 19: Hoare triple {852#false} assume !false; {852#false} is VALID [2022-04-28 06:07:24,207 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 06:07:24,207 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 06:07:37,108 INFO L290 TraceCheckUtils]: 19: Hoare triple {852#false} assume !false; {852#false} is VALID [2022-04-28 06:07:37,108 INFO L290 TraceCheckUtils]: 18: Hoare triple {912#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {852#false} is VALID [2022-04-28 06:07:37,109 INFO L290 TraceCheckUtils]: 17: Hoare triple {908#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {912#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 06:07:37,109 INFO L272 TraceCheckUtils]: 16: Hoare triple {928#(= (+ main_~x~0 (* main_~z~0 main_~y~0)) (+ (* main_~z~0 main_~x~0) 1))} call __VERIFIER_assert((if 0 == 1 + ~x~0 * ~z~0 - ~x~0 - ~z~0 * ~y~0 then 1 else 0)); {908#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 06:07:37,110 INFO L290 TraceCheckUtils]: 15: Hoare triple {928#(= (+ main_~x~0 (* main_~z~0 main_~y~0)) (+ (* main_~z~0 main_~x~0) 1))} assume !!(#t~post6 < 10);havoc #t~post6; {928#(= (+ main_~x~0 (* main_~z~0 main_~y~0)) (+ (* main_~z~0 main_~x~0) 1))} is VALID [2022-04-28 06:07:37,110 INFO L290 TraceCheckUtils]: 14: Hoare triple {928#(= (+ main_~x~0 (* main_~z~0 main_~y~0)) (+ (* main_~z~0 main_~x~0) 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {928#(= (+ main_~x~0 (* main_~z~0 main_~y~0)) (+ (* main_~z~0 main_~x~0) 1))} is VALID [2022-04-28 06:07:37,113 INFO L290 TraceCheckUtils]: 13: Hoare triple {938#(= (+ (* main_~z~0 (+ (* main_~z~0 main_~x~0) 1)) 1) (+ (* main_~z~0 main_~x~0) (* main_~z~0 (* main_~z~0 main_~y~0)) 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~x~0 := 1 + ~x~0 * ~z~0;~y~0 := ~y~0 * ~z~0; {928#(= (+ main_~x~0 (* main_~z~0 main_~y~0)) (+ (* main_~z~0 main_~x~0) 1))} is VALID [2022-04-28 06:07:37,115 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {888#(not (= |__VERIFIER_assert_#in~cond| 0))} {851#true} #50#return; {938#(= (+ (* main_~z~0 (+ (* main_~z~0 main_~x~0) 1)) 1) (+ (* main_~z~0 main_~x~0) (* main_~z~0 (* main_~z~0 main_~y~0)) 1))} is VALID [2022-04-28 06:07:37,115 INFO L290 TraceCheckUtils]: 11: Hoare triple {888#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {888#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 06:07:37,116 INFO L290 TraceCheckUtils]: 10: Hoare triple {951#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {888#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 06:07:37,116 INFO L290 TraceCheckUtils]: 9: Hoare triple {851#true} ~cond := #in~cond; {951#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 06:07:37,116 INFO L272 TraceCheckUtils]: 8: Hoare triple {851#true} call __VERIFIER_assert((if 0 == 1 + ~x~0 * ~z~0 - ~x~0 - ~z~0 * ~y~0 then 1 else 0)); {851#true} is VALID [2022-04-28 06:07:37,116 INFO L290 TraceCheckUtils]: 7: Hoare triple {851#true} assume !!(#t~post6 < 10);havoc #t~post6; {851#true} is VALID [2022-04-28 06:07:37,116 INFO L290 TraceCheckUtils]: 6: Hoare triple {851#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {851#true} is VALID [2022-04-28 06:07:37,116 INFO L290 TraceCheckUtils]: 5: Hoare triple {851#true} havoc ~z~0;havoc ~k~0;havoc ~x~0;havoc ~y~0;havoc ~c~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~z~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~k~0 := #t~nondet5;havoc #t~nondet5;~x~0 := 1;~y~0 := 1;~c~0 := 1; {851#true} is VALID [2022-04-28 06:07:37,116 INFO L272 TraceCheckUtils]: 4: Hoare triple {851#true} call #t~ret7 := main(); {851#true} is VALID [2022-04-28 06:07:37,117 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {851#true} {851#true} #54#return; {851#true} is VALID [2022-04-28 06:07:37,117 INFO L290 TraceCheckUtils]: 2: Hoare triple {851#true} assume true; {851#true} is VALID [2022-04-28 06:07:37,117 INFO L290 TraceCheckUtils]: 1: Hoare triple {851#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {851#true} is VALID [2022-04-28 06:07:37,117 INFO L272 TraceCheckUtils]: 0: Hoare triple {851#true} call ULTIMATE.init(); {851#true} is VALID [2022-04-28 06:07:37,117 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 06:07:37,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 06:07:37,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001613723] [2022-04-28 06:07:37,117 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 06:07:37,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1955475808] [2022-04-28 06:07:37,117 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1955475808] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 06:07:37,117 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 06:07:37,118 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2022-04-28 06:07:37,118 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 06:07:37,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [29701796] [2022-04-28 06:07:37,118 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [29701796] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 06:07:37,118 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 06:07:37,118 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 06:07:37,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828726291] [2022-04-28 06:07:37,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 06:07:37,118 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2022-04-28 06:07:37,118 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 06:07:37,119 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 06:07:37,136 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:07:37,136 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 06:07:37,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 06:07:37,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 06:07:37,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-04-28 06:07:37,137 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 06:07:37,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:07:37,371 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2022-04-28 06:07:37,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 06:07:37,372 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2022-04-28 06:07:37,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 06:07:37,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 06:07:37,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 36 transitions. [2022-04-28 06:07:37,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 06:07:37,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 36 transitions. [2022-04-28 06:07:37,374 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 36 transitions. [2022-04-28 06:07:37,408 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:07:37,409 INFO L225 Difference]: With dead ends: 36 [2022-04-28 06:07:37,409 INFO L226 Difference]: Without dead ends: 33 [2022-04-28 06:07:37,409 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2022-04-28 06:07:37,410 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 12 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 92 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.1s IncrementalHoareTripleChecker+Time [2022-04-28 06:07:37,410 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 92 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 06:07:37,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-28 06:07:37,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-04-28 06:07:37,425 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 06:07:37,425 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 33 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 06:07:37,425 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 33 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 06:07:37,426 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 33 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 06:07:37,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:07:37,427 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2022-04-28 06:07:37,427 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2022-04-28 06:07:37,427 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:07:37,427 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:07:37,428 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 33 states. [2022-04-28 06:07:37,429 INFO L87 Difference]: Start difference. First operand has 33 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 33 states. [2022-04-28 06:07:37,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:07:37,432 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2022-04-28 06:07:37,432 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2022-04-28 06:07:37,432 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:07:37,432 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:07:37,433 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 06:07:37,433 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 06:07:37,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 06:07:37,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2022-04-28 06:07:37,434 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 20 [2022-04-28 06:07:37,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 06:07:37,434 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2022-04-28 06:07:37,435 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 7 states have internal predecessors, (14), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 06:07:37,435 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 35 transitions. [2022-04-28 06:07:37,466 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:07:37,466 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2022-04-28 06:07:37,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-28 06:07:37,467 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 06:07:37,467 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 06:07:37,485 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 06:07:37,674 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 06:07:37,675 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 06:07:37,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 06:07:37,675 INFO L85 PathProgramCache]: Analyzing trace with hash -696181196, now seen corresponding path program 3 times [2022-04-28 06:07:37,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 06:07:37,675 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2117968842] [2022-04-28 06:07:50,019 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 4 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 06:07:50,019 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONLINEAR_UPDATE [2022-04-28 06:07:50,020 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 06:07:50,020 INFO L85 PathProgramCache]: Analyzing trace with hash -696181196, now seen corresponding path program 4 times [2022-04-28 06:07:50,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 06:07:50,020 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832158913] [2022-04-28 06:07:50,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 06:07:50,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 06:07:50,029 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 06:07:50,029 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1292370655] [2022-04-28 06:07:50,029 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 06:07:50,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 06:07:50,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 06:07:50,030 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 06:07:50,031 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-28 06:07:50,302 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 06:07:50,303 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 06:07:50,304 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-28 06:07:50,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 06:07:50,320 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 06:07:57,103 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 06:08:42,989 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 06:08:46,676 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 06:08:49,644 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 06:08:50,048 INFO L272 TraceCheckUtils]: 0: Hoare triple {1189#true} call ULTIMATE.init(); {1189#true} is VALID [2022-04-28 06:08:50,049 INFO L290 TraceCheckUtils]: 1: Hoare triple {1189#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1189#true} is VALID [2022-04-28 06:08:50,049 INFO L290 TraceCheckUtils]: 2: Hoare triple {1189#true} assume true; {1189#true} is VALID [2022-04-28 06:08:50,049 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1189#true} {1189#true} #54#return; {1189#true} is VALID [2022-04-28 06:08:50,049 INFO L272 TraceCheckUtils]: 4: Hoare triple {1189#true} call #t~ret7 := main(); {1189#true} is VALID [2022-04-28 06:08:50,049 INFO L290 TraceCheckUtils]: 5: Hoare triple {1189#true} havoc ~z~0;havoc ~k~0;havoc ~x~0;havoc ~y~0;havoc ~c~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~z~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~k~0 := #t~nondet5;havoc #t~nondet5;~x~0 := 1;~y~0 := 1;~c~0 := 1; {1189#true} is VALID [2022-04-28 06:08:50,049 INFO L290 TraceCheckUtils]: 6: Hoare triple {1189#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1189#true} is VALID [2022-04-28 06:08:50,049 INFO L290 TraceCheckUtils]: 7: Hoare triple {1189#true} assume !!(#t~post6 < 10);havoc #t~post6; {1189#true} is VALID [2022-04-28 06:08:50,049 INFO L272 TraceCheckUtils]: 8: Hoare triple {1189#true} call __VERIFIER_assert((if 0 == 1 + ~x~0 * ~z~0 - ~x~0 - ~z~0 * ~y~0 then 1 else 0)); {1189#true} is VALID [2022-04-28 06:08:50,050 INFO L290 TraceCheckUtils]: 9: Hoare triple {1189#true} ~cond := #in~cond; {1221#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 06:08:50,050 INFO L290 TraceCheckUtils]: 10: Hoare triple {1221#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {1225#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 06:08:50,050 INFO L290 TraceCheckUtils]: 11: Hoare triple {1225#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1225#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 06:08:50,051 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1225#(not (= |__VERIFIER_assert_#in~cond| 0))} {1189#true} #50#return; {1232#(= (+ main_~x~0 (* main_~z~0 main_~y~0)) (+ (* main_~z~0 main_~x~0) 1))} is VALID [2022-04-28 06:08:52,053 WARN L290 TraceCheckUtils]: 13: Hoare triple {1232#(= (+ main_~x~0 (* main_~z~0 main_~y~0)) (+ (* main_~z~0 main_~x~0) 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~x~0 := 1 + ~x~0 * ~z~0;~y~0 := ~y~0 * ~z~0; {1236#(or (and (= main_~z~0 0) (= main_~y~0 0) (exists ((v_main_~y~0_28 Int) (v_main_~x~0_28 Int)) (and (<= (+ (* v_main_~x~0_28 main_~z~0) 1) main_~x~0) (= (+ (* v_main_~x~0_28 main_~z~0) 1) (+ (* v_main_~y~0_28 main_~z~0) v_main_~x~0_28))))) (and (= (mod main_~y~0 main_~z~0) 0) (exists ((v_main_~x~0_28 Int)) (and (= (+ (* v_main_~x~0_28 main_~z~0) 1) (+ v_main_~x~0_28 (* main_~z~0 (div main_~y~0 main_~z~0)))) (<= (+ (* v_main_~x~0_28 main_~z~0) 1) main_~x~0))) (not (= main_~z~0 0))))} is UNKNOWN [2022-04-28 06:08:52,055 INFO L290 TraceCheckUtils]: 14: Hoare triple {1236#(or (and (= main_~z~0 0) (= main_~y~0 0) (exists ((v_main_~y~0_28 Int) (v_main_~x~0_28 Int)) (and (<= (+ (* v_main_~x~0_28 main_~z~0) 1) main_~x~0) (= (+ (* v_main_~x~0_28 main_~z~0) 1) (+ (* v_main_~y~0_28 main_~z~0) v_main_~x~0_28))))) (and (= (mod main_~y~0 main_~z~0) 0) (exists ((v_main_~x~0_28 Int)) (and (= (+ (* v_main_~x~0_28 main_~z~0) 1) (+ v_main_~x~0_28 (* main_~z~0 (div main_~y~0 main_~z~0)))) (<= (+ (* v_main_~x~0_28 main_~z~0) 1) main_~x~0))) (not (= main_~z~0 0))))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1236#(or (and (= main_~z~0 0) (= main_~y~0 0) (exists ((v_main_~y~0_28 Int) (v_main_~x~0_28 Int)) (and (<= (+ (* v_main_~x~0_28 main_~z~0) 1) main_~x~0) (= (+ (* v_main_~x~0_28 main_~z~0) 1) (+ (* v_main_~y~0_28 main_~z~0) v_main_~x~0_28))))) (and (= (mod main_~y~0 main_~z~0) 0) (exists ((v_main_~x~0_28 Int)) (and (= (+ (* v_main_~x~0_28 main_~z~0) 1) (+ v_main_~x~0_28 (* main_~z~0 (div main_~y~0 main_~z~0)))) (<= (+ (* v_main_~x~0_28 main_~z~0) 1) main_~x~0))) (not (= main_~z~0 0))))} is VALID [2022-04-28 06:08:52,056 INFO L290 TraceCheckUtils]: 15: Hoare triple {1236#(or (and (= main_~z~0 0) (= main_~y~0 0) (exists ((v_main_~y~0_28 Int) (v_main_~x~0_28 Int)) (and (<= (+ (* v_main_~x~0_28 main_~z~0) 1) main_~x~0) (= (+ (* v_main_~x~0_28 main_~z~0) 1) (+ (* v_main_~y~0_28 main_~z~0) v_main_~x~0_28))))) (and (= (mod main_~y~0 main_~z~0) 0) (exists ((v_main_~x~0_28 Int)) (and (= (+ (* v_main_~x~0_28 main_~z~0) 1) (+ v_main_~x~0_28 (* main_~z~0 (div main_~y~0 main_~z~0)))) (<= (+ (* v_main_~x~0_28 main_~z~0) 1) main_~x~0))) (not (= main_~z~0 0))))} assume !!(#t~post6 < 10);havoc #t~post6; {1236#(or (and (= main_~z~0 0) (= main_~y~0 0) (exists ((v_main_~y~0_28 Int) (v_main_~x~0_28 Int)) (and (<= (+ (* v_main_~x~0_28 main_~z~0) 1) main_~x~0) (= (+ (* v_main_~x~0_28 main_~z~0) 1) (+ (* v_main_~y~0_28 main_~z~0) v_main_~x~0_28))))) (and (= (mod main_~y~0 main_~z~0) 0) (exists ((v_main_~x~0_28 Int)) (and (= (+ (* v_main_~x~0_28 main_~z~0) 1) (+ v_main_~x~0_28 (* main_~z~0 (div main_~y~0 main_~z~0)))) (<= (+ (* v_main_~x~0_28 main_~z~0) 1) main_~x~0))) (not (= main_~z~0 0))))} is VALID [2022-04-28 06:08:52,056 INFO L272 TraceCheckUtils]: 16: Hoare triple {1236#(or (and (= main_~z~0 0) (= main_~y~0 0) (exists ((v_main_~y~0_28 Int) (v_main_~x~0_28 Int)) (and (<= (+ (* v_main_~x~0_28 main_~z~0) 1) main_~x~0) (= (+ (* v_main_~x~0_28 main_~z~0) 1) (+ (* v_main_~y~0_28 main_~z~0) v_main_~x~0_28))))) (and (= (mod main_~y~0 main_~z~0) 0) (exists ((v_main_~x~0_28 Int)) (and (= (+ (* v_main_~x~0_28 main_~z~0) 1) (+ v_main_~x~0_28 (* main_~z~0 (div main_~y~0 main_~z~0)))) (<= (+ (* v_main_~x~0_28 main_~z~0) 1) main_~x~0))) (not (= main_~z~0 0))))} call __VERIFIER_assert((if 0 == 1 + ~x~0 * ~z~0 - ~x~0 - ~z~0 * ~y~0 then 1 else 0)); {1189#true} is VALID [2022-04-28 06:08:52,056 INFO L290 TraceCheckUtils]: 17: Hoare triple {1189#true} ~cond := #in~cond; {1221#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 06:08:52,057 INFO L290 TraceCheckUtils]: 18: Hoare triple {1221#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {1225#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 06:08:52,057 INFO L290 TraceCheckUtils]: 19: Hoare triple {1225#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1225#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 06:08:52,058 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {1225#(not (= |__VERIFIER_assert_#in~cond| 0))} {1236#(or (and (= main_~z~0 0) (= main_~y~0 0) (exists ((v_main_~y~0_28 Int) (v_main_~x~0_28 Int)) (and (<= (+ (* v_main_~x~0_28 main_~z~0) 1) main_~x~0) (= (+ (* v_main_~x~0_28 main_~z~0) 1) (+ (* v_main_~y~0_28 main_~z~0) v_main_~x~0_28))))) (and (= (mod main_~y~0 main_~z~0) 0) (exists ((v_main_~x~0_28 Int)) (and (= (+ (* v_main_~x~0_28 main_~z~0) 1) (+ v_main_~x~0_28 (* main_~z~0 (div main_~y~0 main_~z~0)))) (<= (+ (* v_main_~x~0_28 main_~z~0) 1) main_~x~0))) (not (= main_~z~0 0))))} #50#return; {1258#(and (or (and (= (mod main_~y~0 main_~z~0) 0) (not (= main_~z~0 0))) (= main_~y~0 0)) (= (+ main_~x~0 (* main_~z~0 main_~y~0)) (+ (* main_~z~0 main_~x~0) 1)))} is VALID [2022-04-28 06:08:54,060 WARN L290 TraceCheckUtils]: 21: Hoare triple {1258#(and (or (and (= (mod main_~y~0 main_~z~0) 0) (not (= main_~z~0 0))) (= main_~y~0 0)) (= (+ main_~x~0 (* main_~z~0 main_~y~0)) (+ (* main_~z~0 main_~x~0) 1)))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~x~0 := 1 + ~x~0 * ~z~0;~y~0 := ~y~0 * ~z~0; {1262#(or (and (= main_~z~0 0) (= main_~x~0 1) (= main_~y~0 0)) (and (= (mod (+ (* main_~z~0 (div (+ (- 1) main_~x~0) main_~z~0)) (* (- 1) (div (+ (- 1) main_~x~0) main_~z~0)) 1) main_~z~0) 0) (= (mod (+ (- 1) main_~x~0) main_~z~0) 0) (not (= main_~z~0 0)) (= main_~y~0 (* main_~z~0 (div (+ (* main_~z~0 (div (+ (- 1) main_~x~0) main_~z~0)) (* (- 1) (div (+ (- 1) main_~x~0) main_~z~0)) 1) main_~z~0))) (= (mod (div (+ (* main_~z~0 (div (+ (- 1) main_~x~0) main_~z~0)) (* (- 1) (div (+ (- 1) main_~x~0) main_~z~0)) 1) main_~z~0) main_~z~0) 0)))} is UNKNOWN [2022-04-28 06:08:54,061 INFO L290 TraceCheckUtils]: 22: Hoare triple {1262#(or (and (= main_~z~0 0) (= main_~x~0 1) (= main_~y~0 0)) (and (= (mod (+ (* main_~z~0 (div (+ (- 1) main_~x~0) main_~z~0)) (* (- 1) (div (+ (- 1) main_~x~0) main_~z~0)) 1) main_~z~0) 0) (= (mod (+ (- 1) main_~x~0) main_~z~0) 0) (not (= main_~z~0 0)) (= main_~y~0 (* main_~z~0 (div (+ (* main_~z~0 (div (+ (- 1) main_~x~0) main_~z~0)) (* (- 1) (div (+ (- 1) main_~x~0) main_~z~0)) 1) main_~z~0))) (= (mod (div (+ (* main_~z~0 (div (+ (- 1) main_~x~0) main_~z~0)) (* (- 1) (div (+ (- 1) main_~x~0) main_~z~0)) 1) main_~z~0) main_~z~0) 0)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1262#(or (and (= main_~z~0 0) (= main_~x~0 1) (= main_~y~0 0)) (and (= (mod (+ (* main_~z~0 (div (+ (- 1) main_~x~0) main_~z~0)) (* (- 1) (div (+ (- 1) main_~x~0) main_~z~0)) 1) main_~z~0) 0) (= (mod (+ (- 1) main_~x~0) main_~z~0) 0) (not (= main_~z~0 0)) (= main_~y~0 (* main_~z~0 (div (+ (* main_~z~0 (div (+ (- 1) main_~x~0) main_~z~0)) (* (- 1) (div (+ (- 1) main_~x~0) main_~z~0)) 1) main_~z~0))) (= (mod (div (+ (* main_~z~0 (div (+ (- 1) main_~x~0) main_~z~0)) (* (- 1) (div (+ (- 1) main_~x~0) main_~z~0)) 1) main_~z~0) main_~z~0) 0)))} is VALID [2022-04-28 06:08:54,062 INFO L290 TraceCheckUtils]: 23: Hoare triple {1262#(or (and (= main_~z~0 0) (= main_~x~0 1) (= main_~y~0 0)) (and (= (mod (+ (* main_~z~0 (div (+ (- 1) main_~x~0) main_~z~0)) (* (- 1) (div (+ (- 1) main_~x~0) main_~z~0)) 1) main_~z~0) 0) (= (mod (+ (- 1) main_~x~0) main_~z~0) 0) (not (= main_~z~0 0)) (= main_~y~0 (* main_~z~0 (div (+ (* main_~z~0 (div (+ (- 1) main_~x~0) main_~z~0)) (* (- 1) (div (+ (- 1) main_~x~0) main_~z~0)) 1) main_~z~0))) (= (mod (div (+ (* main_~z~0 (div (+ (- 1) main_~x~0) main_~z~0)) (* (- 1) (div (+ (- 1) main_~x~0) main_~z~0)) 1) main_~z~0) main_~z~0) 0)))} assume !(#t~post6 < 10);havoc #t~post6; {1262#(or (and (= main_~z~0 0) (= main_~x~0 1) (= main_~y~0 0)) (and (= (mod (+ (* main_~z~0 (div (+ (- 1) main_~x~0) main_~z~0)) (* (- 1) (div (+ (- 1) main_~x~0) main_~z~0)) 1) main_~z~0) 0) (= (mod (+ (- 1) main_~x~0) main_~z~0) 0) (not (= main_~z~0 0)) (= main_~y~0 (* main_~z~0 (div (+ (* main_~z~0 (div (+ (- 1) main_~x~0) main_~z~0)) (* (- 1) (div (+ (- 1) main_~x~0) main_~z~0)) 1) main_~z~0))) (= (mod (div (+ (* main_~z~0 (div (+ (- 1) main_~x~0) main_~z~0)) (* (- 1) (div (+ (- 1) main_~x~0) main_~z~0)) 1) main_~z~0) main_~z~0) 0)))} is VALID [2022-04-28 06:08:54,069 INFO L272 TraceCheckUtils]: 24: Hoare triple {1262#(or (and (= main_~z~0 0) (= main_~x~0 1) (= main_~y~0 0)) (and (= (mod (+ (* main_~z~0 (div (+ (- 1) main_~x~0) main_~z~0)) (* (- 1) (div (+ (- 1) main_~x~0) main_~z~0)) 1) main_~z~0) 0) (= (mod (+ (- 1) main_~x~0) main_~z~0) 0) (not (= main_~z~0 0)) (= main_~y~0 (* main_~z~0 (div (+ (* main_~z~0 (div (+ (- 1) main_~x~0) main_~z~0)) (* (- 1) (div (+ (- 1) main_~x~0) main_~z~0)) 1) main_~z~0))) (= (mod (div (+ (* main_~z~0 (div (+ (- 1) main_~x~0) main_~z~0)) (* (- 1) (div (+ (- 1) main_~x~0) main_~z~0)) 1) main_~z~0) main_~z~0) 0)))} call __VERIFIER_assert((if 0 == 1 + ~x~0 * ~z~0 - ~x~0 - ~z~0 * ~y~0 then 1 else 0)); {1272#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 06:08:54,069 INFO L290 TraceCheckUtils]: 25: Hoare triple {1272#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1276#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 06:08:54,069 INFO L290 TraceCheckUtils]: 26: Hoare triple {1276#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1190#false} is VALID [2022-04-28 06:08:54,069 INFO L290 TraceCheckUtils]: 27: Hoare triple {1190#false} assume !false; {1190#false} is VALID [2022-04-28 06:08:54,070 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 06:08:54,070 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 06:09:20,466 INFO L290 TraceCheckUtils]: 27: Hoare triple {1190#false} assume !false; {1190#false} is VALID [2022-04-28 06:09:20,468 INFO L290 TraceCheckUtils]: 26: Hoare triple {1276#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1190#false} is VALID [2022-04-28 06:09:20,468 INFO L290 TraceCheckUtils]: 25: Hoare triple {1272#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1276#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 06:09:20,469 INFO L272 TraceCheckUtils]: 24: Hoare triple {1232#(= (+ main_~x~0 (* main_~z~0 main_~y~0)) (+ (* main_~z~0 main_~x~0) 1))} call __VERIFIER_assert((if 0 == 1 + ~x~0 * ~z~0 - ~x~0 - ~z~0 * ~y~0 then 1 else 0)); {1272#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 06:09:20,469 INFO L290 TraceCheckUtils]: 23: Hoare triple {1232#(= (+ main_~x~0 (* main_~z~0 main_~y~0)) (+ (* main_~z~0 main_~x~0) 1))} assume !(#t~post6 < 10);havoc #t~post6; {1232#(= (+ main_~x~0 (* main_~z~0 main_~y~0)) (+ (* main_~z~0 main_~x~0) 1))} is VALID [2022-04-28 06:09:20,470 INFO L290 TraceCheckUtils]: 22: Hoare triple {1232#(= (+ main_~x~0 (* main_~z~0 main_~y~0)) (+ (* main_~z~0 main_~x~0) 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1232#(= (+ main_~x~0 (* main_~z~0 main_~y~0)) (+ (* main_~z~0 main_~x~0) 1))} is VALID [2022-04-28 06:09:20,472 INFO L290 TraceCheckUtils]: 21: Hoare triple {1301#(= (+ (* main_~z~0 (+ (* main_~z~0 main_~x~0) 1)) 1) (+ (* main_~z~0 main_~x~0) (* main_~z~0 (* main_~z~0 main_~y~0)) 1))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~x~0 := 1 + ~x~0 * ~z~0;~y~0 := ~y~0 * ~z~0; {1232#(= (+ main_~x~0 (* main_~z~0 main_~y~0)) (+ (* main_~z~0 main_~x~0) 1))} is VALID [2022-04-28 06:09:20,474 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {1225#(not (= |__VERIFIER_assert_#in~cond| 0))} {1189#true} #50#return; {1301#(= (+ (* main_~z~0 (+ (* main_~z~0 main_~x~0) 1)) 1) (+ (* main_~z~0 main_~x~0) (* main_~z~0 (* main_~z~0 main_~y~0)) 1))} is VALID [2022-04-28 06:09:20,474 INFO L290 TraceCheckUtils]: 19: Hoare triple {1225#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1225#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 06:09:20,475 INFO L290 TraceCheckUtils]: 18: Hoare triple {1314#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {1225#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 06:09:20,475 INFO L290 TraceCheckUtils]: 17: Hoare triple {1189#true} ~cond := #in~cond; {1314#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 06:09:20,475 INFO L272 TraceCheckUtils]: 16: Hoare triple {1189#true} call __VERIFIER_assert((if 0 == 1 + ~x~0 * ~z~0 - ~x~0 - ~z~0 * ~y~0 then 1 else 0)); {1189#true} is VALID [2022-04-28 06:09:20,475 INFO L290 TraceCheckUtils]: 15: Hoare triple {1189#true} assume !!(#t~post6 < 10);havoc #t~post6; {1189#true} is VALID [2022-04-28 06:09:20,475 INFO L290 TraceCheckUtils]: 14: Hoare triple {1189#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1189#true} is VALID [2022-04-28 06:09:20,475 INFO L290 TraceCheckUtils]: 13: Hoare triple {1189#true} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~x~0 := 1 + ~x~0 * ~z~0;~y~0 := ~y~0 * ~z~0; {1189#true} is VALID [2022-04-28 06:09:20,476 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1189#true} {1189#true} #50#return; {1189#true} is VALID [2022-04-28 06:09:20,476 INFO L290 TraceCheckUtils]: 11: Hoare triple {1189#true} assume true; {1189#true} is VALID [2022-04-28 06:09:20,476 INFO L290 TraceCheckUtils]: 10: Hoare triple {1189#true} assume !(0 == ~cond); {1189#true} is VALID [2022-04-28 06:09:20,476 INFO L290 TraceCheckUtils]: 9: Hoare triple {1189#true} ~cond := #in~cond; {1189#true} is VALID [2022-04-28 06:09:20,476 INFO L272 TraceCheckUtils]: 8: Hoare triple {1189#true} call __VERIFIER_assert((if 0 == 1 + ~x~0 * ~z~0 - ~x~0 - ~z~0 * ~y~0 then 1 else 0)); {1189#true} is VALID [2022-04-28 06:09:20,476 INFO L290 TraceCheckUtils]: 7: Hoare triple {1189#true} assume !!(#t~post6 < 10);havoc #t~post6; {1189#true} is VALID [2022-04-28 06:09:20,476 INFO L290 TraceCheckUtils]: 6: Hoare triple {1189#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1189#true} is VALID [2022-04-28 06:09:20,476 INFO L290 TraceCheckUtils]: 5: Hoare triple {1189#true} havoc ~z~0;havoc ~k~0;havoc ~x~0;havoc ~y~0;havoc ~c~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~z~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~k~0 := #t~nondet5;havoc #t~nondet5;~x~0 := 1;~y~0 := 1;~c~0 := 1; {1189#true} is VALID [2022-04-28 06:09:20,476 INFO L272 TraceCheckUtils]: 4: Hoare triple {1189#true} call #t~ret7 := main(); {1189#true} is VALID [2022-04-28 06:09:20,476 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1189#true} {1189#true} #54#return; {1189#true} is VALID [2022-04-28 06:09:20,477 INFO L290 TraceCheckUtils]: 2: Hoare triple {1189#true} assume true; {1189#true} is VALID [2022-04-28 06:09:20,477 INFO L290 TraceCheckUtils]: 1: Hoare triple {1189#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(10, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1189#true} is VALID [2022-04-28 06:09:20,477 INFO L272 TraceCheckUtils]: 0: Hoare triple {1189#true} call ULTIMATE.init(); {1189#true} is VALID [2022-04-28 06:09:20,477 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 06:09:20,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 06:09:20,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832158913] [2022-04-28 06:09:20,477 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 06:09:20,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1292370655] [2022-04-28 06:09:20,477 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1292370655] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 06:09:20,477 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 06:09:20,478 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 12 [2022-04-28 06:09:20,478 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 06:09:20,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2117968842] [2022-04-28 06:09:20,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2117968842] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 06:09:20,478 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 06:09:20,478 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 06:09:20,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176842253] [2022-04-28 06:09:20,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 06:09:20,478 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.7) internal successors, (17), 7 states have internal predecessors, (17), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 28 [2022-04-28 06:09:20,478 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 06:09:20,479 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 1.7) internal successors, (17), 7 states have internal predecessors, (17), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 06:09:24,514 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 23 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-28 06:09:24,514 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 06:09:24,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 06:09:24,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 06:09:24,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2022-04-28 06:09:24,515 INFO L87 Difference]: Start difference. First operand 33 states and 35 transitions. Second operand has 10 states, 10 states have (on average 1.7) internal successors, (17), 7 states have internal predecessors, (17), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 06:09:26,595 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 06:09:28,602 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 06:09:37,107 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 06:09:41,172 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 06:09:43,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:09:43,597 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2022-04-28 06:09:43,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 06:09:43,598 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.7) internal successors, (17), 7 states have internal predecessors, (17), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 28 [2022-04-28 06:09:43,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 06:09:43,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.7) internal successors, (17), 7 states have internal predecessors, (17), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 06:09:43,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 29 transitions. [2022-04-28 06:09:43,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.7) internal successors, (17), 7 states have internal predecessors, (17), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 06:09:43,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 29 transitions. [2022-04-28 06:09:43,600 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 29 transitions. [2022-04-28 06:09:47,644 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 27 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-28 06:09:47,645 INFO L225 Difference]: With dead ends: 34 [2022-04-28 06:09:47,645 INFO L226 Difference]: Without dead ends: 0 [2022-04-28 06:09:47,645 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=47, Invalid=133, Unknown=2, NotChecked=0, Total=182 [2022-04-28 06:09:47,645 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 16 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 5 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 11 IncrementalHoareTripleChecker+Unchecked, 8.1s IncrementalHoareTripleChecker+Time [2022-04-28 06:09:47,646 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 91 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 41 Invalid, 4 Unknown, 11 Unchecked, 8.1s Time] [2022-04-28 06:09:47,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-28 06:09:47,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-28 06:09:47,646 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 06:09:47,646 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 06:09:47,646 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 06:09:47,646 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 06:09:47,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:09:47,646 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 06:09:47,646 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 06:09:47,646 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:09:47,646 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:09:47,647 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 06:09:47,647 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 06:09:47,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:09:47,647 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 06:09:47,647 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 06:09:47,647 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:09:47,647 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:09:47,647 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 06:09:47,647 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 06:09:47,647 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 06:09:47,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-28 06:09:47,647 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 28 [2022-04-28 06:09:47,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 06:09:47,647 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-28 06:09:47,647 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.7) internal successors, (17), 7 states have internal predecessors, (17), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 06:09:47,647 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-28 06:09:47,647 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 06:09:47,647 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 06:09:47,648 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:09:47,649 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-28 06:09:47,656 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-28 06:09:47,854 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 06:09:47,858 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-28 06:10:11,120 WARN L232 SmtUtils]: Spent 17.47s on a formula simplification. DAG size of input: 46 DAG size of output: 25 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-04-28 06:10:11,414 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 8) no Hoare annotation was computed. [2022-04-28 06:10:11,414 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 8) no Hoare annotation was computed. [2022-04-28 06:10:11,414 INFO L899 garLoopResultBuilder]: For program point reach_errorFINAL(line 8) no Hoare annotation was computed. [2022-04-28 06:10:11,414 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notENTRY(lines 11 13) no Hoare annotation was computed. [2022-04-28 06:10:11,414 INFO L899 garLoopResultBuilder]: For program point L12(line 12) no Hoare annotation was computed. [2022-04-28 06:10:11,414 INFO L899 garLoopResultBuilder]: For program point L12-2(lines 11 13) no Hoare annotation was computed. [2022-04-28 06:10:11,414 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 11 13) no Hoare annotation was computed. [2022-04-28 06:10:11,414 INFO L895 garLoopResultBuilder]: At program point L34-1(lines 34 43) the Hoare annotation is: (let ((.cse1 (= main_~z~0 0))) (let ((.cse0 (= main_~x~0 1)) (.cse4 (not .cse1))) (or (and (<= ~counter~0 1) (= main_~y~0 1) .cse0 (<= |main_#t~post6| 0)) (and .cse1 .cse0 (= main_~y~0 0)) (let ((.cse3 (+ (- 1) main_~x~0))) (let ((.cse2 (let ((.cse6 (div .cse3 main_~z~0))) (+ (* main_~z~0 .cse6) (* (- 1) .cse6) 1)))) (let ((.cse5 (div .cse2 main_~z~0))) (and (= (mod .cse2 main_~z~0) 0) (= (mod .cse3 main_~z~0) 0) .cse4 (= main_~y~0 (* main_~z~0 .cse5)) (= (mod .cse5 main_~z~0) 0))))) (not (<= |old(~counter~0)| 0)) (and (<= |main_#t~post6| 1) (= (+ main_~x~0 (* main_~z~0 main_~y~0)) (+ (* main_~z~0 main_~x~0) 1)) .cse4 (= main_~x~0 (+ main_~z~0 1)))))) [2022-04-28 06:10:11,414 INFO L895 garLoopResultBuilder]: At program point L34-3(lines 34 43) the Hoare annotation is: (let ((.cse2 (= main_~z~0 0))) (let ((.cse1 (= main_~x~0 1)) (.cse0 (not .cse2))) (or (and (<= ~counter~0 1) (= (+ main_~x~0 (* main_~z~0 main_~y~0)) (+ (* main_~z~0 main_~x~0) 1)) .cse0 (= main_~x~0 (+ main_~z~0 1))) (and (= main_~y~0 1) (<= ~counter~0 0) .cse1) (and .cse2 .cse1 (= main_~y~0 0)) (let ((.cse4 (+ (- 1) main_~x~0))) (let ((.cse3 (let ((.cse6 (div .cse4 main_~z~0))) (+ (* main_~z~0 .cse6) (* (- 1) .cse6) 1)))) (let ((.cse5 (div .cse3 main_~z~0))) (and (= (mod .cse3 main_~z~0) 0) (= (mod .cse4 main_~z~0) 0) .cse0 (= main_~y~0 (* main_~z~0 .cse5)) (= (mod .cse5 main_~z~0) 0))))) (not (<= |old(~counter~0)| 0))))) [2022-04-28 06:10:11,414 INFO L895 garLoopResultBuilder]: At program point L34-4(lines 34 43) the Hoare annotation is: (let ((.cse0 (= main_~z~0 0)) (.cse1 (= main_~x~0 1))) (or (and (= (mod main_~y~0 main_~z~0) 0) (= (+ main_~x~0 (* main_~z~0 main_~y~0)) (+ (* main_~z~0 main_~x~0) 1)) (not .cse0)) (and (= main_~y~0 1) .cse1) (and .cse0 .cse1 (= main_~y~0 0)) (not (<= |old(~counter~0)| 0)))) [2022-04-28 06:10:11,414 INFO L895 garLoopResultBuilder]: At program point mainENTRY(lines 24 46) the Hoare annotation is: (or (= ~counter~0 |old(~counter~0)|) (not (<= |old(~counter~0)| 0))) [2022-04-28 06:10:11,415 INFO L902 garLoopResultBuilder]: At program point mainEXIT(lines 24 46) the Hoare annotation is: true [2022-04-28 06:10:11,415 INFO L902 garLoopResultBuilder]: At program point mainFINAL(lines 24 46) the Hoare annotation is: true [2022-04-28 06:10:11,415 INFO L902 garLoopResultBuilder]: At program point L44(line 44) the Hoare annotation is: true [2022-04-28 06:10:11,415 INFO L895 garLoopResultBuilder]: At program point L35(line 35) the Hoare annotation is: (let ((.cse2 (not (= main_~z~0 0)))) (or (and (<= ~counter~0 1) (= main_~y~0 1) (= main_~x~0 1)) (let ((.cse1 (+ (- 1) main_~x~0))) (let ((.cse0 (let ((.cse4 (div .cse1 main_~z~0))) (+ (* main_~z~0 .cse4) (* (- 1) .cse4) 1)))) (let ((.cse3 (div .cse0 main_~z~0))) (and (= (mod .cse0 main_~z~0) 0) (= (mod .cse1 main_~z~0) 0) .cse2 (= main_~y~0 (* main_~z~0 .cse3)) (= (mod .cse3 main_~z~0) 0))))) (not (<= |old(~counter~0)| 0)) (and (or .cse2 (= main_~y~0 0)) (= (+ main_~x~0 (* main_~z~0 main_~y~0)) (+ (* main_~z~0 main_~x~0) 1)) (= main_~x~0 (+ main_~z~0 1))))) [2022-04-28 06:10:11,415 INFO L895 garLoopResultBuilder]: At program point L35-1(lines 34 43) the Hoare annotation is: (or (and (<= ~counter~0 1) (= main_~y~0 1) (= main_~x~0 1)) (and (or (and (= (mod main_~y~0 main_~z~0) 0) (not (= main_~z~0 0))) (= main_~y~0 0)) (= (+ main_~x~0 (* main_~z~0 main_~y~0)) (+ (* main_~z~0 main_~x~0) 1))) (not (<= |old(~counter~0)| 0))) [2022-04-28 06:10:11,415 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: (<= ~counter~0 0) [2022-04-28 06:10:11,415 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-28 06:10:11,415 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: (<= ~counter~0 0) [2022-04-28 06:10:11,415 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-28 06:10:11,415 INFO L895 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: (<= ~counter~0 0) [2022-04-28 06:10:11,415 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-28 06:10:11,415 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-28 06:10:11,415 INFO L895 garLoopResultBuilder]: At program point L16(lines 16 17) the Hoare annotation is: (not (<= 1 |__VERIFIER_assert_#in~cond|)) [2022-04-28 06:10:11,415 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 06:10:11,415 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 14 20) the Hoare annotation is: true [2022-04-28 06:10:11,415 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 06:10:11,415 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 06:10:11,415 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 06:10:11,417 INFO L356 BasicCegarLoop]: Path program histogram: [4, 2, 2, 2, 2] [2022-04-28 06:10:11,418 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-28 06:10:11,420 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-28 06:10:11,421 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-28 06:10:11,422 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-28 06:10:11,423 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-28 06:10:11,423 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-28 06:10:11,428 WARN L170 areAnnotationChecker]: L12-2 has no Hoare annotation [2022-04-28 06:10:13,469 INFO L163 areAnnotationChecker]: CFG has 26 edges. 25 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-28 06:10:13,482 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 06:10:13 BoogieIcfgContainer [2022-04-28 06:10:13,482 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-28 06:10:13,483 INFO L158 Benchmark]: Toolchain (without parser) took 190707.90ms. Allocated memory was 198.2MB in the beginning and 245.4MB in the end (delta: 47.2MB). Free memory was 148.0MB in the beginning and 141.0MB in the end (delta: 7.0MB). Peak memory consumption was 54.2MB. Max. memory is 8.0GB. [2022-04-28 06:10:13,483 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 198.2MB. Free memory was 164.9MB in the beginning and 164.8MB in the end (delta: 71.5kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 06:10:13,484 INFO L158 Benchmark]: CACSL2BoogieTranslator took 236.17ms. Allocated memory is still 198.2MB. Free memory was 147.7MB in the beginning and 173.9MB in the end (delta: -26.2MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-28 06:10:13,484 INFO L158 Benchmark]: Boogie Preprocessor took 33.57ms. Allocated memory is still 198.2MB. Free memory was 173.9MB in the beginning and 172.4MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-28 06:10:13,484 INFO L158 Benchmark]: RCFGBuilder took 248.50ms. Allocated memory is still 198.2MB. Free memory was 172.4MB in the beginning and 161.9MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-28 06:10:13,484 INFO L158 Benchmark]: TraceAbstraction took 190184.26ms. Allocated memory was 198.2MB in the beginning and 245.4MB in the end (delta: 47.2MB). Free memory was 161.4MB in the beginning and 141.5MB in the end (delta: 19.9MB). Peak memory consumption was 68.4MB. Max. memory is 8.0GB. [2022-04-28 06:10:13,485 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 198.2MB. Free memory was 164.9MB in the beginning and 164.8MB in the end (delta: 71.5kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 236.17ms. Allocated memory is still 198.2MB. Free memory was 147.7MB in the beginning and 173.9MB in the end (delta: -26.2MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 33.57ms. Allocated memory is still 198.2MB. Free memory was 173.9MB in the beginning and 172.4MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 248.50ms. Allocated memory is still 198.2MB. Free memory was 172.4MB in the beginning and 161.9MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 190184.26ms. Allocated memory was 198.2MB in the beginning and 245.4MB in the end (delta: 47.2MB). Free memory was 161.4MB in the beginning and 141.5MB in the end (delta: 19.9MB). Peak memory consumption was 68.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 17]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 29 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 188.1s, OverallIterations: 6, TraceHistogramMax: 3, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 23.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 23.6s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 4 mSolverCounterUnknown, 44 SdHoareTripleChecker+Valid, 8.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 42 mSDsluCounter, 363 SdHoareTripleChecker+Invalid, 8.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 11 IncrementalHoareTripleChecker+Unchecked, 253 mSDsCounter, 15 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 157 IncrementalHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 15 mSolverCounterUnsat, 110 mSDtfsCounter, 157 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 165 GetRequests, 126 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 10.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=33occurred in iteration=5, InterpolantAutomatonStates: 34, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 22 LocationsWithAnnotation, 82 PreInvPairs, 133 NumberOfFragments, 519 HoareAnnotationTreeSize, 82 FomulaSimplifications, 3 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 22 FomulaSimplificationsInter, 377 FormulaSimplificationTreeSizeReductionInter, 23.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: 34]: Loop Invariant Derived loop invariant: ((((((counter <= 1 && x + z * y == z * x + 1) && !(z == 0)) && x == z + 1) || ((y == 1 && counter <= 0) && x == 1)) || ((z == 0 && x == 1) && y == 0)) || (((((z * ((-1 + x) / z) + -1 * ((-1 + x) / z) + 1) % z == 0 && (-1 + x) % z == 0) && !(z == 0)) && y == z * ((z * ((-1 + x) / z) + -1 * ((-1 + x) / z) + 1) / z)) && (z * ((-1 + x) / z) + -1 * ((-1 + x) / z) + 1) / z % z == 0)) || !(\old(counter) <= 0) - ProcedureContractResult [Line: 24]: 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 06:10:13,528 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...