/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/loop-acceleration/underapprox_2-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 09:26:24,103 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 09:26:24,105 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 09:26:24,140 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 09:26:24,140 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 09:26:24,141 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 09:26:24,144 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 09:26:24,145 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 09:26:24,147 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 09:26:24,150 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 09:26:24,151 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 09:26:24,152 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 09:26:24,152 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 09:26:24,154 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 09:26:24,154 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 09:26:24,156 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 09:26:24,157 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 09:26:24,157 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 09:26:24,159 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 09:26:24,163 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 09:26:24,164 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 09:26:24,165 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 09:26:24,166 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 09:26:24,166 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 09:26:24,167 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 09:26:24,172 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 09:26:24,173 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 09:26:24,173 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 09:26:24,173 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 09:26:24,174 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 09:26:24,175 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 09:26:24,175 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 09:26:24,176 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 09:26:24,176 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 09:26:24,177 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 09:26:24,177 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 09:26:24,177 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 09:26:24,178 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 09:26:24,178 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 09:26:24,178 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 09:26:24,179 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 09:26:24,180 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 09:26:24,180 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 09:26:24,190 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 09:26:24,190 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 09:26:24,191 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 09:26:24,191 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 09:26:24,192 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 09:26:24,192 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 09:26:24,192 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 09:26:24,192 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 09:26:24,192 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 09:26:24,193 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 09:26:24,193 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 09:26:24,193 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 09:26:24,193 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 09:26:24,193 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 09:26:24,193 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 09:26:24,193 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 09:26:24,193 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 09:26:24,194 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 09:26:24,194 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 09:26:24,194 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 09:26:24,194 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 09:26:24,194 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-28 09:26:24,194 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 09:26:24,370 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 09:26:24,387 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 09:26:24,388 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 09:26:24,389 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 09:26:24,403 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 09:26:24,404 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/underapprox_2-1.c [2022-04-28 09:26:24,446 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ffae6c84/a056773ce3cf4d1b8d0840d8eb151fd8/FLAG48ce8d4cb [2022-04-28 09:26:24,795 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 09:26:24,796 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/underapprox_2-1.c [2022-04-28 09:26:24,799 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ffae6c84/a056773ce3cf4d1b8d0840d8eb151fd8/FLAG48ce8d4cb [2022-04-28 09:26:24,808 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ffae6c84/a056773ce3cf4d1b8d0840d8eb151fd8 [2022-04-28 09:26:24,809 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 09:26:24,810 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 09:26:24,812 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 09:26:24,812 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 09:26:24,815 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 09:26:24,816 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 09:26:24" (1/1) ... [2022-04-28 09:26:24,817 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74fc48db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:26:24, skipping insertion in model container [2022-04-28 09:26:24,817 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 09:26:24" (1/1) ... [2022-04-28 09:26:24,821 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 09:26:24,830 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 09:26:24,939 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/underapprox_2-1.c[327,340] [2022-04-28 09:26:24,951 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 09:26:24,962 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 09:26:24,970 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/underapprox_2-1.c[327,340] [2022-04-28 09:26:24,971 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 09:26:24,979 INFO L208 MainTranslator]: Completed translation [2022-04-28 09:26:24,980 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:26:24 WrapperNode [2022-04-28 09:26:24,980 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 09:26:24,980 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 09:26:24,980 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 09:26:24,981 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 09:26:24,987 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:26:24" (1/1) ... [2022-04-28 09:26:24,987 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:26:24" (1/1) ... [2022-04-28 09:26:24,990 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:26:24" (1/1) ... [2022-04-28 09:26:24,991 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:26:24" (1/1) ... [2022-04-28 09:26:24,993 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:26:24" (1/1) ... [2022-04-28 09:26:24,996 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:26:24" (1/1) ... [2022-04-28 09:26:24,996 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:26:24" (1/1) ... [2022-04-28 09:26:24,997 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 09:26:24,997 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 09:26:24,998 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 09:26:24,998 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 09:26:24,998 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:26:24" (1/1) ... [2022-04-28 09:26:25,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 09:26:25,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:26:25,021 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 09:26:25,036 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 09:26:25,053 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 09:26:25,053 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 09:26:25,053 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 09:26:25,053 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 09:26:25,053 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 09:26:25,054 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 09:26:25,054 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 09:26:25,054 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 09:26:25,054 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 09:26:25,059 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 09:26:25,059 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 09:26:25,059 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 09:26:25,059 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 09:26:25,059 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 09:26:25,060 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 09:26:25,060 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 09:26:25,060 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 09:26:25,110 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 09:26:25,111 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 09:26:25,191 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 09:26:25,196 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 09:26:25,196 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 09:26:25,197 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 09:26:25 BoogieIcfgContainer [2022-04-28 09:26:25,198 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 09:26:25,199 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 09:26:25,199 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 09:26:25,201 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 09:26:25,201 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 09:26:24" (1/3) ... [2022-04-28 09:26:25,202 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44c10674 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 09:26:25, skipping insertion in model container [2022-04-28 09:26:25,202 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 09:26:24" (2/3) ... [2022-04-28 09:26:25,202 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44c10674 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 09:26:25, skipping insertion in model container [2022-04-28 09:26:25,202 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 09:26:25" (3/3) ... [2022-04-28 09:26:25,203 INFO L111 eAbstractionObserver]: Analyzing ICFG underapprox_2-1.c [2022-04-28 09:26:25,212 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 09:26:25,213 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 09:26:25,242 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 09:26:25,246 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@47cbfa86, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@1d7dd65b [2022-04-28 09:26:25,247 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 09:26:25,255 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 10 states have (on average 1.4) internal successors, (14), 11 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-28 09:26:25,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-28 09:26:25,260 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:26:25,260 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:26:25,261 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:26:25,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:26:25,264 INFO L85 PathProgramCache]: Analyzing trace with hash -219174432, now seen corresponding path program 1 times [2022-04-28 09:26:25,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:26:25,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2050267861] [2022-04-28 09:26:25,277 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 09:26:25,277 INFO L85 PathProgramCache]: Analyzing trace with hash -219174432, now seen corresponding path program 2 times [2022-04-28 09:26:25,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:26:25,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073277168] [2022-04-28 09:26:25,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:26:25,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:26:25,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:26:25,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:26:25,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:26:25,399 INFO L290 TraceCheckUtils]: 0: Hoare triple {26#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {21#true} is VALID [2022-04-28 09:26:25,399 INFO L290 TraceCheckUtils]: 1: Hoare triple {21#true} assume true; {21#true} is VALID [2022-04-28 09:26:25,400 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {21#true} {21#true} #34#return; {21#true} is VALID [2022-04-28 09:26:25,401 INFO L272 TraceCheckUtils]: 0: Hoare triple {21#true} call ULTIMATE.init(); {26#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:26:25,401 INFO L290 TraceCheckUtils]: 1: Hoare triple {26#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {21#true} is VALID [2022-04-28 09:26:25,402 INFO L290 TraceCheckUtils]: 2: Hoare triple {21#true} assume true; {21#true} is VALID [2022-04-28 09:26:25,402 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21#true} {21#true} #34#return; {21#true} is VALID [2022-04-28 09:26:25,402 INFO L272 TraceCheckUtils]: 4: Hoare triple {21#true} call #t~ret5 := main(); {21#true} is VALID [2022-04-28 09:26:25,402 INFO L290 TraceCheckUtils]: 5: Hoare triple {21#true} ~x~0 := 0;~y~0 := 1; {21#true} is VALID [2022-04-28 09:26:25,403 INFO L290 TraceCheckUtils]: 6: Hoare triple {21#true} assume !true; {22#false} is VALID [2022-04-28 09:26:25,403 INFO L272 TraceCheckUtils]: 7: Hoare triple {22#false} call __VERIFIER_assert((if 6 != ~x~0 % 4294967296 then 1 else 0)); {22#false} is VALID [2022-04-28 09:26:25,403 INFO L290 TraceCheckUtils]: 8: Hoare triple {22#false} ~cond := #in~cond; {22#false} is VALID [2022-04-28 09:26:25,403 INFO L290 TraceCheckUtils]: 9: Hoare triple {22#false} assume 0 == ~cond; {22#false} is VALID [2022-04-28 09:26:25,403 INFO L290 TraceCheckUtils]: 10: Hoare triple {22#false} assume !false; {22#false} is VALID [2022-04-28 09:26:25,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:26:25,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:26:25,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073277168] [2022-04-28 09:26:25,405 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073277168] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:26:25,405 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:26:25,405 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 09:26:25,407 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:26:25,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2050267861] [2022-04-28 09:26:25,408 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2050267861] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:26:25,408 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:26:25,408 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 09:26:25,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890776526] [2022-04-28 09:26:25,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:26:25,432 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-28 09:26:25,433 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:26:25,435 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:26:25,457 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:26:25,457 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 09:26:25,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:26:25,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 09:26:25,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 09:26:25,483 INFO L87 Difference]: Start difference. First operand has 18 states, 10 states have (on average 1.4) internal successors, (14), 11 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:26:25,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:26:25,554 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2022-04-28 09:26:25,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 09:26:25,554 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-28 09:26:25,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:26:25,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:26:25,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 32 transitions. [2022-04-28 09:26:25,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:26:25,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 32 transitions. [2022-04-28 09:26:25,564 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 32 transitions. [2022-04-28 09:26:25,610 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:26:25,616 INFO L225 Difference]: With dead ends: 29 [2022-04-28 09:26:25,617 INFO L226 Difference]: Without dead ends: 12 [2022-04-28 09:26:25,619 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 09:26:25,621 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 9 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 09:26:25,622 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 20 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 09:26:25,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2022-04-28 09:26:25,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2022-04-28 09:26:25,641 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:26:25,642 INFO L82 GeneralOperation]: Start isEquivalent. First operand 12 states. Second operand has 12 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:26:25,642 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand has 12 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:26:25,643 INFO L87 Difference]: Start difference. First operand 12 states. Second operand has 12 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:26:25,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:26:25,645 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2022-04-28 09:26:25,645 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2022-04-28 09:26:25,645 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:26:25,646 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:26:25,646 INFO L74 IsIncluded]: Start isIncluded. First operand has 12 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 12 states. [2022-04-28 09:26:25,646 INFO L87 Difference]: Start difference. First operand has 12 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 12 states. [2022-04-28 09:26:25,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:26:25,648 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2022-04-28 09:26:25,648 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2022-04-28 09:26:25,648 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:26:25,648 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:26:25,648 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:26:25,648 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:26:25,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:26:25,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2022-04-28 09:26:25,650 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 11 [2022-04-28 09:26:25,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:26:25,651 INFO L495 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2022-04-28 09:26:25,651 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:26:25,651 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 12 transitions. [2022-04-28 09:26:25,671 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:26:25,671 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2022-04-28 09:26:25,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-28 09:26:25,672 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:26:25,672 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:26:25,672 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 09:26:25,672 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:26:25,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:26:25,673 INFO L85 PathProgramCache]: Analyzing trace with hash -222868516, now seen corresponding path program 1 times [2022-04-28 09:26:25,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:26:25,673 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1374227655] [2022-04-28 09:26:25,674 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 09:26:25,674 INFO L85 PathProgramCache]: Analyzing trace with hash -222868516, now seen corresponding path program 2 times [2022-04-28 09:26:25,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:26:25,674 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434769223] [2022-04-28 09:26:25,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:26:25,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:26:25,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:26:25,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:26:25,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:26:25,770 INFO L290 TraceCheckUtils]: 0: Hoare triple {143#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {135#true} is VALID [2022-04-28 09:26:25,770 INFO L290 TraceCheckUtils]: 1: Hoare triple {135#true} assume true; {135#true} is VALID [2022-04-28 09:26:25,770 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {135#true} {135#true} #34#return; {135#true} is VALID [2022-04-28 09:26:25,781 INFO L272 TraceCheckUtils]: 0: Hoare triple {135#true} call ULTIMATE.init(); {143#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:26:25,782 INFO L290 TraceCheckUtils]: 1: Hoare triple {143#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {135#true} is VALID [2022-04-28 09:26:25,782 INFO L290 TraceCheckUtils]: 2: Hoare triple {135#true} assume true; {135#true} is VALID [2022-04-28 09:26:25,782 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {135#true} {135#true} #34#return; {135#true} is VALID [2022-04-28 09:26:25,782 INFO L272 TraceCheckUtils]: 4: Hoare triple {135#true} call #t~ret5 := main(); {135#true} is VALID [2022-04-28 09:26:25,784 INFO L290 TraceCheckUtils]: 5: Hoare triple {135#true} ~x~0 := 0;~y~0 := 1; {140#(= main_~x~0 0)} is VALID [2022-04-28 09:26:25,784 INFO L290 TraceCheckUtils]: 6: Hoare triple {140#(= main_~x~0 0)} assume !(~x~0 % 4294967296 < 6); {136#false} is VALID [2022-04-28 09:26:25,784 INFO L272 TraceCheckUtils]: 7: Hoare triple {136#false} call __VERIFIER_assert((if 6 != ~x~0 % 4294967296 then 1 else 0)); {141#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 09:26:25,785 INFO L290 TraceCheckUtils]: 8: Hoare triple {141#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {142#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 09:26:25,786 INFO L290 TraceCheckUtils]: 9: Hoare triple {142#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {136#false} is VALID [2022-04-28 09:26:25,786 INFO L290 TraceCheckUtils]: 10: Hoare triple {136#false} assume !false; {136#false} is VALID [2022-04-28 09:26:25,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:26:25,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:26:25,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434769223] [2022-04-28 09:26:25,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434769223] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:26:25,787 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:26:25,787 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 09:26:25,787 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:26:25,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1374227655] [2022-04-28 09:26:25,788 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1374227655] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:26:25,788 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:26:25,788 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 09:26:25,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569805553] [2022-04-28 09:26:25,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:26:25,789 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-28 09:26:25,789 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:26:25,789 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:26:25,802 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:26:25,802 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 09:26:25,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:26:25,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 09:26:25,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-28 09:26:25,803 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:26:25,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:26:25,902 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2022-04-28 09:26:25,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 09:26:25,903 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-28 09:26:25,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:26:25,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:26:25,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2022-04-28 09:26:25,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:26:25,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2022-04-28 09:26:25,917 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 18 transitions. [2022-04-28 09:26:25,933 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:26:25,935 INFO L225 Difference]: With dead ends: 18 [2022-04-28 09:26:25,936 INFO L226 Difference]: Without dead ends: 13 [2022-04-28 09:26:25,936 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-28 09:26:25,939 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 09:26:25,940 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 28 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 09:26:25,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2022-04-28 09:26:25,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-04-28 09:26:25,946 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:26:25,946 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:26:25,947 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:26:25,947 INFO L87 Difference]: Start difference. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:26:25,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:26:25,948 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-04-28 09:26:25,948 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-28 09:26:25,948 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:26:25,948 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:26:25,948 INFO L74 IsIncluded]: Start isIncluded. First operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 13 states. [2022-04-28 09:26:25,948 INFO L87 Difference]: Start difference. First operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 13 states. [2022-04-28 09:26:25,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:26:25,950 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-04-28 09:26:25,950 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-28 09:26:25,950 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:26:25,950 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:26:25,950 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:26:25,950 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:26:25,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:26:25,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2022-04-28 09:26:25,952 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2022-04-28 09:26:25,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:26:25,953 INFO L495 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2022-04-28 09:26:25,953 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:26:25,953 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 13 transitions. [2022-04-28 09:26:25,964 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:26:25,964 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-28 09:26:25,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-28 09:26:25,964 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:26:25,965 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:26:25,965 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 09:26:25,968 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:26:25,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:26:25,969 INFO L85 PathProgramCache]: Analyzing trace with hash 1717471862, now seen corresponding path program 1 times [2022-04-28 09:26:25,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:26:25,970 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [144007496] [2022-04-28 09:26:25,990 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 09:26:25,990 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:26:25,990 INFO L85 PathProgramCache]: Analyzing trace with hash 1717471862, now seen corresponding path program 2 times [2022-04-28 09:26:25,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:26:25,991 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655759445] [2022-04-28 09:26:25,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:26:25,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:26:26,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:26:26,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:26:26,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:26:26,133 INFO L290 TraceCheckUtils]: 0: Hoare triple {245#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {236#true} is VALID [2022-04-28 09:26:26,134 INFO L290 TraceCheckUtils]: 1: Hoare triple {236#true} assume true; {236#true} is VALID [2022-04-28 09:26:26,134 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {236#true} {236#true} #34#return; {236#true} is VALID [2022-04-28 09:26:26,135 INFO L272 TraceCheckUtils]: 0: Hoare triple {236#true} call ULTIMATE.init(); {245#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:26:26,135 INFO L290 TraceCheckUtils]: 1: Hoare triple {245#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {236#true} is VALID [2022-04-28 09:26:26,135 INFO L290 TraceCheckUtils]: 2: Hoare triple {236#true} assume true; {236#true} is VALID [2022-04-28 09:26:26,135 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {236#true} {236#true} #34#return; {236#true} is VALID [2022-04-28 09:26:26,135 INFO L272 TraceCheckUtils]: 4: Hoare triple {236#true} call #t~ret5 := main(); {236#true} is VALID [2022-04-28 09:26:26,136 INFO L290 TraceCheckUtils]: 5: Hoare triple {236#true} ~x~0 := 0;~y~0 := 1; {241#(= main_~x~0 0)} is VALID [2022-04-28 09:26:26,137 INFO L290 TraceCheckUtils]: 6: Hoare triple {241#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {242#(and (<= main_~x~0 1) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-28 09:26:26,137 INFO L290 TraceCheckUtils]: 7: Hoare triple {242#(and (<= main_~x~0 1) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 6); {237#false} is VALID [2022-04-28 09:26:26,137 INFO L272 TraceCheckUtils]: 8: Hoare triple {237#false} call __VERIFIER_assert((if 6 != ~x~0 % 4294967296 then 1 else 0)); {243#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 09:26:26,139 INFO L290 TraceCheckUtils]: 9: Hoare triple {243#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {244#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 09:26:26,139 INFO L290 TraceCheckUtils]: 10: Hoare triple {244#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {237#false} is VALID [2022-04-28 09:26:26,140 INFO L290 TraceCheckUtils]: 11: Hoare triple {237#false} assume !false; {237#false} is VALID [2022-04-28 09:26:26,140 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:26:26,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:26:26,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655759445] [2022-04-28 09:26:26,140 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655759445] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:26:26,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1160509867] [2022-04-28 09:26:26,141 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 09:26:26,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:26:26,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:26:26,144 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 09:26:26,171 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 09:26:26,196 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 09:26:26,197 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:26:26,198 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-28 09:26:26,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:26:26,211 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:26:26,278 INFO L272 TraceCheckUtils]: 0: Hoare triple {236#true} call ULTIMATE.init(); {236#true} is VALID [2022-04-28 09:26:26,279 INFO L290 TraceCheckUtils]: 1: Hoare triple {236#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(18, 2);call #Ultimate.allocInit(12, 3); {236#true} is VALID [2022-04-28 09:26:26,279 INFO L290 TraceCheckUtils]: 2: Hoare triple {236#true} assume true; {236#true} is VALID [2022-04-28 09:26:26,279 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {236#true} {236#true} #34#return; {236#true} is VALID [2022-04-28 09:26:26,279 INFO L272 TraceCheckUtils]: 4: Hoare triple {236#true} call #t~ret5 := main(); {236#true} is VALID [2022-04-28 09:26:26,280 INFO L290 TraceCheckUtils]: 5: Hoare triple {236#true} ~x~0 := 0;~y~0 := 1; {241#(= main_~x~0 0)} is VALID [2022-04-28 09:26:26,281 INFO L290 TraceCheckUtils]: 6: Hoare triple {241#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {267#(= main_~x~0 1)} is VALID [2022-04-28 09:26:26,284 INFO L290 TraceCheckUtils]: 7: Hoare triple {267#(= main_~x~0 1)} assume !(~x~0 % 4294967296 < 6); {237#false} is VALID [2022-04-28 09:26:26,284 INFO L272 TraceCheckUtils]: 8: Hoare triple {237#false} call __VERIFIER_assert((if 6 != ~x~0 % 4294967296 then 1 else 0)); {237#false} is VALID [2022-04-28 09:26:26,284 INFO L290 TraceCheckUtils]: 9: Hoare triple {237#false} ~cond := #in~cond; {237#false} is VALID [2022-04-28 09:26:26,284 INFO L290 TraceCheckUtils]: 10: Hoare triple {237#false} assume 0 == ~cond; {237#false} is VALID [2022-04-28 09:26:26,285 INFO L290 TraceCheckUtils]: 11: Hoare triple {237#false} assume !false; {237#false} is VALID [2022-04-28 09:26:26,285 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:26:26,285 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:26:26,434 INFO L290 TraceCheckUtils]: 11: Hoare triple {237#false} assume !false; {237#false} is VALID [2022-04-28 09:26:26,435 INFO L290 TraceCheckUtils]: 10: Hoare triple {286#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {237#false} is VALID [2022-04-28 09:26:26,436 INFO L290 TraceCheckUtils]: 9: Hoare triple {290#(< 0 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {286#(not (<= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 09:26:26,437 INFO L272 TraceCheckUtils]: 8: Hoare triple {294#(not (= (mod main_~x~0 4294967296) 6))} call __VERIFIER_assert((if 6 != ~x~0 % 4294967296 then 1 else 0)); {290#(< 0 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:26:26,437 INFO L290 TraceCheckUtils]: 7: Hoare triple {294#(not (= (mod main_~x~0 4294967296) 6))} assume !(~x~0 % 4294967296 < 6); {294#(not (= (mod main_~x~0 4294967296) 6))} is VALID [2022-04-28 09:26:26,438 INFO L290 TraceCheckUtils]: 6: Hoare triple {301#(not (= 6 (mod (+ main_~x~0 1) 4294967296)))} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {294#(not (= (mod main_~x~0 4294967296) 6))} is VALID [2022-04-28 09:26:26,438 INFO L290 TraceCheckUtils]: 5: Hoare triple {236#true} ~x~0 := 0;~y~0 := 1; {301#(not (= 6 (mod (+ main_~x~0 1) 4294967296)))} is VALID [2022-04-28 09:26:26,439 INFO L272 TraceCheckUtils]: 4: Hoare triple {236#true} call #t~ret5 := main(); {236#true} is VALID [2022-04-28 09:26:26,439 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {236#true} {236#true} #34#return; {236#true} is VALID [2022-04-28 09:26:26,439 INFO L290 TraceCheckUtils]: 2: Hoare triple {236#true} assume true; {236#true} is VALID [2022-04-28 09:26:26,439 INFO L290 TraceCheckUtils]: 1: Hoare triple {236#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(18, 2);call #Ultimate.allocInit(12, 3); {236#true} is VALID [2022-04-28 09:26:26,439 INFO L272 TraceCheckUtils]: 0: Hoare triple {236#true} call ULTIMATE.init(); {236#true} is VALID [2022-04-28 09:26:26,440 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:26:26,440 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1160509867] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:26:26,440 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:26:26,440 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 6] total 12 [2022-04-28 09:26:26,441 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:26:26,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [144007496] [2022-04-28 09:26:26,441 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [144007496] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:26:26,441 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:26:26,441 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 09:26:26,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486297096] [2022-04-28 09:26:26,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:26:26,442 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 5 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-28 09:26:26,442 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:26:26,442 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 5 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:26:26,451 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:26:26,451 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 09:26:26,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:26:26,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 09:26:26,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-04-28 09:26:26,452 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand has 7 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 5 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:26:26,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:26:26,530 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2022-04-28 09:26:26,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 09:26:26,531 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 5 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-28 09:26:26,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:26:26,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 5 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:26:26,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. [2022-04-28 09:26:26,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 5 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:26:26,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. [2022-04-28 09:26:26,533 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 19 transitions. [2022-04-28 09:26:26,545 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 09:26:26,546 INFO L225 Difference]: With dead ends: 19 [2022-04-28 09:26:26,546 INFO L226 Difference]: Without dead ends: 14 [2022-04-28 09:26:26,546 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2022-04-28 09:26:26,547 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 09:26:26,547 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 33 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 09:26:26,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-04-28 09:26:26,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-04-28 09:26:26,551 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:26:26,551 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:26:26,552 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:26:26,552 INFO L87 Difference]: Start difference. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:26:26,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:26:26,552 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-04-28 09:26:26,553 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-28 09:26:26,553 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:26:26,553 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:26:26,553 INFO L74 IsIncluded]: Start isIncluded. First operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 14 states. [2022-04-28 09:26:26,553 INFO L87 Difference]: Start difference. First operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 14 states. [2022-04-28 09:26:26,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:26:26,554 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-04-28 09:26:26,554 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-28 09:26:26,554 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:26:26,554 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:26:26,554 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:26:26,554 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:26:26,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:26:26,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2022-04-28 09:26:26,555 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2022-04-28 09:26:26,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:26:26,555 INFO L495 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2022-04-28 09:26:26,555 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 5 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:26:26,555 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 14 transitions. [2022-04-28 09:26:26,565 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:26:26,566 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-28 09:26:26,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-28 09:26:26,566 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:26:26,566 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:26:26,585 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-28 09:26:26,782 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:26:26,782 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:26:26,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:26:26,783 INFO L85 PathProgramCache]: Analyzing trace with hash 1738481436, now seen corresponding path program 3 times [2022-04-28 09:26:26,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:26:26,783 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [413229263] [2022-04-28 09:26:26,787 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 09:26:26,787 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:26:26,787 INFO L85 PathProgramCache]: Analyzing trace with hash 1738481436, now seen corresponding path program 4 times [2022-04-28 09:26:26,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:26:26,787 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553474970] [2022-04-28 09:26:26,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:26:26,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:26:26,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:26:26,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:26:26,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:26:26,886 INFO L290 TraceCheckUtils]: 0: Hoare triple {430#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {420#true} is VALID [2022-04-28 09:26:26,889 INFO L290 TraceCheckUtils]: 1: Hoare triple {420#true} assume true; {420#true} is VALID [2022-04-28 09:26:26,889 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {420#true} {420#true} #34#return; {420#true} is VALID [2022-04-28 09:26:26,893 INFO L272 TraceCheckUtils]: 0: Hoare triple {420#true} call ULTIMATE.init(); {430#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:26:26,893 INFO L290 TraceCheckUtils]: 1: Hoare triple {430#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {420#true} is VALID [2022-04-28 09:26:26,893 INFO L290 TraceCheckUtils]: 2: Hoare triple {420#true} assume true; {420#true} is VALID [2022-04-28 09:26:26,894 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {420#true} {420#true} #34#return; {420#true} is VALID [2022-04-28 09:26:26,894 INFO L272 TraceCheckUtils]: 4: Hoare triple {420#true} call #t~ret5 := main(); {420#true} is VALID [2022-04-28 09:26:26,894 INFO L290 TraceCheckUtils]: 5: Hoare triple {420#true} ~x~0 := 0;~y~0 := 1; {425#(= main_~x~0 0)} is VALID [2022-04-28 09:26:26,894 INFO L290 TraceCheckUtils]: 6: Hoare triple {425#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {426#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:26:26,895 INFO L290 TraceCheckUtils]: 7: Hoare triple {426#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {427#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 2))} is VALID [2022-04-28 09:26:26,896 INFO L290 TraceCheckUtils]: 8: Hoare triple {427#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 2))} assume !(~x~0 % 4294967296 < 6); {421#false} is VALID [2022-04-28 09:26:26,896 INFO L272 TraceCheckUtils]: 9: Hoare triple {421#false} call __VERIFIER_assert((if 6 != ~x~0 % 4294967296 then 1 else 0)); {428#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 09:26:26,897 INFO L290 TraceCheckUtils]: 10: Hoare triple {428#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {429#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 09:26:26,897 INFO L290 TraceCheckUtils]: 11: Hoare triple {429#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {421#false} is VALID [2022-04-28 09:26:26,897 INFO L290 TraceCheckUtils]: 12: Hoare triple {421#false} assume !false; {421#false} is VALID [2022-04-28 09:26:26,897 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:26:26,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:26:26,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553474970] [2022-04-28 09:26:26,898 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553474970] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:26:26,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1584449917] [2022-04-28 09:26:26,898 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 09:26:26,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:26:26,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:26:26,899 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 09:26:26,901 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 09:26:26,927 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 09:26:26,927 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:26:26,928 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-28 09:26:26,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:26:26,937 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:26:26,998 INFO L272 TraceCheckUtils]: 0: Hoare triple {420#true} call ULTIMATE.init(); {420#true} is VALID [2022-04-28 09:26:26,998 INFO L290 TraceCheckUtils]: 1: Hoare triple {420#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(18, 2);call #Ultimate.allocInit(12, 3); {420#true} is VALID [2022-04-28 09:26:26,998 INFO L290 TraceCheckUtils]: 2: Hoare triple {420#true} assume true; {420#true} is VALID [2022-04-28 09:26:26,999 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {420#true} {420#true} #34#return; {420#true} is VALID [2022-04-28 09:26:26,999 INFO L272 TraceCheckUtils]: 4: Hoare triple {420#true} call #t~ret5 := main(); {420#true} is VALID [2022-04-28 09:26:26,999 INFO L290 TraceCheckUtils]: 5: Hoare triple {420#true} ~x~0 := 0;~y~0 := 1; {425#(= main_~x~0 0)} is VALID [2022-04-28 09:26:27,000 INFO L290 TraceCheckUtils]: 6: Hoare triple {425#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {426#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:26:27,001 INFO L290 TraceCheckUtils]: 7: Hoare triple {426#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {455#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:26:27,001 INFO L290 TraceCheckUtils]: 8: Hoare triple {455#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !(~x~0 % 4294967296 < 6); {421#false} is VALID [2022-04-28 09:26:27,001 INFO L272 TraceCheckUtils]: 9: Hoare triple {421#false} call __VERIFIER_assert((if 6 != ~x~0 % 4294967296 then 1 else 0)); {421#false} is VALID [2022-04-28 09:26:27,002 INFO L290 TraceCheckUtils]: 10: Hoare triple {421#false} ~cond := #in~cond; {421#false} is VALID [2022-04-28 09:26:27,002 INFO L290 TraceCheckUtils]: 11: Hoare triple {421#false} assume 0 == ~cond; {421#false} is VALID [2022-04-28 09:26:27,002 INFO L290 TraceCheckUtils]: 12: Hoare triple {421#false} assume !false; {421#false} is VALID [2022-04-28 09:26:27,002 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:26:27,002 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:26:27,124 INFO L290 TraceCheckUtils]: 12: Hoare triple {421#false} assume !false; {421#false} is VALID [2022-04-28 09:26:27,124 INFO L290 TraceCheckUtils]: 11: Hoare triple {474#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {421#false} is VALID [2022-04-28 09:26:27,125 INFO L290 TraceCheckUtils]: 10: Hoare triple {478#(< 0 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {474#(not (<= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 09:26:27,125 INFO L272 TraceCheckUtils]: 9: Hoare triple {482#(not (= (mod main_~x~0 4294967296) 6))} call __VERIFIER_assert((if 6 != ~x~0 % 4294967296 then 1 else 0)); {478#(< 0 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:26:27,126 INFO L290 TraceCheckUtils]: 8: Hoare triple {482#(not (= (mod main_~x~0 4294967296) 6))} assume !(~x~0 % 4294967296 < 6); {482#(not (= (mod main_~x~0 4294967296) 6))} is VALID [2022-04-28 09:26:27,126 INFO L290 TraceCheckUtils]: 7: Hoare triple {489#(not (= 6 (mod (+ main_~x~0 1) 4294967296)))} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {482#(not (= (mod main_~x~0 4294967296) 6))} is VALID [2022-04-28 09:26:27,127 INFO L290 TraceCheckUtils]: 6: Hoare triple {493#(not (= (mod (+ main_~x~0 2) 4294967296) 6))} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {489#(not (= 6 (mod (+ main_~x~0 1) 4294967296)))} is VALID [2022-04-28 09:26:27,128 INFO L290 TraceCheckUtils]: 5: Hoare triple {420#true} ~x~0 := 0;~y~0 := 1; {493#(not (= (mod (+ main_~x~0 2) 4294967296) 6))} is VALID [2022-04-28 09:26:27,128 INFO L272 TraceCheckUtils]: 4: Hoare triple {420#true} call #t~ret5 := main(); {420#true} is VALID [2022-04-28 09:26:27,128 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {420#true} {420#true} #34#return; {420#true} is VALID [2022-04-28 09:26:27,128 INFO L290 TraceCheckUtils]: 2: Hoare triple {420#true} assume true; {420#true} is VALID [2022-04-28 09:26:27,128 INFO L290 TraceCheckUtils]: 1: Hoare triple {420#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(18, 2);call #Ultimate.allocInit(12, 3); {420#true} is VALID [2022-04-28 09:26:27,128 INFO L272 TraceCheckUtils]: 0: Hoare triple {420#true} call ULTIMATE.init(); {420#true} is VALID [2022-04-28 09:26:27,129 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:26:27,129 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1584449917] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:26:27,129 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:26:27,129 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 7] total 14 [2022-04-28 09:26:27,129 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:26:27,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [413229263] [2022-04-28 09:26:27,129 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [413229263] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:26:27,129 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:26:27,129 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 09:26:27,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732384396] [2022-04-28 09:26:27,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:26:27,130 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.125) internal successors, (9), 6 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-28 09:26:27,130 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:26:27,130 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 1.125) internal successors, (9), 6 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:26:27,139 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:26:27,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 09:26:27,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:26:27,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 09:26:27,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2022-04-28 09:26:27,141 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand has 8 states, 8 states have (on average 1.125) internal successors, (9), 6 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:26:27,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:26:27,239 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2022-04-28 09:26:27,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 09:26:27,240 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.125) internal successors, (9), 6 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-28 09:26:27,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:26:27,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.125) internal successors, (9), 6 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:26:27,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 20 transitions. [2022-04-28 09:26:27,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.125) internal successors, (9), 6 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:26:27,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 20 transitions. [2022-04-28 09:26:27,242 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 20 transitions. [2022-04-28 09:26:27,259 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 09:26:27,260 INFO L225 Difference]: With dead ends: 20 [2022-04-28 09:26:27,260 INFO L226 Difference]: Without dead ends: 15 [2022-04-28 09:26:27,261 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2022-04-28 09:26:27,261 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 09:26:27,261 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 28 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 09:26:27,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-04-28 09:26:27,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-04-28 09:26:27,266 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:26:27,266 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:26:27,267 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:26:27,267 INFO L87 Difference]: Start difference. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:26:27,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:26:27,268 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-04-28 09:26:27,268 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-28 09:26:27,268 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:26:27,268 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:26:27,268 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 15 states. [2022-04-28 09:26:27,268 INFO L87 Difference]: Start difference. First operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 15 states. [2022-04-28 09:26:27,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:26:27,269 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-04-28 09:26:27,269 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-28 09:26:27,269 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:26:27,269 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:26:27,269 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:26:27,269 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:26:27,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:26:27,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2022-04-28 09:26:27,270 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2022-04-28 09:26:27,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:26:27,270 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2022-04-28 09:26:27,270 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.125) internal successors, (9), 6 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:26:27,270 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 15 transitions. [2022-04-28 09:26:27,281 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:26:27,281 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-28 09:26:27,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-28 09:26:27,281 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:26:27,281 INFO L195 NwaCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:26:27,301 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 09:26:27,497 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,SelfDestructingSolverStorable3 [2022-04-28 09:26:27,498 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:26:27,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:26:27,498 INFO L85 PathProgramCache]: Analyzing trace with hash -1905189066, now seen corresponding path program 5 times [2022-04-28 09:26:27,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:26:27,499 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [635641940] [2022-04-28 09:26:27,501 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 09:26:27,502 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:26:27,502 INFO L85 PathProgramCache]: Analyzing trace with hash -1905189066, now seen corresponding path program 6 times [2022-04-28 09:26:27,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:26:27,502 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890625771] [2022-04-28 09:26:27,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:26:27,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:26:27,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:26:27,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:26:27,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:26:27,586 INFO L290 TraceCheckUtils]: 0: Hoare triple {631#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {620#true} is VALID [2022-04-28 09:26:27,586 INFO L290 TraceCheckUtils]: 1: Hoare triple {620#true} assume true; {620#true} is VALID [2022-04-28 09:26:27,586 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {620#true} {620#true} #34#return; {620#true} is VALID [2022-04-28 09:26:27,586 INFO L272 TraceCheckUtils]: 0: Hoare triple {620#true} call ULTIMATE.init(); {631#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:26:27,587 INFO L290 TraceCheckUtils]: 1: Hoare triple {631#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {620#true} is VALID [2022-04-28 09:26:27,587 INFO L290 TraceCheckUtils]: 2: Hoare triple {620#true} assume true; {620#true} is VALID [2022-04-28 09:26:27,587 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {620#true} {620#true} #34#return; {620#true} is VALID [2022-04-28 09:26:27,587 INFO L272 TraceCheckUtils]: 4: Hoare triple {620#true} call #t~ret5 := main(); {620#true} is VALID [2022-04-28 09:26:27,587 INFO L290 TraceCheckUtils]: 5: Hoare triple {620#true} ~x~0 := 0;~y~0 := 1; {625#(= main_~x~0 0)} is VALID [2022-04-28 09:26:27,588 INFO L290 TraceCheckUtils]: 6: Hoare triple {625#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {626#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:26:27,589 INFO L290 TraceCheckUtils]: 7: Hoare triple {626#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {627#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:26:27,596 INFO L290 TraceCheckUtils]: 8: Hoare triple {627#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {628#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 3))} is VALID [2022-04-28 09:26:27,596 INFO L290 TraceCheckUtils]: 9: Hoare triple {628#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 3))} assume !(~x~0 % 4294967296 < 6); {621#false} is VALID [2022-04-28 09:26:27,596 INFO L272 TraceCheckUtils]: 10: Hoare triple {621#false} call __VERIFIER_assert((if 6 != ~x~0 % 4294967296 then 1 else 0)); {629#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 09:26:27,597 INFO L290 TraceCheckUtils]: 11: Hoare triple {629#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {630#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 09:26:27,597 INFO L290 TraceCheckUtils]: 12: Hoare triple {630#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {621#false} is VALID [2022-04-28 09:26:27,597 INFO L290 TraceCheckUtils]: 13: Hoare triple {621#false} assume !false; {621#false} is VALID [2022-04-28 09:26:27,597 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:26:27,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:26:27,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890625771] [2022-04-28 09:26:27,598 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890625771] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:26:27,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1133029609] [2022-04-28 09:26:27,598 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 09:26:27,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:26:27,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:26:27,599 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 09:26:27,601 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 09:26:27,626 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-28 09:26:27,626 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:26:27,627 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-28 09:26:27,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:26:27,633 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:26:27,697 INFO L272 TraceCheckUtils]: 0: Hoare triple {620#true} call ULTIMATE.init(); {620#true} is VALID [2022-04-28 09:26:27,697 INFO L290 TraceCheckUtils]: 1: Hoare triple {620#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(18, 2);call #Ultimate.allocInit(12, 3); {620#true} is VALID [2022-04-28 09:26:27,697 INFO L290 TraceCheckUtils]: 2: Hoare triple {620#true} assume true; {620#true} is VALID [2022-04-28 09:26:27,697 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {620#true} {620#true} #34#return; {620#true} is VALID [2022-04-28 09:26:27,697 INFO L272 TraceCheckUtils]: 4: Hoare triple {620#true} call #t~ret5 := main(); {620#true} is VALID [2022-04-28 09:26:27,698 INFO L290 TraceCheckUtils]: 5: Hoare triple {620#true} ~x~0 := 0;~y~0 := 1; {625#(= main_~x~0 0)} is VALID [2022-04-28 09:26:27,698 INFO L290 TraceCheckUtils]: 6: Hoare triple {625#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {626#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:26:27,699 INFO L290 TraceCheckUtils]: 7: Hoare triple {626#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {627#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:26:27,699 INFO L290 TraceCheckUtils]: 8: Hoare triple {627#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {659#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-28 09:26:27,701 INFO L290 TraceCheckUtils]: 9: Hoare triple {659#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !(~x~0 % 4294967296 < 6); {621#false} is VALID [2022-04-28 09:26:27,701 INFO L272 TraceCheckUtils]: 10: Hoare triple {621#false} call __VERIFIER_assert((if 6 != ~x~0 % 4294967296 then 1 else 0)); {621#false} is VALID [2022-04-28 09:26:27,701 INFO L290 TraceCheckUtils]: 11: Hoare triple {621#false} ~cond := #in~cond; {621#false} is VALID [2022-04-28 09:26:27,701 INFO L290 TraceCheckUtils]: 12: Hoare triple {621#false} assume 0 == ~cond; {621#false} is VALID [2022-04-28 09:26:27,701 INFO L290 TraceCheckUtils]: 13: Hoare triple {621#false} assume !false; {621#false} is VALID [2022-04-28 09:26:27,701 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:26:27,702 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:26:27,833 INFO L290 TraceCheckUtils]: 13: Hoare triple {621#false} assume !false; {621#false} is VALID [2022-04-28 09:26:27,833 INFO L290 TraceCheckUtils]: 12: Hoare triple {678#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {621#false} is VALID [2022-04-28 09:26:27,834 INFO L290 TraceCheckUtils]: 11: Hoare triple {682#(< 0 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {678#(not (<= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 09:26:27,834 INFO L272 TraceCheckUtils]: 10: Hoare triple {686#(not (= (mod main_~x~0 4294967296) 6))} call __VERIFIER_assert((if 6 != ~x~0 % 4294967296 then 1 else 0)); {682#(< 0 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:26:27,835 INFO L290 TraceCheckUtils]: 9: Hoare triple {686#(not (= (mod main_~x~0 4294967296) 6))} assume !(~x~0 % 4294967296 < 6); {686#(not (= (mod main_~x~0 4294967296) 6))} is VALID [2022-04-28 09:26:27,836 INFO L290 TraceCheckUtils]: 8: Hoare triple {693#(not (= 6 (mod (+ main_~x~0 1) 4294967296)))} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {686#(not (= (mod main_~x~0 4294967296) 6))} is VALID [2022-04-28 09:26:27,837 INFO L290 TraceCheckUtils]: 7: Hoare triple {697#(not (= (mod (+ main_~x~0 2) 4294967296) 6))} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {693#(not (= 6 (mod (+ main_~x~0 1) 4294967296)))} is VALID [2022-04-28 09:26:27,837 INFO L290 TraceCheckUtils]: 6: Hoare triple {701#(not (= (mod (+ main_~x~0 3) 4294967296) 6))} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {697#(not (= (mod (+ main_~x~0 2) 4294967296) 6))} is VALID [2022-04-28 09:26:27,838 INFO L290 TraceCheckUtils]: 5: Hoare triple {620#true} ~x~0 := 0;~y~0 := 1; {701#(not (= (mod (+ main_~x~0 3) 4294967296) 6))} is VALID [2022-04-28 09:26:27,838 INFO L272 TraceCheckUtils]: 4: Hoare triple {620#true} call #t~ret5 := main(); {620#true} is VALID [2022-04-28 09:26:27,838 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {620#true} {620#true} #34#return; {620#true} is VALID [2022-04-28 09:26:27,838 INFO L290 TraceCheckUtils]: 2: Hoare triple {620#true} assume true; {620#true} is VALID [2022-04-28 09:26:27,838 INFO L290 TraceCheckUtils]: 1: Hoare triple {620#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(18, 2);call #Ultimate.allocInit(12, 3); {620#true} is VALID [2022-04-28 09:26:27,838 INFO L272 TraceCheckUtils]: 0: Hoare triple {620#true} call ULTIMATE.init(); {620#true} is VALID [2022-04-28 09:26:27,839 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:26:27,839 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1133029609] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:26:27,839 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:26:27,839 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 8] total 16 [2022-04-28 09:26:27,839 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:26:27,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [635641940] [2022-04-28 09:26:27,839 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [635641940] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:26:27,839 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:26:27,839 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 09:26:27,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862918410] [2022-04-28 09:26:27,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:26:27,840 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 7 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-28 09:26:27,840 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:26:27,840 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 7 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:26:27,851 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:26:27,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 09:26:27,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:26:27,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 09:26:27,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2022-04-28 09:26:27,852 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand has 9 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 7 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:26:28,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:26:28,048 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2022-04-28 09:26:28,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 09:26:28,048 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 7 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-28 09:26:28,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:26:28,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 7 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:26:28,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 21 transitions. [2022-04-28 09:26:28,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 7 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:26:28,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 21 transitions. [2022-04-28 09:26:28,050 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 21 transitions. [2022-04-28 09:26:28,066 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:26:28,066 INFO L225 Difference]: With dead ends: 21 [2022-04-28 09:26:28,066 INFO L226 Difference]: Without dead ends: 16 [2022-04-28 09:26:28,067 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=290, Unknown=0, NotChecked=0, Total=380 [2022-04-28 09:26:28,067 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 09:26:28,067 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 43 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 09:26:28,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-04-28 09:26:28,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2022-04-28 09:26:28,074 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:26:28,074 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:26:28,074 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:26:28,074 INFO L87 Difference]: Start difference. First operand 16 states. Second operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:26:28,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:26:28,075 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2022-04-28 09:26:28,075 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-04-28 09:26:28,075 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:26:28,075 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:26:28,075 INFO L74 IsIncluded]: Start isIncluded. First operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 16 states. [2022-04-28 09:26:28,075 INFO L87 Difference]: Start difference. First operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 16 states. [2022-04-28 09:26:28,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:26:28,076 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2022-04-28 09:26:28,076 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-04-28 09:26:28,076 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:26:28,076 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:26:28,076 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:26:28,076 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:26:28,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:26:28,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2022-04-28 09:26:28,077 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2022-04-28 09:26:28,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:26:28,077 INFO L495 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2022-04-28 09:26:28,077 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 7 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:26:28,078 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 16 transitions. [2022-04-28 09:26:28,093 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:26:28,093 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-04-28 09:26:28,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-28 09:26:28,094 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:26:28,094 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:26:28,113 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 09:26:28,294 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:26:28,295 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:26:28,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:26:28,295 INFO L85 PathProgramCache]: Analyzing trace with hash 1105142364, now seen corresponding path program 7 times [2022-04-28 09:26:28,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:26:28,295 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1122331754] [2022-04-28 09:26:28,299 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 09:26:28,299 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:26:28,299 INFO L85 PathProgramCache]: Analyzing trace with hash 1105142364, now seen corresponding path program 8 times [2022-04-28 09:26:28,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:26:28,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355462935] [2022-04-28 09:26:28,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:26:28,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:26:28,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:26:28,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:26:28,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:26:28,421 INFO L290 TraceCheckUtils]: 0: Hoare triple {848#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {836#true} is VALID [2022-04-28 09:26:28,421 INFO L290 TraceCheckUtils]: 1: Hoare triple {836#true} assume true; {836#true} is VALID [2022-04-28 09:26:28,421 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {836#true} {836#true} #34#return; {836#true} is VALID [2022-04-28 09:26:28,422 INFO L272 TraceCheckUtils]: 0: Hoare triple {836#true} call ULTIMATE.init(); {848#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:26:28,422 INFO L290 TraceCheckUtils]: 1: Hoare triple {848#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {836#true} is VALID [2022-04-28 09:26:28,422 INFO L290 TraceCheckUtils]: 2: Hoare triple {836#true} assume true; {836#true} is VALID [2022-04-28 09:26:28,422 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {836#true} {836#true} #34#return; {836#true} is VALID [2022-04-28 09:26:28,422 INFO L272 TraceCheckUtils]: 4: Hoare triple {836#true} call #t~ret5 := main(); {836#true} is VALID [2022-04-28 09:26:28,422 INFO L290 TraceCheckUtils]: 5: Hoare triple {836#true} ~x~0 := 0;~y~0 := 1; {841#(= main_~x~0 0)} is VALID [2022-04-28 09:26:28,423 INFO L290 TraceCheckUtils]: 6: Hoare triple {841#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {842#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:26:28,424 INFO L290 TraceCheckUtils]: 7: Hoare triple {842#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {843#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:26:28,424 INFO L290 TraceCheckUtils]: 8: Hoare triple {843#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {844#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-28 09:26:28,425 INFO L290 TraceCheckUtils]: 9: Hoare triple {844#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {845#(and (<= main_~x~0 4) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-28 09:26:28,425 INFO L290 TraceCheckUtils]: 10: Hoare triple {845#(and (<= main_~x~0 4) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 6); {837#false} is VALID [2022-04-28 09:26:28,425 INFO L272 TraceCheckUtils]: 11: Hoare triple {837#false} call __VERIFIER_assert((if 6 != ~x~0 % 4294967296 then 1 else 0)); {846#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 09:26:28,426 INFO L290 TraceCheckUtils]: 12: Hoare triple {846#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {847#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 09:26:28,426 INFO L290 TraceCheckUtils]: 13: Hoare triple {847#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {837#false} is VALID [2022-04-28 09:26:28,426 INFO L290 TraceCheckUtils]: 14: Hoare triple {837#false} assume !false; {837#false} is VALID [2022-04-28 09:26:28,426 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:26:28,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:26:28,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355462935] [2022-04-28 09:26:28,427 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355462935] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:26:28,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1942267089] [2022-04-28 09:26:28,427 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 09:26:28,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:26:28,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:26:28,428 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 09:26:28,429 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 09:26:28,453 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 09:26:28,454 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:26:28,454 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-28 09:26:28,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:26:28,460 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:26:28,525 INFO L272 TraceCheckUtils]: 0: Hoare triple {836#true} call ULTIMATE.init(); {836#true} is VALID [2022-04-28 09:26:28,525 INFO L290 TraceCheckUtils]: 1: Hoare triple {836#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(18, 2);call #Ultimate.allocInit(12, 3); {836#true} is VALID [2022-04-28 09:26:28,525 INFO L290 TraceCheckUtils]: 2: Hoare triple {836#true} assume true; {836#true} is VALID [2022-04-28 09:26:28,526 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {836#true} {836#true} #34#return; {836#true} is VALID [2022-04-28 09:26:28,526 INFO L272 TraceCheckUtils]: 4: Hoare triple {836#true} call #t~ret5 := main(); {836#true} is VALID [2022-04-28 09:26:28,526 INFO L290 TraceCheckUtils]: 5: Hoare triple {836#true} ~x~0 := 0;~y~0 := 1; {841#(= main_~x~0 0)} is VALID [2022-04-28 09:26:28,526 INFO L290 TraceCheckUtils]: 6: Hoare triple {841#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {842#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:26:28,528 INFO L290 TraceCheckUtils]: 7: Hoare triple {842#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {843#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:26:28,528 INFO L290 TraceCheckUtils]: 8: Hoare triple {843#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {844#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-28 09:26:28,529 INFO L290 TraceCheckUtils]: 9: Hoare triple {844#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {879#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:26:28,529 INFO L290 TraceCheckUtils]: 10: Hoare triple {879#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !(~x~0 % 4294967296 < 6); {837#false} is VALID [2022-04-28 09:26:28,529 INFO L272 TraceCheckUtils]: 11: Hoare triple {837#false} call __VERIFIER_assert((if 6 != ~x~0 % 4294967296 then 1 else 0)); {837#false} is VALID [2022-04-28 09:26:28,529 INFO L290 TraceCheckUtils]: 12: Hoare triple {837#false} ~cond := #in~cond; {837#false} is VALID [2022-04-28 09:26:28,529 INFO L290 TraceCheckUtils]: 13: Hoare triple {837#false} assume 0 == ~cond; {837#false} is VALID [2022-04-28 09:26:28,530 INFO L290 TraceCheckUtils]: 14: Hoare triple {837#false} assume !false; {837#false} is VALID [2022-04-28 09:26:28,530 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:26:28,530 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:26:28,666 INFO L290 TraceCheckUtils]: 14: Hoare triple {837#false} assume !false; {837#false} is VALID [2022-04-28 09:26:28,666 INFO L290 TraceCheckUtils]: 13: Hoare triple {898#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {837#false} is VALID [2022-04-28 09:26:28,667 INFO L290 TraceCheckUtils]: 12: Hoare triple {902#(< 0 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {898#(not (<= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 09:26:28,667 INFO L272 TraceCheckUtils]: 11: Hoare triple {906#(not (= (mod main_~x~0 4294967296) 6))} call __VERIFIER_assert((if 6 != ~x~0 % 4294967296 then 1 else 0)); {902#(< 0 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:26:28,668 INFO L290 TraceCheckUtils]: 10: Hoare triple {906#(not (= (mod main_~x~0 4294967296) 6))} assume !(~x~0 % 4294967296 < 6); {906#(not (= (mod main_~x~0 4294967296) 6))} is VALID [2022-04-28 09:26:28,669 INFO L290 TraceCheckUtils]: 9: Hoare triple {913#(not (= 6 (mod (+ main_~x~0 1) 4294967296)))} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {906#(not (= (mod main_~x~0 4294967296) 6))} is VALID [2022-04-28 09:26:28,669 INFO L290 TraceCheckUtils]: 8: Hoare triple {917#(not (= (mod (+ main_~x~0 2) 4294967296) 6))} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {913#(not (= 6 (mod (+ main_~x~0 1) 4294967296)))} is VALID [2022-04-28 09:26:28,670 INFO L290 TraceCheckUtils]: 7: Hoare triple {921#(not (= (mod (+ main_~x~0 3) 4294967296) 6))} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {917#(not (= (mod (+ main_~x~0 2) 4294967296) 6))} is VALID [2022-04-28 09:26:28,671 INFO L290 TraceCheckUtils]: 6: Hoare triple {925#(not (= (mod (+ main_~x~0 4) 4294967296) 6))} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {921#(not (= (mod (+ main_~x~0 3) 4294967296) 6))} is VALID [2022-04-28 09:26:28,671 INFO L290 TraceCheckUtils]: 5: Hoare triple {836#true} ~x~0 := 0;~y~0 := 1; {925#(not (= (mod (+ main_~x~0 4) 4294967296) 6))} is VALID [2022-04-28 09:26:28,671 INFO L272 TraceCheckUtils]: 4: Hoare triple {836#true} call #t~ret5 := main(); {836#true} is VALID [2022-04-28 09:26:28,671 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {836#true} {836#true} #34#return; {836#true} is VALID [2022-04-28 09:26:28,671 INFO L290 TraceCheckUtils]: 2: Hoare triple {836#true} assume true; {836#true} is VALID [2022-04-28 09:26:28,672 INFO L290 TraceCheckUtils]: 1: Hoare triple {836#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(18, 2);call #Ultimate.allocInit(12, 3); {836#true} is VALID [2022-04-28 09:26:28,672 INFO L272 TraceCheckUtils]: 0: Hoare triple {836#true} call ULTIMATE.init(); {836#true} is VALID [2022-04-28 09:26:28,672 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:26:28,672 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1942267089] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:26:28,672 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:26:28,672 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 9] total 18 [2022-04-28 09:26:28,672 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:26:28,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1122331754] [2022-04-28 09:26:28,672 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1122331754] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:26:28,673 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:26:28,673 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 09:26:28,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749961228] [2022-04-28 09:26:28,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:26:28,673 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.1) internal successors, (11), 8 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-28 09:26:28,673 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:26:28,673 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 1.1) internal successors, (11), 8 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:26:28,686 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:26:28,686 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 09:26:28,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:26:28,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 09:26:28,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2022-04-28 09:26:28,688 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand has 10 states, 10 states have (on average 1.1) internal successors, (11), 8 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:26:28,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:26:28,870 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2022-04-28 09:26:28,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 09:26:28,871 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.1) internal successors, (11), 8 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-28 09:26:28,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:26:28,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.1) internal successors, (11), 8 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:26:28,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 22 transitions. [2022-04-28 09:26:28,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.1) internal successors, (11), 8 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:26:28,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 22 transitions. [2022-04-28 09:26:28,873 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 22 transitions. [2022-04-28 09:26:28,890 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:26:28,891 INFO L225 Difference]: With dead ends: 22 [2022-04-28 09:26:28,891 INFO L226 Difference]: Without dead ends: 17 [2022-04-28 09:26:28,891 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=112, Invalid=394, Unknown=0, NotChecked=0, Total=506 [2022-04-28 09:26:28,892 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 09:26:28,892 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 43 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 09:26:28,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-28 09:26:28,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-04-28 09:26:28,899 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:26:28,900 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:26:28,900 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:26:28,900 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:26:28,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:26:28,901 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2022-04-28 09:26:28,901 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2022-04-28 09:26:28,901 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:26:28,901 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:26:28,901 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17 states. [2022-04-28 09:26:28,901 INFO L87 Difference]: Start difference. First operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17 states. [2022-04-28 09:26:28,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:26:28,902 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2022-04-28 09:26:28,902 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2022-04-28 09:26:28,902 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:26:28,902 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:26:28,902 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:26:28,902 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:26:28,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:26:28,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2022-04-28 09:26:28,903 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2022-04-28 09:26:28,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:26:28,903 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2022-04-28 09:26:28,903 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.1) internal successors, (11), 8 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:26:28,903 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 17 transitions. [2022-04-28 09:26:28,916 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:26:28,916 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2022-04-28 09:26:28,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-28 09:26:28,917 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:26:28,917 INFO L195 NwaCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:26:28,933 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 09:26:29,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:26:29,123 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:26:29,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:26:29,124 INFO L85 PathProgramCache]: Analyzing trace with hash -63863818, now seen corresponding path program 9 times [2022-04-28 09:26:29,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:26:29,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1099545932] [2022-04-28 09:26:29,126 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 09:26:29,126 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:26:29,126 INFO L85 PathProgramCache]: Analyzing trace with hash -63863818, now seen corresponding path program 10 times [2022-04-28 09:26:29,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:26:29,127 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106320616] [2022-04-28 09:26:29,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:26:29,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:26:29,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:26:29,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 09:26:29,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:26:29,230 INFO L290 TraceCheckUtils]: 0: Hoare triple {1081#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {1068#true} is VALID [2022-04-28 09:26:29,230 INFO L290 TraceCheckUtils]: 1: Hoare triple {1068#true} assume true; {1068#true} is VALID [2022-04-28 09:26:29,230 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1068#true} {1068#true} #34#return; {1068#true} is VALID [2022-04-28 09:26:29,230 INFO L272 TraceCheckUtils]: 0: Hoare triple {1068#true} call ULTIMATE.init(); {1081#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 09:26:29,230 INFO L290 TraceCheckUtils]: 1: Hoare triple {1081#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {1068#true} is VALID [2022-04-28 09:26:29,231 INFO L290 TraceCheckUtils]: 2: Hoare triple {1068#true} assume true; {1068#true} is VALID [2022-04-28 09:26:29,231 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1068#true} {1068#true} #34#return; {1068#true} is VALID [2022-04-28 09:26:29,231 INFO L272 TraceCheckUtils]: 4: Hoare triple {1068#true} call #t~ret5 := main(); {1068#true} is VALID [2022-04-28 09:26:29,231 INFO L290 TraceCheckUtils]: 5: Hoare triple {1068#true} ~x~0 := 0;~y~0 := 1; {1073#(= main_~x~0 0)} is VALID [2022-04-28 09:26:29,232 INFO L290 TraceCheckUtils]: 6: Hoare triple {1073#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {1074#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:26:29,232 INFO L290 TraceCheckUtils]: 7: Hoare triple {1074#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {1075#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:26:29,233 INFO L290 TraceCheckUtils]: 8: Hoare triple {1075#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {1076#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-28 09:26:29,233 INFO L290 TraceCheckUtils]: 9: Hoare triple {1076#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {1077#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:26:29,234 INFO L290 TraceCheckUtils]: 10: Hoare triple {1077#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {1078#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 5))} is VALID [2022-04-28 09:26:29,234 INFO L290 TraceCheckUtils]: 11: Hoare triple {1078#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 5))} assume !(~x~0 % 4294967296 < 6); {1069#false} is VALID [2022-04-28 09:26:29,234 INFO L272 TraceCheckUtils]: 12: Hoare triple {1069#false} call __VERIFIER_assert((if 6 != ~x~0 % 4294967296 then 1 else 0)); {1079#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 09:26:29,234 INFO L290 TraceCheckUtils]: 13: Hoare triple {1079#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {1080#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 09:26:29,235 INFO L290 TraceCheckUtils]: 14: Hoare triple {1080#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {1069#false} is VALID [2022-04-28 09:26:29,235 INFO L290 TraceCheckUtils]: 15: Hoare triple {1069#false} assume !false; {1069#false} is VALID [2022-04-28 09:26:29,235 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:26:29,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 09:26:29,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106320616] [2022-04-28 09:26:29,235 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106320616] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 09:26:29,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1865317970] [2022-04-28 09:26:29,235 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 09:26:29,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:26:29,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 09:26:29,237 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 09:26:29,238 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 09:26:29,263 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 09:26:29,263 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 09:26:29,264 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-28 09:26:29,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 09:26:29,270 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 09:26:29,350 INFO L272 TraceCheckUtils]: 0: Hoare triple {1068#true} call ULTIMATE.init(); {1068#true} is VALID [2022-04-28 09:26:29,351 INFO L290 TraceCheckUtils]: 1: Hoare triple {1068#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(18, 2);call #Ultimate.allocInit(12, 3); {1068#true} is VALID [2022-04-28 09:26:29,351 INFO L290 TraceCheckUtils]: 2: Hoare triple {1068#true} assume true; {1068#true} is VALID [2022-04-28 09:26:29,351 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1068#true} {1068#true} #34#return; {1068#true} is VALID [2022-04-28 09:26:29,351 INFO L272 TraceCheckUtils]: 4: Hoare triple {1068#true} call #t~ret5 := main(); {1068#true} is VALID [2022-04-28 09:26:29,351 INFO L290 TraceCheckUtils]: 5: Hoare triple {1068#true} ~x~0 := 0;~y~0 := 1; {1073#(= main_~x~0 0)} is VALID [2022-04-28 09:26:29,352 INFO L290 TraceCheckUtils]: 6: Hoare triple {1073#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {1074#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 09:26:29,352 INFO L290 TraceCheckUtils]: 7: Hoare triple {1074#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {1075#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 09:26:29,353 INFO L290 TraceCheckUtils]: 8: Hoare triple {1075#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {1076#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-28 09:26:29,353 INFO L290 TraceCheckUtils]: 9: Hoare triple {1076#(and (<= main_~x~0 3) (<= 3 main_~x~0))} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {1077#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 09:26:29,354 INFO L290 TraceCheckUtils]: 10: Hoare triple {1077#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {1115#(and (<= 5 main_~x~0) (<= main_~x~0 5))} is VALID [2022-04-28 09:26:29,354 INFO L290 TraceCheckUtils]: 11: Hoare triple {1115#(and (<= 5 main_~x~0) (<= main_~x~0 5))} assume !(~x~0 % 4294967296 < 6); {1069#false} is VALID [2022-04-28 09:26:29,354 INFO L272 TraceCheckUtils]: 12: Hoare triple {1069#false} call __VERIFIER_assert((if 6 != ~x~0 % 4294967296 then 1 else 0)); {1069#false} is VALID [2022-04-28 09:26:29,354 INFO L290 TraceCheckUtils]: 13: Hoare triple {1069#false} ~cond := #in~cond; {1069#false} is VALID [2022-04-28 09:26:29,354 INFO L290 TraceCheckUtils]: 14: Hoare triple {1069#false} assume 0 == ~cond; {1069#false} is VALID [2022-04-28 09:26:29,355 INFO L290 TraceCheckUtils]: 15: Hoare triple {1069#false} assume !false; {1069#false} is VALID [2022-04-28 09:26:29,355 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:26:29,355 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 09:26:29,512 INFO L290 TraceCheckUtils]: 15: Hoare triple {1069#false} assume !false; {1069#false} is VALID [2022-04-28 09:26:29,512 INFO L290 TraceCheckUtils]: 14: Hoare triple {1134#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {1069#false} is VALID [2022-04-28 09:26:29,512 INFO L290 TraceCheckUtils]: 13: Hoare triple {1138#(< 0 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1134#(not (<= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 09:26:29,513 INFO L272 TraceCheckUtils]: 12: Hoare triple {1142#(not (= (mod main_~x~0 4294967296) 6))} call __VERIFIER_assert((if 6 != ~x~0 % 4294967296 then 1 else 0)); {1138#(< 0 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 09:26:29,513 INFO L290 TraceCheckUtils]: 11: Hoare triple {1142#(not (= (mod main_~x~0 4294967296) 6))} assume !(~x~0 % 4294967296 < 6); {1142#(not (= (mod main_~x~0 4294967296) 6))} is VALID [2022-04-28 09:26:29,514 INFO L290 TraceCheckUtils]: 10: Hoare triple {1149#(not (= 6 (mod (+ main_~x~0 1) 4294967296)))} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {1142#(not (= (mod main_~x~0 4294967296) 6))} is VALID [2022-04-28 09:26:29,519 INFO L290 TraceCheckUtils]: 9: Hoare triple {1153#(not (= (mod (+ main_~x~0 2) 4294967296) 6))} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {1149#(not (= 6 (mod (+ main_~x~0 1) 4294967296)))} is VALID [2022-04-28 09:26:29,520 INFO L290 TraceCheckUtils]: 8: Hoare triple {1157#(not (= (mod (+ main_~x~0 3) 4294967296) 6))} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {1153#(not (= (mod (+ main_~x~0 2) 4294967296) 6))} is VALID [2022-04-28 09:26:29,521 INFO L290 TraceCheckUtils]: 7: Hoare triple {1161#(not (= (mod (+ main_~x~0 4) 4294967296) 6))} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {1157#(not (= (mod (+ main_~x~0 3) 4294967296) 6))} is VALID [2022-04-28 09:26:29,522 INFO L290 TraceCheckUtils]: 6: Hoare triple {1165#(not (= 6 (mod (+ 5 main_~x~0) 4294967296)))} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {1161#(not (= (mod (+ main_~x~0 4) 4294967296) 6))} is VALID [2022-04-28 09:26:29,525 INFO L290 TraceCheckUtils]: 5: Hoare triple {1068#true} ~x~0 := 0;~y~0 := 1; {1165#(not (= 6 (mod (+ 5 main_~x~0) 4294967296)))} is VALID [2022-04-28 09:26:29,525 INFO L272 TraceCheckUtils]: 4: Hoare triple {1068#true} call #t~ret5 := main(); {1068#true} is VALID [2022-04-28 09:26:29,525 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1068#true} {1068#true} #34#return; {1068#true} is VALID [2022-04-28 09:26:29,525 INFO L290 TraceCheckUtils]: 2: Hoare triple {1068#true} assume true; {1068#true} is VALID [2022-04-28 09:26:29,525 INFO L290 TraceCheckUtils]: 1: Hoare triple {1068#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(18, 2);call #Ultimate.allocInit(12, 3); {1068#true} is VALID [2022-04-28 09:26:29,525 INFO L272 TraceCheckUtils]: 0: Hoare triple {1068#true} call ULTIMATE.init(); {1068#true} is VALID [2022-04-28 09:26:29,526 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 09:26:29,526 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1865317970] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 09:26:29,526 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 09:26:29,526 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 10] total 20 [2022-04-28 09:26:29,526 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 09:26:29,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1099545932] [2022-04-28 09:26:29,526 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1099545932] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 09:26:29,526 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 09:26:29,526 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 09:26:29,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893467596] [2022-04-28 09:26:29,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 09:26:29,527 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 9 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-28 09:26:29,527 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 09:26:29,527 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 9 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:26:29,537 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:26:29,537 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 09:26:29,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 09:26:29,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 09:26:29,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=303, Unknown=0, NotChecked=0, Total=380 [2022-04-28 09:26:29,538 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand has 11 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 9 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:26:29,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:26:29,725 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2022-04-28 09:26:29,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 09:26:29,725 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 9 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-28 09:26:29,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 09:26:29,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 9 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:26:29,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 23 transitions. [2022-04-28 09:26:29,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 9 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:26:29,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 23 transitions. [2022-04-28 09:26:29,727 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 23 transitions. [2022-04-28 09:26:29,740 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:26:29,741 INFO L225 Difference]: With dead ends: 23 [2022-04-28 09:26:29,741 INFO L226 Difference]: Without dead ends: 18 [2022-04-28 09:26:29,741 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=138, Invalid=512, Unknown=0, NotChecked=0, Total=650 [2022-04-28 09:26:29,742 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 09:26:29,742 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 48 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 09:26:29,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-04-28 09:26:29,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-04-28 09:26:29,749 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 09:26:29,749 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:26:29,749 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:26:29,750 INFO L87 Difference]: Start difference. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:26:29,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:26:29,750 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2022-04-28 09:26:29,750 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2022-04-28 09:26:29,750 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:26:29,750 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:26:29,751 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 18 states. [2022-04-28 09:26:29,751 INFO L87 Difference]: Start difference. First operand has 18 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 18 states. [2022-04-28 09:26:29,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 09:26:29,751 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2022-04-28 09:26:29,751 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2022-04-28 09:26:29,751 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 09:26:29,752 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 09:26:29,752 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 09:26:29,752 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 09:26:29,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:26:29,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2022-04-28 09:26:29,752 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2022-04-28 09:26:29,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 09:26:29,752 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2022-04-28 09:26:29,753 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 9 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 09:26:29,753 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 18 transitions. [2022-04-28 09:26:29,765 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 09:26:29,765 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2022-04-28 09:26:29,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-28 09:26:29,766 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 09:26:29,766 INFO L195 NwaCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 09:26:29,784 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 09:26:29,966 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 09:26:29,966 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 09:26:29,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 09:26:29,967 INFO L85 PathProgramCache]: Analyzing trace with hash -1943317092, now seen corresponding path program 11 times [2022-04-28 09:26:29,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 09:26:29,967 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1481976868] [2022-04-28 09:26:29,970 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 09:26:29,970 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 09:26:29,970 INFO L85 PathProgramCache]: Analyzing trace with hash -1943317092, now seen corresponding path program 12 times [2022-04-28 09:26:29,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 09:26:29,970 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481554347] [2022-04-28 09:26:29,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 09:26:29,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 09:26:29,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 09:26:29,981 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 09:26:29,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 09:26:30,007 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 09:26:30,007 INFO L130 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found a feasible trace [2022-04-28 09:26:30,007 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-04-28 09:26:30,011 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-28 09:26:30,012 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-28 09:26:30,014 INFO L356 BasicCegarLoop]: Path program histogram: [12, 2, 2] [2022-04-28 09:26:30,016 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-28 09:26:30,031 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-28 09:26:30,031 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2022-04-28 09:26:30,031 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-28 09:26:30,031 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-28 09:26:30,031 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2022-04-28 09:26:30,031 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2022-04-28 09:26:30,031 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-28 09:26:30,031 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-28 09:26:30,031 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-28 09:26:30,031 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-28 09:26:30,031 WARN L170 areAnnotationChecker]: L16-2 has no Hoare annotation [2022-04-28 09:26:30,031 WARN L170 areAnnotationChecker]: L16-2 has no Hoare annotation [2022-04-28 09:26:30,031 WARN L170 areAnnotationChecker]: L16-2 has no Hoare annotation [2022-04-28 09:26:30,031 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2022-04-28 09:26:30,031 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2022-04-28 09:26:30,032 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-28 09:26:30,032 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-28 09:26:30,032 WARN L170 areAnnotationChecker]: L16-3 has no Hoare annotation [2022-04-28 09:26:30,032 WARN L170 areAnnotationChecker]: L16-3 has no Hoare annotation [2022-04-28 09:26:30,032 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-04-28 09:26:30,032 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-04-28 09:26:30,032 WARN L170 areAnnotationChecker]: L6-2 has no Hoare annotation [2022-04-28 09:26:30,032 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-28 09:26:30,032 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-28 09:26:30,032 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-28 09:26:30,032 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 09:26:30,034 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 09:26:30 BoogieIcfgContainer [2022-04-28 09:26:30,034 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-28 09:26:30,035 INFO L158 Benchmark]: Toolchain (without parser) took 5224.74ms. Allocated memory was 210.8MB in the beginning and 256.9MB in the end (delta: 46.1MB). Free memory was 160.5MB in the beginning and 233.2MB in the end (delta: -72.7MB). Peak memory consumption was 120.5MB. Max. memory is 8.0GB. [2022-04-28 09:26:30,035 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 210.8MB. Free memory was 176.5MB in the beginning and 176.4MB in the end (delta: 146.8kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 09:26:30,035 INFO L158 Benchmark]: CACSL2BoogieTranslator took 167.61ms. Allocated memory is still 210.8MB. Free memory was 160.2MB in the beginning and 186.5MB in the end (delta: -26.3MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-28 09:26:30,036 INFO L158 Benchmark]: Boogie Preprocessor took 16.60ms. Allocated memory is still 210.8MB. Free memory was 186.5MB in the beginning and 185.1MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-28 09:26:30,036 INFO L158 Benchmark]: RCFGBuilder took 200.29ms. Allocated memory is still 210.8MB. Free memory was 185.1MB in the beginning and 175.3MB in the end (delta: 9.8MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2022-04-28 09:26:30,036 INFO L158 Benchmark]: TraceAbstraction took 4835.38ms. Allocated memory was 210.8MB in the beginning and 256.9MB in the end (delta: 46.1MB). Free memory was 175.0MB in the beginning and 233.2MB in the end (delta: -58.2MB). Peak memory consumption was 136.3MB. Max. memory is 8.0GB. [2022-04-28 09:26:30,037 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.15ms. Allocated memory is still 210.8MB. Free memory was 176.5MB in the beginning and 176.4MB in the end (delta: 146.8kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 167.61ms. Allocated memory is still 210.8MB. Free memory was 160.2MB in the beginning and 186.5MB in the end (delta: -26.3MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 16.60ms. Allocated memory is still 210.8MB. Free memory was 186.5MB in the beginning and 185.1MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 200.29ms. Allocated memory is still 210.8MB. Free memory was 185.1MB in the beginning and 175.3MB in the end (delta: 9.8MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * TraceAbstraction took 4835.38ms. Allocated memory was 210.8MB in the beginning and 256.9MB in the end (delta: 46.1MB). Free memory was 175.0MB in the beginning and 233.2MB in the end (delta: -58.2MB). Peak memory consumption was 136.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: 7]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L13] unsigned int x = 0; [L14] unsigned int y = 1; [L16] COND TRUE x < 6 [L17] x++ [L18] y *= 2 [L16] COND TRUE x < 6 [L17] x++ [L18] y *= 2 [L16] COND TRUE x < 6 [L17] x++ [L18] y *= 2 [L16] COND TRUE x < 6 [L17] x++ [L18] y *= 2 [L16] COND TRUE x < 6 [L17] x++ [L18] y *= 2 [L16] COND TRUE x < 6 [L17] x++ [L18] y *= 2 [L16] COND FALSE !(x < 6) [L21] CALL __VERIFIER_assert(x != 6) [L6] COND TRUE !(cond) [L7] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 21 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.8s, OverallIterations: 8, TraceHistogramMax: 6, PathProgramHistogramMax: 12, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 46 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 45 mSDsluCounter, 243 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 160 mSDsCounter, 50 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 275 IncrementalHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 50 mSolverCounterUnsat, 83 mSDtfsCounter, 275 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 223 GetRequests, 123 SyntacticMatches, 4 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=18occurred in iteration=0, InterpolantAutomatonStates: 42, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 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 09:26:30,068 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...