/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_2-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 10:39:46,068 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 10:39:46,070 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 10:39:46,103 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 10:39:46,104 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 10:39:46,104 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 10:39:46,106 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 10:39:46,112 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 10:39:46,113 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 10:39:46,114 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 10:39:46,115 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 10:39:46,116 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 10:39:46,116 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 10:39:46,117 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 10:39:46,118 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 10:39:46,119 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 10:39:46,119 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 10:39:46,120 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 10:39:46,121 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 10:39:46,127 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 10:39:46,130 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 10:39:46,134 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 10:39:46,136 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 10:39:46,138 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 10:39:46,141 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 10:39:46,148 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 10:39:46,149 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 10:39:46,149 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 10:39:46,150 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 10:39:46,150 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 10:39:46,150 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 10:39:46,151 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 10:39:46,151 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 10:39:46,152 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 10:39:46,152 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 10:39:46,153 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 10:39:46,153 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 10:39:46,154 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 10:39:46,154 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 10:39:46,154 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 10:39:46,155 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 10:39:46,161 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 10:39:46,162 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:39:46,192 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 10:39:46,193 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 10:39:46,193 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 10:39:46,193 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 10:39:46,194 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 10:39:46,194 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 10:39:46,195 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 10:39:46,195 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 10:39:46,195 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 10:39:46,196 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 10:39:46,196 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 10:39:46,196 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 10:39:46,196 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 10:39:46,196 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 10:39:46,196 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 10:39:46,197 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 10:39:46,197 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 10:39:46,197 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 10:39:46,197 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 10:39:46,198 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 10:39:46,198 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 10:39:46,198 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 10:39:46,199 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 10:39:46,199 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 10:39:46,199 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 10:39:46,199 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 10:39:46,199 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 10:39:46,199 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 10:39:46,200 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 10:39:46,200 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 10:39:46,200 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 10:39:46,200 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 10:39:46,200 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 10:39:46,200 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:39:46,426 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 10:39:46,458 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 10:39:46,460 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 10:39:46,461 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 10:39:46,461 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 10:39:46,463 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/underapprox_2-1.c [2022-04-27 10:39:46,512 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c548cb5d/f6ffea8fb9cc4cb8ae4b7dcba8a6738d/FLAGe1c1523bb [2022-04-27 10:39:46,879 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 10:39:46,879 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/underapprox_2-1.c [2022-04-27 10:39:46,883 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c548cb5d/f6ffea8fb9cc4cb8ae4b7dcba8a6738d/FLAGe1c1523bb [2022-04-27 10:39:47,318 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c548cb5d/f6ffea8fb9cc4cb8ae4b7dcba8a6738d [2022-04-27 10:39:47,320 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 10:39:47,321 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 10:39:47,325 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 10:39:47,326 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 10:39:47,328 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 10:39:47,332 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 10:39:47" (1/1) ... [2022-04-27 10:39:47,333 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66e5a630 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:39:47, skipping insertion in model container [2022-04-27 10:39:47,333 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 10:39:47" (1/1) ... [2022-04-27 10:39:47,338 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 10:39:47,347 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 10:39:47,470 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/underapprox_2-1.c[327,340] [2022-04-27 10:39:47,480 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 10:39:47,487 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 10:39:47,497 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/underapprox_2-1.c[327,340] [2022-04-27 10:39:47,499 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 10:39:47,510 INFO L208 MainTranslator]: Completed translation [2022-04-27 10:39:47,510 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:39:47 WrapperNode [2022-04-27 10:39:47,510 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 10:39:47,511 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 10:39:47,511 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 10:39:47,511 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 10:39:47,519 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:39:47" (1/1) ... [2022-04-27 10:39:47,520 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:39:47" (1/1) ... [2022-04-27 10:39:47,524 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:39:47" (1/1) ... [2022-04-27 10:39:47,524 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:39:47" (1/1) ... [2022-04-27 10:39:47,532 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:39:47" (1/1) ... [2022-04-27 10:39:47,535 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:39:47" (1/1) ... [2022-04-27 10:39:47,538 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:39:47" (1/1) ... [2022-04-27 10:39:47,539 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 10:39:47,540 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 10:39:47,540 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 10:39:47,540 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 10:39:47,541 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:39:47" (1/1) ... [2022-04-27 10:39:47,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 10:39:47,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:39:47,565 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:39:47,573 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:39:47,598 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 10:39:47,599 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 10:39:47,599 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 10:39:47,599 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 10:39:47,599 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 10:39:47,599 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 10:39:47,599 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 10:39:47,599 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 10:39:47,599 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 10:39:47,600 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 10:39:47,600 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 10:39:47,600 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 10:39:47,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 10:39:47,600 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 10:39:47,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 10:39:47,600 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 10:39:47,600 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 10:39:47,646 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 10:39:47,647 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 10:39:47,785 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 10:39:47,791 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 10:39:47,791 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 10:39:47,792 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 10:39:47 BoogieIcfgContainer [2022-04-27 10:39:47,792 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 10:39:47,794 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 10:39:47,794 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 10:39:47,798 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 10:39:47,798 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 10:39:47" (1/3) ... [2022-04-27 10:39:47,799 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2edbd74c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 10:39:47, skipping insertion in model container [2022-04-27 10:39:47,799 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:39:47" (2/3) ... [2022-04-27 10:39:47,800 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2edbd74c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 10:39:47, skipping insertion in model container [2022-04-27 10:39:47,800 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 10:39:47" (3/3) ... [2022-04-27 10:39:47,801 INFO L111 eAbstractionObserver]: Analyzing ICFG underapprox_2-1.c [2022-04-27 10:39:47,814 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 10:39:47,814 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 10:39:47,873 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 10:39:47,885 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@f51da72, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@7922210d [2022-04-27 10:39:47,885 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 10:39:47,893 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:39:47,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-27 10:39:47,899 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:39:47,899 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:39:47,900 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:39:47,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:39:47,906 INFO L85 PathProgramCache]: Analyzing trace with hash -219174432, now seen corresponding path program 1 times [2022-04-27 10:39:47,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:39:47,915 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593309048] [2022-04-27 10:39:47,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:39:47,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:39:48,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:39:48,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:39:48,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:39:48,110 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:39:48,110 INFO L290 TraceCheckUtils]: 1: Hoare triple {21#true} assume true; {21#true} is VALID [2022-04-27 10:39:48,111 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {21#true} {21#true} #34#return; {21#true} is VALID [2022-04-27 10:39:48,113 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:39:48,113 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:39:48,113 INFO L290 TraceCheckUtils]: 2: Hoare triple {21#true} assume true; {21#true} is VALID [2022-04-27 10:39:48,113 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21#true} {21#true} #34#return; {21#true} is VALID [2022-04-27 10:39:48,113 INFO L272 TraceCheckUtils]: 4: Hoare triple {21#true} call #t~ret5 := main(); {21#true} is VALID [2022-04-27 10:39:48,114 INFO L290 TraceCheckUtils]: 5: Hoare triple {21#true} ~x~0 := 0;~y~0 := 1; {21#true} is VALID [2022-04-27 10:39:48,114 INFO L290 TraceCheckUtils]: 6: Hoare triple {21#true} assume !true; {22#false} is VALID [2022-04-27 10:39:48,114 INFO L272 TraceCheckUtils]: 7: Hoare triple {22#false} call __VERIFIER_assert((if 6 != ~x~0 % 4294967296 then 1 else 0)); {22#false} is VALID [2022-04-27 10:39:48,115 INFO L290 TraceCheckUtils]: 8: Hoare triple {22#false} ~cond := #in~cond; {22#false} is VALID [2022-04-27 10:39:48,115 INFO L290 TraceCheckUtils]: 9: Hoare triple {22#false} assume 0 == ~cond; {22#false} is VALID [2022-04-27 10:39:48,115 INFO L290 TraceCheckUtils]: 10: Hoare triple {22#false} assume !false; {22#false} is VALID [2022-04-27 10:39:48,115 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:39:48,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:39:48,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593309048] [2022-04-27 10:39:48,116 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593309048] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:39:48,117 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:39:48,117 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 10:39:48,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123757498] [2022-04-27 10:39:48,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:39:48,122 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:39:48,123 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:39:48,126 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:39:48,140 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:39:48,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 10:39:48,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:39:48,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 10:39:48,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 10:39:48,158 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:39:48,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:39:48,220 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2022-04-27 10:39:48,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 10:39:48,220 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:39:48,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:39:48,221 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:39:48,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 32 transitions. [2022-04-27 10:39:48,233 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:39:48,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 32 transitions. [2022-04-27 10:39:48,243 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 32 transitions. [2022-04-27 10:39:48,308 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:39:48,315 INFO L225 Difference]: With dead ends: 29 [2022-04-27 10:39:48,315 INFO L226 Difference]: Without dead ends: 12 [2022-04-27 10:39:48,317 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:39:48,320 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:39:48,324 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:39:48,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2022-04-27 10:39:48,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2022-04-27 10:39:48,356 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:39:48,357 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:39:48,358 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:39:48,358 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:39:48,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:39:48,366 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2022-04-27 10:39:48,366 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2022-04-27 10:39:48,366 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:39:48,366 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:39:48,367 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:39:48,367 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:39:48,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:39:48,369 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2022-04-27 10:39:48,370 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2022-04-27 10:39:48,370 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:39:48,370 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:39:48,370 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:39:48,371 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:39:48,371 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:39:48,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2022-04-27 10:39:48,374 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 11 [2022-04-27 10:39:48,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:39:48,376 INFO L495 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2022-04-27 10:39:48,376 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:39:48,377 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2022-04-27 10:39:48,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-27 10:39:48,378 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:39:48,378 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:39:48,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 10:39:48,382 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:39:48,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:39:48,388 INFO L85 PathProgramCache]: Analyzing trace with hash -222868516, now seen corresponding path program 1 times [2022-04-27 10:39:48,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:39:48,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331746170] [2022-04-27 10:39:48,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:39:48,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:39:48,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:39:48,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:39:48,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:39:48,559 INFO L290 TraceCheckUtils]: 0: Hoare triple {118#(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:39:48,559 INFO L290 TraceCheckUtils]: 1: Hoare triple {110#true} assume true; {110#true} is VALID [2022-04-27 10:39:48,560 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {110#true} {110#true} #34#return; {110#true} is VALID [2022-04-27 10:39:48,560 INFO L272 TraceCheckUtils]: 0: Hoare triple {110#true} call ULTIMATE.init(); {118#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:39:48,561 INFO L290 TraceCheckUtils]: 1: Hoare triple {118#(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:39:48,561 INFO L290 TraceCheckUtils]: 2: Hoare triple {110#true} assume true; {110#true} is VALID [2022-04-27 10:39:48,562 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {110#true} {110#true} #34#return; {110#true} is VALID [2022-04-27 10:39:48,562 INFO L272 TraceCheckUtils]: 4: Hoare triple {110#true} call #t~ret5 := main(); {110#true} is VALID [2022-04-27 10:39:48,563 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:39:48,564 INFO L290 TraceCheckUtils]: 6: Hoare triple {115#(= main_~x~0 0)} assume !(~x~0 % 4294967296 < 6); {111#false} is VALID [2022-04-27 10:39:48,565 INFO L272 TraceCheckUtils]: 7: Hoare triple {111#false} call __VERIFIER_assert((if 6 != ~x~0 % 4294967296 then 1 else 0)); {116#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 10:39:48,565 INFO L290 TraceCheckUtils]: 8: Hoare triple {116#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {117#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 10:39:48,565 INFO L290 TraceCheckUtils]: 9: Hoare triple {117#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {111#false} is VALID [2022-04-27 10:39:48,566 INFO L290 TraceCheckUtils]: 10: Hoare triple {111#false} assume !false; {111#false} is VALID [2022-04-27 10:39:48,567 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:39:48,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:39:48,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331746170] [2022-04-27 10:39:48,568 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331746170] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:39:48,568 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:39:48,568 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 10:39:48,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461073342] [2022-04-27 10:39:48,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:39:48,569 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-27 10:39:48,570 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:39:48,570 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:39:48,586 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:39:48,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 10:39:48,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:39:48,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 10:39:48,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 10:39:48,588 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:39:48,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:39:48,707 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2022-04-27 10:39:48,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 10:39:48,708 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-27 10:39:48,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:39:48,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:39:48,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2022-04-27 10:39:48,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:39:48,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2022-04-27 10:39:48,716 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 18 transitions. [2022-04-27 10:39:48,738 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:39:48,740 INFO L225 Difference]: With dead ends: 18 [2022-04-27 10:39:48,741 INFO L226 Difference]: Without dead ends: 13 [2022-04-27 10:39:48,744 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-27 10:39:48,747 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 6 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 10:39:48,747 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 28 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 10:39:48,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2022-04-27 10:39:48,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-04-27 10:39:48,752 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:39:48,752 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:39:48,753 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:39:48,753 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:39:48,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:39:48,755 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-04-27 10:39:48,755 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-27 10:39:48,755 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:39:48,755 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:39:48,756 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:39:48,756 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:39:48,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:39:48,757 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-04-27 10:39:48,757 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-27 10:39:48,757 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:39:48,758 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:39:48,758 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:39:48,758 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:39:48,758 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:39:48,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2022-04-27 10:39:48,759 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2022-04-27 10:39:48,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:39:48,760 INFO L495 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2022-04-27 10:39:48,761 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:39:48,761 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-27 10:39:48,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-27 10:39:48,762 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:39:48,762 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:39:48,762 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 10:39:48,762 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:39:48,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:39:48,763 INFO L85 PathProgramCache]: Analyzing trace with hash 1717471862, now seen corresponding path program 1 times [2022-04-27 10:39:48,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:39:48,763 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445133923] [2022-04-27 10:39:48,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:39:48,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:39:48,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:39:48,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:39:48,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:39:48,901 INFO L290 TraceCheckUtils]: 0: Hoare triple {207#(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); {198#true} is VALID [2022-04-27 10:39:48,901 INFO L290 TraceCheckUtils]: 1: Hoare triple {198#true} assume true; {198#true} is VALID [2022-04-27 10:39:48,901 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {198#true} {198#true} #34#return; {198#true} is VALID [2022-04-27 10:39:48,902 INFO L272 TraceCheckUtils]: 0: Hoare triple {198#true} call ULTIMATE.init(); {207#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:39:48,902 INFO L290 TraceCheckUtils]: 1: Hoare triple {207#(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); {198#true} is VALID [2022-04-27 10:39:48,903 INFO L290 TraceCheckUtils]: 2: Hoare triple {198#true} assume true; {198#true} is VALID [2022-04-27 10:39:48,903 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {198#true} {198#true} #34#return; {198#true} is VALID [2022-04-27 10:39:48,903 INFO L272 TraceCheckUtils]: 4: Hoare triple {198#true} call #t~ret5 := main(); {198#true} is VALID [2022-04-27 10:39:48,903 INFO L290 TraceCheckUtils]: 5: Hoare triple {198#true} ~x~0 := 0;~y~0 := 1; {203#(= main_~x~0 0)} is VALID [2022-04-27 10:39:48,904 INFO L290 TraceCheckUtils]: 6: Hoare triple {203#(= 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; {204#(and (<= main_~x~0 1) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-27 10:39:48,905 INFO L290 TraceCheckUtils]: 7: Hoare triple {204#(and (<= main_~x~0 1) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 6); {199#false} is VALID [2022-04-27 10:39:48,905 INFO L272 TraceCheckUtils]: 8: Hoare triple {199#false} call __VERIFIER_assert((if 6 != ~x~0 % 4294967296 then 1 else 0)); {205#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 10:39:48,906 INFO L290 TraceCheckUtils]: 9: Hoare triple {205#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {206#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 10:39:48,906 INFO L290 TraceCheckUtils]: 10: Hoare triple {206#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {199#false} is VALID [2022-04-27 10:39:48,906 INFO L290 TraceCheckUtils]: 11: Hoare triple {199#false} assume !false; {199#false} is VALID [2022-04-27 10:39:48,907 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:48,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:39:48,907 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445133923] [2022-04-27 10:39:48,908 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445133923] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:39:48,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1874130679] [2022-04-27 10:39:48,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:39:48,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:39:48,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:39:48,910 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:39:48,911 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:39:48,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:39:48,951 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-27 10:39:48,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:39:48,961 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:39:49,017 INFO L272 TraceCheckUtils]: 0: Hoare triple {198#true} call ULTIMATE.init(); {198#true} is VALID [2022-04-27 10:39:49,018 INFO L290 TraceCheckUtils]: 1: Hoare triple {198#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); {198#true} is VALID [2022-04-27 10:39:49,018 INFO L290 TraceCheckUtils]: 2: Hoare triple {198#true} assume true; {198#true} is VALID [2022-04-27 10:39:49,018 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {198#true} {198#true} #34#return; {198#true} is VALID [2022-04-27 10:39:49,018 INFO L272 TraceCheckUtils]: 4: Hoare triple {198#true} call #t~ret5 := main(); {198#true} is VALID [2022-04-27 10:39:49,019 INFO L290 TraceCheckUtils]: 5: Hoare triple {198#true} ~x~0 := 0;~y~0 := 1; {203#(= main_~x~0 0)} is VALID [2022-04-27 10:39:49,019 INFO L290 TraceCheckUtils]: 6: Hoare triple {203#(= 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; {229#(= main_~x~0 1)} is VALID [2022-04-27 10:39:49,020 INFO L290 TraceCheckUtils]: 7: Hoare triple {229#(= main_~x~0 1)} assume !(~x~0 % 4294967296 < 6); {199#false} is VALID [2022-04-27 10:39:49,020 INFO L272 TraceCheckUtils]: 8: Hoare triple {199#false} call __VERIFIER_assert((if 6 != ~x~0 % 4294967296 then 1 else 0)); {199#false} is VALID [2022-04-27 10:39:49,020 INFO L290 TraceCheckUtils]: 9: Hoare triple {199#false} ~cond := #in~cond; {199#false} is VALID [2022-04-27 10:39:49,021 INFO L290 TraceCheckUtils]: 10: Hoare triple {199#false} assume 0 == ~cond; {199#false} is VALID [2022-04-27 10:39:49,021 INFO L290 TraceCheckUtils]: 11: Hoare triple {199#false} assume !false; {199#false} is VALID [2022-04-27 10:39:49,021 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:49,021 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 10:39:49,175 INFO L290 TraceCheckUtils]: 11: Hoare triple {199#false} assume !false; {199#false} is VALID [2022-04-27 10:39:49,176 INFO L290 TraceCheckUtils]: 10: Hoare triple {248#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {199#false} is VALID [2022-04-27 10:39:49,176 INFO L290 TraceCheckUtils]: 9: Hoare triple {252#(< 0 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {248#(not (<= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 10:39:49,177 INFO L272 TraceCheckUtils]: 8: Hoare triple {256#(not (= (mod main_~x~0 4294967296) 6))} call __VERIFIER_assert((if 6 != ~x~0 % 4294967296 then 1 else 0)); {252#(< 0 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 10:39:49,178 INFO L290 TraceCheckUtils]: 7: Hoare triple {256#(not (= (mod main_~x~0 4294967296) 6))} assume !(~x~0 % 4294967296 < 6); {256#(not (= (mod main_~x~0 4294967296) 6))} is VALID [2022-04-27 10:39:49,179 INFO L290 TraceCheckUtils]: 6: Hoare triple {263#(not (= 6 (mod (+ main_~x~0 1) 4294967296)))} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {256#(not (= (mod main_~x~0 4294967296) 6))} is VALID [2022-04-27 10:39:49,179 INFO L290 TraceCheckUtils]: 5: Hoare triple {198#true} ~x~0 := 0;~y~0 := 1; {263#(not (= 6 (mod (+ main_~x~0 1) 4294967296)))} is VALID [2022-04-27 10:39:49,180 INFO L272 TraceCheckUtils]: 4: Hoare triple {198#true} call #t~ret5 := main(); {198#true} is VALID [2022-04-27 10:39:49,180 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {198#true} {198#true} #34#return; {198#true} is VALID [2022-04-27 10:39:49,180 INFO L290 TraceCheckUtils]: 2: Hoare triple {198#true} assume true; {198#true} is VALID [2022-04-27 10:39:49,180 INFO L290 TraceCheckUtils]: 1: Hoare triple {198#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); {198#true} is VALID [2022-04-27 10:39:49,180 INFO L272 TraceCheckUtils]: 0: Hoare triple {198#true} call ULTIMATE.init(); {198#true} is VALID [2022-04-27 10:39:49,181 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:49,181 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1874130679] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 10:39:49,181 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 10:39:49,181 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 6] total 12 [2022-04-27 10:39:49,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43374642] [2022-04-27 10:39:49,182 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 10:39:49,182 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.5) internal successors, (18), 9 states have internal predecessors, (18), 3 states have call successors, (6), 5 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:49,183 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:39:49,183 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 1.5) internal successors, (18), 9 states have internal predecessors, (18), 3 states have call successors, (6), 5 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:49,201 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:39:49,201 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-27 10:39:49,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:39:49,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-27 10:39:49,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-04-27 10:39:49,202 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand has 12 states, 12 states have (on average 1.5) internal successors, (18), 9 states have internal predecessors, (18), 3 states have call successors, (6), 5 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:49,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:39:49,420 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2022-04-27 10:39:49,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-27 10:39:49,421 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.5) internal successors, (18), 9 states have internal predecessors, (18), 3 states have call successors, (6), 5 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:49,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:39:49,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.5) internal successors, (18), 9 states have internal predecessors, (18), 3 states have call successors, (6), 5 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:49,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 26 transitions. [2022-04-27 10:39:49,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.5) internal successors, (18), 9 states have internal predecessors, (18), 3 states have call successors, (6), 5 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:49,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 26 transitions. [2022-04-27 10:39:49,424 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 26 transitions. [2022-04-27 10:39:49,450 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:39:49,451 INFO L225 Difference]: With dead ends: 24 [2022-04-27 10:39:49,451 INFO L226 Difference]: Without dead ends: 16 [2022-04-27 10:39:49,452 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2022-04-27 10:39:49,452 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 12 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 10:39:49,453 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 41 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 10:39:49,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-04-27 10:39:49,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2022-04-27 10:39:49,455 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:39:49,456 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:49,456 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:49,456 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:49,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:39:49,457 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2022-04-27 10:39:49,457 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-04-27 10:39:49,457 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:39:49,457 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:39:49,458 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:49,458 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:49,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:39:49,459 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2022-04-27 10:39:49,459 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-04-27 10:39:49,459 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:39:49,459 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:39:49,459 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:39:49,459 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:39:49,459 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:49,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2022-04-27 10:39:49,460 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 12 [2022-04-27 10:39:49,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:39:49,460 INFO L495 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2022-04-27 10:39:49,461 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.5) internal successors, (18), 9 states have internal predecessors, (18), 3 states have call successors, (6), 5 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:49,461 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-04-27 10:39:49,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-27 10:39:49,461 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:39:49,461 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:39:49,488 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-27 10:39:49,684 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:49,685 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:39:49,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:39:49,685 INFO L85 PathProgramCache]: Analyzing trace with hash 1105142364, now seen corresponding path program 2 times [2022-04-27 10:39:49,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:39:49,685 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899538716] [2022-04-27 10:39:49,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:39:49,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:39:49,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:39:49,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:39:49,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:39:49,848 INFO L290 TraceCheckUtils]: 0: Hoare triple {408#(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); {396#true} is VALID [2022-04-27 10:39:49,849 INFO L290 TraceCheckUtils]: 1: Hoare triple {396#true} assume true; {396#true} is VALID [2022-04-27 10:39:49,849 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {396#true} {396#true} #34#return; {396#true} is VALID [2022-04-27 10:39:49,849 INFO L272 TraceCheckUtils]: 0: Hoare triple {396#true} call ULTIMATE.init(); {408#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:39:49,850 INFO L290 TraceCheckUtils]: 1: Hoare triple {408#(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); {396#true} is VALID [2022-04-27 10:39:49,850 INFO L290 TraceCheckUtils]: 2: Hoare triple {396#true} assume true; {396#true} is VALID [2022-04-27 10:39:49,850 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {396#true} {396#true} #34#return; {396#true} is VALID [2022-04-27 10:39:49,850 INFO L272 TraceCheckUtils]: 4: Hoare triple {396#true} call #t~ret5 := main(); {396#true} is VALID [2022-04-27 10:39:49,850 INFO L290 TraceCheckUtils]: 5: Hoare triple {396#true} ~x~0 := 0;~y~0 := 1; {401#(= main_~x~0 0)} is VALID [2022-04-27 10:39:49,851 INFO L290 TraceCheckUtils]: 6: Hoare triple {401#(= 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; {402#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 10:39:49,852 INFO L290 TraceCheckUtils]: 7: Hoare triple {402#(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; {403#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 10:39:49,852 INFO L290 TraceCheckUtils]: 8: Hoare triple {403#(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; {404#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-27 10:39:49,853 INFO L290 TraceCheckUtils]: 9: Hoare triple {404#(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; {405#(and (<= main_~x~0 4) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-27 10:39:49,854 INFO L290 TraceCheckUtils]: 10: Hoare triple {405#(and (<= main_~x~0 4) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 6); {397#false} is VALID [2022-04-27 10:39:49,854 INFO L272 TraceCheckUtils]: 11: Hoare triple {397#false} call __VERIFIER_assert((if 6 != ~x~0 % 4294967296 then 1 else 0)); {406#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 10:39:49,854 INFO L290 TraceCheckUtils]: 12: Hoare triple {406#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {407#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 10:39:49,855 INFO L290 TraceCheckUtils]: 13: Hoare triple {407#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {397#false} is VALID [2022-04-27 10:39:49,855 INFO L290 TraceCheckUtils]: 14: Hoare triple {397#false} assume !false; {397#false} is VALID [2022-04-27 10:39:49,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:49,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:39:49,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899538716] [2022-04-27 10:39:49,855 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899538716] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:39:49,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1514807139] [2022-04-27 10:39:49,855 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 10:39:49,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:39:49,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:39:49,857 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:49,885 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:49,902 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 10:39:49,903 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 10:39:49,903 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-27 10:39:49,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:39:49,911 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:39:50,024 INFO L272 TraceCheckUtils]: 0: Hoare triple {396#true} call ULTIMATE.init(); {396#true} is VALID [2022-04-27 10:39:50,024 INFO L290 TraceCheckUtils]: 1: Hoare triple {396#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); {396#true} is VALID [2022-04-27 10:39:50,024 INFO L290 TraceCheckUtils]: 2: Hoare triple {396#true} assume true; {396#true} is VALID [2022-04-27 10:39:50,024 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {396#true} {396#true} #34#return; {396#true} is VALID [2022-04-27 10:39:50,025 INFO L272 TraceCheckUtils]: 4: Hoare triple {396#true} call #t~ret5 := main(); {396#true} is VALID [2022-04-27 10:39:50,025 INFO L290 TraceCheckUtils]: 5: Hoare triple {396#true} ~x~0 := 0;~y~0 := 1; {401#(= main_~x~0 0)} is VALID [2022-04-27 10:39:50,026 INFO L290 TraceCheckUtils]: 6: Hoare triple {401#(= 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; {402#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-27 10:39:50,026 INFO L290 TraceCheckUtils]: 7: Hoare triple {402#(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; {403#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 10:39:50,027 INFO L290 TraceCheckUtils]: 8: Hoare triple {403#(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; {404#(and (<= main_~x~0 3) (<= 3 main_~x~0))} is VALID [2022-04-27 10:39:50,028 INFO L290 TraceCheckUtils]: 9: Hoare triple {404#(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; {439#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-27 10:39:50,029 INFO L290 TraceCheckUtils]: 10: Hoare triple {439#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !(~x~0 % 4294967296 < 6); {397#false} is VALID [2022-04-27 10:39:50,029 INFO L272 TraceCheckUtils]: 11: Hoare triple {397#false} call __VERIFIER_assert((if 6 != ~x~0 % 4294967296 then 1 else 0)); {397#false} is VALID [2022-04-27 10:39:50,029 INFO L290 TraceCheckUtils]: 12: Hoare triple {397#false} ~cond := #in~cond; {397#false} is VALID [2022-04-27 10:39:50,030 INFO L290 TraceCheckUtils]: 13: Hoare triple {397#false} assume 0 == ~cond; {397#false} is VALID [2022-04-27 10:39:50,030 INFO L290 TraceCheckUtils]: 14: Hoare triple {397#false} assume !false; {397#false} is VALID [2022-04-27 10:39:50,030 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:50,030 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 10:39:50,218 INFO L290 TraceCheckUtils]: 14: Hoare triple {397#false} assume !false; {397#false} is VALID [2022-04-27 10:39:50,218 INFO L290 TraceCheckUtils]: 13: Hoare triple {458#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {397#false} is VALID [2022-04-27 10:39:50,219 INFO L290 TraceCheckUtils]: 12: Hoare triple {462#(< 0 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {458#(not (<= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 10:39:50,219 INFO L272 TraceCheckUtils]: 11: Hoare triple {466#(not (= (mod main_~x~0 4294967296) 6))} call __VERIFIER_assert((if 6 != ~x~0 % 4294967296 then 1 else 0)); {462#(< 0 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 10:39:50,220 INFO L290 TraceCheckUtils]: 10: Hoare triple {466#(not (= (mod main_~x~0 4294967296) 6))} assume !(~x~0 % 4294967296 < 6); {466#(not (= (mod main_~x~0 4294967296) 6))} is VALID [2022-04-27 10:39:50,221 INFO L290 TraceCheckUtils]: 9: Hoare triple {473#(not (= 6 (mod (+ main_~x~0 1) 4294967296)))} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {466#(not (= (mod main_~x~0 4294967296) 6))} is VALID [2022-04-27 10:39:50,222 INFO L290 TraceCheckUtils]: 8: Hoare triple {477#(not (= (mod (+ main_~x~0 2) 4294967296) 6))} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {473#(not (= 6 (mod (+ main_~x~0 1) 4294967296)))} is VALID [2022-04-27 10:39:50,223 INFO L290 TraceCheckUtils]: 7: Hoare triple {481#(not (= (mod (+ main_~x~0 3) 4294967296) 6))} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {477#(not (= (mod (+ main_~x~0 2) 4294967296) 6))} is VALID [2022-04-27 10:39:50,223 INFO L290 TraceCheckUtils]: 6: Hoare triple {485#(not (= (mod (+ main_~x~0 4) 4294967296) 6))} assume !!(~x~0 % 4294967296 < 6);#t~post4 := ~x~0;~x~0 := 1 + #t~post4;havoc #t~post4;~y~0 := 2 * ~y~0; {481#(not (= (mod (+ main_~x~0 3) 4294967296) 6))} is VALID [2022-04-27 10:39:50,224 INFO L290 TraceCheckUtils]: 5: Hoare triple {396#true} ~x~0 := 0;~y~0 := 1; {485#(not (= (mod (+ main_~x~0 4) 4294967296) 6))} is VALID [2022-04-27 10:39:50,224 INFO L272 TraceCheckUtils]: 4: Hoare triple {396#true} call #t~ret5 := main(); {396#true} is VALID [2022-04-27 10:39:50,224 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {396#true} {396#true} #34#return; {396#true} is VALID [2022-04-27 10:39:50,224 INFO L290 TraceCheckUtils]: 2: Hoare triple {396#true} assume true; {396#true} is VALID [2022-04-27 10:39:50,225 INFO L290 TraceCheckUtils]: 1: Hoare triple {396#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); {396#true} is VALID [2022-04-27 10:39:50,225 INFO L272 TraceCheckUtils]: 0: Hoare triple {396#true} call ULTIMATE.init(); {396#true} is VALID [2022-04-27 10:39:50,225 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:50,225 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1514807139] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 10:39:50,225 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 10:39:50,225 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 9] total 18 [2022-04-27 10:39:50,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173482609] [2022-04-27 10:39:50,225 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 10:39:50,226 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 15 states have internal predecessors, (24), 3 states have call successors, (6), 5 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:50,227 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:39:50,227 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 15 states have internal predecessors, (24), 3 states have call successors, (6), 5 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:50,251 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:39:50,251 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-27 10:39:50,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:39:50,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-27 10:39:50,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2022-04-27 10:39:50,252 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand has 18 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 15 states have internal predecessors, (24), 3 states have call successors, (6), 5 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:51,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:39:51,080 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2022-04-27 10:39:51,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-27 10:39:51,081 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 15 states have internal predecessors, (24), 3 states have call successors, (6), 5 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:51,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:39:51,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 15 states have internal predecessors, (24), 3 states have call successors, (6), 5 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:51,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 35 transitions. [2022-04-27 10:39:51,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 15 states have internal predecessors, (24), 3 states have call successors, (6), 5 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:51,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 35 transitions. [2022-04-27 10:39:51,084 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 35 transitions. [2022-04-27 10:39:51,153 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:39:51,154 INFO L225 Difference]: With dead ends: 30 [2022-04-27 10:39:51,154 INFO L226 Difference]: Without dead ends: 22 [2022-04-27 10:39:51,155 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=201, Invalid=791, Unknown=0, NotChecked=0, Total=992 [2022-04-27 10:39:51,155 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 23 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 10:39:51,156 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 51 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 10:39:51,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-04-27 10:39:51,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-04-27 10:39:51,165 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:39:51,165 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 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:51,166 INFO L74 IsIncluded]: Start isIncluded. First operand 22 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:51,166 INFO L87 Difference]: Start difference. First operand 22 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:51,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:39:51,167 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2022-04-27 10:39:51,167 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2022-04-27 10:39:51,167 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:39:51,167 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:39:51,168 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 22 states. [2022-04-27 10:39:51,168 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 22 states. [2022-04-27 10:39:51,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:39:51,169 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2022-04-27 10:39:51,169 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2022-04-27 10:39:51,169 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:39:51,169 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:39:51,170 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:39:51,170 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:39:51,170 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:51,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2022-04-27 10:39:51,171 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 15 [2022-04-27 10:39:51,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:39:51,171 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2022-04-27 10:39:51,171 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 15 states have internal predecessors, (24), 3 states have call successors, (6), 5 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:51,171 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2022-04-27 10:39:51,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-27 10:39:51,172 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:39:51,172 INFO L195 NwaCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:39:51,192 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-27 10:39:51,379 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:51,380 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:39:51,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:39:51,380 INFO L85 PathProgramCache]: Analyzing trace with hash -1943317092, now seen corresponding path program 3 times [2022-04-27 10:39:51,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:39:51,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016756796] [2022-04-27 10:39:51,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:39:51,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:39:51,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-27 10:39:51,416 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-27 10:39:51,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-27 10:39:51,460 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-27 10:39:51,460 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-04-27 10:39:51,461 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 10:39:51,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-27 10:39:51,466 INFO L356 BasicCegarLoop]: Path program histogram: [3, 1, 1] [2022-04-27 10:39:51,468 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 10:39:51,486 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-27 10:39:51,486 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2022-04-27 10:39:51,486 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-27 10:39:51,486 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-27 10:39:51,486 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2022-04-27 10:39:51,486 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2022-04-27 10:39:51,487 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-27 10:39:51,487 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 10:39:51,487 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-27 10:39:51,487 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-27 10:39:51,487 WARN L170 areAnnotationChecker]: L16-2 has no Hoare annotation [2022-04-27 10:39:51,487 WARN L170 areAnnotationChecker]: L16-2 has no Hoare annotation [2022-04-27 10:39:51,487 WARN L170 areAnnotationChecker]: L16-2 has no Hoare annotation [2022-04-27 10:39:51,487 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2022-04-27 10:39:51,487 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2022-04-27 10:39:51,487 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-27 10:39:51,487 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 10:39:51,487 WARN L170 areAnnotationChecker]: L16-3 has no Hoare annotation [2022-04-27 10:39:51,487 WARN L170 areAnnotationChecker]: L16-3 has no Hoare annotation [2022-04-27 10:39:51,487 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-04-27 10:39:51,487 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-04-27 10:39:51,487 WARN L170 areAnnotationChecker]: L6-2 has no Hoare annotation [2022-04-27 10:39:51,487 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 10:39:51,487 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 10:39:51,487 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-27 10:39:51,488 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:51,488 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 10:39:51 BoogieIcfgContainer [2022-04-27 10:39:51,488 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 10:39:51,489 INFO L158 Benchmark]: Toolchain (without parser) took 4167.78ms. Allocated memory was 182.5MB in the beginning and 220.2MB in the end (delta: 37.7MB). Free memory was 131.1MB in the beginning and 175.8MB in the end (delta: -44.7MB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 10:39:51,489 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 182.5MB. Free memory is still 147.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 10:39:51,489 INFO L158 Benchmark]: CACSL2BoogieTranslator took 185.06ms. Allocated memory is still 182.5MB. Free memory was 131.0MB in the beginning and 157.7MB in the end (delta: -26.7MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-27 10:39:51,490 INFO L158 Benchmark]: Boogie Preprocessor took 28.52ms. Allocated memory is still 182.5MB. Free memory was 157.7MB in the beginning and 156.3MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-27 10:39:51,490 INFO L158 Benchmark]: RCFGBuilder took 252.15ms. Allocated memory is still 182.5MB. Free memory was 156.1MB in the beginning and 146.2MB in the end (delta: 9.9MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-27 10:39:51,490 INFO L158 Benchmark]: TraceAbstraction took 3694.36ms. Allocated memory was 182.5MB in the beginning and 220.2MB in the end (delta: 37.7MB). Free memory was 145.7MB in the beginning and 175.8MB in the end (delta: -30.1MB). Peak memory consumption was 9.2MB. Max. memory is 8.0GB. [2022-04-27 10:39:51,493 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.10ms. Allocated memory is still 182.5MB. Free memory is still 147.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 185.06ms. Allocated memory is still 182.5MB. Free memory was 131.0MB in the beginning and 157.7MB in the end (delta: -26.7MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 28.52ms. Allocated memory is still 182.5MB. Free memory was 157.7MB in the beginning and 156.3MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 252.15ms. Allocated memory is still 182.5MB. Free memory was 156.1MB in the beginning and 146.2MB in the end (delta: 9.9MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 3694.36ms. Allocated memory was 182.5MB in the beginning and 220.2MB in the end (delta: 37.7MB). Free memory was 145.7MB in the beginning and 175.8MB in the end (delta: -30.1MB). Peak memory consumption was 9.2MB. 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(x != 6) 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: 3.6s, OverallIterations: 5, TraceHistogramMax: 6, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 51 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 50 mSDsluCounter, 140 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 94 mSDsCounter, 57 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 163 IncrementalHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 57 mSolverCounterUnsat, 46 mSDtfsCounter, 163 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 107 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=22occurred in iteration=4, InterpolantAutomatonStates: 34, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 93 NumberOfCodeBlocks, 93 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 95 ConstructedInterpolants, 0 QuantifiedInterpolants, 278 SizeOfPredicates, 0 NumberOfNonLiveVariables, 131 ConjunctsInSsa, 22 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:51,513 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...