/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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loop-acceleration/underapprox_1-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 10:38:58,282 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 10:38:58,283 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 10:38:58,321 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 10:38:58,321 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 10:38:58,322 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 10:38:58,327 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 10:38:58,331 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 10:38:58,333 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 10:38:58,337 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 10:38:58,337 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 10:38:58,338 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 10:38:58,338 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 10:38:58,338 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 10:38:58,339 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 10:38:58,340 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 10:38:58,340 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 10:38:58,340 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 10:38:58,341 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 10:38:58,342 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 10:38:58,343 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 10:38:58,345 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 10:38:58,346 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 10:38:58,347 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 10:38:58,348 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 10:38:58,356 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 10:38:58,356 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 10:38:58,357 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 10:38:58,358 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 10:38:58,358 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 10:38:58,358 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 10:38:58,359 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 10:38:58,360 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 10:38:58,360 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 10:38:58,360 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 10:38:58,361 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 10:38:58,361 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 10:38:58,362 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 10:38:58,362 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 10:38:58,362 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 10:38:58,362 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 10:38:58,364 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 10:38:58,365 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2022-04-27 10:38:58,387 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 10:38:58,387 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 10:38:58,387 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 10:38:58,387 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 10:38:58,388 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 10:38:58,388 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 10:38:58,388 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 10:38:58,388 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 10:38:58,388 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 10:38:58,389 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 10:38:58,389 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 10:38:58,389 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 10:38:58,389 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 10:38:58,389 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 10:38:58,389 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 10:38:58,389 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 10:38:58,390 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 10:38:58,390 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 10:38:58,390 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 10:38:58,391 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 10:38:58,391 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 10:38:58,391 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 10:38:58,391 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 10:38:58,391 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 10:38:58,391 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 10:38:58,391 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 10:38:58,391 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 10:38:58,391 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 10:38:58,391 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 10:38:58,391 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 10:38:58,392 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 10:38:58,392 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 10:38:58,392 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 10:38:58,392 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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-27 10:38:58,565 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 10:38:58,578 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 10:38:58,579 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 10:38:58,580 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 10:38:58,580 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 10:38:58,581 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/underapprox_1-1.c [2022-04-27 10:38:58,626 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/769bccd64/7d0d6e6e6ccb4e9ab965582fc1361197/FLAG96f3e4090 [2022-04-27 10:38:58,962 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 10:38:58,962 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/underapprox_1-1.c [2022-04-27 10:38:58,966 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/769bccd64/7d0d6e6e6ccb4e9ab965582fc1361197/FLAG96f3e4090 [2022-04-27 10:38:58,979 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/769bccd64/7d0d6e6e6ccb4e9ab965582fc1361197 [2022-04-27 10:38:58,982 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 10:38:58,982 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 10:38:58,984 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 10:38:58,984 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 10:38:58,986 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 10:38:58,990 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 10:38:58" (1/1) ... [2022-04-27 10:38:58,990 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f884023 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:38:58, skipping insertion in model container [2022-04-27 10:38:58,991 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 10:38:58" (1/1) ... [2022-04-27 10:38:58,999 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 10:38:59,007 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 10:38:59,133 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_1-1.c[327,340] [2022-04-27 10:38:59,140 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 10:38:59,145 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 10:38:59,152 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_1-1.c[327,340] [2022-04-27 10:38:59,154 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 10:38:59,161 INFO L208 MainTranslator]: Completed translation [2022-04-27 10:38:59,161 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:38:59 WrapperNode [2022-04-27 10:38:59,162 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 10:38:59,162 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 10:38:59,162 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 10:38:59,162 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 10:38:59,168 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:38:59" (1/1) ... [2022-04-27 10:38:59,169 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:38:59" (1/1) ... [2022-04-27 10:38:59,172 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:38:59" (1/1) ... [2022-04-27 10:38:59,172 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:38:59" (1/1) ... [2022-04-27 10:38:59,175 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:38:59" (1/1) ... [2022-04-27 10:38:59,177 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:38:59" (1/1) ... [2022-04-27 10:38:59,177 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:38:59" (1/1) ... [2022-04-27 10:38:59,178 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 10:38:59,178 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 10:38:59,178 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 10:38:59,179 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 10:38:59,179 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:38:59" (1/1) ... [2022-04-27 10:38:59,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 10:38:59,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:38:59,228 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-27 10:38:59,234 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-27 10:38:59,253 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 10:38:59,254 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 10:38:59,254 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 10:38:59,254 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 10:38:59,256 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 10:38:59,256 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 10:38:59,256 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 10:38:59,256 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 10:38:59,256 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 10:38:59,257 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 10:38:59,257 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 10:38:59,257 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 10:38:59,257 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 10:38:59,257 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 10:38:59,257 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 10:38:59,257 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 10:38:59,257 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 10:38:59,300 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 10:38:59,301 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 10:38:59,368 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 10:38:59,372 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 10:38:59,372 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 10:38:59,373 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 10:38:59 BoogieIcfgContainer [2022-04-27 10:38:59,373 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 10:38:59,374 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 10:38:59,375 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 10:38:59,377 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 10:38:59,377 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 10:38:58" (1/3) ... [2022-04-27 10:38:59,377 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b32cd8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 10:38:59, skipping insertion in model container [2022-04-27 10:38:59,377 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:38:59" (2/3) ... [2022-04-27 10:38:59,378 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b32cd8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 10:38:59, skipping insertion in model container [2022-04-27 10:38:59,378 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 10:38:59" (3/3) ... [2022-04-27 10:38:59,378 INFO L111 eAbstractionObserver]: Analyzing ICFG underapprox_1-1.c [2022-04-27 10:38:59,387 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 10:38:59,387 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 10:38:59,415 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 10:38:59,419 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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@4d0c6b34, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@463d3a57 [2022-04-27 10:38:59,419 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 10:38:59,424 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-27 10:38:59,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-27 10:38:59,428 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:38:59,428 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:38:59,429 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:38:59,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:38:59,432 INFO L85 PathProgramCache]: Analyzing trace with hash -219174432, now seen corresponding path program 1 times [2022-04-27 10:38:59,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:38:59,438 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367928217] [2022-04-27 10:38:59,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:38:59,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:38:59,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:38:59,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:38:59,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:38:59,540 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-27 10:38:59,541 INFO L290 TraceCheckUtils]: 1: Hoare triple {21#true} assume true; {21#true} is VALID [2022-04-27 10:38:59,541 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {21#true} {21#true} #34#return; {21#true} is VALID [2022-04-27 10:38:59,542 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-27 10:38:59,542 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-27 10:38:59,542 INFO L290 TraceCheckUtils]: 2: Hoare triple {21#true} assume true; {21#true} is VALID [2022-04-27 10:38:59,543 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21#true} {21#true} #34#return; {21#true} is VALID [2022-04-27 10:38:59,543 INFO L272 TraceCheckUtils]: 4: Hoare triple {21#true} call #t~ret5 := main(); {21#true} is VALID [2022-04-27 10:38:59,543 INFO L290 TraceCheckUtils]: 5: Hoare triple {21#true} ~x~0 := 0;~y~0 := 1; {21#true} is VALID [2022-04-27 10:38:59,543 INFO L290 TraceCheckUtils]: 6: Hoare triple {21#true} assume !true; {22#false} is VALID [2022-04-27 10:38:59,544 INFO L272 TraceCheckUtils]: 7: Hoare triple {22#false} call __VERIFIER_assert((if 64 != ~y~0 % 4294967296 then 1 else 0)); {22#false} is VALID [2022-04-27 10:38:59,544 INFO L290 TraceCheckUtils]: 8: Hoare triple {22#false} ~cond := #in~cond; {22#false} is VALID [2022-04-27 10:38:59,544 INFO L290 TraceCheckUtils]: 9: Hoare triple {22#false} assume 0 == ~cond; {22#false} is VALID [2022-04-27 10:38:59,544 INFO L290 TraceCheckUtils]: 10: Hoare triple {22#false} assume !false; {22#false} is VALID [2022-04-27 10:38:59,544 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-27 10:38:59,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:38:59,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367928217] [2022-04-27 10:38:59,545 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367928217] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:38:59,545 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:38:59,545 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 10:38:59,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510718491] [2022-04-27 10:38:59,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:38:59,550 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-27 10:38:59,551 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:38:59,553 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-27 10:38:59,580 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-27 10:38:59,580 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 10:38:59,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:38:59,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 10:38:59,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 10:38:59,595 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-27 10:38:59,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:38:59,645 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2022-04-27 10:38:59,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 10:38:59,645 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-27 10:38:59,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:38:59,646 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-27 10:38:59,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 32 transitions. [2022-04-27 10:38:59,650 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-27 10:38:59,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 32 transitions. [2022-04-27 10:38:59,652 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 32 transitions. [2022-04-27 10:38:59,684 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-27 10:38:59,689 INFO L225 Difference]: With dead ends: 29 [2022-04-27 10:38:59,689 INFO L226 Difference]: Without dead ends: 12 [2022-04-27 10:38:59,690 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-27 10:38:59,692 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-27 10:38:59,693 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-27 10:38:59,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2022-04-27 10:38:59,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2022-04-27 10:38:59,709 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:38:59,710 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-27 10:38:59,710 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-27 10:38:59,710 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-27 10:38:59,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:38:59,712 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2022-04-27 10:38:59,712 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2022-04-27 10:38:59,712 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:38:59,712 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:38:59,712 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-27 10:38:59,713 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-27 10:38:59,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:38:59,714 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2022-04-27 10:38:59,714 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2022-04-27 10:38:59,714 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:38:59,714 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:38:59,714 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:38:59,714 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:38:59,715 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-27 10:38:59,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2022-04-27 10:38:59,716 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 11 [2022-04-27 10:38:59,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:38:59,716 INFO L495 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2022-04-27 10:38:59,717 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-27 10:38:59,717 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2022-04-27 10:38:59,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-27 10:38:59,717 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:38:59,717 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:38:59,717 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 10:38:59,718 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:38:59,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:38:59,718 INFO L85 PathProgramCache]: Analyzing trace with hash -222868516, now seen corresponding path program 1 times [2022-04-27 10:38:59,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:38:59,719 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843561347] [2022-04-27 10:38:59,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:38:59,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:38:59,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:38:59,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:38:59,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:38:59,766 INFO L290 TraceCheckUtils]: 0: Hoare triple {116#(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); {110#true} is VALID [2022-04-27 10:38:59,767 INFO L290 TraceCheckUtils]: 1: Hoare triple {110#true} assume true; {110#true} is VALID [2022-04-27 10:38:59,767 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {110#true} {110#true} #34#return; {110#true} is VALID [2022-04-27 10:38:59,767 INFO L272 TraceCheckUtils]: 0: Hoare triple {110#true} call ULTIMATE.init(); {116#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:38:59,768 INFO L290 TraceCheckUtils]: 1: Hoare triple {116#(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); {110#true} is VALID [2022-04-27 10:38:59,768 INFO L290 TraceCheckUtils]: 2: Hoare triple {110#true} assume true; {110#true} is VALID [2022-04-27 10:38:59,768 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {110#true} {110#true} #34#return; {110#true} is VALID [2022-04-27 10:38:59,768 INFO L272 TraceCheckUtils]: 4: Hoare triple {110#true} call #t~ret5 := main(); {110#true} is VALID [2022-04-27 10:38:59,768 INFO L290 TraceCheckUtils]: 5: Hoare triple {110#true} ~x~0 := 0;~y~0 := 1; {115#(= main_~x~0 0)} is VALID [2022-04-27 10:38:59,769 INFO L290 TraceCheckUtils]: 6: Hoare triple {115#(= main_~x~0 0)} assume !(~x~0 % 4294967296 < 6); {111#false} is VALID [2022-04-27 10:38:59,769 INFO L272 TraceCheckUtils]: 7: Hoare triple {111#false} call __VERIFIER_assert((if 64 != ~y~0 % 4294967296 then 1 else 0)); {111#false} is VALID [2022-04-27 10:38:59,769 INFO L290 TraceCheckUtils]: 8: Hoare triple {111#false} ~cond := #in~cond; {111#false} is VALID [2022-04-27 10:38:59,769 INFO L290 TraceCheckUtils]: 9: Hoare triple {111#false} assume 0 == ~cond; {111#false} is VALID [2022-04-27 10:38:59,770 INFO L290 TraceCheckUtils]: 10: Hoare triple {111#false} assume !false; {111#false} is VALID [2022-04-27 10:38:59,770 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-27 10:38:59,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:38:59,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843561347] [2022-04-27 10:38:59,770 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843561347] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:38:59,770 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:38:59,770 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 10:38:59,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914475938] [2022-04-27 10:38:59,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:38:59,772 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 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-27 10:38:59,772 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:38:59,772 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 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-27 10:38:59,781 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-27 10:38:59,781 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 10:38:59,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:38:59,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 10:38:59,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 10:38:59,782 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 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-27 10:38:59,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:38:59,815 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2022-04-27 10:38:59,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 10:38:59,816 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 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-27 10:38:59,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:38:59,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 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-27 10:38:59,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2022-04-27 10:38:59,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 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-27 10:38:59,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2022-04-27 10:38:59,818 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 18 transitions. [2022-04-27 10:38:59,833 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-27 10:38:59,834 INFO L225 Difference]: With dead ends: 18 [2022-04-27 10:38:59,834 INFO L226 Difference]: Without dead ends: 13 [2022-04-27 10:38:59,834 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 10:38:59,835 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 10:38:59,836 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 18 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 10:38:59,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2022-04-27 10:38:59,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-04-27 10:38:59,838 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:38:59,838 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-27 10:38:59,838 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-27 10:38:59,839 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-27 10:38:59,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:38:59,839 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-04-27 10:38:59,840 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-27 10:38:59,840 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:38:59,840 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:38:59,840 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-27 10:38:59,840 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-27 10:38:59,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:38:59,841 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-04-27 10:38:59,841 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-27 10:38:59,841 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:38:59,841 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:38:59,841 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:38:59,841 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:38:59,842 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-27 10:38:59,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2022-04-27 10:38:59,842 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2022-04-27 10:38:59,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:38:59,843 INFO L495 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2022-04-27 10:38:59,843 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 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-27 10:38:59,843 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-27 10:38:59,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-27 10:38:59,843 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:38:59,843 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:38:59,843 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 10:38:59,844 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:38:59,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:38:59,844 INFO L85 PathProgramCache]: Analyzing trace with hash 1717471862, now seen corresponding path program 1 times [2022-04-27 10:38:59,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:38:59,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695002455] [2022-04-27 10:38:59,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:38:59,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:38:59,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:38:59,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:38:59,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:38:59,909 INFO L290 TraceCheckUtils]: 0: Hoare triple {203#(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); {196#true} is VALID [2022-04-27 10:38:59,909 INFO L290 TraceCheckUtils]: 1: Hoare triple {196#true} assume true; {196#true} is VALID [2022-04-27 10:38:59,909 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {196#true} {196#true} #34#return; {196#true} is VALID [2022-04-27 10:38:59,909 INFO L272 TraceCheckUtils]: 0: Hoare triple {196#true} call ULTIMATE.init(); {203#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:38:59,910 INFO L290 TraceCheckUtils]: 1: Hoare triple {203#(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); {196#true} is VALID [2022-04-27 10:38:59,910 INFO L290 TraceCheckUtils]: 2: Hoare triple {196#true} assume true; {196#true} is VALID [2022-04-27 10:38:59,910 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {196#true} {196#true} #34#return; {196#true} is VALID [2022-04-27 10:38:59,910 INFO L272 TraceCheckUtils]: 4: Hoare triple {196#true} call #t~ret5 := main(); {196#true} is VALID [2022-04-27 10:38:59,910 INFO L290 TraceCheckUtils]: 5: Hoare triple {196#true} ~x~0 := 0;~y~0 := 1; {201#(= main_~x~0 0)} is VALID [2022-04-27 10:38:59,911 INFO L290 TraceCheckUtils]: 6: Hoare triple {201#(= 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; {202#(and (<= main_~x~0 1) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-27 10:38:59,911 INFO L290 TraceCheckUtils]: 7: Hoare triple {202#(and (<= main_~x~0 1) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 6); {197#false} is VALID [2022-04-27 10:38:59,912 INFO L272 TraceCheckUtils]: 8: Hoare triple {197#false} call __VERIFIER_assert((if 64 != ~y~0 % 4294967296 then 1 else 0)); {197#false} is VALID [2022-04-27 10:38:59,912 INFO L290 TraceCheckUtils]: 9: Hoare triple {197#false} ~cond := #in~cond; {197#false} is VALID [2022-04-27 10:38:59,912 INFO L290 TraceCheckUtils]: 10: Hoare triple {197#false} assume 0 == ~cond; {197#false} is VALID [2022-04-27 10:38:59,912 INFO L290 TraceCheckUtils]: 11: Hoare triple {197#false} assume !false; {197#false} is VALID [2022-04-27 10:38:59,912 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-27 10:38:59,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:38:59,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695002455] [2022-04-27 10:38:59,913 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695002455] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:38:59,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2075711082] [2022-04-27 10:38:59,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:38:59,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:38:59,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:38:59,914 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-27 10:38:59,915 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-27 10:38:59,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:38:59,946 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 10:38:59,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:38:59,973 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:39:00,070 INFO L272 TraceCheckUtils]: 0: Hoare triple {196#true} call ULTIMATE.init(); {196#true} is VALID [2022-04-27 10:39:00,071 INFO L290 TraceCheckUtils]: 1: Hoare triple {196#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); {196#true} is VALID [2022-04-27 10:39:00,071 INFO L290 TraceCheckUtils]: 2: Hoare triple {196#true} assume true; {196#true} is VALID [2022-04-27 10:39:00,071 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {196#true} {196#true} #34#return; {196#true} is VALID [2022-04-27 10:39:00,071 INFO L272 TraceCheckUtils]: 4: Hoare triple {196#true} call #t~ret5 := main(); {196#true} is VALID [2022-04-27 10:39:00,072 INFO L290 TraceCheckUtils]: 5: Hoare triple {196#true} ~x~0 := 0;~y~0 := 1; {222#(= main_~y~0 1)} is VALID [2022-04-27 10:39:00,072 INFO L290 TraceCheckUtils]: 6: Hoare triple {222#(= main_~y~0 1)} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {226#(= main_~y~0 2)} is VALID [2022-04-27 10:39:00,073 INFO L290 TraceCheckUtils]: 7: Hoare triple {226#(= main_~y~0 2)} assume !(~x~0 % 4294967296 < 6); {226#(= main_~y~0 2)} is VALID [2022-04-27 10:39:00,073 INFO L272 TraceCheckUtils]: 8: Hoare triple {226#(= main_~y~0 2)} call __VERIFIER_assert((if 64 != ~y~0 % 4294967296 then 1 else 0)); {233#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 10:39:00,074 INFO L290 TraceCheckUtils]: 9: Hoare triple {233#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {237#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 10:39:00,074 INFO L290 TraceCheckUtils]: 10: Hoare triple {237#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {197#false} is VALID [2022-04-27 10:39:00,074 INFO L290 TraceCheckUtils]: 11: Hoare triple {197#false} assume !false; {197#false} is VALID [2022-04-27 10:39:00,074 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-27 10:39:00,074 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 10:39:00,226 INFO L290 TraceCheckUtils]: 11: Hoare triple {197#false} assume !false; {197#false} is VALID [2022-04-27 10:39:00,227 INFO L290 TraceCheckUtils]: 10: Hoare triple {237#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {197#false} is VALID [2022-04-27 10:39:00,228 INFO L290 TraceCheckUtils]: 9: Hoare triple {233#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {237#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 10:39:00,228 INFO L272 TraceCheckUtils]: 8: Hoare triple {253#(not (= 64 (mod main_~y~0 4294967296)))} call __VERIFIER_assert((if 64 != ~y~0 % 4294967296 then 1 else 0)); {233#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 10:39:00,229 INFO L290 TraceCheckUtils]: 7: Hoare triple {253#(not (= 64 (mod main_~y~0 4294967296)))} assume !(~x~0 % 4294967296 < 6); {253#(not (= 64 (mod main_~y~0 4294967296)))} is VALID [2022-04-27 10:39:00,230 INFO L290 TraceCheckUtils]: 6: Hoare triple {260#(not (= (mod (* main_~y~0 2) 4294967296) 64))} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {253#(not (= 64 (mod main_~y~0 4294967296)))} is VALID [2022-04-27 10:39:00,231 INFO L290 TraceCheckUtils]: 5: Hoare triple {196#true} ~x~0 := 0;~y~0 := 1; {260#(not (= (mod (* main_~y~0 2) 4294967296) 64))} is VALID [2022-04-27 10:39:00,231 INFO L272 TraceCheckUtils]: 4: Hoare triple {196#true} call #t~ret5 := main(); {196#true} is VALID [2022-04-27 10:39:00,232 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {196#true} {196#true} #34#return; {196#true} is VALID [2022-04-27 10:39:00,232 INFO L290 TraceCheckUtils]: 2: Hoare triple {196#true} assume true; {196#true} is VALID [2022-04-27 10:39:00,232 INFO L290 TraceCheckUtils]: 1: Hoare triple {196#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); {196#true} is VALID [2022-04-27 10:39:00,232 INFO L272 TraceCheckUtils]: 0: Hoare triple {196#true} call ULTIMATE.init(); {196#true} is VALID [2022-04-27 10:39:00,232 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-27 10:39:00,232 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2075711082] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 10:39:00,232 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 10:39:00,233 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 11 [2022-04-27 10:39:00,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821994116] [2022-04-27 10:39:00,235 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 10:39:00,237 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 9 states have internal predecessors, (17), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-27 10:39:00,237 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:39:00,238 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 9 states have internal predecessors, (17), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:39:00,257 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:39:00,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-27 10:39:00,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:39:00,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-27 10:39:00,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2022-04-27 10:39:00,258 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand has 11 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 9 states have internal predecessors, (17), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:39:00,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:39:00,467 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2022-04-27 10:39:00,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-27 10:39:00,468 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 9 states have internal predecessors, (17), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-27 10:39:00,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:39:00,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 9 states have internal predecessors, (17), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:39:00,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 27 transitions. [2022-04-27 10:39:00,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 9 states have internal predecessors, (17), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:39:00,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 27 transitions. [2022-04-27 10:39:00,471 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 27 transitions. [2022-04-27 10:39:00,498 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:39:00,498 INFO L225 Difference]: With dead ends: 25 [2022-04-27 10:39:00,498 INFO L226 Difference]: Without dead ends: 16 [2022-04-27 10:39:00,499 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2022-04-27 10:39:00,499 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 11 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 10:39:00,500 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 42 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 10:39:00,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-04-27 10:39:00,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2022-04-27 10:39:00,504 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:39:00,504 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-27 10:39:00,504 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-27 10:39:00,504 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-27 10:39:00,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:39:00,505 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2022-04-27 10:39:00,505 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-04-27 10:39:00,505 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:39:00,505 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:39:00,505 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-27 10:39:00,506 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-27 10:39:00,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:39:00,506 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2022-04-27 10:39:00,506 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-04-27 10:39:00,507 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:39:00,507 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:39:00,507 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:39:00,507 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:39:00,507 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-27 10:39:00,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2022-04-27 10:39:00,508 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 12 [2022-04-27 10:39:00,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:39:00,508 INFO L495 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2022-04-27 10:39:00,508 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 9 states have internal predecessors, (17), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:39:00,508 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-04-27 10:39:00,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-27 10:39:00,508 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:39:00,508 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:39:00,525 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-27 10:39:00,724 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-27 10:39:00,725 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:39:00,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:39:00,725 INFO L85 PathProgramCache]: Analyzing trace with hash 1105142364, now seen corresponding path program 2 times [2022-04-27 10:39:00,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:39:00,726 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40538894] [2022-04-27 10:39:00,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:39:00,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:39:00,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:39:00,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:39:00,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:39:00,841 INFO L290 TraceCheckUtils]: 0: Hoare triple {403#(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); {393#true} is VALID [2022-04-27 10:39:00,841 INFO L290 TraceCheckUtils]: 1: Hoare triple {393#true} assume true; {393#true} is VALID [2022-04-27 10:39:00,842 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {393#true} {393#true} #34#return; {393#true} is VALID [2022-04-27 10:39:00,842 INFO L272 TraceCheckUtils]: 0: Hoare triple {393#true} call ULTIMATE.init(); {403#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:39:00,843 INFO L290 TraceCheckUtils]: 1: Hoare triple {403#(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); {393#true} is VALID [2022-04-27 10:39:00,843 INFO L290 TraceCheckUtils]: 2: Hoare triple {393#true} assume true; {393#true} is VALID [2022-04-27 10:39:00,843 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {393#true} {393#true} #34#return; {393#true} is VALID [2022-04-27 10:39:00,845 INFO L272 TraceCheckUtils]: 4: Hoare triple {393#true} call #t~ret5 := main(); {393#true} is VALID [2022-04-27 10:39:00,852 INFO L290 TraceCheckUtils]: 5: Hoare triple {393#true} ~x~0 := 0;~y~0 := 1; {398#(= main_~x~0 0)} is VALID [2022-04-27 10:39:00,852 INFO L290 TraceCheckUtils]: 6: Hoare triple {398#(= 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; {399#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 10:39:00,853 INFO L290 TraceCheckUtils]: 7: Hoare triple {399#(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; {400#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 10:39:00,853 INFO L290 TraceCheckUtils]: 8: Hoare triple {400#(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; {401#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-27 10:39:00,854 INFO L290 TraceCheckUtils]: 9: Hoare triple {401#(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; {402#(and (<= main_~x~0 4) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-27 10:39:00,855 INFO L290 TraceCheckUtils]: 10: Hoare triple {402#(and (<= main_~x~0 4) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 6); {394#false} is VALID [2022-04-27 10:39:00,855 INFO L272 TraceCheckUtils]: 11: Hoare triple {394#false} call __VERIFIER_assert((if 64 != ~y~0 % 4294967296 then 1 else 0)); {394#false} is VALID [2022-04-27 10:39:00,855 INFO L290 TraceCheckUtils]: 12: Hoare triple {394#false} ~cond := #in~cond; {394#false} is VALID [2022-04-27 10:39:00,855 INFO L290 TraceCheckUtils]: 13: Hoare triple {394#false} assume 0 == ~cond; {394#false} is VALID [2022-04-27 10:39:00,855 INFO L290 TraceCheckUtils]: 14: Hoare triple {394#false} assume !false; {394#false} is VALID [2022-04-27 10:39:00,855 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-27 10:39:00,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:39:00,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40538894] [2022-04-27 10:39:00,856 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40538894] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:39:00,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [697776979] [2022-04-27 10:39:00,856 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 10:39:00,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:39:00,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:39:00,858 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-27 10:39:00,871 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-27 10:39:00,902 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 10:39:00,902 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 10:39:00,903 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-27 10:39:00,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:39:00,909 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:39:01,000 INFO L272 TraceCheckUtils]: 0: Hoare triple {393#true} call ULTIMATE.init(); {393#true} is VALID [2022-04-27 10:39:01,000 INFO L290 TraceCheckUtils]: 1: Hoare triple {393#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); {393#true} is VALID [2022-04-27 10:39:01,000 INFO L290 TraceCheckUtils]: 2: Hoare triple {393#true} assume true; {393#true} is VALID [2022-04-27 10:39:01,000 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {393#true} {393#true} #34#return; {393#true} is VALID [2022-04-27 10:39:01,000 INFO L272 TraceCheckUtils]: 4: Hoare triple {393#true} call #t~ret5 := main(); {393#true} is VALID [2022-04-27 10:39:01,001 INFO L290 TraceCheckUtils]: 5: Hoare triple {393#true} ~x~0 := 0;~y~0 := 1; {422#(= main_~y~0 1)} is VALID [2022-04-27 10:39:01,001 INFO L290 TraceCheckUtils]: 6: Hoare triple {422#(= main_~y~0 1)} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {426#(= main_~y~0 2)} is VALID [2022-04-27 10:39:01,002 INFO L290 TraceCheckUtils]: 7: Hoare triple {426#(= main_~y~0 2)} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {430#(= main_~y~0 4)} is VALID [2022-04-27 10:39:01,002 INFO L290 TraceCheckUtils]: 8: Hoare triple {430#(= main_~y~0 4)} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {434#(= main_~y~0 8)} is VALID [2022-04-27 10:39:01,003 INFO L290 TraceCheckUtils]: 9: Hoare triple {434#(= main_~y~0 8)} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {438#(= main_~y~0 16)} is VALID [2022-04-27 10:39:01,003 INFO L290 TraceCheckUtils]: 10: Hoare triple {438#(= main_~y~0 16)} assume !(~x~0 % 4294967296 < 6); {438#(= main_~y~0 16)} is VALID [2022-04-27 10:39:01,003 INFO L272 TraceCheckUtils]: 11: Hoare triple {438#(= main_~y~0 16)} call __VERIFIER_assert((if 64 != ~y~0 % 4294967296 then 1 else 0)); {445#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 10:39:01,004 INFO L290 TraceCheckUtils]: 12: Hoare triple {445#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {449#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 10:39:01,004 INFO L290 TraceCheckUtils]: 13: Hoare triple {449#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {394#false} is VALID [2022-04-27 10:39:01,004 INFO L290 TraceCheckUtils]: 14: Hoare triple {394#false} assume !false; {394#false} is VALID [2022-04-27 10:39:01,004 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-27 10:39:01,005 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 10:39:01,153 INFO L290 TraceCheckUtils]: 14: Hoare triple {394#false} assume !false; {394#false} is VALID [2022-04-27 10:39:01,153 INFO L290 TraceCheckUtils]: 13: Hoare triple {449#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {394#false} is VALID [2022-04-27 10:39:01,154 INFO L290 TraceCheckUtils]: 12: Hoare triple {445#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {449#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 10:39:01,155 INFO L272 TraceCheckUtils]: 11: Hoare triple {465#(not (= 64 (mod main_~y~0 4294967296)))} call __VERIFIER_assert((if 64 != ~y~0 % 4294967296 then 1 else 0)); {445#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 10:39:01,157 INFO L290 TraceCheckUtils]: 10: Hoare triple {465#(not (= 64 (mod main_~y~0 4294967296)))} assume !(~x~0 % 4294967296 < 6); {465#(not (= 64 (mod main_~y~0 4294967296)))} is VALID [2022-04-27 10:39:01,158 INFO L290 TraceCheckUtils]: 9: Hoare triple {472#(not (= (mod (* main_~y~0 2) 4294967296) 64))} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {465#(not (= 64 (mod main_~y~0 4294967296)))} is VALID [2022-04-27 10:39:01,159 INFO L290 TraceCheckUtils]: 8: Hoare triple {476#(not (= (mod (* main_~y~0 4) 4294967296) 64))} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {472#(not (= (mod (* main_~y~0 2) 4294967296) 64))} is VALID [2022-04-27 10:39:01,160 INFO L290 TraceCheckUtils]: 7: Hoare triple {480#(not (= (mod (* main_~y~0 8) 4294967296) 64))} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {476#(not (= (mod (* main_~y~0 4) 4294967296) 64))} is VALID [2022-04-27 10:39:01,161 INFO L290 TraceCheckUtils]: 6: Hoare triple {484#(not (= 64 (mod (* main_~y~0 16) 4294967296)))} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {480#(not (= (mod (* main_~y~0 8) 4294967296) 64))} is VALID [2022-04-27 10:39:01,163 INFO L290 TraceCheckUtils]: 5: Hoare triple {393#true} ~x~0 := 0;~y~0 := 1; {484#(not (= 64 (mod (* main_~y~0 16) 4294967296)))} is VALID [2022-04-27 10:39:01,163 INFO L272 TraceCheckUtils]: 4: Hoare triple {393#true} call #t~ret5 := main(); {393#true} is VALID [2022-04-27 10:39:01,163 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {393#true} {393#true} #34#return; {393#true} is VALID [2022-04-27 10:39:01,163 INFO L290 TraceCheckUtils]: 2: Hoare triple {393#true} assume true; {393#true} is VALID [2022-04-27 10:39:01,163 INFO L290 TraceCheckUtils]: 1: Hoare triple {393#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); {393#true} is VALID [2022-04-27 10:39:01,163 INFO L272 TraceCheckUtils]: 0: Hoare triple {393#true} call ULTIMATE.init(); {393#true} is VALID [2022-04-27 10:39:01,163 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-27 10:39:01,164 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [697776979] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 10:39:01,164 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 10:39:01,164 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 20 [2022-04-27 10:39:01,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989507126] [2022-04-27 10:39:01,164 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 10:39:01,165 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.3) internal successors, (26), 18 states have internal predecessors, (26), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-27 10:39:01,165 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:39:01,165 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 20 states, 20 states have (on average 1.3) internal successors, (26), 18 states have internal predecessors, (26), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:39:01,188 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:39:01,188 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-27 10:39:01,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:39:01,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-27 10:39:01,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=317, Unknown=0, NotChecked=0, Total=380 [2022-04-27 10:39:01,189 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand has 20 states, 20 states have (on average 1.3) internal successors, (26), 18 states have internal predecessors, (26), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:39:03,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:39:03,690 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2022-04-27 10:39:03,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-27 10:39:03,690 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.3) internal successors, (26), 18 states have internal predecessors, (26), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-27 10:39:03,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:39:03,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.3) internal successors, (26), 18 states have internal predecessors, (26), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:39:03,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 39 transitions. [2022-04-27 10:39:03,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.3) internal successors, (26), 18 states have internal predecessors, (26), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:39:03,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 39 transitions. [2022-04-27 10:39:03,693 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 39 transitions. [2022-04-27 10:39:04,215 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:39:04,216 INFO L225 Difference]: With dead ends: 34 [2022-04-27 10:39:04,216 INFO L226 Difference]: Without dead ends: 23 [2022-04-27 10:39:04,216 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=175, Invalid=817, Unknown=0, NotChecked=0, Total=992 [2022-04-27 10:39:04,217 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 22 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 10:39:04,217 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 76 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 10:39:04,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-27 10:39:04,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2022-04-27 10:39:04,236 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:39:04,236 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 22 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 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-27 10:39:04,237 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 22 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 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-27 10:39:04,237 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 22 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 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-27 10:39:04,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:39:04,238 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2022-04-27 10:39:04,238 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2022-04-27 10:39:04,238 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:39:04,238 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:39:04,238 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 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 23 states. [2022-04-27 10:39:04,238 INFO L87 Difference]: Start difference. First operand has 22 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 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 23 states. [2022-04-27 10:39:04,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:39:04,239 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2022-04-27 10:39:04,239 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2022-04-27 10:39:04,240 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:39:04,240 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:39:04,240 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:39:04,240 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:39:04,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 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-27 10:39:04,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2022-04-27 10:39:04,241 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 15 [2022-04-27 10:39:04,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:39:04,241 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2022-04-27 10:39:04,241 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.3) internal successors, (26), 18 states have internal predecessors, (26), 4 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:39:04,241 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2022-04-27 10:39:04,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-27 10:39:04,242 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:39:04,242 INFO L195 NwaCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:39:04,259 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-04-27 10:39:04,460 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-27 10:39:04,460 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:39:04,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:39:04,460 INFO L85 PathProgramCache]: Analyzing trace with hash -1943317092, now seen corresponding path program 3 times [2022-04-27 10:39:04,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:39:04,461 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971360741] [2022-04-27 10:39:04,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:39:04,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:39:04,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-27 10:39:04,480 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-27 10:39:04,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-27 10:39:04,519 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-27 10:39:04,519 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-04-27 10:39:04,520 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 10:39:04,522 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-27 10:39:04,524 INFO L356 BasicCegarLoop]: Path program histogram: [3, 1, 1] [2022-04-27 10:39:04,527 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 10:39:04,537 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-27 10:39:04,537 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2022-04-27 10:39:04,537 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-27 10:39:04,537 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-27 10:39:04,537 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2022-04-27 10:39:04,537 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2022-04-27 10:39:04,537 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-27 10:39:04,537 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 10:39:04,537 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-27 10:39:04,537 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-27 10:39:04,537 WARN L170 areAnnotationChecker]: L16-2 has no Hoare annotation [2022-04-27 10:39:04,538 WARN L170 areAnnotationChecker]: L16-2 has no Hoare annotation [2022-04-27 10:39:04,538 WARN L170 areAnnotationChecker]: L16-2 has no Hoare annotation [2022-04-27 10:39:04,538 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2022-04-27 10:39:04,538 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2022-04-27 10:39:04,538 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-27 10:39:04,538 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 10:39:04,538 WARN L170 areAnnotationChecker]: L16-3 has no Hoare annotation [2022-04-27 10:39:04,538 WARN L170 areAnnotationChecker]: L16-3 has no Hoare annotation [2022-04-27 10:39:04,538 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-04-27 10:39:04,538 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-04-27 10:39:04,538 WARN L170 areAnnotationChecker]: L6-2 has no Hoare annotation [2022-04-27 10:39:04,538 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 10:39:04,538 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 10:39:04,538 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-27 10:39:04,538 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-27 10:39:04,538 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 10:39:04 BoogieIcfgContainer [2022-04-27 10:39:04,538 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 10:39:04,539 INFO L158 Benchmark]: Toolchain (without parser) took 5556.81ms. Allocated memory was 198.2MB in the beginning and 278.9MB in the end (delta: 80.7MB). Free memory was 143.3MB in the beginning and 202.0MB in the end (delta: -58.7MB). Peak memory consumption was 22.2MB. Max. memory is 8.0GB. [2022-04-27 10:39:04,539 INFO L158 Benchmark]: CDTParser took 0.08ms. Allocated memory is still 198.2MB. Free memory is still 159.2MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 10:39:04,539 INFO L158 Benchmark]: CACSL2BoogieTranslator took 178.14ms. Allocated memory is still 198.2MB. Free memory was 143.1MB in the beginning and 168.5MB in the end (delta: -25.4MB). Peak memory consumption was 11.9MB. Max. memory is 8.0GB. [2022-04-27 10:39:04,540 INFO L158 Benchmark]: Boogie Preprocessor took 15.88ms. Allocated memory is still 198.2MB. Free memory was 168.5MB in the beginning and 167.1MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-27 10:39:04,540 INFO L158 Benchmark]: RCFGBuilder took 195.17ms. Allocated memory is still 198.2MB. Free memory was 167.1MB in the beginning and 157.0MB in the end (delta: 10.1MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-27 10:39:04,540 INFO L158 Benchmark]: TraceAbstraction took 5163.98ms. Allocated memory was 198.2MB in the beginning and 278.9MB in the end (delta: 80.7MB). Free memory was 156.7MB in the beginning and 202.0MB in the end (delta: -45.3MB). Peak memory consumption was 36.4MB. Max. memory is 8.0GB. [2022-04-27 10:39:04,541 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.08ms. Allocated memory is still 198.2MB. Free memory is still 159.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 178.14ms. Allocated memory is still 198.2MB. Free memory was 143.1MB in the beginning and 168.5MB in the end (delta: -25.4MB). Peak memory consumption was 11.9MB. Max. memory is 8.0GB. * Boogie Preprocessor took 15.88ms. Allocated memory is still 198.2MB. Free memory was 168.5MB in the beginning and 167.1MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 195.17ms. Allocated memory is still 198.2MB. Free memory was 167.1MB in the beginning and 157.0MB in the end (delta: 10.1MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 5163.98ms. Allocated memory was 198.2MB in the beginning and 278.9MB in the end (delta: 80.7MB). Free memory was 156.7MB in the beginning and 202.0MB in the end (delta: -45.3MB). Peak memory consumption was 36.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - 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; VAL [x=0, y=1] [L16] COND TRUE x < 6 [L17] x++ [L18] y *= 2 VAL [x=1, y=2] [L16] COND TRUE x < 6 [L17] x++ [L18] y *= 2 VAL [x=2, y=4] [L16] COND TRUE x < 6 [L17] x++ [L18] y *= 2 VAL [x=3, y=8] [L16] COND TRUE x < 6 [L17] x++ [L18] y *= 2 VAL [x=4, y=16] [L16] COND TRUE x < 6 [L17] x++ [L18] y *= 2 VAL [x=5, y=32] [L16] COND TRUE x < 6 [L17] x++ [L18] y *= 2 VAL [x=6, y=64] [L16] COND FALSE !(x < 6) VAL [x=6, y=64] [L21] CALL __VERIFIER_assert(y != 64) VAL [\old(cond)=0] [L6] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L7] reach_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 21 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.1s, OverallIterations: 5, TraceHistogramMax: 6, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 3.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 49 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 48 mSDsluCounter, 156 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 104 mSDsCounter, 46 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 229 IncrementalHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 46 mSolverCounterUnsat, 52 mSDtfsCounter, 229 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 95 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=22occurred in iteration=4, InterpolantAutomatonStates: 31, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 93 NumberOfCodeBlocks, 93 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 95 ConstructedInterpolants, 0 QuantifiedInterpolants, 254 SizeOfPredicates, 2 NumberOfNonLiveVariables, 131 ConjunctsInSsa, 20 ConjunctsInUnsatCore, 8 InterpolantComputations, 2 PerfectInterpolantSequences, 0/33 InterpolantCoveringCapability, 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-27 10:39:04,575 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...