/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-invariants/odd.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 11:40:44,977 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 11:40:44,979 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 11:40:45,037 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 11:40:45,037 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 11:40:45,038 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 11:40:45,040 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 11:40:45,042 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 11:40:45,043 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 11:40:45,046 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 11:40:45,047 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 11:40:45,048 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 11:40:45,048 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 11:40:45,050 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 11:40:45,050 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 11:40:45,052 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 11:40:45,053 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 11:40:45,053 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 11:40:45,055 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 11:40:45,059 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 11:40:45,060 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 11:40:45,061 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 11:40:45,061 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 11:40:45,062 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 11:40:45,063 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 11:40:45,068 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 11:40:45,068 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 11:40:45,068 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 11:40:45,069 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 11:40:45,069 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 11:40:45,070 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 11:40:45,070 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 11:40:45,071 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 11:40:45,071 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 11:40:45,072 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 11:40:45,072 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 11:40:45,072 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 11:40:45,073 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 11:40:45,073 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 11:40:45,073 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 11:40:45,074 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 11:40:45,074 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 11:40:45,075 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 11:40:45,096 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 11:40:45,097 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 11:40:45,097 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 11:40:45,097 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 11:40:45,097 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 11:40:45,098 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 11:40:45,098 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 11:40:45,098 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 11:40:45,098 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 11:40:45,099 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 11:40:45,099 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 11:40:45,099 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 11:40:45,099 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 11:40:45,099 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 11:40:45,099 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 11:40:45,099 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 11:40:45,099 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 11:40:45,100 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 11:40:45,100 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 11:40:45,100 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 11:40:45,100 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 11:40:45,100 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 11:40:45,100 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 11:40:45,101 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 11:40:45,101 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 11:40:45,101 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 11:40:45,101 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 11:40:45,101 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 11:40:45,101 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 11:40:45,101 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 11:40:45,101 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 11:40:45,101 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 11:40:45,101 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 11:40:45,101 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 11:40:45,289 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 11:40:45,304 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 11:40:45,306 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 11:40:45,307 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 11:40:45,307 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 11:40:45,308 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invariants/odd.c [2022-04-27 11:40:45,355 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a7cbacac7/f692e3717daa442ab1b9cd7ef0790242/FLAG9d684f459 [2022-04-27 11:40:45,707 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 11:40:45,707 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invariants/odd.c [2022-04-27 11:40:45,711 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a7cbacac7/f692e3717daa442ab1b9cd7ef0790242/FLAG9d684f459 [2022-04-27 11:40:45,719 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a7cbacac7/f692e3717daa442ab1b9cd7ef0790242 [2022-04-27 11:40:45,721 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 11:40:45,721 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 11:40:45,722 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 11:40:45,722 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 11:40:45,725 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 11:40:45,725 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 11:40:45" (1/1) ... [2022-04-27 11:40:45,726 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b1e0312 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:40:45, skipping insertion in model container [2022-04-27 11:40:45,726 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 11:40:45" (1/1) ... [2022-04-27 11:40:45,731 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 11:40:45,738 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 11:40:45,877 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-invariants/odd.c[350,363] [2022-04-27 11:40:45,883 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 11:40:45,888 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 11:40:45,896 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-invariants/odd.c[350,363] [2022-04-27 11:40:45,898 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 11:40:45,906 INFO L208 MainTranslator]: Completed translation [2022-04-27 11:40:45,906 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:40:45 WrapperNode [2022-04-27 11:40:45,906 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 11:40:45,911 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 11:40:45,912 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 11:40:45,912 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 11:40:45,918 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:40:45" (1/1) ... [2022-04-27 11:40:45,919 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:40:45" (1/1) ... [2022-04-27 11:40:45,923 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:40:45" (1/1) ... [2022-04-27 11:40:45,924 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:40:45" (1/1) ... [2022-04-27 11:40:45,935 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:40:45" (1/1) ... [2022-04-27 11:40:45,938 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:40:45" (1/1) ... [2022-04-27 11:40:45,938 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:40:45" (1/1) ... [2022-04-27 11:40:45,941 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 11:40:45,941 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 11:40:45,942 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 11:40:45,942 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 11:40:45,943 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:40:45" (1/1) ... [2022-04-27 11:40:45,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 11:40:45,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:40:45,968 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 11:40:45,987 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 11:40:46,005 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 11:40:46,005 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 11:40:46,005 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 11:40:46,006 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 11:40:46,007 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 11:40:46,007 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 11:40:46,008 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 11:40:46,008 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 11:40:46,008 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 11:40:46,008 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 11:40:46,008 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 11:40:46,008 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 11:40:46,008 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 11:40:46,008 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 11:40:46,008 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 11:40:46,008 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 11:40:46,008 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 11:40:46,008 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 11:40:46,066 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 11:40:46,067 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 11:40:46,186 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 11:40:46,191 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 11:40:46,191 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 11:40:46,192 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 11:40:46 BoogieIcfgContainer [2022-04-27 11:40:46,192 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 11:40:46,193 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 11:40:46,194 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 11:40:46,196 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 11:40:46,196 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 11:40:45" (1/3) ... [2022-04-27 11:40:46,196 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67c41154 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 11:40:46, skipping insertion in model container [2022-04-27 11:40:46,196 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 11:40:45" (2/3) ... [2022-04-27 11:40:46,197 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67c41154 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 11:40:46, skipping insertion in model container [2022-04-27 11:40:46,197 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 11:40:46" (3/3) ... [2022-04-27 11:40:46,197 INFO L111 eAbstractionObserver]: Analyzing ICFG odd.c [2022-04-27 11:40:46,207 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 11:40:46,207 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 11:40:46,235 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 11:40:46,240 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@1c585ad0, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@5291fbc9 [2022-04-27 11:40:46,240 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 11:40:46,246 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 13 states have internal predecessors, (16), 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 11:40:46,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-27 11:40:46,250 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:40:46,251 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:40:46,251 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:40:46,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:40:46,254 INFO L85 PathProgramCache]: Analyzing trace with hash -1035305623, now seen corresponding path program 1 times [2022-04-27 11:40:46,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:40:46,261 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45884894] [2022-04-27 11:40:46,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:40:46,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:40:46,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:40:46,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:40:46,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:40:46,392 INFO L290 TraceCheckUtils]: 0: Hoare triple {28#(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(6, 2);call write~init~int(111, 2, 0, 1);call write~init~int(100, 2, 1, 1);call write~init~int(100, 2, 2, 1);call write~init~int(46, 2, 3, 1);call write~init~int(99, 2, 4, 1);call write~init~int(0, 2, 5, 1);call #Ultimate.allocInit(12, 3); {23#true} is VALID [2022-04-27 11:40:46,392 INFO L290 TraceCheckUtils]: 1: Hoare triple {23#true} assume true; {23#true} is VALID [2022-04-27 11:40:46,392 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23#true} {23#true} #38#return; {23#true} is VALID [2022-04-27 11:40:46,394 INFO L272 TraceCheckUtils]: 0: Hoare triple {23#true} call ULTIMATE.init(); {28#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:40:46,394 INFO L290 TraceCheckUtils]: 1: Hoare triple {28#(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(6, 2);call write~init~int(111, 2, 0, 1);call write~init~int(100, 2, 1, 1);call write~init~int(100, 2, 2, 1);call write~init~int(46, 2, 3, 1);call write~init~int(99, 2, 4, 1);call write~init~int(0, 2, 5, 1);call #Ultimate.allocInit(12, 3); {23#true} is VALID [2022-04-27 11:40:46,394 INFO L290 TraceCheckUtils]: 2: Hoare triple {23#true} assume true; {23#true} is VALID [2022-04-27 11:40:46,394 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23#true} {23#true} #38#return; {23#true} is VALID [2022-04-27 11:40:46,394 INFO L272 TraceCheckUtils]: 4: Hoare triple {23#true} call #t~ret5 := main(); {23#true} is VALID [2022-04-27 11:40:46,395 INFO L290 TraceCheckUtils]: 5: Hoare triple {23#true} ~x~0 := 1; {23#true} is VALID [2022-04-27 11:40:46,395 INFO L290 TraceCheckUtils]: 6: Hoare triple {23#true} assume !true; {24#false} is VALID [2022-04-27 11:40:46,395 INFO L272 TraceCheckUtils]: 7: Hoare triple {24#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {24#false} is VALID [2022-04-27 11:40:46,395 INFO L290 TraceCheckUtils]: 8: Hoare triple {24#false} ~cond := #in~cond; {24#false} is VALID [2022-04-27 11:40:46,396 INFO L290 TraceCheckUtils]: 9: Hoare triple {24#false} assume 0 == ~cond; {24#false} is VALID [2022-04-27 11:40:46,396 INFO L290 TraceCheckUtils]: 10: Hoare triple {24#false} assume !false; {24#false} is VALID [2022-04-27 11:40:46,396 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 11:40:46,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:40:46,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45884894] [2022-04-27 11:40:46,397 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45884894] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 11:40:46,397 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 11:40:46,397 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 11:40:46,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893811025] [2022-04-27 11:40:46,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 11:40:46,402 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 11:40:46,403 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:40:46,405 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 11:40:46,422 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 11:40:46,423 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 11:40:46,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:40:46,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 11:40:46,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 11:40:46,439 INFO L87 Difference]: Start difference. First operand has 20 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 13 states have internal predecessors, (16), 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 11:40:46,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:40:46,509 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2022-04-27 11:40:46,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 11:40:46,509 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 11:40:46,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:40:46,510 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 11:40:46,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 35 transitions. [2022-04-27 11:40:46,515 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 11:40:46,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 35 transitions. [2022-04-27 11:40:46,518 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 35 transitions. [2022-04-27 11:40:46,561 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 11:40:46,566 INFO L225 Difference]: With dead ends: 32 [2022-04-27 11:40:46,566 INFO L226 Difference]: Without dead ends: 13 [2022-04-27 11:40:46,568 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 11:40:46,570 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 11 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 22 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 11:40:46,571 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 22 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 11:40:46,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2022-04-27 11:40:46,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-04-27 11:40:46,593 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:40:46,594 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 11:40:46,594 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 11:40:46,594 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 11:40:46,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:40:46,596 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-04-27 11:40:46,596 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-27 11:40:46,596 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:40:46,596 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:40:46,596 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 11:40:46,597 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 11:40:46,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:40:46,598 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-04-27 11:40:46,598 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-27 11:40:46,598 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:40:46,598 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:40:46,599 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:40:46,599 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:40:46,599 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 11:40:46,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2022-04-27 11:40:46,601 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2022-04-27 11:40:46,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:40:46,601 INFO L495 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2022-04-27 11:40:46,601 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 11:40:46,601 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-27 11:40:46,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-27 11:40:46,602 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:40:46,602 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:40:46,602 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 11:40:46,602 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:40:46,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:40:46,603 INFO L85 PathProgramCache]: Analyzing trace with hash 2042096758, now seen corresponding path program 1 times [2022-04-27 11:40:46,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:40:46,603 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027176539] [2022-04-27 11:40:46,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:40:46,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:40:46,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:40:46,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:40:46,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:40:46,720 INFO L290 TraceCheckUtils]: 0: Hoare triple {126#(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(6, 2);call write~init~int(111, 2, 0, 1);call write~init~int(100, 2, 1, 1);call write~init~int(100, 2, 2, 1);call write~init~int(46, 2, 3, 1);call write~init~int(99, 2, 4, 1);call write~init~int(0, 2, 5, 1);call #Ultimate.allocInit(12, 3); {118#true} is VALID [2022-04-27 11:40:46,720 INFO L290 TraceCheckUtils]: 1: Hoare triple {118#true} assume true; {118#true} is VALID [2022-04-27 11:40:46,720 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {118#true} {118#true} #38#return; {118#true} is VALID [2022-04-27 11:40:46,721 INFO L272 TraceCheckUtils]: 0: Hoare triple {118#true} call ULTIMATE.init(); {126#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:40:46,721 INFO L290 TraceCheckUtils]: 1: Hoare triple {126#(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(6, 2);call write~init~int(111, 2, 0, 1);call write~init~int(100, 2, 1, 1);call write~init~int(100, 2, 2, 1);call write~init~int(46, 2, 3, 1);call write~init~int(99, 2, 4, 1);call write~init~int(0, 2, 5, 1);call #Ultimate.allocInit(12, 3); {118#true} is VALID [2022-04-27 11:40:46,721 INFO L290 TraceCheckUtils]: 2: Hoare triple {118#true} assume true; {118#true} is VALID [2022-04-27 11:40:46,721 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {118#true} {118#true} #38#return; {118#true} is VALID [2022-04-27 11:40:46,722 INFO L272 TraceCheckUtils]: 4: Hoare triple {118#true} call #t~ret5 := main(); {118#true} is VALID [2022-04-27 11:40:46,722 INFO L290 TraceCheckUtils]: 5: Hoare triple {118#true} ~x~0 := 1; {123#(= (+ (- 1) main_~x~0) 0)} is VALID [2022-04-27 11:40:46,723 INFO L290 TraceCheckUtils]: 6: Hoare triple {123#(= (+ (- 1) main_~x~0) 0)} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {123#(= (+ (- 1) main_~x~0) 0)} is VALID [2022-04-27 11:40:46,724 INFO L290 TraceCheckUtils]: 7: Hoare triple {123#(= (+ (- 1) main_~x~0) 0)} assume !(0 != #t~nondet4);havoc #t~nondet4; {123#(= (+ (- 1) main_~x~0) 0)} is VALID [2022-04-27 11:40:46,724 INFO L272 TraceCheckUtils]: 8: Hoare triple {123#(= (+ (- 1) main_~x~0) 0)} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {124#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:40:46,725 INFO L290 TraceCheckUtils]: 9: Hoare triple {124#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {125#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:40:46,725 INFO L290 TraceCheckUtils]: 10: Hoare triple {125#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {119#false} is VALID [2022-04-27 11:40:46,725 INFO L290 TraceCheckUtils]: 11: Hoare triple {119#false} assume !false; {119#false} is VALID [2022-04-27 11:40:46,726 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 11:40:46,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:40:46,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027176539] [2022-04-27 11:40:46,726 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027176539] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 11:40:46,726 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 11:40:46,726 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 11:40:46,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445224563] [2022-04-27 11:40:46,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 11:40:46,728 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-27 11:40:46,728 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:40:46,728 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:40:46,742 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:40:46,742 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 11:40:46,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:40:46,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 11:40:46,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 11:40:46,743 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:40:46,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:40:46,862 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2022-04-27 11:40:46,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 11:40:46,862 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-27 11:40:46,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:40:46,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:40:46,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 20 transitions. [2022-04-27 11:40:46,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:40:46,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 20 transitions. [2022-04-27 11:40:46,865 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 20 transitions. [2022-04-27 11:40:46,890 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:40:46,893 INFO L225 Difference]: With dead ends: 20 [2022-04-27 11:40:46,893 INFO L226 Difference]: Without dead ends: 15 [2022-04-27 11:40:46,897 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-04-27 11:40:46,900 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 11 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 11:40:46,900 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 28 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 11:40:46,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-04-27 11:40:46,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-04-27 11:40:46,906 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:40:46,906 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:40:46,907 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:40:46,907 INFO L87 Difference]: Start difference. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:40:46,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:40:46,910 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-04-27 11:40:46,911 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-27 11:40:46,911 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:40:46,911 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:40:46,912 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 15 states. [2022-04-27 11:40:46,912 INFO L87 Difference]: Start difference. First operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 15 states. [2022-04-27 11:40:46,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:40:46,914 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-04-27 11:40:46,914 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-27 11:40:46,914 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:40:46,914 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:40:46,914 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:40:46,915 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:40:46,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:40:46,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2022-04-27 11:40:46,918 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 12 [2022-04-27 11:40:46,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:40:46,919 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2022-04-27 11:40:46,919 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:40:46,920 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-27 11:40:46,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-27 11:40:46,920 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:40:46,920 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:40:46,920 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 11:40:46,921 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:40:46,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:40:46,921 INFO L85 PathProgramCache]: Analyzing trace with hash 615626395, now seen corresponding path program 1 times [2022-04-27 11:40:46,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:40:46,922 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483421574] [2022-04-27 11:40:46,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:40:46,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:40:46,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:40:46,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:40:46,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:40:46,997 INFO L290 TraceCheckUtils]: 0: Hoare triple {227#(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(6, 2);call write~init~int(111, 2, 0, 1);call write~init~int(100, 2, 1, 1);call write~init~int(100, 2, 2, 1);call write~init~int(46, 2, 3, 1);call write~init~int(99, 2, 4, 1);call write~init~int(0, 2, 5, 1);call #Ultimate.allocInit(12, 3); {218#true} is VALID [2022-04-27 11:40:46,997 INFO L290 TraceCheckUtils]: 1: Hoare triple {218#true} assume true; {218#true} is VALID [2022-04-27 11:40:46,997 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {218#true} {218#true} #38#return; {218#true} is VALID [2022-04-27 11:40:46,998 INFO L272 TraceCheckUtils]: 0: Hoare triple {218#true} call ULTIMATE.init(); {227#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:40:46,998 INFO L290 TraceCheckUtils]: 1: Hoare triple {227#(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(6, 2);call write~init~int(111, 2, 0, 1);call write~init~int(100, 2, 1, 1);call write~init~int(100, 2, 2, 1);call write~init~int(46, 2, 3, 1);call write~init~int(99, 2, 4, 1);call write~init~int(0, 2, 5, 1);call #Ultimate.allocInit(12, 3); {218#true} is VALID [2022-04-27 11:40:46,998 INFO L290 TraceCheckUtils]: 2: Hoare triple {218#true} assume true; {218#true} is VALID [2022-04-27 11:40:46,998 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {218#true} {218#true} #38#return; {218#true} is VALID [2022-04-27 11:40:46,998 INFO L272 TraceCheckUtils]: 4: Hoare triple {218#true} call #t~ret5 := main(); {218#true} is VALID [2022-04-27 11:40:46,999 INFO L290 TraceCheckUtils]: 5: Hoare triple {218#true} ~x~0 := 1; {223#(= (+ (- 1) main_~x~0) 0)} is VALID [2022-04-27 11:40:46,999 INFO L290 TraceCheckUtils]: 6: Hoare triple {223#(= (+ (- 1) main_~x~0) 0)} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {223#(= (+ (- 1) main_~x~0) 0)} is VALID [2022-04-27 11:40:47,000 INFO L290 TraceCheckUtils]: 7: Hoare triple {223#(= (+ (- 1) main_~x~0) 0)} assume !!(0 != #t~nondet4);havoc #t~nondet4;~x~0 := 2 + ~x~0; {224#(<= (+ (* (div main_~x~0 2) 2) 1) main_~x~0)} is VALID [2022-04-27 11:40:47,000 INFO L290 TraceCheckUtils]: 8: Hoare triple {224#(<= (+ (* (div main_~x~0 2) 2) 1) main_~x~0)} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {224#(<= (+ (* (div main_~x~0 2) 2) 1) main_~x~0)} is VALID [2022-04-27 11:40:47,001 INFO L290 TraceCheckUtils]: 9: Hoare triple {224#(<= (+ (* (div main_~x~0 2) 2) 1) main_~x~0)} assume !(0 != #t~nondet4);havoc #t~nondet4; {224#(<= (+ (* (div main_~x~0 2) 2) 1) main_~x~0)} is VALID [2022-04-27 11:40:47,001 INFO L272 TraceCheckUtils]: 10: Hoare triple {224#(<= (+ (* (div main_~x~0 2) 2) 1) main_~x~0)} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {225#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 11:40:47,002 INFO L290 TraceCheckUtils]: 11: Hoare triple {225#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {226#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 11:40:47,002 INFO L290 TraceCheckUtils]: 12: Hoare triple {226#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {219#false} is VALID [2022-04-27 11:40:47,002 INFO L290 TraceCheckUtils]: 13: Hoare triple {219#false} assume !false; {219#false} is VALID [2022-04-27 11:40:47,003 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:40:47,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:40:47,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483421574] [2022-04-27 11:40:47,003 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483421574] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 11:40:47,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1850434658] [2022-04-27 11:40:47,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:40:47,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 11:40:47,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 11:40:47,005 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 11:40:47,006 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 11:40:47,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:40:47,037 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-27 11:40:47,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:40:47,043 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 11:40:47,124 INFO L272 TraceCheckUtils]: 0: Hoare triple {218#true} call ULTIMATE.init(); {218#true} is VALID [2022-04-27 11:40:47,125 INFO L290 TraceCheckUtils]: 1: Hoare triple {218#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(6, 2);call write~init~int(111, 2, 0, 1);call write~init~int(100, 2, 1, 1);call write~init~int(100, 2, 2, 1);call write~init~int(46, 2, 3, 1);call write~init~int(99, 2, 4, 1);call write~init~int(0, 2, 5, 1);call #Ultimate.allocInit(12, 3); {218#true} is VALID [2022-04-27 11:40:47,125 INFO L290 TraceCheckUtils]: 2: Hoare triple {218#true} assume true; {218#true} is VALID [2022-04-27 11:40:47,125 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {218#true} {218#true} #38#return; {218#true} is VALID [2022-04-27 11:40:47,125 INFO L272 TraceCheckUtils]: 4: Hoare triple {218#true} call #t~ret5 := main(); {218#true} is VALID [2022-04-27 11:40:47,129 INFO L290 TraceCheckUtils]: 5: Hoare triple {218#true} ~x~0 := 1; {223#(= (+ (- 1) main_~x~0) 0)} is VALID [2022-04-27 11:40:47,129 INFO L290 TraceCheckUtils]: 6: Hoare triple {223#(= (+ (- 1) main_~x~0) 0)} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {223#(= (+ (- 1) main_~x~0) 0)} is VALID [2022-04-27 11:40:47,130 INFO L290 TraceCheckUtils]: 7: Hoare triple {223#(= (+ (- 1) main_~x~0) 0)} assume !!(0 != #t~nondet4);havoc #t~nondet4;~x~0 := 2 + ~x~0; {252#(= main_~x~0 3)} is VALID [2022-04-27 11:40:47,130 INFO L290 TraceCheckUtils]: 8: Hoare triple {252#(= main_~x~0 3)} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {252#(= main_~x~0 3)} is VALID [2022-04-27 11:40:47,131 INFO L290 TraceCheckUtils]: 9: Hoare triple {252#(= main_~x~0 3)} assume !(0 != #t~nondet4);havoc #t~nondet4; {252#(= main_~x~0 3)} is VALID [2022-04-27 11:40:47,133 INFO L272 TraceCheckUtils]: 10: Hoare triple {252#(= main_~x~0 3)} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {262#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2022-04-27 11:40:47,133 INFO L290 TraceCheckUtils]: 11: Hoare triple {262#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {266#(= __VERIFIER_assert_~cond 1)} is VALID [2022-04-27 11:40:47,133 INFO L290 TraceCheckUtils]: 12: Hoare triple {266#(= __VERIFIER_assert_~cond 1)} assume 0 == ~cond; {219#false} is VALID [2022-04-27 11:40:47,134 INFO L290 TraceCheckUtils]: 13: Hoare triple {219#false} assume !false; {219#false} is VALID [2022-04-27 11:40:47,134 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 11:40:47,134 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 11:40:47,240 INFO L290 TraceCheckUtils]: 13: Hoare triple {219#false} assume !false; {219#false} is VALID [2022-04-27 11:40:47,240 INFO L290 TraceCheckUtils]: 12: Hoare triple {276#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {219#false} is VALID [2022-04-27 11:40:47,241 INFO L290 TraceCheckUtils]: 11: Hoare triple {280#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {276#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 11:40:47,241 INFO L272 TraceCheckUtils]: 10: Hoare triple {224#(<= (+ (* (div main_~x~0 2) 2) 1) main_~x~0)} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {280#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 11:40:47,242 INFO L290 TraceCheckUtils]: 9: Hoare triple {224#(<= (+ (* (div main_~x~0 2) 2) 1) main_~x~0)} assume !(0 != #t~nondet4);havoc #t~nondet4; {224#(<= (+ (* (div main_~x~0 2) 2) 1) main_~x~0)} is VALID [2022-04-27 11:40:47,242 INFO L290 TraceCheckUtils]: 8: Hoare triple {224#(<= (+ (* (div main_~x~0 2) 2) 1) main_~x~0)} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {224#(<= (+ (* (div main_~x~0 2) 2) 1) main_~x~0)} is VALID [2022-04-27 11:40:47,243 INFO L290 TraceCheckUtils]: 7: Hoare triple {224#(<= (+ (* (div main_~x~0 2) 2) 1) main_~x~0)} assume !!(0 != #t~nondet4);havoc #t~nondet4;~x~0 := 2 + ~x~0; {224#(<= (+ (* (div main_~x~0 2) 2) 1) main_~x~0)} is VALID [2022-04-27 11:40:47,243 INFO L290 TraceCheckUtils]: 6: Hoare triple {224#(<= (+ (* (div main_~x~0 2) 2) 1) main_~x~0)} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {224#(<= (+ (* (div main_~x~0 2) 2) 1) main_~x~0)} is VALID [2022-04-27 11:40:47,244 INFO L290 TraceCheckUtils]: 5: Hoare triple {218#true} ~x~0 := 1; {224#(<= (+ (* (div main_~x~0 2) 2) 1) main_~x~0)} is VALID [2022-04-27 11:40:47,244 INFO L272 TraceCheckUtils]: 4: Hoare triple {218#true} call #t~ret5 := main(); {218#true} is VALID [2022-04-27 11:40:47,244 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {218#true} {218#true} #38#return; {218#true} is VALID [2022-04-27 11:40:47,244 INFO L290 TraceCheckUtils]: 2: Hoare triple {218#true} assume true; {218#true} is VALID [2022-04-27 11:40:47,244 INFO L290 TraceCheckUtils]: 1: Hoare triple {218#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(6, 2);call write~init~int(111, 2, 0, 1);call write~init~int(100, 2, 1, 1);call write~init~int(100, 2, 2, 1);call write~init~int(46, 2, 3, 1);call write~init~int(99, 2, 4, 1);call write~init~int(0, 2, 5, 1);call #Ultimate.allocInit(12, 3); {218#true} is VALID [2022-04-27 11:40:47,244 INFO L272 TraceCheckUtils]: 0: Hoare triple {218#true} call ULTIMATE.init(); {218#true} is VALID [2022-04-27 11:40:47,245 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-27 11:40:47,245 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1850434658] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-27 11:40:47,245 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-27 11:40:47,245 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7, 6] total 12 [2022-04-27 11:40:47,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883683353] [2022-04-27 11:40:47,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 11:40:47,246 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-27 11:40:47,246 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:40:47,246 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:40:47,257 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:40:47,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 11:40:47,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:40:47,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 11:40:47,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-04-27 11:40:47,258 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:40:47,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:40:47,300 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-04-27 11:40:47,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 11:40:47,301 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-27 11:40:47,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:40:47,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:40:47,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 13 transitions. [2022-04-27 11:40:47,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:40:47,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 13 transitions. [2022-04-27 11:40:47,311 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 13 transitions. [2022-04-27 11:40:47,319 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 11:40:47,320 INFO L225 Difference]: With dead ends: 15 [2022-04-27 11:40:47,320 INFO L226 Difference]: Without dead ends: 0 [2022-04-27 11:40:47,321 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 22 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-04-27 11:40:47,323 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 1 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 11:40:47,324 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 30 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 11:40:47,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-27 11:40:47,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-27 11:40:47,326 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:40:47,327 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 11:40:47,327 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 11:40:47,327 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 11:40:47,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:40:47,327 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 11:40:47,327 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 11:40:47,327 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:40:47,327 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:40:47,327 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-27 11:40:47,328 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-27 11:40:47,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:40:47,328 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 11:40:47,328 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 11:40:47,328 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:40:47,328 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:40:47,328 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:40:47,328 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:40:47,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 11:40:47,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-27 11:40:47,328 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 14 [2022-04-27 11:40:47,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:40:47,329 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-27 11:40:47,329 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:40:47,329 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 11:40:47,329 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:40:47,332 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 11:40:47,356 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-27 11:40:47,539 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 11:40:47,541 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-27 11:40:47,567 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 3) no Hoare annotation was computed. [2022-04-27 11:40:47,567 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 3) no Hoare annotation was computed. [2022-04-27 11:40:47,567 INFO L899 garLoopResultBuilder]: For program point reach_errorFINAL(line 3) no Hoare annotation was computed. [2022-04-27 11:40:47,567 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 11 18) the Hoare annotation is: true [2022-04-27 11:40:47,567 INFO L899 garLoopResultBuilder]: For program point mainEXIT(lines 11 18) no Hoare annotation was computed. [2022-04-27 11:40:47,567 INFO L899 garLoopResultBuilder]: For program point L16(line 16) no Hoare annotation was computed. [2022-04-27 11:40:47,567 INFO L899 garLoopResultBuilder]: For program point mainFINAL(lines 11 18) no Hoare annotation was computed. [2022-04-27 11:40:47,567 INFO L899 garLoopResultBuilder]: For program point L13-1(lines 13 15) no Hoare annotation was computed. [2022-04-27 11:40:47,568 INFO L895 garLoopResultBuilder]: At program point L13-3(lines 13 15) the Hoare annotation is: (<= (+ (* (div main_~x~0 2) 2) 1) main_~x~0) [2022-04-27 11:40:47,568 INFO L895 garLoopResultBuilder]: At program point L13-4(lines 13 15) the Hoare annotation is: (<= (+ (* (div main_~x~0 2) 2) 1) main_~x~0) [2022-04-27 11:40:47,568 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-27 11:40:47,568 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-27 11:40:47,568 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-27 11:40:47,568 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-27 11:40:47,568 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-27 11:40:47,568 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-27 11:40:47,568 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-27 11:40:47,568 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 5 10) the Hoare annotation is: true [2022-04-27 11:40:47,568 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 5 10) no Hoare annotation was computed. [2022-04-27 11:40:47,568 INFO L899 garLoopResultBuilder]: For program point L7(line 7) no Hoare annotation was computed. [2022-04-27 11:40:47,568 INFO L899 garLoopResultBuilder]: For program point L6(lines 6 8) no Hoare annotation was computed. [2022-04-27 11:40:47,569 INFO L899 garLoopResultBuilder]: For program point L6-2(lines 5 10) no Hoare annotation was computed. [2022-04-27 11:40:47,569 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 7) no Hoare annotation was computed. [2022-04-27 11:40:47,571 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-04-27 11:40:47,572 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 11:40:47,575 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-27 11:40:47,575 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 11:40:47,576 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2022-04-27 11:40:47,576 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-27 11:40:47,576 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 11:40:47,576 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 11:40:47,577 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2022-04-27 11:40:47,577 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2022-04-27 11:40:47,577 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2022-04-27 11:40:47,577 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-27 11:40:47,577 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 11:40:47,577 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-27 11:40:47,577 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2022-04-27 11:40:47,577 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2022-04-27 11:40:47,577 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-04-27 11:40:47,577 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-04-27 11:40:47,577 WARN L170 areAnnotationChecker]: L6-2 has no Hoare annotation [2022-04-27 11:40:47,577 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-27 11:40:47,577 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 11:40:47,577 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 11:40:47,577 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-27 11:40:47,578 INFO L163 areAnnotationChecker]: CFG has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-27 11:40:47,582 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 11:40:47 BoogieIcfgContainer [2022-04-27 11:40:47,582 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 11:40:47,583 INFO L158 Benchmark]: Toolchain (without parser) took 1861.64ms. Allocated memory is still 207.6MB. Free memory was 150.2MB in the beginning and 77.7MB in the end (delta: 72.5MB). Peak memory consumption was 72.1MB. Max. memory is 8.0GB. [2022-04-27 11:40:47,583 INFO L158 Benchmark]: CDTParser took 0.38ms. Allocated memory is still 207.6MB. Free memory is still 166.5MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 11:40:47,583 INFO L158 Benchmark]: CACSL2BoogieTranslator took 184.40ms. Allocated memory is still 207.6MB. Free memory was 149.9MB in the beginning and 176.8MB in the end (delta: -26.8MB). Peak memory consumption was 11.3MB. Max. memory is 8.0GB. [2022-04-27 11:40:47,584 INFO L158 Benchmark]: Boogie Preprocessor took 29.45ms. Allocated memory is still 207.6MB. Free memory was 176.8MB in the beginning and 175.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-27 11:40:47,584 INFO L158 Benchmark]: RCFGBuilder took 250.97ms. Allocated memory is still 207.6MB. Free memory was 175.2MB in the beginning and 165.2MB in the end (delta: 10.0MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2022-04-27 11:40:47,584 INFO L158 Benchmark]: TraceAbstraction took 1388.91ms. Allocated memory is still 207.6MB. Free memory was 164.7MB in the beginning and 77.7MB in the end (delta: 87.0MB). Peak memory consumption was 87.0MB. Max. memory is 8.0GB. [2022-04-27 11:40:47,585 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.38ms. Allocated memory is still 207.6MB. Free memory is still 166.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 184.40ms. Allocated memory is still 207.6MB. Free memory was 149.9MB in the beginning and 176.8MB in the end (delta: -26.8MB). Peak memory consumption was 11.3MB. Max. memory is 8.0GB. * Boogie Preprocessor took 29.45ms. Allocated memory is still 207.6MB. Free memory was 176.8MB in the beginning and 175.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 250.97ms. Allocated memory is still 207.6MB. Free memory was 175.2MB in the beginning and 165.2MB in the end (delta: 10.0MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * TraceAbstraction took 1388.91ms. Allocated memory is still 207.6MB. Free memory was 164.7MB in the beginning and 77.7MB in the end (delta: 87.0MB). Peak memory consumption was 87.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 7]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 23 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.3s, OverallIterations: 3, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 24 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 23 mSDsluCounter, 80 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 41 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 36 IncrementalHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 39 mSDtfsCounter, 36 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 50 GetRequests, 28 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=20occurred in iteration=0, InterpolantAutomatonStates: 14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 9 PreInvPairs, 12 NumberOfFragments, 29 HoareAnnotationTreeSize, 9 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 22 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 51 NumberOfCodeBlocks, 51 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 60 ConstructedInterpolants, 0 QuantifiedInterpolants, 194 SizeOfPredicates, 1 NumberOfNonLiveVariables, 71 ConjunctsInSsa, 10 ConjunctsInUnsatCore, 5 InterpolantComputations, 3 PerfectInterpolantSequences, 2/6 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 13]: Loop Invariant Derived loop invariant: x / 2 * 2 + 1 <= x RESULT: Ultimate proved your program to be correct! [2022-04-27 11:40:47,612 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...