/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/mannadiv_unwindbound5.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 13:56:59,162 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 13:56:59,168 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 13:56:59,212 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 13:56:59,212 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 13:56:59,213 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 13:56:59,214 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 13:56:59,215 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 13:56:59,217 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 13:56:59,217 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 13:56:59,218 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 13:56:59,219 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 13:56:59,219 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 13:56:59,219 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 13:56:59,220 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 13:56:59,221 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 13:56:59,221 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 13:56:59,222 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 13:56:59,224 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 13:56:59,225 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 13:56:59,226 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 13:56:59,227 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 13:56:59,227 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 13:56:59,228 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 13:56:59,229 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 13:56:59,232 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 13:56:59,232 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 13:56:59,232 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 13:56:59,233 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 13:56:59,233 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 13:56:59,234 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 13:56:59,234 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 13:56:59,234 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 13:56:59,235 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 13:56:59,235 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 13:56:59,236 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 13:56:59,236 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 13:56:59,237 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 13:56:59,237 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 13:56:59,237 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 13:56:59,237 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 13:56:59,239 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 13:56:59,240 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-28 13:56:59,247 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 13:56:59,247 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 13:56:59,248 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 13:56:59,248 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 13:56:59,249 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 13:56:59,249 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 13:56:59,249 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 13:56:59,249 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 13:56:59,249 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 13:56:59,249 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 13:56:59,250 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 13:56:59,250 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 13:56:59,250 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 13:56:59,250 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 13:56:59,250 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 13:56:59,250 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 13:56:59,251 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 13:56:59,251 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 13:56:59,251 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 13:56:59,251 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 13:56:59,251 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 13:56:59,251 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-28 13:56:59,251 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 13:56:59,429 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 13:56:59,443 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 13:56:59,445 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 13:56:59,446 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 13:56:59,448 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 13:56:59,448 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/mannadiv_unwindbound5.c [2022-04-28 13:56:59,501 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3dc6bc083/25372c8a8f59449d9b05ea17f8fd8346/FLAGe6ff70deb [2022-04-28 13:56:59,861 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 13:56:59,862 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/mannadiv_unwindbound5.c [2022-04-28 13:56:59,865 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3dc6bc083/25372c8a8f59449d9b05ea17f8fd8346/FLAGe6ff70deb [2022-04-28 13:56:59,873 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3dc6bc083/25372c8a8f59449d9b05ea17f8fd8346 [2022-04-28 13:56:59,874 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 13:56:59,875 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 13:56:59,876 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 13:56:59,876 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 13:56:59,878 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 13:56:59,878 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 01:56:59" (1/1) ... [2022-04-28 13:56:59,879 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d9db342 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 01:56:59, skipping insertion in model container [2022-04-28 13:56:59,879 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 01:56:59" (1/1) ... [2022-04-28 13:56:59,883 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 13:56:59,892 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 13:57:00,000 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/mannadiv_unwindbound5.c[573,586] [2022-04-28 13:57:00,019 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 13:57:00,024 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 13:57:00,031 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/mannadiv_unwindbound5.c[573,586] [2022-04-28 13:57:00,038 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 13:57:00,046 INFO L208 MainTranslator]: Completed translation [2022-04-28 13:57:00,046 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 01:57:00 WrapperNode [2022-04-28 13:57:00,047 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 13:57:00,047 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 13:57:00,047 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 13:57:00,047 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 13:57:00,057 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 01:57:00" (1/1) ... [2022-04-28 13:57:00,057 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 01:57:00" (1/1) ... [2022-04-28 13:57:00,061 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 01:57:00" (1/1) ... [2022-04-28 13:57:00,061 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 01:57:00" (1/1) ... [2022-04-28 13:57:00,065 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 01:57:00" (1/1) ... [2022-04-28 13:57:00,067 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 01:57:00" (1/1) ... [2022-04-28 13:57:00,068 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 01:57:00" (1/1) ... [2022-04-28 13:57:00,069 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 13:57:00,069 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 13:57:00,070 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 13:57:00,070 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 13:57:00,077 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 01:57:00" (1/1) ... [2022-04-28 13:57:00,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 13:57:00,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 13:57:00,106 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 13:57:00,111 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 13:57:00,128 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 13:57:00,128 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 13:57:00,128 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 13:57:00,128 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-28 13:57:00,128 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 13:57:00,128 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 13:57:00,128 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 13:57:00,128 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 13:57:00,129 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 13:57:00,129 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 13:57:00,129 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-28 13:57:00,129 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-28 13:57:00,129 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 13:57:00,129 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 13:57:00,129 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 13:57:00,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 13:57:00,129 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 13:57:00,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 13:57:00,129 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 13:57:00,130 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 13:57:00,173 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 13:57:00,174 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 13:57:00,305 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 13:57:00,310 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 13:57:00,310 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 13:57:00,311 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 01:57:00 BoogieIcfgContainer [2022-04-28 13:57:00,311 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 13:57:00,319 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 13:57:00,319 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 13:57:00,322 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 13:57:00,322 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 01:56:59" (1/3) ... [2022-04-28 13:57:00,323 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17fbe17b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 01:57:00, skipping insertion in model container [2022-04-28 13:57:00,323 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 01:57:00" (2/3) ... [2022-04-28 13:57:00,323 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17fbe17b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 01:57:00, skipping insertion in model container [2022-04-28 13:57:00,323 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 01:57:00" (3/3) ... [2022-04-28 13:57:00,324 INFO L111 eAbstractionObserver]: Analyzing ICFG mannadiv_unwindbound5.c [2022-04-28 13:57:00,333 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 13:57:00,334 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 13:57:00,379 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 13:57:00,385 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@366dcb31, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@2a7be0ab [2022-04-28 13:57:00,385 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 13:57:00,407 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 19 states have internal predecessors, (25), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 13:57:00,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-28 13:57:00,411 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 13:57:00,412 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 13:57:00,412 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 13:57:00,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 13:57:00,416 INFO L85 PathProgramCache]: Analyzing trace with hash -1859024204, now seen corresponding path program 1 times [2022-04-28 13:57:00,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 13:57:00,421 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1046611661] [2022-04-28 13:57:00,430 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 13:57:00,430 INFO L85 PathProgramCache]: Analyzing trace with hash -1859024204, now seen corresponding path program 2 times [2022-04-28 13:57:00,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 13:57:00,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68645813] [2022-04-28 13:57:00,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 13:57:00,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 13:57:00,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 13:57:00,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 13:57:00,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 13:57:00,612 INFO L290 TraceCheckUtils]: 0: Hoare triple {46#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {33#true} is VALID [2022-04-28 13:57:00,612 INFO L290 TraceCheckUtils]: 1: Hoare triple {33#true} assume true; {33#true} is VALID [2022-04-28 13:57:00,612 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {33#true} {33#true} #67#return; {33#true} is VALID [2022-04-28 13:57:00,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-28 13:57:00,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 13:57:00,621 INFO L290 TraceCheckUtils]: 0: Hoare triple {33#true} ~cond := #in~cond; {33#true} is VALID [2022-04-28 13:57:00,622 INFO L290 TraceCheckUtils]: 1: Hoare triple {33#true} assume 0 == ~cond;assume false; {34#false} is VALID [2022-04-28 13:57:00,622 INFO L290 TraceCheckUtils]: 2: Hoare triple {34#false} assume true; {34#false} is VALID [2022-04-28 13:57:00,623 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34#false} {33#true} #59#return; {34#false} is VALID [2022-04-28 13:57:00,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-28 13:57:00,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 13:57:00,629 INFO L290 TraceCheckUtils]: 0: Hoare triple {33#true} ~cond := #in~cond; {33#true} is VALID [2022-04-28 13:57:00,631 INFO L290 TraceCheckUtils]: 1: Hoare triple {33#true} assume 0 == ~cond;assume false; {34#false} is VALID [2022-04-28 13:57:00,631 INFO L290 TraceCheckUtils]: 2: Hoare triple {34#false} assume true; {34#false} is VALID [2022-04-28 13:57:00,631 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34#false} {34#false} #61#return; {34#false} is VALID [2022-04-28 13:57:00,633 INFO L272 TraceCheckUtils]: 0: Hoare triple {33#true} call ULTIMATE.init(); {46#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 13:57:00,633 INFO L290 TraceCheckUtils]: 1: Hoare triple {46#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {33#true} is VALID [2022-04-28 13:57:00,633 INFO L290 TraceCheckUtils]: 2: Hoare triple {33#true} assume true; {33#true} is VALID [2022-04-28 13:57:00,633 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33#true} {33#true} #67#return; {33#true} is VALID [2022-04-28 13:57:00,633 INFO L272 TraceCheckUtils]: 4: Hoare triple {33#true} call #t~ret7 := main(); {33#true} is VALID [2022-04-28 13:57:00,634 INFO L290 TraceCheckUtils]: 5: Hoare triple {33#true} havoc ~x1~0;havoc ~x2~0;havoc ~y1~0;havoc ~y2~0;havoc ~y3~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x1~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~x2~0 := #t~nondet5;havoc #t~nondet5; {33#true} is VALID [2022-04-28 13:57:00,634 INFO L272 TraceCheckUtils]: 6: Hoare triple {33#true} call assume_abort_if_not((if ~x1~0 >= 0 then 1 else 0)); {33#true} is VALID [2022-04-28 13:57:00,634 INFO L290 TraceCheckUtils]: 7: Hoare triple {33#true} ~cond := #in~cond; {33#true} is VALID [2022-04-28 13:57:00,635 INFO L290 TraceCheckUtils]: 8: Hoare triple {33#true} assume 0 == ~cond;assume false; {34#false} is VALID [2022-04-28 13:57:00,635 INFO L290 TraceCheckUtils]: 9: Hoare triple {34#false} assume true; {34#false} is VALID [2022-04-28 13:57:00,635 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {34#false} {33#true} #59#return; {34#false} is VALID [2022-04-28 13:57:00,635 INFO L272 TraceCheckUtils]: 11: Hoare triple {34#false} call assume_abort_if_not((if 0 != ~x2~0 then 1 else 0)); {33#true} is VALID [2022-04-28 13:57:00,635 INFO L290 TraceCheckUtils]: 12: Hoare triple {33#true} ~cond := #in~cond; {33#true} is VALID [2022-04-28 13:57:00,636 INFO L290 TraceCheckUtils]: 13: Hoare triple {33#true} assume 0 == ~cond;assume false; {34#false} is VALID [2022-04-28 13:57:00,637 INFO L290 TraceCheckUtils]: 14: Hoare triple {34#false} assume true; {34#false} is VALID [2022-04-28 13:57:00,637 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {34#false} {34#false} #61#return; {34#false} is VALID [2022-04-28 13:57:00,637 INFO L290 TraceCheckUtils]: 16: Hoare triple {34#false} ~y1~0 := 0;~y2~0 := 0;~y3~0 := ~x1~0; {34#false} is VALID [2022-04-28 13:57:00,637 INFO L290 TraceCheckUtils]: 17: Hoare triple {34#false} assume !true; {34#false} is VALID [2022-04-28 13:57:00,637 INFO L272 TraceCheckUtils]: 18: Hoare triple {34#false} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 == ~x1~0 then 1 else 0)); {34#false} is VALID [2022-04-28 13:57:00,637 INFO L290 TraceCheckUtils]: 19: Hoare triple {34#false} ~cond := #in~cond; {34#false} is VALID [2022-04-28 13:57:00,638 INFO L290 TraceCheckUtils]: 20: Hoare triple {34#false} assume 0 == ~cond; {34#false} is VALID [2022-04-28 13:57:00,638 INFO L290 TraceCheckUtils]: 21: Hoare triple {34#false} assume !false; {34#false} is VALID [2022-04-28 13:57:00,638 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 13:57:00,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 13:57:00,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68645813] [2022-04-28 13:57:00,639 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68645813] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 13:57:00,639 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 13:57:00,639 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 13:57:00,641 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 13:57:00,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1046611661] [2022-04-28 13:57:00,641 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1046611661] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 13:57:00,642 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 13:57:00,642 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 13:57:00,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650723132] [2022-04-28 13:57:00,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 13:57:00,645 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-28 13:57:00,646 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 13:57:00,648 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 13:57:00,684 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 13:57:00,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 13:57:00,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 13:57:00,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 13:57:00,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 13:57:00,702 INFO L87 Difference]: Start difference. First operand has 30 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 19 states have internal predecessors, (25), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 13:57:00,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:57:00,810 INFO L93 Difference]: Finished difference Result 54 states and 72 transitions. [2022-04-28 13:57:00,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 13:57:00,811 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-28 13:57:00,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 13:57:00,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 13:57:00,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 72 transitions. [2022-04-28 13:57:00,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 13:57:00,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 72 transitions. [2022-04-28 13:57:00,830 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 72 transitions. [2022-04-28 13:57:00,910 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:57:00,917 INFO L225 Difference]: With dead ends: 54 [2022-04-28 13:57:00,917 INFO L226 Difference]: Without dead ends: 26 [2022-04-28 13:57:00,920 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 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 13:57:00,924 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 10 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 13:57:00,925 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 35 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 13:57:00,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-28 13:57:00,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2022-04-28 13:57:00,956 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 13:57:00,957 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 25 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 13:57:00,958 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 25 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 13:57:00,959 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 25 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 13:57:00,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:57:00,967 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2022-04-28 13:57:00,967 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2022-04-28 13:57:00,971 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:57:00,971 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:57:00,971 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 26 states. [2022-04-28 13:57:00,972 INFO L87 Difference]: Start difference. First operand has 25 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 26 states. [2022-04-28 13:57:00,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:57:00,975 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2022-04-28 13:57:00,975 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2022-04-28 13:57:00,975 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:57:00,975 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:57:00,975 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 13:57:00,975 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 13:57:00,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 13:57:00,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2022-04-28 13:57:00,980 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 22 [2022-04-28 13:57:00,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 13:57:00,980 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2022-04-28 13:57:00,981 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 13:57:00,981 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 29 transitions. [2022-04-28 13:57:01,006 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 13:57:01,007 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2022-04-28 13:57:01,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-28 13:57:01,008 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 13:57:01,008 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 13:57:01,008 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 13:57:01,009 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 13:57:01,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 13:57:01,009 INFO L85 PathProgramCache]: Analyzing trace with hash 243739414, now seen corresponding path program 1 times [2022-04-28 13:57:01,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 13:57:01,010 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2094418473] [2022-04-28 13:57:01,011 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 13:57:01,011 INFO L85 PathProgramCache]: Analyzing trace with hash 243739414, now seen corresponding path program 2 times [2022-04-28 13:57:01,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 13:57:01,013 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659548407] [2022-04-28 13:57:01,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 13:57:01,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 13:57:01,048 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 13:57:01,049 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2027864172] [2022-04-28 13:57:01,049 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 13:57:01,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 13:57:01,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 13:57:01,053 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 13:57:01,054 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 13:57:01,100 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-28 13:57:01,100 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 13:57:01,101 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-28 13:57:01,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 13:57:01,117 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 13:57:01,273 INFO L272 TraceCheckUtils]: 0: Hoare triple {259#true} call ULTIMATE.init(); {259#true} is VALID [2022-04-28 13:57:01,274 INFO L290 TraceCheckUtils]: 1: Hoare triple {259#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {267#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:01,274 INFO L290 TraceCheckUtils]: 2: Hoare triple {267#(<= ~counter~0 0)} assume true; {267#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:01,275 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {267#(<= ~counter~0 0)} {259#true} #67#return; {267#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:01,275 INFO L272 TraceCheckUtils]: 4: Hoare triple {267#(<= ~counter~0 0)} call #t~ret7 := main(); {267#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:01,275 INFO L290 TraceCheckUtils]: 5: Hoare triple {267#(<= ~counter~0 0)} havoc ~x1~0;havoc ~x2~0;havoc ~y1~0;havoc ~y2~0;havoc ~y3~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x1~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~x2~0 := #t~nondet5;havoc #t~nondet5; {267#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:01,276 INFO L272 TraceCheckUtils]: 6: Hoare triple {267#(<= ~counter~0 0)} call assume_abort_if_not((if ~x1~0 >= 0 then 1 else 0)); {267#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:01,276 INFO L290 TraceCheckUtils]: 7: Hoare triple {267#(<= ~counter~0 0)} ~cond := #in~cond; {267#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:01,277 INFO L290 TraceCheckUtils]: 8: Hoare triple {267#(<= ~counter~0 0)} assume !(0 == ~cond); {267#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:01,277 INFO L290 TraceCheckUtils]: 9: Hoare triple {267#(<= ~counter~0 0)} assume true; {267#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:01,278 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {267#(<= ~counter~0 0)} {267#(<= ~counter~0 0)} #59#return; {267#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:01,279 INFO L272 TraceCheckUtils]: 11: Hoare triple {267#(<= ~counter~0 0)} call assume_abort_if_not((if 0 != ~x2~0 then 1 else 0)); {267#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:01,279 INFO L290 TraceCheckUtils]: 12: Hoare triple {267#(<= ~counter~0 0)} ~cond := #in~cond; {267#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:01,280 INFO L290 TraceCheckUtils]: 13: Hoare triple {267#(<= ~counter~0 0)} assume !(0 == ~cond); {267#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:01,280 INFO L290 TraceCheckUtils]: 14: Hoare triple {267#(<= ~counter~0 0)} assume true; {267#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:01,282 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {267#(<= ~counter~0 0)} {267#(<= ~counter~0 0)} #61#return; {267#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:01,283 INFO L290 TraceCheckUtils]: 16: Hoare triple {267#(<= ~counter~0 0)} ~y1~0 := 0;~y2~0 := 0;~y3~0 := ~x1~0; {267#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:01,284 INFO L290 TraceCheckUtils]: 17: Hoare triple {267#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {316#(<= |main_#t~post6| 0)} is VALID [2022-04-28 13:57:01,285 INFO L290 TraceCheckUtils]: 18: Hoare triple {316#(<= |main_#t~post6| 0)} assume !(#t~post6 < 5);havoc #t~post6; {260#false} is VALID [2022-04-28 13:57:01,285 INFO L272 TraceCheckUtils]: 19: Hoare triple {260#false} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 == ~x1~0 then 1 else 0)); {260#false} is VALID [2022-04-28 13:57:01,285 INFO L290 TraceCheckUtils]: 20: Hoare triple {260#false} ~cond := #in~cond; {260#false} is VALID [2022-04-28 13:57:01,285 INFO L290 TraceCheckUtils]: 21: Hoare triple {260#false} assume 0 == ~cond; {260#false} is VALID [2022-04-28 13:57:01,287 INFO L290 TraceCheckUtils]: 22: Hoare triple {260#false} assume !false; {260#false} is VALID [2022-04-28 13:57:01,287 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 13:57:01,287 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 13:57:01,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 13:57:01,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659548407] [2022-04-28 13:57:01,288 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 13:57:01,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2027864172] [2022-04-28 13:57:01,288 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2027864172] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 13:57:01,289 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 13:57:01,289 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 13:57:01,290 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 13:57:01,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2094418473] [2022-04-28 13:57:01,290 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2094418473] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 13:57:01,290 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 13:57:01,290 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 13:57:01,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858697153] [2022-04-28 13:57:01,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 13:57:01,291 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-28 13:57:01,292 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 13:57:01,292 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 13:57:01,309 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 13:57:01,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 13:57:01,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 13:57:01,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 13:57:01,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 13:57:01,311 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 13:57:01,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:57:01,360 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2022-04-28 13:57:01,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 13:57:01,360 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-28 13:57:01,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 13:57:01,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 13:57:01,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2022-04-28 13:57:01,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 13:57:01,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2022-04-28 13:57:01,363 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 38 transitions. [2022-04-28 13:57:01,388 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:57:01,389 INFO L225 Difference]: With dead ends: 34 [2022-04-28 13:57:01,389 INFO L226 Difference]: Without dead ends: 27 [2022-04-28 13:57:01,389 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 20 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 13:57:01,390 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 0 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 67 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 13:57:01,390 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 67 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 13:57:01,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-28 13:57:01,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-04-28 13:57:01,417 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 13:57:01,417 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 27 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 13:57:01,417 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 27 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 13:57:01,417 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 27 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 13:57:01,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:57:01,419 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2022-04-28 13:57:01,419 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-04-28 13:57:01,419 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:57:01,419 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:57:01,419 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 27 states. [2022-04-28 13:57:01,420 INFO L87 Difference]: Start difference. First operand has 27 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 27 states. [2022-04-28 13:57:01,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:57:01,421 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2022-04-28 13:57:01,421 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-04-28 13:57:01,421 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:57:01,421 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:57:01,421 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 13:57:01,421 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 13:57:01,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 13:57:01,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2022-04-28 13:57:01,423 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 23 [2022-04-28 13:57:01,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 13:57:01,423 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2022-04-28 13:57:01,423 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 13:57:01,423 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 31 transitions. [2022-04-28 13:57:01,447 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 13:57:01,447 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-04-28 13:57:01,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-28 13:57:01,448 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 13:57:01,448 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 13:57:01,467 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-28 13:57:01,663 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 13:57:01,664 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 13:57:01,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 13:57:01,664 INFO L85 PathProgramCache]: Analyzing trace with hash 245526874, now seen corresponding path program 1 times [2022-04-28 13:57:01,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 13:57:01,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1633858237] [2022-04-28 13:57:01,664 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 13:57:01,665 INFO L85 PathProgramCache]: Analyzing trace with hash 245526874, now seen corresponding path program 2 times [2022-04-28 13:57:01,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 13:57:01,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352731920] [2022-04-28 13:57:01,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 13:57:01,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 13:57:01,676 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 13:57:01,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1497739426] [2022-04-28 13:57:01,676 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 13:57:01,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 13:57:01,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 13:57:01,678 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 13:57:01,679 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 13:57:01,709 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-28 13:57:01,709 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 13:57:01,709 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 13:57:01,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 13:57:01,726 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 13:57:02,047 INFO L272 TraceCheckUtils]: 0: Hoare triple {507#true} call ULTIMATE.init(); {507#true} is VALID [2022-04-28 13:57:02,047 INFO L290 TraceCheckUtils]: 1: Hoare triple {507#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {507#true} is VALID [2022-04-28 13:57:02,047 INFO L290 TraceCheckUtils]: 2: Hoare triple {507#true} assume true; {507#true} is VALID [2022-04-28 13:57:02,048 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {507#true} {507#true} #67#return; {507#true} is VALID [2022-04-28 13:57:02,048 INFO L272 TraceCheckUtils]: 4: Hoare triple {507#true} call #t~ret7 := main(); {507#true} is VALID [2022-04-28 13:57:02,048 INFO L290 TraceCheckUtils]: 5: Hoare triple {507#true} havoc ~x1~0;havoc ~x2~0;havoc ~y1~0;havoc ~y2~0;havoc ~y3~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x1~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~x2~0 := #t~nondet5;havoc #t~nondet5; {507#true} is VALID [2022-04-28 13:57:02,048 INFO L272 TraceCheckUtils]: 6: Hoare triple {507#true} call assume_abort_if_not((if ~x1~0 >= 0 then 1 else 0)); {507#true} is VALID [2022-04-28 13:57:02,048 INFO L290 TraceCheckUtils]: 7: Hoare triple {507#true} ~cond := #in~cond; {507#true} is VALID [2022-04-28 13:57:02,048 INFO L290 TraceCheckUtils]: 8: Hoare triple {507#true} assume !(0 == ~cond); {507#true} is VALID [2022-04-28 13:57:02,048 INFO L290 TraceCheckUtils]: 9: Hoare triple {507#true} assume true; {507#true} is VALID [2022-04-28 13:57:02,048 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {507#true} {507#true} #59#return; {507#true} is VALID [2022-04-28 13:57:02,048 INFO L272 TraceCheckUtils]: 11: Hoare triple {507#true} call assume_abort_if_not((if 0 != ~x2~0 then 1 else 0)); {507#true} is VALID [2022-04-28 13:57:02,049 INFO L290 TraceCheckUtils]: 12: Hoare triple {507#true} ~cond := #in~cond; {507#true} is VALID [2022-04-28 13:57:02,049 INFO L290 TraceCheckUtils]: 13: Hoare triple {507#true} assume !(0 == ~cond); {507#true} is VALID [2022-04-28 13:57:02,049 INFO L290 TraceCheckUtils]: 14: Hoare triple {507#true} assume true; {507#true} is VALID [2022-04-28 13:57:02,049 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {507#true} {507#true} #61#return; {507#true} is VALID [2022-04-28 13:57:02,063 INFO L290 TraceCheckUtils]: 16: Hoare triple {507#true} ~y1~0 := 0;~y2~0 := 0;~y3~0 := ~x1~0; {560#(and (= main_~y2~0 0) (= main_~y1~0 0) (= main_~x1~0 main_~y3~0))} is VALID [2022-04-28 13:57:02,064 INFO L290 TraceCheckUtils]: 17: Hoare triple {560#(and (= main_~y2~0 0) (= main_~y1~0 0) (= main_~x1~0 main_~y3~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {560#(and (= main_~y2~0 0) (= main_~y1~0 0) (= main_~x1~0 main_~y3~0))} is VALID [2022-04-28 13:57:02,065 INFO L290 TraceCheckUtils]: 18: Hoare triple {560#(and (= main_~y2~0 0) (= main_~y1~0 0) (= main_~x1~0 main_~y3~0))} assume !!(#t~post6 < 5);havoc #t~post6; {560#(and (= main_~y2~0 0) (= main_~y1~0 0) (= main_~x1~0 main_~y3~0))} is VALID [2022-04-28 13:57:02,065 INFO L272 TraceCheckUtils]: 19: Hoare triple {560#(and (= main_~y2~0 0) (= main_~y1~0 0) (= main_~x1~0 main_~y3~0))} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {570#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 13:57:02,066 INFO L290 TraceCheckUtils]: 20: Hoare triple {570#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {574#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 13:57:02,066 INFO L290 TraceCheckUtils]: 21: Hoare triple {574#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {508#false} is VALID [2022-04-28 13:57:02,066 INFO L290 TraceCheckUtils]: 22: Hoare triple {508#false} assume !false; {508#false} is VALID [2022-04-28 13:57:02,067 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 13:57:02,067 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 13:57:02,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 13:57:02,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352731920] [2022-04-28 13:57:02,067 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 13:57:02,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1497739426] [2022-04-28 13:57:02,067 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1497739426] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 13:57:02,067 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 13:57:02,067 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 13:57:02,068 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 13:57:02,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1633858237] [2022-04-28 13:57:02,068 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1633858237] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 13:57:02,068 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 13:57:02,068 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 13:57:02,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035338376] [2022-04-28 13:57:02,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 13:57:02,068 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 23 [2022-04-28 13:57:02,069 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 13:57:02,069 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 13:57:02,082 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 13:57:02,082 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 13:57:02,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 13:57:02,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 13:57:02,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 13:57:02,083 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 13:57:02,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:57:02,204 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2022-04-28 13:57:02,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 13:57:02,204 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 23 [2022-04-28 13:57:02,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 13:57:02,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 13:57:02,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-04-28 13:57:02,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 13:57:02,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 43 transitions. [2022-04-28 13:57:02,207 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 43 transitions. [2022-04-28 13:57:02,238 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:57:02,240 INFO L225 Difference]: With dead ends: 37 [2022-04-28 13:57:02,240 INFO L226 Difference]: Without dead ends: 35 [2022-04-28 13:57:02,240 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 19 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 13:57:02,241 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 7 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 13:57:02,241 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 83 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 13:57:02,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-28 13:57:02,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2022-04-28 13:57:02,256 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 13:57:02,256 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 32 states, 20 states have (on average 1.2) internal successors, (24), 22 states have internal predecessors, (24), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 13:57:02,256 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 32 states, 20 states have (on average 1.2) internal successors, (24), 22 states have internal predecessors, (24), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 13:57:02,256 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 32 states, 20 states have (on average 1.2) internal successors, (24), 22 states have internal predecessors, (24), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 13:57:02,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:57:02,258 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2022-04-28 13:57:02,258 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2022-04-28 13:57:02,259 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:57:02,259 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:57:02,259 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 20 states have (on average 1.2) internal successors, (24), 22 states have internal predecessors, (24), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) Second operand 35 states. [2022-04-28 13:57:02,259 INFO L87 Difference]: Start difference. First operand has 32 states, 20 states have (on average 1.2) internal successors, (24), 22 states have internal predecessors, (24), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) Second operand 35 states. [2022-04-28 13:57:02,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:57:02,261 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2022-04-28 13:57:02,261 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2022-04-28 13:57:02,262 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:57:02,262 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:57:02,262 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 13:57:02,262 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 13:57:02,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 20 states have (on average 1.2) internal successors, (24), 22 states have internal predecessors, (24), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 13:57:02,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2022-04-28 13:57:02,264 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 23 [2022-04-28 13:57:02,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 13:57:02,264 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2022-04-28 13:57:02,264 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 13:57:02,264 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 36 transitions. [2022-04-28 13:57:02,292 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 13:57:02,292 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2022-04-28 13:57:02,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-28 13:57:02,293 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 13:57:02,293 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 13:57:02,324 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 13:57:02,507 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 13:57:02,507 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 13:57:02,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 13:57:02,508 INFO L85 PathProgramCache]: Analyzing trace with hash -1019533657, now seen corresponding path program 1 times [2022-04-28 13:57:02,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 13:57:02,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [758716915] [2022-04-28 13:57:02,508 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 13:57:02,509 INFO L85 PathProgramCache]: Analyzing trace with hash -1019533657, now seen corresponding path program 2 times [2022-04-28 13:57:02,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 13:57:02,509 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338530567] [2022-04-28 13:57:02,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 13:57:02,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 13:57:02,524 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 13:57:02,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [129352205] [2022-04-28 13:57:02,524 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 13:57:02,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 13:57:02,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 13:57:02,525 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 13:57:02,526 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-28 13:57:02,557 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 13:57:02,557 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 13:57:02,558 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-28 13:57:02,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 13:57:02,569 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 13:57:02,697 INFO L272 TraceCheckUtils]: 0: Hoare triple {790#true} call ULTIMATE.init(); {790#true} is VALID [2022-04-28 13:57:02,697 INFO L290 TraceCheckUtils]: 1: Hoare triple {790#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {790#true} is VALID [2022-04-28 13:57:02,697 INFO L290 TraceCheckUtils]: 2: Hoare triple {790#true} assume true; {790#true} is VALID [2022-04-28 13:57:02,697 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {790#true} {790#true} #67#return; {790#true} is VALID [2022-04-28 13:57:02,697 INFO L272 TraceCheckUtils]: 4: Hoare triple {790#true} call #t~ret7 := main(); {790#true} is VALID [2022-04-28 13:57:02,697 INFO L290 TraceCheckUtils]: 5: Hoare triple {790#true} havoc ~x1~0;havoc ~x2~0;havoc ~y1~0;havoc ~y2~0;havoc ~y3~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x1~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~x2~0 := #t~nondet5;havoc #t~nondet5; {790#true} is VALID [2022-04-28 13:57:02,698 INFO L272 TraceCheckUtils]: 6: Hoare triple {790#true} call assume_abort_if_not((if ~x1~0 >= 0 then 1 else 0)); {790#true} is VALID [2022-04-28 13:57:02,698 INFO L290 TraceCheckUtils]: 7: Hoare triple {790#true} ~cond := #in~cond; {790#true} is VALID [2022-04-28 13:57:02,698 INFO L290 TraceCheckUtils]: 8: Hoare triple {790#true} assume !(0 == ~cond); {790#true} is VALID [2022-04-28 13:57:02,698 INFO L290 TraceCheckUtils]: 9: Hoare triple {790#true} assume true; {790#true} is VALID [2022-04-28 13:57:02,698 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {790#true} {790#true} #59#return; {790#true} is VALID [2022-04-28 13:57:02,698 INFO L272 TraceCheckUtils]: 11: Hoare triple {790#true} call assume_abort_if_not((if 0 != ~x2~0 then 1 else 0)); {790#true} is VALID [2022-04-28 13:57:02,698 INFO L290 TraceCheckUtils]: 12: Hoare triple {790#true} ~cond := #in~cond; {790#true} is VALID [2022-04-28 13:57:02,698 INFO L290 TraceCheckUtils]: 13: Hoare triple {790#true} assume !(0 == ~cond); {790#true} is VALID [2022-04-28 13:57:02,698 INFO L290 TraceCheckUtils]: 14: Hoare triple {790#true} assume true; {790#true} is VALID [2022-04-28 13:57:02,698 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {790#true} {790#true} #61#return; {790#true} is VALID [2022-04-28 13:57:02,699 INFO L290 TraceCheckUtils]: 16: Hoare triple {790#true} ~y1~0 := 0;~y2~0 := 0;~y3~0 := ~x1~0; {790#true} is VALID [2022-04-28 13:57:02,699 INFO L290 TraceCheckUtils]: 17: Hoare triple {790#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {790#true} is VALID [2022-04-28 13:57:02,699 INFO L290 TraceCheckUtils]: 18: Hoare triple {790#true} assume !!(#t~post6 < 5);havoc #t~post6; {790#true} is VALID [2022-04-28 13:57:02,699 INFO L272 TraceCheckUtils]: 19: Hoare triple {790#true} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {790#true} is VALID [2022-04-28 13:57:02,699 INFO L290 TraceCheckUtils]: 20: Hoare triple {790#true} ~cond := #in~cond; {855#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 13:57:02,700 INFO L290 TraceCheckUtils]: 21: Hoare triple {855#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {859#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 13:57:02,700 INFO L290 TraceCheckUtils]: 22: Hoare triple {859#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {859#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 13:57:02,700 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {859#(not (= |__VERIFIER_assert_#in~cond| 0))} {790#true} #63#return; {866#(= (+ (* main_~x2~0 main_~y1~0) main_~y3~0 main_~y2~0) main_~x1~0)} is VALID [2022-04-28 13:57:02,701 INFO L290 TraceCheckUtils]: 24: Hoare triple {866#(= (+ (* main_~x2~0 main_~y1~0) main_~y3~0 main_~y2~0) main_~x1~0)} assume !(0 != ~y3~0); {870#(= (+ (* main_~x2~0 main_~y1~0) main_~y2~0) main_~x1~0)} is VALID [2022-04-28 13:57:02,701 INFO L272 TraceCheckUtils]: 25: Hoare triple {870#(= (+ (* main_~x2~0 main_~y1~0) main_~y2~0) main_~x1~0)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 == ~x1~0 then 1 else 0)); {874#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 13:57:02,702 INFO L290 TraceCheckUtils]: 26: Hoare triple {874#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {878#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 13:57:02,702 INFO L290 TraceCheckUtils]: 27: Hoare triple {878#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {791#false} is VALID [2022-04-28 13:57:02,702 INFO L290 TraceCheckUtils]: 28: Hoare triple {791#false} assume !false; {791#false} is VALID [2022-04-28 13:57:02,702 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 13:57:02,703 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 13:57:08,956 INFO L290 TraceCheckUtils]: 28: Hoare triple {791#false} assume !false; {791#false} is VALID [2022-04-28 13:57:08,957 INFO L290 TraceCheckUtils]: 27: Hoare triple {878#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {791#false} is VALID [2022-04-28 13:57:08,957 INFO L290 TraceCheckUtils]: 26: Hoare triple {874#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {878#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 13:57:08,958 INFO L272 TraceCheckUtils]: 25: Hoare triple {870#(= (+ (* main_~x2~0 main_~y1~0) main_~y2~0) main_~x1~0)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 == ~x1~0 then 1 else 0)); {874#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 13:57:08,958 INFO L290 TraceCheckUtils]: 24: Hoare triple {897#(or (not (= main_~y3~0 0)) (= (+ (* main_~x2~0 main_~y1~0) main_~y2~0) main_~x1~0))} assume !(0 != ~y3~0); {870#(= (+ (* main_~x2~0 main_~y1~0) main_~y2~0) main_~x1~0)} is VALID [2022-04-28 13:57:08,959 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {859#(not (= |__VERIFIER_assert_#in~cond| 0))} {790#true} #63#return; {897#(or (not (= main_~y3~0 0)) (= (+ (* main_~x2~0 main_~y1~0) main_~y2~0) main_~x1~0))} is VALID [2022-04-28 13:57:08,960 INFO L290 TraceCheckUtils]: 22: Hoare triple {859#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {859#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 13:57:08,961 INFO L290 TraceCheckUtils]: 21: Hoare triple {910#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {859#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 13:57:08,961 INFO L290 TraceCheckUtils]: 20: Hoare triple {790#true} ~cond := #in~cond; {910#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 13:57:08,961 INFO L272 TraceCheckUtils]: 19: Hoare triple {790#true} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {790#true} is VALID [2022-04-28 13:57:08,961 INFO L290 TraceCheckUtils]: 18: Hoare triple {790#true} assume !!(#t~post6 < 5);havoc #t~post6; {790#true} is VALID [2022-04-28 13:57:08,961 INFO L290 TraceCheckUtils]: 17: Hoare triple {790#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {790#true} is VALID [2022-04-28 13:57:08,961 INFO L290 TraceCheckUtils]: 16: Hoare triple {790#true} ~y1~0 := 0;~y2~0 := 0;~y3~0 := ~x1~0; {790#true} is VALID [2022-04-28 13:57:08,962 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {790#true} {790#true} #61#return; {790#true} is VALID [2022-04-28 13:57:08,962 INFO L290 TraceCheckUtils]: 14: Hoare triple {790#true} assume true; {790#true} is VALID [2022-04-28 13:57:08,962 INFO L290 TraceCheckUtils]: 13: Hoare triple {790#true} assume !(0 == ~cond); {790#true} is VALID [2022-04-28 13:57:08,962 INFO L290 TraceCheckUtils]: 12: Hoare triple {790#true} ~cond := #in~cond; {790#true} is VALID [2022-04-28 13:57:08,962 INFO L272 TraceCheckUtils]: 11: Hoare triple {790#true} call assume_abort_if_not((if 0 != ~x2~0 then 1 else 0)); {790#true} is VALID [2022-04-28 13:57:08,962 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {790#true} {790#true} #59#return; {790#true} is VALID [2022-04-28 13:57:08,962 INFO L290 TraceCheckUtils]: 9: Hoare triple {790#true} assume true; {790#true} is VALID [2022-04-28 13:57:08,962 INFO L290 TraceCheckUtils]: 8: Hoare triple {790#true} assume !(0 == ~cond); {790#true} is VALID [2022-04-28 13:57:08,962 INFO L290 TraceCheckUtils]: 7: Hoare triple {790#true} ~cond := #in~cond; {790#true} is VALID [2022-04-28 13:57:08,962 INFO L272 TraceCheckUtils]: 6: Hoare triple {790#true} call assume_abort_if_not((if ~x1~0 >= 0 then 1 else 0)); {790#true} is VALID [2022-04-28 13:57:08,963 INFO L290 TraceCheckUtils]: 5: Hoare triple {790#true} havoc ~x1~0;havoc ~x2~0;havoc ~y1~0;havoc ~y2~0;havoc ~y3~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x1~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~x2~0 := #t~nondet5;havoc #t~nondet5; {790#true} is VALID [2022-04-28 13:57:08,963 INFO L272 TraceCheckUtils]: 4: Hoare triple {790#true} call #t~ret7 := main(); {790#true} is VALID [2022-04-28 13:57:08,963 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {790#true} {790#true} #67#return; {790#true} is VALID [2022-04-28 13:57:08,963 INFO L290 TraceCheckUtils]: 2: Hoare triple {790#true} assume true; {790#true} is VALID [2022-04-28 13:57:08,963 INFO L290 TraceCheckUtils]: 1: Hoare triple {790#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {790#true} is VALID [2022-04-28 13:57:08,963 INFO L272 TraceCheckUtils]: 0: Hoare triple {790#true} call ULTIMATE.init(); {790#true} is VALID [2022-04-28 13:57:08,963 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 13:57:08,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 13:57:08,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338530567] [2022-04-28 13:57:08,963 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 13:57:08,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [129352205] [2022-04-28 13:57:08,964 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [129352205] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 13:57:08,964 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 13:57:08,964 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2022-04-28 13:57:08,964 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 13:57:08,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [758716915] [2022-04-28 13:57:08,964 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [758716915] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 13:57:08,964 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 13:57:08,964 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 13:57:08,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228470181] [2022-04-28 13:57:08,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 13:57:08,965 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 29 [2022-04-28 13:57:08,965 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 13:57:08,965 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-28 13:57:08,995 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:57:08,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 13:57:08,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 13:57:08,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 13:57:08,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-04-28 13:57:08,997 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-28 13:57:09,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:57:09,214 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2022-04-28 13:57:09,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 13:57:09,214 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 29 [2022-04-28 13:57:09,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 13:57:09,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-28 13:57:09,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 35 transitions. [2022-04-28 13:57:09,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-28 13:57:09,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 35 transitions. [2022-04-28 13:57:09,234 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 35 transitions. [2022-04-28 13:57:09,266 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 13:57:09,267 INFO L225 Difference]: With dead ends: 39 [2022-04-28 13:57:09,267 INFO L226 Difference]: Without dead ends: 34 [2022-04-28 13:57:09,268 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2022-04-28 13:57:09,268 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 17 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 13:57:09,269 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 103 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 13:57:09,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-28 13:57:09,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 29. [2022-04-28 13:57:09,286 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 13:57:09,286 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 29 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 6 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 13:57:09,286 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 29 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 6 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 13:57:09,286 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 29 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 6 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 13:57:09,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:57:09,289 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2022-04-28 13:57:09,289 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2022-04-28 13:57:09,291 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:57:09,291 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:57:09,292 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 6 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 34 states. [2022-04-28 13:57:09,293 INFO L87 Difference]: Start difference. First operand has 29 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 6 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 34 states. [2022-04-28 13:57:09,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:57:09,296 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2022-04-28 13:57:09,296 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2022-04-28 13:57:09,296 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:57:09,296 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:57:09,296 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 13:57:09,297 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 13:57:09,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 6 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 13:57:09,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2022-04-28 13:57:09,297 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 29 [2022-04-28 13:57:09,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 13:57:09,298 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2022-04-28 13:57:09,298 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-28 13:57:09,298 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 31 transitions. [2022-04-28 13:57:09,332 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 13:57:09,332 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2022-04-28 13:57:09,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-28 13:57:09,332 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 13:57:09,333 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 13:57:09,352 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-28 13:57:09,533 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 13:57:09,534 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 13:57:09,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 13:57:09,534 INFO L85 PathProgramCache]: Analyzing trace with hash 1080225052, now seen corresponding path program 1 times [2022-04-28 13:57:09,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 13:57:09,534 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [923555549] [2022-04-28 13:57:09,534 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 13:57:09,534 INFO L85 PathProgramCache]: Analyzing trace with hash 1080225052, now seen corresponding path program 2 times [2022-04-28 13:57:09,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 13:57:09,535 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306934856] [2022-04-28 13:57:09,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 13:57:09,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 13:57:09,547 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 13:57:09,547 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2066567512] [2022-04-28 13:57:09,548 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 13:57:09,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 13:57:09,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 13:57:09,556 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 13:57:09,561 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 13:57:09,596 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 13:57:09,596 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 13:57:09,597 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 13:57:09,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 13:57:09,605 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 13:57:09,747 INFO L272 TraceCheckUtils]: 0: Hoare triple {1183#true} call ULTIMATE.init(); {1183#true} is VALID [2022-04-28 13:57:09,748 INFO L290 TraceCheckUtils]: 1: Hoare triple {1183#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1191#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:09,748 INFO L290 TraceCheckUtils]: 2: Hoare triple {1191#(<= ~counter~0 0)} assume true; {1191#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:09,749 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1191#(<= ~counter~0 0)} {1183#true} #67#return; {1191#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:09,749 INFO L272 TraceCheckUtils]: 4: Hoare triple {1191#(<= ~counter~0 0)} call #t~ret7 := main(); {1191#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:09,750 INFO L290 TraceCheckUtils]: 5: Hoare triple {1191#(<= ~counter~0 0)} havoc ~x1~0;havoc ~x2~0;havoc ~y1~0;havoc ~y2~0;havoc ~y3~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x1~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~x2~0 := #t~nondet5;havoc #t~nondet5; {1191#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:09,750 INFO L272 TraceCheckUtils]: 6: Hoare triple {1191#(<= ~counter~0 0)} call assume_abort_if_not((if ~x1~0 >= 0 then 1 else 0)); {1191#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:09,751 INFO L290 TraceCheckUtils]: 7: Hoare triple {1191#(<= ~counter~0 0)} ~cond := #in~cond; {1191#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:09,753 INFO L290 TraceCheckUtils]: 8: Hoare triple {1191#(<= ~counter~0 0)} assume !(0 == ~cond); {1191#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:09,753 INFO L290 TraceCheckUtils]: 9: Hoare triple {1191#(<= ~counter~0 0)} assume true; {1191#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:09,754 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1191#(<= ~counter~0 0)} {1191#(<= ~counter~0 0)} #59#return; {1191#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:09,754 INFO L272 TraceCheckUtils]: 11: Hoare triple {1191#(<= ~counter~0 0)} call assume_abort_if_not((if 0 != ~x2~0 then 1 else 0)); {1191#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:09,754 INFO L290 TraceCheckUtils]: 12: Hoare triple {1191#(<= ~counter~0 0)} ~cond := #in~cond; {1191#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:09,755 INFO L290 TraceCheckUtils]: 13: Hoare triple {1191#(<= ~counter~0 0)} assume !(0 == ~cond); {1191#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:09,755 INFO L290 TraceCheckUtils]: 14: Hoare triple {1191#(<= ~counter~0 0)} assume true; {1191#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:09,756 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1191#(<= ~counter~0 0)} {1191#(<= ~counter~0 0)} #61#return; {1191#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:09,756 INFO L290 TraceCheckUtils]: 16: Hoare triple {1191#(<= ~counter~0 0)} ~y1~0 := 0;~y2~0 := 0;~y3~0 := ~x1~0; {1191#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:09,756 INFO L290 TraceCheckUtils]: 17: Hoare triple {1191#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1240#(<= ~counter~0 1)} is VALID [2022-04-28 13:57:09,757 INFO L290 TraceCheckUtils]: 18: Hoare triple {1240#(<= ~counter~0 1)} assume !!(#t~post6 < 5);havoc #t~post6; {1240#(<= ~counter~0 1)} is VALID [2022-04-28 13:57:09,757 INFO L272 TraceCheckUtils]: 19: Hoare triple {1240#(<= ~counter~0 1)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {1240#(<= ~counter~0 1)} is VALID [2022-04-28 13:57:09,758 INFO L290 TraceCheckUtils]: 20: Hoare triple {1240#(<= ~counter~0 1)} ~cond := #in~cond; {1240#(<= ~counter~0 1)} is VALID [2022-04-28 13:57:09,758 INFO L290 TraceCheckUtils]: 21: Hoare triple {1240#(<= ~counter~0 1)} assume !(0 == ~cond); {1240#(<= ~counter~0 1)} is VALID [2022-04-28 13:57:09,758 INFO L290 TraceCheckUtils]: 22: Hoare triple {1240#(<= ~counter~0 1)} assume true; {1240#(<= ~counter~0 1)} is VALID [2022-04-28 13:57:09,759 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1240#(<= ~counter~0 1)} {1240#(<= ~counter~0 1)} #63#return; {1240#(<= ~counter~0 1)} is VALID [2022-04-28 13:57:09,759 INFO L290 TraceCheckUtils]: 24: Hoare triple {1240#(<= ~counter~0 1)} assume !!(0 != ~y3~0); {1240#(<= ~counter~0 1)} is VALID [2022-04-28 13:57:09,759 INFO L290 TraceCheckUtils]: 25: Hoare triple {1240#(<= ~counter~0 1)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {1240#(<= ~counter~0 1)} is VALID [2022-04-28 13:57:09,760 INFO L290 TraceCheckUtils]: 26: Hoare triple {1240#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1268#(<= |main_#t~post6| 1)} is VALID [2022-04-28 13:57:09,760 INFO L290 TraceCheckUtils]: 27: Hoare triple {1268#(<= |main_#t~post6| 1)} assume !(#t~post6 < 5);havoc #t~post6; {1184#false} is VALID [2022-04-28 13:57:09,760 INFO L272 TraceCheckUtils]: 28: Hoare triple {1184#false} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 == ~x1~0 then 1 else 0)); {1184#false} is VALID [2022-04-28 13:57:09,760 INFO L290 TraceCheckUtils]: 29: Hoare triple {1184#false} ~cond := #in~cond; {1184#false} is VALID [2022-04-28 13:57:09,761 INFO L290 TraceCheckUtils]: 30: Hoare triple {1184#false} assume 0 == ~cond; {1184#false} is VALID [2022-04-28 13:57:09,761 INFO L290 TraceCheckUtils]: 31: Hoare triple {1184#false} assume !false; {1184#false} is VALID [2022-04-28 13:57:09,761 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 13:57:09,761 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 13:57:09,942 INFO L290 TraceCheckUtils]: 31: Hoare triple {1184#false} assume !false; {1184#false} is VALID [2022-04-28 13:57:09,943 INFO L290 TraceCheckUtils]: 30: Hoare triple {1184#false} assume 0 == ~cond; {1184#false} is VALID [2022-04-28 13:57:09,943 INFO L290 TraceCheckUtils]: 29: Hoare triple {1184#false} ~cond := #in~cond; {1184#false} is VALID [2022-04-28 13:57:09,943 INFO L272 TraceCheckUtils]: 28: Hoare triple {1184#false} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 == ~x1~0 then 1 else 0)); {1184#false} is VALID [2022-04-28 13:57:09,951 INFO L290 TraceCheckUtils]: 27: Hoare triple {1296#(< |main_#t~post6| 5)} assume !(#t~post6 < 5);havoc #t~post6; {1184#false} is VALID [2022-04-28 13:57:09,952 INFO L290 TraceCheckUtils]: 26: Hoare triple {1300#(< ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1296#(< |main_#t~post6| 5)} is VALID [2022-04-28 13:57:09,952 INFO L290 TraceCheckUtils]: 25: Hoare triple {1300#(< ~counter~0 5)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {1300#(< ~counter~0 5)} is VALID [2022-04-28 13:57:09,953 INFO L290 TraceCheckUtils]: 24: Hoare triple {1300#(< ~counter~0 5)} assume !!(0 != ~y3~0); {1300#(< ~counter~0 5)} is VALID [2022-04-28 13:57:09,954 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1183#true} {1300#(< ~counter~0 5)} #63#return; {1300#(< ~counter~0 5)} is VALID [2022-04-28 13:57:09,954 INFO L290 TraceCheckUtils]: 22: Hoare triple {1183#true} assume true; {1183#true} is VALID [2022-04-28 13:57:09,954 INFO L290 TraceCheckUtils]: 21: Hoare triple {1183#true} assume !(0 == ~cond); {1183#true} is VALID [2022-04-28 13:57:09,954 INFO L290 TraceCheckUtils]: 20: Hoare triple {1183#true} ~cond := #in~cond; {1183#true} is VALID [2022-04-28 13:57:09,954 INFO L272 TraceCheckUtils]: 19: Hoare triple {1300#(< ~counter~0 5)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {1183#true} is VALID [2022-04-28 13:57:09,955 INFO L290 TraceCheckUtils]: 18: Hoare triple {1300#(< ~counter~0 5)} assume !!(#t~post6 < 5);havoc #t~post6; {1300#(< ~counter~0 5)} is VALID [2022-04-28 13:57:09,955 INFO L290 TraceCheckUtils]: 17: Hoare triple {1328#(< ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1300#(< ~counter~0 5)} is VALID [2022-04-28 13:57:09,956 INFO L290 TraceCheckUtils]: 16: Hoare triple {1328#(< ~counter~0 4)} ~y1~0 := 0;~y2~0 := 0;~y3~0 := ~x1~0; {1328#(< ~counter~0 4)} is VALID [2022-04-28 13:57:09,956 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1183#true} {1328#(< ~counter~0 4)} #61#return; {1328#(< ~counter~0 4)} is VALID [2022-04-28 13:57:09,956 INFO L290 TraceCheckUtils]: 14: Hoare triple {1183#true} assume true; {1183#true} is VALID [2022-04-28 13:57:09,956 INFO L290 TraceCheckUtils]: 13: Hoare triple {1183#true} assume !(0 == ~cond); {1183#true} is VALID [2022-04-28 13:57:09,956 INFO L290 TraceCheckUtils]: 12: Hoare triple {1183#true} ~cond := #in~cond; {1183#true} is VALID [2022-04-28 13:57:09,957 INFO L272 TraceCheckUtils]: 11: Hoare triple {1328#(< ~counter~0 4)} call assume_abort_if_not((if 0 != ~x2~0 then 1 else 0)); {1183#true} is VALID [2022-04-28 13:57:09,957 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1183#true} {1328#(< ~counter~0 4)} #59#return; {1328#(< ~counter~0 4)} is VALID [2022-04-28 13:57:09,957 INFO L290 TraceCheckUtils]: 9: Hoare triple {1183#true} assume true; {1183#true} is VALID [2022-04-28 13:57:09,957 INFO L290 TraceCheckUtils]: 8: Hoare triple {1183#true} assume !(0 == ~cond); {1183#true} is VALID [2022-04-28 13:57:09,958 INFO L290 TraceCheckUtils]: 7: Hoare triple {1183#true} ~cond := #in~cond; {1183#true} is VALID [2022-04-28 13:57:09,958 INFO L272 TraceCheckUtils]: 6: Hoare triple {1328#(< ~counter~0 4)} call assume_abort_if_not((if ~x1~0 >= 0 then 1 else 0)); {1183#true} is VALID [2022-04-28 13:57:09,958 INFO L290 TraceCheckUtils]: 5: Hoare triple {1328#(< ~counter~0 4)} havoc ~x1~0;havoc ~x2~0;havoc ~y1~0;havoc ~y2~0;havoc ~y3~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x1~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~x2~0 := #t~nondet5;havoc #t~nondet5; {1328#(< ~counter~0 4)} is VALID [2022-04-28 13:57:09,958 INFO L272 TraceCheckUtils]: 4: Hoare triple {1328#(< ~counter~0 4)} call #t~ret7 := main(); {1328#(< ~counter~0 4)} is VALID [2022-04-28 13:57:09,959 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1328#(< ~counter~0 4)} {1183#true} #67#return; {1328#(< ~counter~0 4)} is VALID [2022-04-28 13:57:09,959 INFO L290 TraceCheckUtils]: 2: Hoare triple {1328#(< ~counter~0 4)} assume true; {1328#(< ~counter~0 4)} is VALID [2022-04-28 13:57:09,960 INFO L290 TraceCheckUtils]: 1: Hoare triple {1183#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1328#(< ~counter~0 4)} is VALID [2022-04-28 13:57:09,960 INFO L272 TraceCheckUtils]: 0: Hoare triple {1183#true} call ULTIMATE.init(); {1183#true} is VALID [2022-04-28 13:57:09,960 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 13:57:09,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 13:57:09,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306934856] [2022-04-28 13:57:09,961 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 13:57:09,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2066567512] [2022-04-28 13:57:09,961 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2066567512] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 13:57:09,961 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 13:57:09,961 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-04-28 13:57:09,961 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 13:57:09,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [923555549] [2022-04-28 13:57:09,961 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [923555549] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 13:57:09,961 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 13:57:09,961 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 13:57:09,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209043489] [2022-04-28 13:57:09,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 13:57:09,962 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 32 [2022-04-28 13:57:09,962 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 13:57:09,962 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-28 13:57:09,984 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 13:57:09,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 13:57:09,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 13:57:09,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 13:57:09,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-04-28 13:57:09,985 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-28 13:57:10,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:57:10,084 INFO L93 Difference]: Finished difference Result 43 states and 46 transitions. [2022-04-28 13:57:10,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 13:57:10,085 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 32 [2022-04-28 13:57:10,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 13:57:10,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-28 13:57:10,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 45 transitions. [2022-04-28 13:57:10,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-28 13:57:10,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 45 transitions. [2022-04-28 13:57:10,093 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 45 transitions. [2022-04-28 13:57:10,130 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:57:10,132 INFO L225 Difference]: With dead ends: 43 [2022-04-28 13:57:10,132 INFO L226 Difference]: Without dead ends: 38 [2022-04-28 13:57:10,133 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 57 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 13:57:10,136 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 7 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 13:57:10,137 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 78 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 13:57:10,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-04-28 13:57:10,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-04-28 13:57:10,171 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 13:57:10,171 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand has 38 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 26 states have internal predecessors, (29), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 13:57:10,171 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand has 38 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 26 states have internal predecessors, (29), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 13:57:10,172 INFO L87 Difference]: Start difference. First operand 38 states. Second operand has 38 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 26 states have internal predecessors, (29), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 13:57:10,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:57:10,175 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2022-04-28 13:57:10,175 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2022-04-28 13:57:10,176 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:57:10,176 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:57:10,176 INFO L74 IsIncluded]: Start isIncluded. First operand has 38 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 26 states have internal predecessors, (29), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 38 states. [2022-04-28 13:57:10,177 INFO L87 Difference]: Start difference. First operand has 38 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 26 states have internal predecessors, (29), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 38 states. [2022-04-28 13:57:10,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:57:10,181 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2022-04-28 13:57:10,181 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2022-04-28 13:57:10,181 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:57:10,181 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:57:10,181 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 13:57:10,181 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 13:57:10,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 26 states have internal predecessors, (29), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 13:57:10,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2022-04-28 13:57:10,185 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 32 [2022-04-28 13:57:10,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 13:57:10,185 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2022-04-28 13:57:10,185 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-28 13:57:10,185 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 41 transitions. [2022-04-28 13:57:10,222 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:57:10,222 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2022-04-28 13:57:10,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-28 13:57:10,223 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 13:57:10,223 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 13:57:10,241 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 13:57:10,441 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 13:57:10,441 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 13:57:10,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 13:57:10,442 INFO L85 PathProgramCache]: Analyzing trace with hash 1448743382, now seen corresponding path program 3 times [2022-04-28 13:57:10,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 13:57:10,442 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [755053365] [2022-04-28 13:57:10,442 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 13:57:10,442 INFO L85 PathProgramCache]: Analyzing trace with hash 1448743382, now seen corresponding path program 4 times [2022-04-28 13:57:10,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 13:57:10,442 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28905165] [2022-04-28 13:57:10,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 13:57:10,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 13:57:10,462 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 13:57:10,463 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1295009188] [2022-04-28 13:57:10,463 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 13:57:10,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 13:57:10,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 13:57:10,468 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 13:57:10,469 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 13:57:10,504 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 13:57:10,504 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 13:57:10,505 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 13:57:10,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 13:57:10,517 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 13:57:10,685 INFO L272 TraceCheckUtils]: 0: Hoare triple {1622#true} call ULTIMATE.init(); {1622#true} is VALID [2022-04-28 13:57:10,686 INFO L290 TraceCheckUtils]: 1: Hoare triple {1622#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1630#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:10,686 INFO L290 TraceCheckUtils]: 2: Hoare triple {1630#(<= ~counter~0 0)} assume true; {1630#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:10,687 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1630#(<= ~counter~0 0)} {1622#true} #67#return; {1630#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:10,687 INFO L272 TraceCheckUtils]: 4: Hoare triple {1630#(<= ~counter~0 0)} call #t~ret7 := main(); {1630#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:10,687 INFO L290 TraceCheckUtils]: 5: Hoare triple {1630#(<= ~counter~0 0)} havoc ~x1~0;havoc ~x2~0;havoc ~y1~0;havoc ~y2~0;havoc ~y3~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x1~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~x2~0 := #t~nondet5;havoc #t~nondet5; {1630#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:10,688 INFO L272 TraceCheckUtils]: 6: Hoare triple {1630#(<= ~counter~0 0)} call assume_abort_if_not((if ~x1~0 >= 0 then 1 else 0)); {1630#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:10,688 INFO L290 TraceCheckUtils]: 7: Hoare triple {1630#(<= ~counter~0 0)} ~cond := #in~cond; {1630#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:10,688 INFO L290 TraceCheckUtils]: 8: Hoare triple {1630#(<= ~counter~0 0)} assume !(0 == ~cond); {1630#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:10,688 INFO L290 TraceCheckUtils]: 9: Hoare triple {1630#(<= ~counter~0 0)} assume true; {1630#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:10,689 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1630#(<= ~counter~0 0)} {1630#(<= ~counter~0 0)} #59#return; {1630#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:10,689 INFO L272 TraceCheckUtils]: 11: Hoare triple {1630#(<= ~counter~0 0)} call assume_abort_if_not((if 0 != ~x2~0 then 1 else 0)); {1630#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:10,691 INFO L290 TraceCheckUtils]: 12: Hoare triple {1630#(<= ~counter~0 0)} ~cond := #in~cond; {1630#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:10,691 INFO L290 TraceCheckUtils]: 13: Hoare triple {1630#(<= ~counter~0 0)} assume !(0 == ~cond); {1630#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:10,691 INFO L290 TraceCheckUtils]: 14: Hoare triple {1630#(<= ~counter~0 0)} assume true; {1630#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:10,692 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1630#(<= ~counter~0 0)} {1630#(<= ~counter~0 0)} #61#return; {1630#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:10,692 INFO L290 TraceCheckUtils]: 16: Hoare triple {1630#(<= ~counter~0 0)} ~y1~0 := 0;~y2~0 := 0;~y3~0 := ~x1~0; {1630#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:10,692 INFO L290 TraceCheckUtils]: 17: Hoare triple {1630#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1679#(<= ~counter~0 1)} is VALID [2022-04-28 13:57:10,693 INFO L290 TraceCheckUtils]: 18: Hoare triple {1679#(<= ~counter~0 1)} assume !!(#t~post6 < 5);havoc #t~post6; {1679#(<= ~counter~0 1)} is VALID [2022-04-28 13:57:10,693 INFO L272 TraceCheckUtils]: 19: Hoare triple {1679#(<= ~counter~0 1)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {1679#(<= ~counter~0 1)} is VALID [2022-04-28 13:57:10,693 INFO L290 TraceCheckUtils]: 20: Hoare triple {1679#(<= ~counter~0 1)} ~cond := #in~cond; {1679#(<= ~counter~0 1)} is VALID [2022-04-28 13:57:10,694 INFO L290 TraceCheckUtils]: 21: Hoare triple {1679#(<= ~counter~0 1)} assume !(0 == ~cond); {1679#(<= ~counter~0 1)} is VALID [2022-04-28 13:57:10,694 INFO L290 TraceCheckUtils]: 22: Hoare triple {1679#(<= ~counter~0 1)} assume true; {1679#(<= ~counter~0 1)} is VALID [2022-04-28 13:57:10,694 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1679#(<= ~counter~0 1)} {1679#(<= ~counter~0 1)} #63#return; {1679#(<= ~counter~0 1)} is VALID [2022-04-28 13:57:10,695 INFO L290 TraceCheckUtils]: 24: Hoare triple {1679#(<= ~counter~0 1)} assume !!(0 != ~y3~0); {1679#(<= ~counter~0 1)} is VALID [2022-04-28 13:57:10,695 INFO L290 TraceCheckUtils]: 25: Hoare triple {1679#(<= ~counter~0 1)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {1679#(<= ~counter~0 1)} is VALID [2022-04-28 13:57:10,695 INFO L290 TraceCheckUtils]: 26: Hoare triple {1679#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1707#(<= ~counter~0 2)} is VALID [2022-04-28 13:57:10,696 INFO L290 TraceCheckUtils]: 27: Hoare triple {1707#(<= ~counter~0 2)} assume !!(#t~post6 < 5);havoc #t~post6; {1707#(<= ~counter~0 2)} is VALID [2022-04-28 13:57:10,696 INFO L272 TraceCheckUtils]: 28: Hoare triple {1707#(<= ~counter~0 2)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {1707#(<= ~counter~0 2)} is VALID [2022-04-28 13:57:10,696 INFO L290 TraceCheckUtils]: 29: Hoare triple {1707#(<= ~counter~0 2)} ~cond := #in~cond; {1707#(<= ~counter~0 2)} is VALID [2022-04-28 13:57:10,697 INFO L290 TraceCheckUtils]: 30: Hoare triple {1707#(<= ~counter~0 2)} assume !(0 == ~cond); {1707#(<= ~counter~0 2)} is VALID [2022-04-28 13:57:10,697 INFO L290 TraceCheckUtils]: 31: Hoare triple {1707#(<= ~counter~0 2)} assume true; {1707#(<= ~counter~0 2)} is VALID [2022-04-28 13:57:10,697 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1707#(<= ~counter~0 2)} {1707#(<= ~counter~0 2)} #63#return; {1707#(<= ~counter~0 2)} is VALID [2022-04-28 13:57:10,698 INFO L290 TraceCheckUtils]: 33: Hoare triple {1707#(<= ~counter~0 2)} assume !!(0 != ~y3~0); {1707#(<= ~counter~0 2)} is VALID [2022-04-28 13:57:10,698 INFO L290 TraceCheckUtils]: 34: Hoare triple {1707#(<= ~counter~0 2)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {1707#(<= ~counter~0 2)} is VALID [2022-04-28 13:57:10,698 INFO L290 TraceCheckUtils]: 35: Hoare triple {1707#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1735#(<= |main_#t~post6| 2)} is VALID [2022-04-28 13:57:10,699 INFO L290 TraceCheckUtils]: 36: Hoare triple {1735#(<= |main_#t~post6| 2)} assume !(#t~post6 < 5);havoc #t~post6; {1623#false} is VALID [2022-04-28 13:57:10,699 INFO L272 TraceCheckUtils]: 37: Hoare triple {1623#false} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 == ~x1~0 then 1 else 0)); {1623#false} is VALID [2022-04-28 13:57:10,699 INFO L290 TraceCheckUtils]: 38: Hoare triple {1623#false} ~cond := #in~cond; {1623#false} is VALID [2022-04-28 13:57:10,699 INFO L290 TraceCheckUtils]: 39: Hoare triple {1623#false} assume 0 == ~cond; {1623#false} is VALID [2022-04-28 13:57:10,699 INFO L290 TraceCheckUtils]: 40: Hoare triple {1623#false} assume !false; {1623#false} is VALID [2022-04-28 13:57:10,699 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 13:57:10,699 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 13:57:10,881 INFO L290 TraceCheckUtils]: 40: Hoare triple {1623#false} assume !false; {1623#false} is VALID [2022-04-28 13:57:10,881 INFO L290 TraceCheckUtils]: 39: Hoare triple {1623#false} assume 0 == ~cond; {1623#false} is VALID [2022-04-28 13:57:10,881 INFO L290 TraceCheckUtils]: 38: Hoare triple {1623#false} ~cond := #in~cond; {1623#false} is VALID [2022-04-28 13:57:10,881 INFO L272 TraceCheckUtils]: 37: Hoare triple {1623#false} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 == ~x1~0 then 1 else 0)); {1623#false} is VALID [2022-04-28 13:57:10,893 INFO L290 TraceCheckUtils]: 36: Hoare triple {1763#(< |main_#t~post6| 5)} assume !(#t~post6 < 5);havoc #t~post6; {1623#false} is VALID [2022-04-28 13:57:10,894 INFO L290 TraceCheckUtils]: 35: Hoare triple {1767#(< ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1763#(< |main_#t~post6| 5)} is VALID [2022-04-28 13:57:10,895 INFO L290 TraceCheckUtils]: 34: Hoare triple {1767#(< ~counter~0 5)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {1767#(< ~counter~0 5)} is VALID [2022-04-28 13:57:10,896 INFO L290 TraceCheckUtils]: 33: Hoare triple {1767#(< ~counter~0 5)} assume !!(0 != ~y3~0); {1767#(< ~counter~0 5)} is VALID [2022-04-28 13:57:10,896 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1622#true} {1767#(< ~counter~0 5)} #63#return; {1767#(< ~counter~0 5)} is VALID [2022-04-28 13:57:10,896 INFO L290 TraceCheckUtils]: 31: Hoare triple {1622#true} assume true; {1622#true} is VALID [2022-04-28 13:57:10,896 INFO L290 TraceCheckUtils]: 30: Hoare triple {1622#true} assume !(0 == ~cond); {1622#true} is VALID [2022-04-28 13:57:10,897 INFO L290 TraceCheckUtils]: 29: Hoare triple {1622#true} ~cond := #in~cond; {1622#true} is VALID [2022-04-28 13:57:10,897 INFO L272 TraceCheckUtils]: 28: Hoare triple {1767#(< ~counter~0 5)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {1622#true} is VALID [2022-04-28 13:57:10,897 INFO L290 TraceCheckUtils]: 27: Hoare triple {1767#(< ~counter~0 5)} assume !!(#t~post6 < 5);havoc #t~post6; {1767#(< ~counter~0 5)} is VALID [2022-04-28 13:57:10,898 INFO L290 TraceCheckUtils]: 26: Hoare triple {1795#(< ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1767#(< ~counter~0 5)} is VALID [2022-04-28 13:57:10,898 INFO L290 TraceCheckUtils]: 25: Hoare triple {1795#(< ~counter~0 4)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {1795#(< ~counter~0 4)} is VALID [2022-04-28 13:57:10,899 INFO L290 TraceCheckUtils]: 24: Hoare triple {1795#(< ~counter~0 4)} assume !!(0 != ~y3~0); {1795#(< ~counter~0 4)} is VALID [2022-04-28 13:57:10,899 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1622#true} {1795#(< ~counter~0 4)} #63#return; {1795#(< ~counter~0 4)} is VALID [2022-04-28 13:57:10,899 INFO L290 TraceCheckUtils]: 22: Hoare triple {1622#true} assume true; {1622#true} is VALID [2022-04-28 13:57:10,899 INFO L290 TraceCheckUtils]: 21: Hoare triple {1622#true} assume !(0 == ~cond); {1622#true} is VALID [2022-04-28 13:57:10,899 INFO L290 TraceCheckUtils]: 20: Hoare triple {1622#true} ~cond := #in~cond; {1622#true} is VALID [2022-04-28 13:57:10,899 INFO L272 TraceCheckUtils]: 19: Hoare triple {1795#(< ~counter~0 4)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {1622#true} is VALID [2022-04-28 13:57:10,900 INFO L290 TraceCheckUtils]: 18: Hoare triple {1795#(< ~counter~0 4)} assume !!(#t~post6 < 5);havoc #t~post6; {1795#(< ~counter~0 4)} is VALID [2022-04-28 13:57:10,900 INFO L290 TraceCheckUtils]: 17: Hoare triple {1707#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1795#(< ~counter~0 4)} is VALID [2022-04-28 13:57:10,900 INFO L290 TraceCheckUtils]: 16: Hoare triple {1707#(<= ~counter~0 2)} ~y1~0 := 0;~y2~0 := 0;~y3~0 := ~x1~0; {1707#(<= ~counter~0 2)} is VALID [2022-04-28 13:57:10,901 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1622#true} {1707#(<= ~counter~0 2)} #61#return; {1707#(<= ~counter~0 2)} is VALID [2022-04-28 13:57:10,901 INFO L290 TraceCheckUtils]: 14: Hoare triple {1622#true} assume true; {1622#true} is VALID [2022-04-28 13:57:10,901 INFO L290 TraceCheckUtils]: 13: Hoare triple {1622#true} assume !(0 == ~cond); {1622#true} is VALID [2022-04-28 13:57:10,901 INFO L290 TraceCheckUtils]: 12: Hoare triple {1622#true} ~cond := #in~cond; {1622#true} is VALID [2022-04-28 13:57:10,901 INFO L272 TraceCheckUtils]: 11: Hoare triple {1707#(<= ~counter~0 2)} call assume_abort_if_not((if 0 != ~x2~0 then 1 else 0)); {1622#true} is VALID [2022-04-28 13:57:10,901 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1622#true} {1707#(<= ~counter~0 2)} #59#return; {1707#(<= ~counter~0 2)} is VALID [2022-04-28 13:57:10,901 INFO L290 TraceCheckUtils]: 9: Hoare triple {1622#true} assume true; {1622#true} is VALID [2022-04-28 13:57:10,902 INFO L290 TraceCheckUtils]: 8: Hoare triple {1622#true} assume !(0 == ~cond); {1622#true} is VALID [2022-04-28 13:57:10,902 INFO L290 TraceCheckUtils]: 7: Hoare triple {1622#true} ~cond := #in~cond; {1622#true} is VALID [2022-04-28 13:57:10,902 INFO L272 TraceCheckUtils]: 6: Hoare triple {1707#(<= ~counter~0 2)} call assume_abort_if_not((if ~x1~0 >= 0 then 1 else 0)); {1622#true} is VALID [2022-04-28 13:57:10,902 INFO L290 TraceCheckUtils]: 5: Hoare triple {1707#(<= ~counter~0 2)} havoc ~x1~0;havoc ~x2~0;havoc ~y1~0;havoc ~y2~0;havoc ~y3~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x1~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~x2~0 := #t~nondet5;havoc #t~nondet5; {1707#(<= ~counter~0 2)} is VALID [2022-04-28 13:57:10,902 INFO L272 TraceCheckUtils]: 4: Hoare triple {1707#(<= ~counter~0 2)} call #t~ret7 := main(); {1707#(<= ~counter~0 2)} is VALID [2022-04-28 13:57:10,903 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1707#(<= ~counter~0 2)} {1622#true} #67#return; {1707#(<= ~counter~0 2)} is VALID [2022-04-28 13:57:10,903 INFO L290 TraceCheckUtils]: 2: Hoare triple {1707#(<= ~counter~0 2)} assume true; {1707#(<= ~counter~0 2)} is VALID [2022-04-28 13:57:10,903 INFO L290 TraceCheckUtils]: 1: Hoare triple {1622#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1707#(<= ~counter~0 2)} is VALID [2022-04-28 13:57:10,903 INFO L272 TraceCheckUtils]: 0: Hoare triple {1622#true} call ULTIMATE.init(); {1622#true} is VALID [2022-04-28 13:57:10,905 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-04-28 13:57:10,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 13:57:10,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28905165] [2022-04-28 13:57:10,905 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 13:57:10,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1295009188] [2022-04-28 13:57:10,906 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1295009188] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 13:57:10,906 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 13:57:10,906 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2022-04-28 13:57:10,906 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 13:57:10,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [755053365] [2022-04-28 13:57:10,906 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [755053365] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 13:57:10,924 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 13:57:10,924 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 13:57:10,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720830964] [2022-04-28 13:57:10,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 13:57:10,924 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 5 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) Word has length 41 [2022-04-28 13:57:10,924 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 13:57:10,925 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 5 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-28 13:57:10,947 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:57:10,947 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 13:57:10,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 13:57:10,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 13:57:10,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-04-28 13:57:10,948 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 5 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-28 13:57:11,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:57:11,051 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2022-04-28 13:57:11,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 13:57:11,051 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 5 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) Word has length 41 [2022-04-28 13:57:11,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 13:57:11,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 5 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-28 13:57:11,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 55 transitions. [2022-04-28 13:57:11,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 5 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-28 13:57:11,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 55 transitions. [2022-04-28 13:57:11,057 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 55 transitions. [2022-04-28 13:57:11,086 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:57:11,088 INFO L225 Difference]: With dead ends: 52 [2022-04-28 13:57:11,088 INFO L226 Difference]: Without dead ends: 47 [2022-04-28 13:57:11,089 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 73 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2022-04-28 13:57:11,090 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 15 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 13:57:11,090 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 80 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 13:57:11,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-04-28 13:57:11,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2022-04-28 13:57:11,118 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 13:57:11,118 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand has 47 states, 33 states have (on average 1.121212121212121) internal successors, (37), 33 states have internal predecessors, (37), 8 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 13:57:11,119 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand has 47 states, 33 states have (on average 1.121212121212121) internal successors, (37), 33 states have internal predecessors, (37), 8 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 13:57:11,119 INFO L87 Difference]: Start difference. First operand 47 states. Second operand has 47 states, 33 states have (on average 1.121212121212121) internal successors, (37), 33 states have internal predecessors, (37), 8 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 13:57:11,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:57:11,120 INFO L93 Difference]: Finished difference Result 47 states and 51 transitions. [2022-04-28 13:57:11,120 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2022-04-28 13:57:11,120 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:57:11,120 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:57:11,120 INFO L74 IsIncluded]: Start isIncluded. First operand has 47 states, 33 states have (on average 1.121212121212121) internal successors, (37), 33 states have internal predecessors, (37), 8 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 47 states. [2022-04-28 13:57:11,121 INFO L87 Difference]: Start difference. First operand has 47 states, 33 states have (on average 1.121212121212121) internal successors, (37), 33 states have internal predecessors, (37), 8 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 47 states. [2022-04-28 13:57:11,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:57:11,122 INFO L93 Difference]: Finished difference Result 47 states and 51 transitions. [2022-04-28 13:57:11,122 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2022-04-28 13:57:11,123 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:57:11,123 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:57:11,123 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 13:57:11,123 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 13:57:11,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 33 states have (on average 1.121212121212121) internal successors, (37), 33 states have internal predecessors, (37), 8 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 13:57:11,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2022-04-28 13:57:11,124 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 41 [2022-04-28 13:57:11,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 13:57:11,124 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2022-04-28 13:57:11,125 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 5 states have call successors, (7), 5 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-28 13:57:11,125 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 47 states and 51 transitions. [2022-04-28 13:57:11,169 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:57:11,170 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2022-04-28 13:57:11,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-28 13:57:11,170 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 13:57:11,170 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 13:57:11,195 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 13:57:11,375 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 13:57:11,375 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 13:57:11,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 13:57:11,376 INFO L85 PathProgramCache]: Analyzing trace with hash -678977956, now seen corresponding path program 5 times [2022-04-28 13:57:11,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 13:57:11,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1729612602] [2022-04-28 13:57:11,376 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 13:57:11,376 INFO L85 PathProgramCache]: Analyzing trace with hash -678977956, now seen corresponding path program 6 times [2022-04-28 13:57:11,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 13:57:11,377 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772573488] [2022-04-28 13:57:11,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 13:57:11,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 13:57:11,387 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 13:57:11,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [419179631] [2022-04-28 13:57:11,388 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 13:57:11,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 13:57:11,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 13:57:11,389 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 13:57:11,390 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-28 13:57:11,429 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-28 13:57:11,429 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 13:57:11,430 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-28 13:57:11,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 13:57:11,443 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 13:57:11,676 INFO L272 TraceCheckUtils]: 0: Hoare triple {2172#true} call ULTIMATE.init(); {2172#true} is VALID [2022-04-28 13:57:11,676 INFO L290 TraceCheckUtils]: 1: Hoare triple {2172#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2180#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:11,676 INFO L290 TraceCheckUtils]: 2: Hoare triple {2180#(<= ~counter~0 0)} assume true; {2180#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:11,677 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2180#(<= ~counter~0 0)} {2172#true} #67#return; {2180#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:11,677 INFO L272 TraceCheckUtils]: 4: Hoare triple {2180#(<= ~counter~0 0)} call #t~ret7 := main(); {2180#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:11,677 INFO L290 TraceCheckUtils]: 5: Hoare triple {2180#(<= ~counter~0 0)} havoc ~x1~0;havoc ~x2~0;havoc ~y1~0;havoc ~y2~0;havoc ~y3~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x1~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~x2~0 := #t~nondet5;havoc #t~nondet5; {2180#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:11,678 INFO L272 TraceCheckUtils]: 6: Hoare triple {2180#(<= ~counter~0 0)} call assume_abort_if_not((if ~x1~0 >= 0 then 1 else 0)); {2180#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:11,679 INFO L290 TraceCheckUtils]: 7: Hoare triple {2180#(<= ~counter~0 0)} ~cond := #in~cond; {2180#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:11,679 INFO L290 TraceCheckUtils]: 8: Hoare triple {2180#(<= ~counter~0 0)} assume !(0 == ~cond); {2180#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:11,679 INFO L290 TraceCheckUtils]: 9: Hoare triple {2180#(<= ~counter~0 0)} assume true; {2180#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:11,679 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2180#(<= ~counter~0 0)} {2180#(<= ~counter~0 0)} #59#return; {2180#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:11,680 INFO L272 TraceCheckUtils]: 11: Hoare triple {2180#(<= ~counter~0 0)} call assume_abort_if_not((if 0 != ~x2~0 then 1 else 0)); {2180#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:11,680 INFO L290 TraceCheckUtils]: 12: Hoare triple {2180#(<= ~counter~0 0)} ~cond := #in~cond; {2180#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:11,680 INFO L290 TraceCheckUtils]: 13: Hoare triple {2180#(<= ~counter~0 0)} assume !(0 == ~cond); {2180#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:11,681 INFO L290 TraceCheckUtils]: 14: Hoare triple {2180#(<= ~counter~0 0)} assume true; {2180#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:11,681 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2180#(<= ~counter~0 0)} {2180#(<= ~counter~0 0)} #61#return; {2180#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:11,681 INFO L290 TraceCheckUtils]: 16: Hoare triple {2180#(<= ~counter~0 0)} ~y1~0 := 0;~y2~0 := 0;~y3~0 := ~x1~0; {2180#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:11,682 INFO L290 TraceCheckUtils]: 17: Hoare triple {2180#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2229#(<= ~counter~0 1)} is VALID [2022-04-28 13:57:11,683 INFO L290 TraceCheckUtils]: 18: Hoare triple {2229#(<= ~counter~0 1)} assume !!(#t~post6 < 5);havoc #t~post6; {2229#(<= ~counter~0 1)} is VALID [2022-04-28 13:57:11,683 INFO L272 TraceCheckUtils]: 19: Hoare triple {2229#(<= ~counter~0 1)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {2229#(<= ~counter~0 1)} is VALID [2022-04-28 13:57:11,684 INFO L290 TraceCheckUtils]: 20: Hoare triple {2229#(<= ~counter~0 1)} ~cond := #in~cond; {2229#(<= ~counter~0 1)} is VALID [2022-04-28 13:57:11,685 INFO L290 TraceCheckUtils]: 21: Hoare triple {2229#(<= ~counter~0 1)} assume !(0 == ~cond); {2229#(<= ~counter~0 1)} is VALID [2022-04-28 13:57:11,685 INFO L290 TraceCheckUtils]: 22: Hoare triple {2229#(<= ~counter~0 1)} assume true; {2229#(<= ~counter~0 1)} is VALID [2022-04-28 13:57:11,686 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2229#(<= ~counter~0 1)} {2229#(<= ~counter~0 1)} #63#return; {2229#(<= ~counter~0 1)} is VALID [2022-04-28 13:57:11,686 INFO L290 TraceCheckUtils]: 24: Hoare triple {2229#(<= ~counter~0 1)} assume !!(0 != ~y3~0); {2229#(<= ~counter~0 1)} is VALID [2022-04-28 13:57:11,686 INFO L290 TraceCheckUtils]: 25: Hoare triple {2229#(<= ~counter~0 1)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {2229#(<= ~counter~0 1)} is VALID [2022-04-28 13:57:11,687 INFO L290 TraceCheckUtils]: 26: Hoare triple {2229#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2257#(<= ~counter~0 2)} is VALID [2022-04-28 13:57:11,687 INFO L290 TraceCheckUtils]: 27: Hoare triple {2257#(<= ~counter~0 2)} assume !!(#t~post6 < 5);havoc #t~post6; {2257#(<= ~counter~0 2)} is VALID [2022-04-28 13:57:11,687 INFO L272 TraceCheckUtils]: 28: Hoare triple {2257#(<= ~counter~0 2)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {2257#(<= ~counter~0 2)} is VALID [2022-04-28 13:57:11,688 INFO L290 TraceCheckUtils]: 29: Hoare triple {2257#(<= ~counter~0 2)} ~cond := #in~cond; {2257#(<= ~counter~0 2)} is VALID [2022-04-28 13:57:11,688 INFO L290 TraceCheckUtils]: 30: Hoare triple {2257#(<= ~counter~0 2)} assume !(0 == ~cond); {2257#(<= ~counter~0 2)} is VALID [2022-04-28 13:57:11,688 INFO L290 TraceCheckUtils]: 31: Hoare triple {2257#(<= ~counter~0 2)} assume true; {2257#(<= ~counter~0 2)} is VALID [2022-04-28 13:57:11,689 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2257#(<= ~counter~0 2)} {2257#(<= ~counter~0 2)} #63#return; {2257#(<= ~counter~0 2)} is VALID [2022-04-28 13:57:11,689 INFO L290 TraceCheckUtils]: 33: Hoare triple {2257#(<= ~counter~0 2)} assume !!(0 != ~y3~0); {2257#(<= ~counter~0 2)} is VALID [2022-04-28 13:57:11,689 INFO L290 TraceCheckUtils]: 34: Hoare triple {2257#(<= ~counter~0 2)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {2257#(<= ~counter~0 2)} is VALID [2022-04-28 13:57:11,689 INFO L290 TraceCheckUtils]: 35: Hoare triple {2257#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2285#(<= ~counter~0 3)} is VALID [2022-04-28 13:57:11,690 INFO L290 TraceCheckUtils]: 36: Hoare triple {2285#(<= ~counter~0 3)} assume !!(#t~post6 < 5);havoc #t~post6; {2285#(<= ~counter~0 3)} is VALID [2022-04-28 13:57:11,690 INFO L272 TraceCheckUtils]: 37: Hoare triple {2285#(<= ~counter~0 3)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {2285#(<= ~counter~0 3)} is VALID [2022-04-28 13:57:11,690 INFO L290 TraceCheckUtils]: 38: Hoare triple {2285#(<= ~counter~0 3)} ~cond := #in~cond; {2285#(<= ~counter~0 3)} is VALID [2022-04-28 13:57:11,691 INFO L290 TraceCheckUtils]: 39: Hoare triple {2285#(<= ~counter~0 3)} assume !(0 == ~cond); {2285#(<= ~counter~0 3)} is VALID [2022-04-28 13:57:11,691 INFO L290 TraceCheckUtils]: 40: Hoare triple {2285#(<= ~counter~0 3)} assume true; {2285#(<= ~counter~0 3)} is VALID [2022-04-28 13:57:11,691 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {2285#(<= ~counter~0 3)} {2285#(<= ~counter~0 3)} #63#return; {2285#(<= ~counter~0 3)} is VALID [2022-04-28 13:57:11,692 INFO L290 TraceCheckUtils]: 42: Hoare triple {2285#(<= ~counter~0 3)} assume !!(0 != ~y3~0); {2285#(<= ~counter~0 3)} is VALID [2022-04-28 13:57:11,692 INFO L290 TraceCheckUtils]: 43: Hoare triple {2285#(<= ~counter~0 3)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {2285#(<= ~counter~0 3)} is VALID [2022-04-28 13:57:11,692 INFO L290 TraceCheckUtils]: 44: Hoare triple {2285#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2313#(<= |main_#t~post6| 3)} is VALID [2022-04-28 13:57:11,693 INFO L290 TraceCheckUtils]: 45: Hoare triple {2313#(<= |main_#t~post6| 3)} assume !(#t~post6 < 5);havoc #t~post6; {2173#false} is VALID [2022-04-28 13:57:11,693 INFO L272 TraceCheckUtils]: 46: Hoare triple {2173#false} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 == ~x1~0 then 1 else 0)); {2173#false} is VALID [2022-04-28 13:57:11,693 INFO L290 TraceCheckUtils]: 47: Hoare triple {2173#false} ~cond := #in~cond; {2173#false} is VALID [2022-04-28 13:57:11,693 INFO L290 TraceCheckUtils]: 48: Hoare triple {2173#false} assume 0 == ~cond; {2173#false} is VALID [2022-04-28 13:57:11,693 INFO L290 TraceCheckUtils]: 49: Hoare triple {2173#false} assume !false; {2173#false} is VALID [2022-04-28 13:57:11,693 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 6 proven. 33 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 13:57:11,693 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 13:57:11,908 INFO L290 TraceCheckUtils]: 49: Hoare triple {2173#false} assume !false; {2173#false} is VALID [2022-04-28 13:57:11,908 INFO L290 TraceCheckUtils]: 48: Hoare triple {2173#false} assume 0 == ~cond; {2173#false} is VALID [2022-04-28 13:57:11,908 INFO L290 TraceCheckUtils]: 47: Hoare triple {2173#false} ~cond := #in~cond; {2173#false} is VALID [2022-04-28 13:57:11,908 INFO L272 TraceCheckUtils]: 46: Hoare triple {2173#false} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 == ~x1~0 then 1 else 0)); {2173#false} is VALID [2022-04-28 13:57:11,909 INFO L290 TraceCheckUtils]: 45: Hoare triple {2341#(< |main_#t~post6| 5)} assume !(#t~post6 < 5);havoc #t~post6; {2173#false} is VALID [2022-04-28 13:57:11,909 INFO L290 TraceCheckUtils]: 44: Hoare triple {2345#(< ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2341#(< |main_#t~post6| 5)} is VALID [2022-04-28 13:57:11,909 INFO L290 TraceCheckUtils]: 43: Hoare triple {2345#(< ~counter~0 5)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {2345#(< ~counter~0 5)} is VALID [2022-04-28 13:57:11,910 INFO L290 TraceCheckUtils]: 42: Hoare triple {2345#(< ~counter~0 5)} assume !!(0 != ~y3~0); {2345#(< ~counter~0 5)} is VALID [2022-04-28 13:57:11,910 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {2172#true} {2345#(< ~counter~0 5)} #63#return; {2345#(< ~counter~0 5)} is VALID [2022-04-28 13:57:11,910 INFO L290 TraceCheckUtils]: 40: Hoare triple {2172#true} assume true; {2172#true} is VALID [2022-04-28 13:57:11,911 INFO L290 TraceCheckUtils]: 39: Hoare triple {2172#true} assume !(0 == ~cond); {2172#true} is VALID [2022-04-28 13:57:11,911 INFO L290 TraceCheckUtils]: 38: Hoare triple {2172#true} ~cond := #in~cond; {2172#true} is VALID [2022-04-28 13:57:11,911 INFO L272 TraceCheckUtils]: 37: Hoare triple {2345#(< ~counter~0 5)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {2172#true} is VALID [2022-04-28 13:57:11,911 INFO L290 TraceCheckUtils]: 36: Hoare triple {2345#(< ~counter~0 5)} assume !!(#t~post6 < 5);havoc #t~post6; {2345#(< ~counter~0 5)} is VALID [2022-04-28 13:57:11,912 INFO L290 TraceCheckUtils]: 35: Hoare triple {2285#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2345#(< ~counter~0 5)} is VALID [2022-04-28 13:57:11,912 INFO L290 TraceCheckUtils]: 34: Hoare triple {2285#(<= ~counter~0 3)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {2285#(<= ~counter~0 3)} is VALID [2022-04-28 13:57:11,912 INFO L290 TraceCheckUtils]: 33: Hoare triple {2285#(<= ~counter~0 3)} assume !!(0 != ~y3~0); {2285#(<= ~counter~0 3)} is VALID [2022-04-28 13:57:11,913 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2172#true} {2285#(<= ~counter~0 3)} #63#return; {2285#(<= ~counter~0 3)} is VALID [2022-04-28 13:57:11,913 INFO L290 TraceCheckUtils]: 31: Hoare triple {2172#true} assume true; {2172#true} is VALID [2022-04-28 13:57:11,913 INFO L290 TraceCheckUtils]: 30: Hoare triple {2172#true} assume !(0 == ~cond); {2172#true} is VALID [2022-04-28 13:57:11,913 INFO L290 TraceCheckUtils]: 29: Hoare triple {2172#true} ~cond := #in~cond; {2172#true} is VALID [2022-04-28 13:57:11,913 INFO L272 TraceCheckUtils]: 28: Hoare triple {2285#(<= ~counter~0 3)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {2172#true} is VALID [2022-04-28 13:57:11,913 INFO L290 TraceCheckUtils]: 27: Hoare triple {2285#(<= ~counter~0 3)} assume !!(#t~post6 < 5);havoc #t~post6; {2285#(<= ~counter~0 3)} is VALID [2022-04-28 13:57:11,914 INFO L290 TraceCheckUtils]: 26: Hoare triple {2257#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2285#(<= ~counter~0 3)} is VALID [2022-04-28 13:57:11,914 INFO L290 TraceCheckUtils]: 25: Hoare triple {2257#(<= ~counter~0 2)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {2257#(<= ~counter~0 2)} is VALID [2022-04-28 13:57:11,915 INFO L290 TraceCheckUtils]: 24: Hoare triple {2257#(<= ~counter~0 2)} assume !!(0 != ~y3~0); {2257#(<= ~counter~0 2)} is VALID [2022-04-28 13:57:11,915 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2172#true} {2257#(<= ~counter~0 2)} #63#return; {2257#(<= ~counter~0 2)} is VALID [2022-04-28 13:57:11,915 INFO L290 TraceCheckUtils]: 22: Hoare triple {2172#true} assume true; {2172#true} is VALID [2022-04-28 13:57:11,915 INFO L290 TraceCheckUtils]: 21: Hoare triple {2172#true} assume !(0 == ~cond); {2172#true} is VALID [2022-04-28 13:57:11,916 INFO L290 TraceCheckUtils]: 20: Hoare triple {2172#true} ~cond := #in~cond; {2172#true} is VALID [2022-04-28 13:57:11,916 INFO L272 TraceCheckUtils]: 19: Hoare triple {2257#(<= ~counter~0 2)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {2172#true} is VALID [2022-04-28 13:57:11,916 INFO L290 TraceCheckUtils]: 18: Hoare triple {2257#(<= ~counter~0 2)} assume !!(#t~post6 < 5);havoc #t~post6; {2257#(<= ~counter~0 2)} is VALID [2022-04-28 13:57:11,916 INFO L290 TraceCheckUtils]: 17: Hoare triple {2229#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2257#(<= ~counter~0 2)} is VALID [2022-04-28 13:57:11,917 INFO L290 TraceCheckUtils]: 16: Hoare triple {2229#(<= ~counter~0 1)} ~y1~0 := 0;~y2~0 := 0;~y3~0 := ~x1~0; {2229#(<= ~counter~0 1)} is VALID [2022-04-28 13:57:11,917 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2172#true} {2229#(<= ~counter~0 1)} #61#return; {2229#(<= ~counter~0 1)} is VALID [2022-04-28 13:57:11,917 INFO L290 TraceCheckUtils]: 14: Hoare triple {2172#true} assume true; {2172#true} is VALID [2022-04-28 13:57:11,917 INFO L290 TraceCheckUtils]: 13: Hoare triple {2172#true} assume !(0 == ~cond); {2172#true} is VALID [2022-04-28 13:57:11,917 INFO L290 TraceCheckUtils]: 12: Hoare triple {2172#true} ~cond := #in~cond; {2172#true} is VALID [2022-04-28 13:57:11,918 INFO L272 TraceCheckUtils]: 11: Hoare triple {2229#(<= ~counter~0 1)} call assume_abort_if_not((if 0 != ~x2~0 then 1 else 0)); {2172#true} is VALID [2022-04-28 13:57:11,919 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2172#true} {2229#(<= ~counter~0 1)} #59#return; {2229#(<= ~counter~0 1)} is VALID [2022-04-28 13:57:11,919 INFO L290 TraceCheckUtils]: 9: Hoare triple {2172#true} assume true; {2172#true} is VALID [2022-04-28 13:57:11,919 INFO L290 TraceCheckUtils]: 8: Hoare triple {2172#true} assume !(0 == ~cond); {2172#true} is VALID [2022-04-28 13:57:11,919 INFO L290 TraceCheckUtils]: 7: Hoare triple {2172#true} ~cond := #in~cond; {2172#true} is VALID [2022-04-28 13:57:11,919 INFO L272 TraceCheckUtils]: 6: Hoare triple {2229#(<= ~counter~0 1)} call assume_abort_if_not((if ~x1~0 >= 0 then 1 else 0)); {2172#true} is VALID [2022-04-28 13:57:11,923 INFO L290 TraceCheckUtils]: 5: Hoare triple {2229#(<= ~counter~0 1)} havoc ~x1~0;havoc ~x2~0;havoc ~y1~0;havoc ~y2~0;havoc ~y3~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x1~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~x2~0 := #t~nondet5;havoc #t~nondet5; {2229#(<= ~counter~0 1)} is VALID [2022-04-28 13:57:11,923 INFO L272 TraceCheckUtils]: 4: Hoare triple {2229#(<= ~counter~0 1)} call #t~ret7 := main(); {2229#(<= ~counter~0 1)} is VALID [2022-04-28 13:57:11,923 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2229#(<= ~counter~0 1)} {2172#true} #67#return; {2229#(<= ~counter~0 1)} is VALID [2022-04-28 13:57:11,924 INFO L290 TraceCheckUtils]: 2: Hoare triple {2229#(<= ~counter~0 1)} assume true; {2229#(<= ~counter~0 1)} is VALID [2022-04-28 13:57:11,925 INFO L290 TraceCheckUtils]: 1: Hoare triple {2172#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2229#(<= ~counter~0 1)} is VALID [2022-04-28 13:57:11,925 INFO L272 TraceCheckUtils]: 0: Hoare triple {2172#true} call ULTIMATE.init(); {2172#true} is VALID [2022-04-28 13:57:11,925 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-28 13:57:11,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 13:57:11,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772573488] [2022-04-28 13:57:11,925 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 13:57:11,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [419179631] [2022-04-28 13:57:11,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [419179631] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 13:57:11,925 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 13:57:11,926 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2022-04-28 13:57:11,926 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 13:57:11,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1729612602] [2022-04-28 13:57:11,926 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1729612602] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 13:57:11,926 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 13:57:11,926 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 13:57:11,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779134543] [2022-04-28 13:57:11,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 13:57:11,926 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 6 states have internal predecessors, (33), 6 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) Word has length 50 [2022-04-28 13:57:11,927 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 13:57:11,927 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 6 states have internal predecessors, (33), 6 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-28 13:57:11,961 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:57:11,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 13:57:11,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 13:57:11,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 13:57:11,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-04-28 13:57:11,962 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 6 states have internal predecessors, (33), 6 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-28 13:57:12,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:57:12,102 INFO L93 Difference]: Finished difference Result 61 states and 66 transitions. [2022-04-28 13:57:12,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 13:57:12,102 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 6 states have internal predecessors, (33), 6 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) Word has length 50 [2022-04-28 13:57:12,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 13:57:12,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 6 states have internal predecessors, (33), 6 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-28 13:57:12,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 65 transitions. [2022-04-28 13:57:12,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 6 states have internal predecessors, (33), 6 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-28 13:57:12,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 65 transitions. [2022-04-28 13:57:12,105 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 65 transitions. [2022-04-28 13:57:12,149 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:57:12,150 INFO L225 Difference]: With dead ends: 61 [2022-04-28 13:57:12,150 INFO L226 Difference]: Without dead ends: 56 [2022-04-28 13:57:12,150 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 91 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2022-04-28 13:57:12,150 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 9 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 13:57:12,151 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 100 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 13:57:12,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-04-28 13:57:12,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2022-04-28 13:57:12,188 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 13:57:12,189 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand has 56 states, 40 states have (on average 1.125) internal successors, (45), 40 states have internal predecessors, (45), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 13:57:12,189 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand has 56 states, 40 states have (on average 1.125) internal successors, (45), 40 states have internal predecessors, (45), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 13:57:12,189 INFO L87 Difference]: Start difference. First operand 56 states. Second operand has 56 states, 40 states have (on average 1.125) internal successors, (45), 40 states have internal predecessors, (45), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 13:57:12,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:57:12,191 INFO L93 Difference]: Finished difference Result 56 states and 61 transitions. [2022-04-28 13:57:12,191 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2022-04-28 13:57:12,191 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:57:12,191 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:57:12,192 INFO L74 IsIncluded]: Start isIncluded. First operand has 56 states, 40 states have (on average 1.125) internal successors, (45), 40 states have internal predecessors, (45), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 56 states. [2022-04-28 13:57:12,192 INFO L87 Difference]: Start difference. First operand has 56 states, 40 states have (on average 1.125) internal successors, (45), 40 states have internal predecessors, (45), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 56 states. [2022-04-28 13:57:12,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:57:12,194 INFO L93 Difference]: Finished difference Result 56 states and 61 transitions. [2022-04-28 13:57:12,194 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2022-04-28 13:57:12,194 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:57:12,194 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:57:12,194 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 13:57:12,194 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 13:57:12,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 40 states have (on average 1.125) internal successors, (45), 40 states have internal predecessors, (45), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 13:57:12,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 61 transitions. [2022-04-28 13:57:12,196 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 61 transitions. Word has length 50 [2022-04-28 13:57:12,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 13:57:12,196 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 61 transitions. [2022-04-28 13:57:12,196 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 6 states have internal predecessors, (33), 6 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-28 13:57:12,196 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 56 states and 61 transitions. [2022-04-28 13:57:12,263 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:57:12,263 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2022-04-28 13:57:12,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-04-28 13:57:12,263 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 13:57:12,263 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 13:57:12,285 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-28 13:57:12,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 13:57:12,480 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 13:57:12,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 13:57:12,480 INFO L85 PathProgramCache]: Analyzing trace with hash 1632159894, now seen corresponding path program 7 times [2022-04-28 13:57:12,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 13:57:12,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [679586131] [2022-04-28 13:57:12,480 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 13:57:12,481 INFO L85 PathProgramCache]: Analyzing trace with hash 1632159894, now seen corresponding path program 8 times [2022-04-28 13:57:12,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 13:57:12,481 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732489956] [2022-04-28 13:57:12,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 13:57:12,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 13:57:12,492 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 13:57:12,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [879983625] [2022-04-28 13:57:12,492 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 13:57:12,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 13:57:12,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 13:57:12,495 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 13:57:12,498 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-28 13:57:12,539 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 13:57:12,540 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 13:57:12,540 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-28 13:57:12,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 13:57:12,553 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 13:57:12,801 INFO L272 TraceCheckUtils]: 0: Hoare triple {2832#true} call ULTIMATE.init(); {2832#true} is VALID [2022-04-28 13:57:12,804 INFO L290 TraceCheckUtils]: 1: Hoare triple {2832#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2840#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:12,804 INFO L290 TraceCheckUtils]: 2: Hoare triple {2840#(<= ~counter~0 0)} assume true; {2840#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:12,804 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2840#(<= ~counter~0 0)} {2832#true} #67#return; {2840#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:12,805 INFO L272 TraceCheckUtils]: 4: Hoare triple {2840#(<= ~counter~0 0)} call #t~ret7 := main(); {2840#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:12,805 INFO L290 TraceCheckUtils]: 5: Hoare triple {2840#(<= ~counter~0 0)} havoc ~x1~0;havoc ~x2~0;havoc ~y1~0;havoc ~y2~0;havoc ~y3~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x1~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~x2~0 := #t~nondet5;havoc #t~nondet5; {2840#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:12,806 INFO L272 TraceCheckUtils]: 6: Hoare triple {2840#(<= ~counter~0 0)} call assume_abort_if_not((if ~x1~0 >= 0 then 1 else 0)); {2840#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:12,806 INFO L290 TraceCheckUtils]: 7: Hoare triple {2840#(<= ~counter~0 0)} ~cond := #in~cond; {2840#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:12,806 INFO L290 TraceCheckUtils]: 8: Hoare triple {2840#(<= ~counter~0 0)} assume !(0 == ~cond); {2840#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:12,806 INFO L290 TraceCheckUtils]: 9: Hoare triple {2840#(<= ~counter~0 0)} assume true; {2840#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:12,807 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2840#(<= ~counter~0 0)} {2840#(<= ~counter~0 0)} #59#return; {2840#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:12,807 INFO L272 TraceCheckUtils]: 11: Hoare triple {2840#(<= ~counter~0 0)} call assume_abort_if_not((if 0 != ~x2~0 then 1 else 0)); {2840#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:12,808 INFO L290 TraceCheckUtils]: 12: Hoare triple {2840#(<= ~counter~0 0)} ~cond := #in~cond; {2840#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:12,808 INFO L290 TraceCheckUtils]: 13: Hoare triple {2840#(<= ~counter~0 0)} assume !(0 == ~cond); {2840#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:12,808 INFO L290 TraceCheckUtils]: 14: Hoare triple {2840#(<= ~counter~0 0)} assume true; {2840#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:12,809 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2840#(<= ~counter~0 0)} {2840#(<= ~counter~0 0)} #61#return; {2840#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:12,819 INFO L290 TraceCheckUtils]: 16: Hoare triple {2840#(<= ~counter~0 0)} ~y1~0 := 0;~y2~0 := 0;~y3~0 := ~x1~0; {2840#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:12,820 INFO L290 TraceCheckUtils]: 17: Hoare triple {2840#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2889#(<= ~counter~0 1)} is VALID [2022-04-28 13:57:12,820 INFO L290 TraceCheckUtils]: 18: Hoare triple {2889#(<= ~counter~0 1)} assume !!(#t~post6 < 5);havoc #t~post6; {2889#(<= ~counter~0 1)} is VALID [2022-04-28 13:57:12,820 INFO L272 TraceCheckUtils]: 19: Hoare triple {2889#(<= ~counter~0 1)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {2889#(<= ~counter~0 1)} is VALID [2022-04-28 13:57:12,821 INFO L290 TraceCheckUtils]: 20: Hoare triple {2889#(<= ~counter~0 1)} ~cond := #in~cond; {2889#(<= ~counter~0 1)} is VALID [2022-04-28 13:57:12,821 INFO L290 TraceCheckUtils]: 21: Hoare triple {2889#(<= ~counter~0 1)} assume !(0 == ~cond); {2889#(<= ~counter~0 1)} is VALID [2022-04-28 13:57:12,821 INFO L290 TraceCheckUtils]: 22: Hoare triple {2889#(<= ~counter~0 1)} assume true; {2889#(<= ~counter~0 1)} is VALID [2022-04-28 13:57:12,822 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2889#(<= ~counter~0 1)} {2889#(<= ~counter~0 1)} #63#return; {2889#(<= ~counter~0 1)} is VALID [2022-04-28 13:57:12,822 INFO L290 TraceCheckUtils]: 24: Hoare triple {2889#(<= ~counter~0 1)} assume !!(0 != ~y3~0); {2889#(<= ~counter~0 1)} is VALID [2022-04-28 13:57:12,822 INFO L290 TraceCheckUtils]: 25: Hoare triple {2889#(<= ~counter~0 1)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {2889#(<= ~counter~0 1)} is VALID [2022-04-28 13:57:12,823 INFO L290 TraceCheckUtils]: 26: Hoare triple {2889#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2917#(<= ~counter~0 2)} is VALID [2022-04-28 13:57:12,823 INFO L290 TraceCheckUtils]: 27: Hoare triple {2917#(<= ~counter~0 2)} assume !!(#t~post6 < 5);havoc #t~post6; {2917#(<= ~counter~0 2)} is VALID [2022-04-28 13:57:12,823 INFO L272 TraceCheckUtils]: 28: Hoare triple {2917#(<= ~counter~0 2)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {2917#(<= ~counter~0 2)} is VALID [2022-04-28 13:57:12,824 INFO L290 TraceCheckUtils]: 29: Hoare triple {2917#(<= ~counter~0 2)} ~cond := #in~cond; {2917#(<= ~counter~0 2)} is VALID [2022-04-28 13:57:12,824 INFO L290 TraceCheckUtils]: 30: Hoare triple {2917#(<= ~counter~0 2)} assume !(0 == ~cond); {2917#(<= ~counter~0 2)} is VALID [2022-04-28 13:57:12,824 INFO L290 TraceCheckUtils]: 31: Hoare triple {2917#(<= ~counter~0 2)} assume true; {2917#(<= ~counter~0 2)} is VALID [2022-04-28 13:57:12,825 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2917#(<= ~counter~0 2)} {2917#(<= ~counter~0 2)} #63#return; {2917#(<= ~counter~0 2)} is VALID [2022-04-28 13:57:12,825 INFO L290 TraceCheckUtils]: 33: Hoare triple {2917#(<= ~counter~0 2)} assume !!(0 != ~y3~0); {2917#(<= ~counter~0 2)} is VALID [2022-04-28 13:57:12,828 INFO L290 TraceCheckUtils]: 34: Hoare triple {2917#(<= ~counter~0 2)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {2917#(<= ~counter~0 2)} is VALID [2022-04-28 13:57:12,829 INFO L290 TraceCheckUtils]: 35: Hoare triple {2917#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2945#(<= ~counter~0 3)} is VALID [2022-04-28 13:57:12,829 INFO L290 TraceCheckUtils]: 36: Hoare triple {2945#(<= ~counter~0 3)} assume !!(#t~post6 < 5);havoc #t~post6; {2945#(<= ~counter~0 3)} is VALID [2022-04-28 13:57:12,829 INFO L272 TraceCheckUtils]: 37: Hoare triple {2945#(<= ~counter~0 3)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {2945#(<= ~counter~0 3)} is VALID [2022-04-28 13:57:12,830 INFO L290 TraceCheckUtils]: 38: Hoare triple {2945#(<= ~counter~0 3)} ~cond := #in~cond; {2945#(<= ~counter~0 3)} is VALID [2022-04-28 13:57:12,830 INFO L290 TraceCheckUtils]: 39: Hoare triple {2945#(<= ~counter~0 3)} assume !(0 == ~cond); {2945#(<= ~counter~0 3)} is VALID [2022-04-28 13:57:12,830 INFO L290 TraceCheckUtils]: 40: Hoare triple {2945#(<= ~counter~0 3)} assume true; {2945#(<= ~counter~0 3)} is VALID [2022-04-28 13:57:12,830 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {2945#(<= ~counter~0 3)} {2945#(<= ~counter~0 3)} #63#return; {2945#(<= ~counter~0 3)} is VALID [2022-04-28 13:57:12,831 INFO L290 TraceCheckUtils]: 42: Hoare triple {2945#(<= ~counter~0 3)} assume !!(0 != ~y3~0); {2945#(<= ~counter~0 3)} is VALID [2022-04-28 13:57:12,831 INFO L290 TraceCheckUtils]: 43: Hoare triple {2945#(<= ~counter~0 3)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {2945#(<= ~counter~0 3)} is VALID [2022-04-28 13:57:12,831 INFO L290 TraceCheckUtils]: 44: Hoare triple {2945#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2973#(<= ~counter~0 4)} is VALID [2022-04-28 13:57:12,832 INFO L290 TraceCheckUtils]: 45: Hoare triple {2973#(<= ~counter~0 4)} assume !!(#t~post6 < 5);havoc #t~post6; {2973#(<= ~counter~0 4)} is VALID [2022-04-28 13:57:12,832 INFO L272 TraceCheckUtils]: 46: Hoare triple {2973#(<= ~counter~0 4)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {2973#(<= ~counter~0 4)} is VALID [2022-04-28 13:57:12,833 INFO L290 TraceCheckUtils]: 47: Hoare triple {2973#(<= ~counter~0 4)} ~cond := #in~cond; {2973#(<= ~counter~0 4)} is VALID [2022-04-28 13:57:12,833 INFO L290 TraceCheckUtils]: 48: Hoare triple {2973#(<= ~counter~0 4)} assume !(0 == ~cond); {2973#(<= ~counter~0 4)} is VALID [2022-04-28 13:57:12,833 INFO L290 TraceCheckUtils]: 49: Hoare triple {2973#(<= ~counter~0 4)} assume true; {2973#(<= ~counter~0 4)} is VALID [2022-04-28 13:57:12,834 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {2973#(<= ~counter~0 4)} {2973#(<= ~counter~0 4)} #63#return; {2973#(<= ~counter~0 4)} is VALID [2022-04-28 13:57:12,834 INFO L290 TraceCheckUtils]: 51: Hoare triple {2973#(<= ~counter~0 4)} assume !!(0 != ~y3~0); {2973#(<= ~counter~0 4)} is VALID [2022-04-28 13:57:12,834 INFO L290 TraceCheckUtils]: 52: Hoare triple {2973#(<= ~counter~0 4)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {2973#(<= ~counter~0 4)} is VALID [2022-04-28 13:57:12,835 INFO L290 TraceCheckUtils]: 53: Hoare triple {2973#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3001#(<= |main_#t~post6| 4)} is VALID [2022-04-28 13:57:12,835 INFO L290 TraceCheckUtils]: 54: Hoare triple {3001#(<= |main_#t~post6| 4)} assume !(#t~post6 < 5);havoc #t~post6; {2833#false} is VALID [2022-04-28 13:57:12,835 INFO L272 TraceCheckUtils]: 55: Hoare triple {2833#false} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 == ~x1~0 then 1 else 0)); {2833#false} is VALID [2022-04-28 13:57:12,835 INFO L290 TraceCheckUtils]: 56: Hoare triple {2833#false} ~cond := #in~cond; {2833#false} is VALID [2022-04-28 13:57:12,835 INFO L290 TraceCheckUtils]: 57: Hoare triple {2833#false} assume 0 == ~cond; {2833#false} is VALID [2022-04-28 13:57:12,835 INFO L290 TraceCheckUtils]: 58: Hoare triple {2833#false} assume !false; {2833#false} is VALID [2022-04-28 13:57:12,836 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 8 proven. 62 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 13:57:12,836 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 13:57:13,069 INFO L290 TraceCheckUtils]: 58: Hoare triple {2833#false} assume !false; {2833#false} is VALID [2022-04-28 13:57:13,069 INFO L290 TraceCheckUtils]: 57: Hoare triple {2833#false} assume 0 == ~cond; {2833#false} is VALID [2022-04-28 13:57:13,069 INFO L290 TraceCheckUtils]: 56: Hoare triple {2833#false} ~cond := #in~cond; {2833#false} is VALID [2022-04-28 13:57:13,069 INFO L272 TraceCheckUtils]: 55: Hoare triple {2833#false} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 == ~x1~0 then 1 else 0)); {2833#false} is VALID [2022-04-28 13:57:13,069 INFO L290 TraceCheckUtils]: 54: Hoare triple {3001#(<= |main_#t~post6| 4)} assume !(#t~post6 < 5);havoc #t~post6; {2833#false} is VALID [2022-04-28 13:57:13,070 INFO L290 TraceCheckUtils]: 53: Hoare triple {2973#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3001#(<= |main_#t~post6| 4)} is VALID [2022-04-28 13:57:13,070 INFO L290 TraceCheckUtils]: 52: Hoare triple {2973#(<= ~counter~0 4)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {2973#(<= ~counter~0 4)} is VALID [2022-04-28 13:57:13,070 INFO L290 TraceCheckUtils]: 51: Hoare triple {2973#(<= ~counter~0 4)} assume !!(0 != ~y3~0); {2973#(<= ~counter~0 4)} is VALID [2022-04-28 13:57:13,071 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {2832#true} {2973#(<= ~counter~0 4)} #63#return; {2973#(<= ~counter~0 4)} is VALID [2022-04-28 13:57:13,071 INFO L290 TraceCheckUtils]: 49: Hoare triple {2832#true} assume true; {2832#true} is VALID [2022-04-28 13:57:13,071 INFO L290 TraceCheckUtils]: 48: Hoare triple {2832#true} assume !(0 == ~cond); {2832#true} is VALID [2022-04-28 13:57:13,071 INFO L290 TraceCheckUtils]: 47: Hoare triple {2832#true} ~cond := #in~cond; {2832#true} is VALID [2022-04-28 13:57:13,071 INFO L272 TraceCheckUtils]: 46: Hoare triple {2973#(<= ~counter~0 4)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {2832#true} is VALID [2022-04-28 13:57:13,071 INFO L290 TraceCheckUtils]: 45: Hoare triple {2973#(<= ~counter~0 4)} assume !!(#t~post6 < 5);havoc #t~post6; {2973#(<= ~counter~0 4)} is VALID [2022-04-28 13:57:13,072 INFO L290 TraceCheckUtils]: 44: Hoare triple {2945#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2973#(<= ~counter~0 4)} is VALID [2022-04-28 13:57:13,072 INFO L290 TraceCheckUtils]: 43: Hoare triple {2945#(<= ~counter~0 3)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {2945#(<= ~counter~0 3)} is VALID [2022-04-28 13:57:13,072 INFO L290 TraceCheckUtils]: 42: Hoare triple {2945#(<= ~counter~0 3)} assume !!(0 != ~y3~0); {2945#(<= ~counter~0 3)} is VALID [2022-04-28 13:57:13,073 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {2832#true} {2945#(<= ~counter~0 3)} #63#return; {2945#(<= ~counter~0 3)} is VALID [2022-04-28 13:57:13,073 INFO L290 TraceCheckUtils]: 40: Hoare triple {2832#true} assume true; {2832#true} is VALID [2022-04-28 13:57:13,073 INFO L290 TraceCheckUtils]: 39: Hoare triple {2832#true} assume !(0 == ~cond); {2832#true} is VALID [2022-04-28 13:57:13,073 INFO L290 TraceCheckUtils]: 38: Hoare triple {2832#true} ~cond := #in~cond; {2832#true} is VALID [2022-04-28 13:57:13,073 INFO L272 TraceCheckUtils]: 37: Hoare triple {2945#(<= ~counter~0 3)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {2832#true} is VALID [2022-04-28 13:57:13,073 INFO L290 TraceCheckUtils]: 36: Hoare triple {2945#(<= ~counter~0 3)} assume !!(#t~post6 < 5);havoc #t~post6; {2945#(<= ~counter~0 3)} is VALID [2022-04-28 13:57:13,074 INFO L290 TraceCheckUtils]: 35: Hoare triple {2917#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2945#(<= ~counter~0 3)} is VALID [2022-04-28 13:57:13,074 INFO L290 TraceCheckUtils]: 34: Hoare triple {2917#(<= ~counter~0 2)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {2917#(<= ~counter~0 2)} is VALID [2022-04-28 13:57:13,075 INFO L290 TraceCheckUtils]: 33: Hoare triple {2917#(<= ~counter~0 2)} assume !!(0 != ~y3~0); {2917#(<= ~counter~0 2)} is VALID [2022-04-28 13:57:13,076 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2832#true} {2917#(<= ~counter~0 2)} #63#return; {2917#(<= ~counter~0 2)} is VALID [2022-04-28 13:57:13,076 INFO L290 TraceCheckUtils]: 31: Hoare triple {2832#true} assume true; {2832#true} is VALID [2022-04-28 13:57:13,076 INFO L290 TraceCheckUtils]: 30: Hoare triple {2832#true} assume !(0 == ~cond); {2832#true} is VALID [2022-04-28 13:57:13,076 INFO L290 TraceCheckUtils]: 29: Hoare triple {2832#true} ~cond := #in~cond; {2832#true} is VALID [2022-04-28 13:57:13,076 INFO L272 TraceCheckUtils]: 28: Hoare triple {2917#(<= ~counter~0 2)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {2832#true} is VALID [2022-04-28 13:57:13,077 INFO L290 TraceCheckUtils]: 27: Hoare triple {2917#(<= ~counter~0 2)} assume !!(#t~post6 < 5);havoc #t~post6; {2917#(<= ~counter~0 2)} is VALID [2022-04-28 13:57:13,077 INFO L290 TraceCheckUtils]: 26: Hoare triple {2889#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2917#(<= ~counter~0 2)} is VALID [2022-04-28 13:57:13,077 INFO L290 TraceCheckUtils]: 25: Hoare triple {2889#(<= ~counter~0 1)} assume 1 + ~y2~0 == ~x2~0;~y1~0 := 1 + ~y1~0;~y2~0 := 0;~y3~0 := ~y3~0 - 1; {2889#(<= ~counter~0 1)} is VALID [2022-04-28 13:57:13,077 INFO L290 TraceCheckUtils]: 24: Hoare triple {2889#(<= ~counter~0 1)} assume !!(0 != ~y3~0); {2889#(<= ~counter~0 1)} is VALID [2022-04-28 13:57:13,078 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2832#true} {2889#(<= ~counter~0 1)} #63#return; {2889#(<= ~counter~0 1)} is VALID [2022-04-28 13:57:13,078 INFO L290 TraceCheckUtils]: 22: Hoare triple {2832#true} assume true; {2832#true} is VALID [2022-04-28 13:57:13,078 INFO L290 TraceCheckUtils]: 21: Hoare triple {2832#true} assume !(0 == ~cond); {2832#true} is VALID [2022-04-28 13:57:13,078 INFO L290 TraceCheckUtils]: 20: Hoare triple {2832#true} ~cond := #in~cond; {2832#true} is VALID [2022-04-28 13:57:13,078 INFO L272 TraceCheckUtils]: 19: Hoare triple {2889#(<= ~counter~0 1)} call __VERIFIER_assert((if ~y1~0 * ~x2~0 + ~y2~0 + ~y3~0 == ~x1~0 then 1 else 0)); {2832#true} is VALID [2022-04-28 13:57:13,078 INFO L290 TraceCheckUtils]: 18: Hoare triple {2889#(<= ~counter~0 1)} assume !!(#t~post6 < 5);havoc #t~post6; {2889#(<= ~counter~0 1)} is VALID [2022-04-28 13:57:13,079 INFO L290 TraceCheckUtils]: 17: Hoare triple {2840#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2889#(<= ~counter~0 1)} is VALID [2022-04-28 13:57:13,079 INFO L290 TraceCheckUtils]: 16: Hoare triple {2840#(<= ~counter~0 0)} ~y1~0 := 0;~y2~0 := 0;~y3~0 := ~x1~0; {2840#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:13,079 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2832#true} {2840#(<= ~counter~0 0)} #61#return; {2840#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:13,080 INFO L290 TraceCheckUtils]: 14: Hoare triple {2832#true} assume true; {2832#true} is VALID [2022-04-28 13:57:13,080 INFO L290 TraceCheckUtils]: 13: Hoare triple {2832#true} assume !(0 == ~cond); {2832#true} is VALID [2022-04-28 13:57:13,080 INFO L290 TraceCheckUtils]: 12: Hoare triple {2832#true} ~cond := #in~cond; {2832#true} is VALID [2022-04-28 13:57:13,080 INFO L272 TraceCheckUtils]: 11: Hoare triple {2840#(<= ~counter~0 0)} call assume_abort_if_not((if 0 != ~x2~0 then 1 else 0)); {2832#true} is VALID [2022-04-28 13:57:13,080 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2832#true} {2840#(<= ~counter~0 0)} #59#return; {2840#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:13,080 INFO L290 TraceCheckUtils]: 9: Hoare triple {2832#true} assume true; {2832#true} is VALID [2022-04-28 13:57:13,080 INFO L290 TraceCheckUtils]: 8: Hoare triple {2832#true} assume !(0 == ~cond); {2832#true} is VALID [2022-04-28 13:57:13,080 INFO L290 TraceCheckUtils]: 7: Hoare triple {2832#true} ~cond := #in~cond; {2832#true} is VALID [2022-04-28 13:57:13,080 INFO L272 TraceCheckUtils]: 6: Hoare triple {2840#(<= ~counter~0 0)} call assume_abort_if_not((if ~x1~0 >= 0 then 1 else 0)); {2832#true} is VALID [2022-04-28 13:57:13,081 INFO L290 TraceCheckUtils]: 5: Hoare triple {2840#(<= ~counter~0 0)} havoc ~x1~0;havoc ~x2~0;havoc ~y1~0;havoc ~y2~0;havoc ~y3~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x1~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~x2~0 := #t~nondet5;havoc #t~nondet5; {2840#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:13,081 INFO L272 TraceCheckUtils]: 4: Hoare triple {2840#(<= ~counter~0 0)} call #t~ret7 := main(); {2840#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:13,081 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2840#(<= ~counter~0 0)} {2832#true} #67#return; {2840#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:13,081 INFO L290 TraceCheckUtils]: 2: Hoare triple {2840#(<= ~counter~0 0)} assume true; {2840#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:13,082 INFO L290 TraceCheckUtils]: 1: Hoare triple {2832#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2840#(<= ~counter~0 0)} is VALID [2022-04-28 13:57:13,082 INFO L272 TraceCheckUtils]: 0: Hoare triple {2832#true} call ULTIMATE.init(); {2832#true} is VALID [2022-04-28 13:57:13,082 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 8 proven. 38 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-28 13:57:13,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 13:57:13,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732489956] [2022-04-28 13:57:13,082 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 13:57:13,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [879983625] [2022-04-28 13:57:13,083 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [879983625] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 13:57:13,083 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 13:57:13,083 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2022-04-28 13:57:13,083 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 13:57:13,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [679586131] [2022-04-28 13:57:13,083 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [679586131] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 13:57:13,083 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 13:57:13,083 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 13:57:13,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980519152] [2022-04-28 13:57:13,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 13:57:13,083 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 7 states have internal predecessors, (40), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) Word has length 59 [2022-04-28 13:57:13,084 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 13:57:13,084 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 5.0) internal successors, (40), 7 states have internal predecessors, (40), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-28 13:57:13,119 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:57:13,119 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 13:57:13,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 13:57:13,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 13:57:13,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-04-28 13:57:13,119 INFO L87 Difference]: Start difference. First operand 56 states and 61 transitions. Second operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 7 states have internal predecessors, (40), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-28 13:57:13,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:57:13,339 INFO L93 Difference]: Finished difference Result 70 states and 76 transitions. [2022-04-28 13:57:13,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-28 13:57:13,339 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 7 states have internal predecessors, (40), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) Word has length 59 [2022-04-28 13:57:13,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 13:57:13,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 7 states have internal predecessors, (40), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-28 13:57:13,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 75 transitions. [2022-04-28 13:57:13,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 7 states have internal predecessors, (40), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-28 13:57:13,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 75 transitions. [2022-04-28 13:57:13,342 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 75 transitions. [2022-04-28 13:57:13,389 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:57:13,391 INFO L225 Difference]: With dead ends: 70 [2022-04-28 13:57:13,391 INFO L226 Difference]: Without dead ends: 65 [2022-04-28 13:57:13,391 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 110 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2022-04-28 13:57:13,391 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 34 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 13:57:13,392 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 96 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 13:57:13,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-04-28 13:57:13,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2022-04-28 13:57:13,448 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 13:57:13,449 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand has 65 states, 47 states have (on average 1.127659574468085) internal successors, (53), 47 states have internal predecessors, (53), 10 states have call successors, (10), 9 states have call predecessors, (10), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 13:57:13,449 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand has 65 states, 47 states have (on average 1.127659574468085) internal successors, (53), 47 states have internal predecessors, (53), 10 states have call successors, (10), 9 states have call predecessors, (10), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 13:57:13,449 INFO L87 Difference]: Start difference. First operand 65 states. Second operand has 65 states, 47 states have (on average 1.127659574468085) internal successors, (53), 47 states have internal predecessors, (53), 10 states have call successors, (10), 9 states have call predecessors, (10), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 13:57:13,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:57:13,451 INFO L93 Difference]: Finished difference Result 65 states and 71 transitions. [2022-04-28 13:57:13,451 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 71 transitions. [2022-04-28 13:57:13,451 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:57:13,451 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:57:13,451 INFO L74 IsIncluded]: Start isIncluded. First operand has 65 states, 47 states have (on average 1.127659574468085) internal successors, (53), 47 states have internal predecessors, (53), 10 states have call successors, (10), 9 states have call predecessors, (10), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 65 states. [2022-04-28 13:57:13,452 INFO L87 Difference]: Start difference. First operand has 65 states, 47 states have (on average 1.127659574468085) internal successors, (53), 47 states have internal predecessors, (53), 10 states have call successors, (10), 9 states have call predecessors, (10), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 65 states. [2022-04-28 13:57:13,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 13:57:13,453 INFO L93 Difference]: Finished difference Result 65 states and 71 transitions. [2022-04-28 13:57:13,453 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 71 transitions. [2022-04-28 13:57:13,453 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 13:57:13,453 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 13:57:13,453 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 13:57:13,453 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 13:57:13,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 47 states have (on average 1.127659574468085) internal successors, (53), 47 states have internal predecessors, (53), 10 states have call successors, (10), 9 states have call predecessors, (10), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 13:57:13,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 71 transitions. [2022-04-28 13:57:13,455 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 71 transitions. Word has length 59 [2022-04-28 13:57:13,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 13:57:13,455 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 71 transitions. [2022-04-28 13:57:13,455 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 7 states have internal predecessors, (40), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-28 13:57:13,455 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 65 states and 71 transitions. [2022-04-28 13:57:13,549 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 13:57:13,550 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 71 transitions. [2022-04-28 13:57:13,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-04-28 13:57:13,550 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 13:57:13,550 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 13:57:13,568 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-28 13:57:13,768 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 13:57:13,770 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 13:57:13,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 13:57:13,771 INFO L85 PathProgramCache]: Analyzing trace with hash -1512407140, now seen corresponding path program 9 times [2022-04-28 13:57:13,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 13:57:13,771 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2089520665] [2022-04-28 13:57:13,771 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 13:57:13,771 INFO L85 PathProgramCache]: Analyzing trace with hash -1512407140, now seen corresponding path program 10 times [2022-04-28 13:57:13,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 13:57:13,771 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736514446] [2022-04-28 13:57:13,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 13:57:13,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 13:57:13,791 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 13:57:13,791 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [697140026] [2022-04-28 13:57:13,791 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 13:57:13,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 13:57:13,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 13:57:13,795 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 13:57:13,795 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-28 13:57:13,840 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 13:57:13,840 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-04-28 13:57:13,841 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 13:57:13,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 13:57:13,898 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 13:57:13,899 INFO L130 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found a feasible trace [2022-04-28 13:57:13,899 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-04-28 13:57:13,900 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-28 13:57:13,923 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-28 13:57:14,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-04-28 13:57:14,126 INFO L356 BasicCegarLoop]: Path program histogram: [10, 2, 2, 2, 2] [2022-04-28 13:57:14,128 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-28 13:57:14,137 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-28 13:57:14,137 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2022-04-28 13:57:14,137 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-28 13:57:14,137 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-28 13:57:14,137 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-28 13:57:14,137 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2022-04-28 13:57:14,137 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2022-04-28 13:57:14,137 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-28 13:57:14,137 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-28 13:57:14,137 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-28 13:57:14,137 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-28 13:57:14,137 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-04-28 13:57:14,137 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-04-28 13:57:14,137 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2022-04-28 13:57:14,137 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2022-04-28 13:57:14,137 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-28 13:57:14,137 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-28 13:57:14,137 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-28 13:57:14,137 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-28 13:57:14,137 WARN L170 areAnnotationChecker]: L13-2 has no Hoare annotation [2022-04-28 13:57:14,137 WARN L170 areAnnotationChecker]: L29-1 has no Hoare annotation [2022-04-28 13:57:14,137 WARN L170 areAnnotationChecker]: L29-1 has no Hoare annotation [2022-04-28 13:57:14,138 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2022-04-28 13:57:14,138 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2022-04-28 13:57:14,138 WARN L170 areAnnotationChecker]: L16-2 has no Hoare annotation [2022-04-28 13:57:14,138 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-28 13:57:14,138 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-28 13:57:14,138 WARN L170 areAnnotationChecker]: L30 has no Hoare annotation [2022-04-28 13:57:14,138 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-28 13:57:14,138 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-28 13:57:14,138 WARN L170 areAnnotationChecker]: L41-2 has no Hoare annotation [2022-04-28 13:57:14,138 WARN L170 areAnnotationChecker]: L41-2 has no Hoare annotation [2022-04-28 13:57:14,138 WARN L170 areAnnotationChecker]: L37-1 has no Hoare annotation [2022-04-28 13:57:14,138 WARN L170 areAnnotationChecker]: L37-1 has no Hoare annotation [2022-04-28 13:57:14,138 WARN L170 areAnnotationChecker]: L50 has no Hoare annotation [2022-04-28 13:57:14,138 WARN L170 areAnnotationChecker]: L36-3 has no Hoare annotation [2022-04-28 13:57:14,138 WARN L170 areAnnotationChecker]: L36-3 has no Hoare annotation [2022-04-28 13:57:14,138 WARN L170 areAnnotationChecker]: L36-1 has no Hoare annotation [2022-04-28 13:57:14,138 WARN L170 areAnnotationChecker]: L36-1 has no Hoare annotation [2022-04-28 13:57:14,138 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2022-04-28 13:57:14,138 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2022-04-28 13:57:14,138 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-28 13:57:14,138 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2022-04-28 13:57:14,138 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2022-04-28 13:57:14,138 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-28 13:57:14,138 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-28 13:57:14,139 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 01:57:14 BoogieIcfgContainer [2022-04-28 13:57:14,139 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-28 13:57:14,140 INFO L158 Benchmark]: Toolchain (without parser) took 14264.72ms. Allocated memory was 181.4MB in the beginning and 266.3MB in the end (delta: 84.9MB). Free memory was 132.7MB in the beginning and 107.6MB in the end (delta: 25.0MB). Peak memory consumption was 111.3MB. Max. memory is 8.0GB. [2022-04-28 13:57:14,140 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 181.4MB. Free memory was 148.8MB in the beginning and 148.7MB in the end (delta: 74.4kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 13:57:14,140 INFO L158 Benchmark]: CACSL2BoogieTranslator took 170.96ms. Allocated memory was 181.4MB in the beginning and 221.2MB in the end (delta: 39.8MB). Free memory was 132.5MB in the beginning and 197.9MB in the end (delta: -65.5MB). Peak memory consumption was 11.0MB. Max. memory is 8.0GB. [2022-04-28 13:57:14,140 INFO L158 Benchmark]: Boogie Preprocessor took 21.77ms. Allocated memory is still 221.2MB. Free memory was 197.9MB in the beginning and 196.4MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-28 13:57:14,140 INFO L158 Benchmark]: RCFGBuilder took 241.65ms. Allocated memory is still 221.2MB. Free memory was 196.4MB in the beginning and 184.4MB in the end (delta: 12.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-28 13:57:14,141 INFO L158 Benchmark]: TraceAbstraction took 13819.76ms. Allocated memory was 221.2MB in the beginning and 266.3MB in the end (delta: 45.1MB). Free memory was 184.3MB in the beginning and 107.6MB in the end (delta: 76.6MB). Peak memory consumption was 123.3MB. Max. memory is 8.0GB. [2022-04-28 13:57:14,141 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 181.4MB. Free memory was 148.8MB in the beginning and 148.7MB in the end (delta: 74.4kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 170.96ms. Allocated memory was 181.4MB in the beginning and 221.2MB in the end (delta: 39.8MB). Free memory was 132.5MB in the beginning and 197.9MB in the end (delta: -65.5MB). Peak memory consumption was 11.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 21.77ms. Allocated memory is still 221.2MB. Free memory was 197.9MB in the beginning and 196.4MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 241.65ms. Allocated memory is still 221.2MB. Free memory was 196.4MB in the beginning and 184.4MB in the end (delta: 12.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 13819.76ms. Allocated memory was 221.2MB in the beginning and 266.3MB in the end (delta: 45.1MB). Free memory was 184.3MB in the beginning and 107.6MB in the end (delta: 76.6MB). Peak memory consumption was 123.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L22] int counter = 0; [L24] int x1, x2; [L25] int y1, y2, y3; [L26] x1 = __VERIFIER_nondet_int() [L27] x2 = __VERIFIER_nondet_int() [L29] CALL assume_abort_if_not(x1 >= 0) [L13] COND FALSE !(!cond) [L29] RET assume_abort_if_not(x1 >= 0) [L30] CALL assume_abort_if_not(x2 != 0) [L13] COND FALSE !(!cond) [L30] RET assume_abort_if_not(x2 != 0) [L32] y1 = 0 [L33] y2 = 0 [L34] y3 = x1 [L36] EXPR counter++ [L36] COND TRUE counter++<5 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) [L16] COND FALSE !(!(cond)) [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) [L39] COND FALSE !(!(y3 != 0)) [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 [L36] EXPR counter++ [L36] COND TRUE counter++<5 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) [L16] COND FALSE !(!(cond)) [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) [L39] COND FALSE !(!(y3 != 0)) [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 [L36] EXPR counter++ [L36] COND TRUE counter++<5 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) [L16] COND FALSE !(!(cond)) [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) [L39] COND FALSE !(!(y3 != 0)) [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 [L36] EXPR counter++ [L36] COND TRUE counter++<5 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) [L16] COND FALSE !(!(cond)) [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) [L39] COND FALSE !(!(y3 != 0)) [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 [L36] EXPR counter++ [L36] COND TRUE counter++<5 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) [L16] COND FALSE !(!(cond)) [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) [L39] COND FALSE !(!(y3 != 0)) [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 [L36] EXPR counter++ [L36] COND FALSE !(counter++<5) [L50] CALL __VERIFIER_assert(y1*x2 + y2 == x1) [L16] COND TRUE !(cond) [L18] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 33 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 13.8s, OverallIterations: 9, TraceHistogramMax: 6, PathProgramHistogramMax: 10, EmptinessCheckTime: 0.0s, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 102 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 99 mSDsluCounter, 642 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 426 mSDsCounter, 67 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 185 IncrementalHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 67 mSolverCounterUnsat, 216 mSDtfsCounter, 185 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 485 GetRequests, 427 SyntacticMatches, 4 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=65occurred in iteration=8, InterpolantAutomatonStates: 56, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 8 MinimizatonAttempts, 9 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-04-28 13:57:14,157 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...