/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loop-acceleration/functions_1-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 10:31:37,345 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 10:31:37,347 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 10:31:37,367 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 10:31:37,368 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 10:31:37,368 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 10:31:37,369 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 10:31:37,370 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 10:31:37,371 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 10:31:37,371 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 10:31:37,372 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 10:31:37,373 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 10:31:37,373 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 10:31:37,373 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 10:31:37,374 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 10:31:37,375 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 10:31:37,375 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 10:31:37,375 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 10:31:37,376 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 10:31:37,377 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 10:31:37,378 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 10:31:37,381 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 10:31:37,382 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 10:31:37,383 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 10:31:37,383 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 10:31:37,385 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 10:31:37,385 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 10:31:37,385 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 10:31:37,385 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 10:31:37,386 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 10:31:37,386 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 10:31:37,386 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 10:31:37,387 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 10:31:37,387 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 10:31:37,388 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 10:31:37,388 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 10:31:37,389 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 10:31:37,389 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 10:31:37,389 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 10:31:37,389 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 10:31:37,390 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 10:31:37,397 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 10:31:37,397 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2022-04-27 10:31:37,409 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 10:31:37,410 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 10:31:37,410 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 10:31:37,410 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 10:31:37,410 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 10:31:37,410 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 10:31:37,411 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 10:31:37,411 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 10:31:37,411 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 10:31:37,411 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 10:31:37,411 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 10:31:37,411 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 10:31:37,411 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 10:31:37,412 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 10:31:37,412 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 10:31:37,412 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 10:31:37,412 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 10:31:37,412 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 10:31:37,412 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 10:31:37,412 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 10:31:37,412 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 10:31:37,412 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 10:31:37,412 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 10:31:37,413 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 10:31:37,413 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 10:31:37,413 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 10:31:37,413 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 10:31:37,413 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 10:31:37,413 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 10:31:37,413 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 10:31:37,413 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 10:31:37,413 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 10:31:37,413 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 10:31:37,414 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-27 10:31:37,583 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 10:31:37,604 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 10:31:37,605 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 10:31:37,606 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 10:31:37,607 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 10:31:37,607 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/functions_1-1.c [2022-04-27 10:31:37,655 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/81b8a7f59/db7e6046182644fd954c13f59f2c1c93/FLAGdfbdf878f [2022-04-27 10:31:37,998 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 10:31:37,998 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/functions_1-1.c [2022-04-27 10:31:38,003 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/81b8a7f59/db7e6046182644fd954c13f59f2c1c93/FLAGdfbdf878f [2022-04-27 10:31:38,012 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/81b8a7f59/db7e6046182644fd954c13f59f2c1c93 [2022-04-27 10:31:38,013 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 10:31:38,014 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 10:31:38,018 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 10:31:38,018 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 10:31:38,020 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 10:31:38,021 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 10:31:38" (1/1) ... [2022-04-27 10:31:38,021 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57cde434 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:31:38, skipping insertion in model container [2022-04-27 10:31:38,021 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 10:31:38" (1/1) ... [2022-04-27 10:31:38,026 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 10:31:38,035 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 10:31:38,193 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/functions_1-1.c[325,338] [2022-04-27 10:31:38,206 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 10:31:38,211 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 10:31:38,228 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/functions_1-1.c[325,338] [2022-04-27 10:31:38,233 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 10:31:38,243 INFO L208 MainTranslator]: Completed translation [2022-04-27 10:31:38,243 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:31:38 WrapperNode [2022-04-27 10:31:38,243 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 10:31:38,244 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 10:31:38,244 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 10:31:38,244 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 10:31:38,250 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:31:38" (1/1) ... [2022-04-27 10:31:38,250 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:31:38" (1/1) ... [2022-04-27 10:31:38,253 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:31:38" (1/1) ... [2022-04-27 10:31:38,254 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:31:38" (1/1) ... [2022-04-27 10:31:38,257 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:31:38" (1/1) ... [2022-04-27 10:31:38,260 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:31:38" (1/1) ... [2022-04-27 10:31:38,263 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:31:38" (1/1) ... [2022-04-27 10:31:38,264 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 10:31:38,265 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 10:31:38,265 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 10:31:38,265 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 10:31:38,265 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:31:38" (1/1) ... [2022-04-27 10:31:38,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 10:31:38,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:31:38,329 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-27 10:31:38,339 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-27 10:31:38,371 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 10:31:38,371 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 10:31:38,372 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 10:31:38,373 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 10:31:38,374 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2022-04-27 10:31:38,374 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 10:31:38,374 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 10:31:38,374 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 10:31:38,374 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 10:31:38,374 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 10:31:38,374 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 10:31:38,374 INFO L130 BoogieDeclarations]: Found specification of procedure f [2022-04-27 10:31:38,375 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 10:31:38,375 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 10:31:38,375 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 10:31:38,375 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 10:31:38,375 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 10:31:38,375 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 10:31:38,375 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 10:31:38,416 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 10:31:38,417 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 10:31:38,509 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 10:31:38,513 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 10:31:38,513 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 10:31:38,515 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 10:31:38 BoogieIcfgContainer [2022-04-27 10:31:38,515 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 10:31:38,516 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 10:31:38,516 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 10:31:38,522 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 10:31:38,522 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 10:31:38" (1/3) ... [2022-04-27 10:31:38,523 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4228a0ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 10:31:38, skipping insertion in model container [2022-04-27 10:31:38,523 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:31:38" (2/3) ... [2022-04-27 10:31:38,523 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4228a0ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 10:31:38, skipping insertion in model container [2022-04-27 10:31:38,523 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 10:31:38" (3/3) ... [2022-04-27 10:31:38,524 INFO L111 eAbstractionObserver]: Analyzing ICFG functions_1-1.c [2022-04-27 10:31:38,533 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 10:31:38,534 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 10:31:38,574 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 10:31:38,578 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@9193dc5, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@31f3409b [2022-04-27 10:31:38,578 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 10:31:38,583 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 10:31:38,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-27 10:31:38,587 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:31:38,587 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:31:38,588 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:31:38,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:31:38,591 INFO L85 PathProgramCache]: Analyzing trace with hash -1649640916, now seen corresponding path program 1 times [2022-04-27 10:31:38,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:31:38,602 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202073348] [2022-04-27 10:31:38,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:31:38,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:31:38,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:31:38,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:31:38,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:31:38,719 INFO L290 TraceCheckUtils]: 0: Hoare triple {31#(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(16, 2);call #Ultimate.allocInit(12, 3); {26#true} is VALID [2022-04-27 10:31:38,719 INFO L290 TraceCheckUtils]: 1: Hoare triple {26#true} assume true; {26#true} is VALID [2022-04-27 10:31:38,720 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {26#true} {26#true} #42#return; {26#true} is VALID [2022-04-27 10:31:38,721 INFO L272 TraceCheckUtils]: 0: Hoare triple {26#true} call ULTIMATE.init(); {31#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:31:38,721 INFO L290 TraceCheckUtils]: 1: Hoare triple {31#(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(16, 2);call #Ultimate.allocInit(12, 3); {26#true} is VALID [2022-04-27 10:31:38,722 INFO L290 TraceCheckUtils]: 2: Hoare triple {26#true} assume true; {26#true} is VALID [2022-04-27 10:31:38,722 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26#true} {26#true} #42#return; {26#true} is VALID [2022-04-27 10:31:38,722 INFO L272 TraceCheckUtils]: 4: Hoare triple {26#true} call #t~ret5 := main(); {26#true} is VALID [2022-04-27 10:31:38,722 INFO L290 TraceCheckUtils]: 5: Hoare triple {26#true} ~x~0 := 0; {26#true} is VALID [2022-04-27 10:31:38,723 INFO L290 TraceCheckUtils]: 6: Hoare triple {26#true} assume !true; {27#false} is VALID [2022-04-27 10:31:38,723 INFO L272 TraceCheckUtils]: 7: Hoare triple {27#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {27#false} is VALID [2022-04-27 10:31:38,723 INFO L290 TraceCheckUtils]: 8: Hoare triple {27#false} ~cond := #in~cond; {27#false} is VALID [2022-04-27 10:31:38,723 INFO L290 TraceCheckUtils]: 9: Hoare triple {27#false} assume 0 == ~cond; {27#false} is VALID [2022-04-27 10:31:38,723 INFO L290 TraceCheckUtils]: 10: Hoare triple {27#false} assume !false; {27#false} is VALID [2022-04-27 10:31:38,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:31:38,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:31:38,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202073348] [2022-04-27 10:31:38,724 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202073348] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:31:38,724 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:31:38,725 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 10:31:38,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59181325] [2022-04-27 10:31:38,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:31:38,729 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-27 10:31:38,730 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:31:38,732 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:31:38,746 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:31:38,746 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 10:31:38,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:31:38,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 10:31:38,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 10:31:38,762 INFO L87 Difference]: Start difference. First operand has 23 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:31:38,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:31:38,822 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2022-04-27 10:31:38,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 10:31:38,822 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-27 10:31:38,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:31:38,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:31:38,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 37 transitions. [2022-04-27 10:31:38,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:31:38,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 37 transitions. [2022-04-27 10:31:38,829 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 37 transitions. [2022-04-27 10:31:38,882 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:31:38,887 INFO L225 Difference]: With dead ends: 34 [2022-04-27 10:31:38,887 INFO L226 Difference]: Without dead ends: 17 [2022-04-27 10:31:38,888 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 10:31:38,891 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 12 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 10:31:38,891 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 24 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 10:31:38,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-27 10:31:38,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-04-27 10:31:38,915 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:31:38,916 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 17 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 10:31:38,917 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 17 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 10:31:38,917 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 17 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 10:31:38,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:31:38,922 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2022-04-27 10:31:38,922 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2022-04-27 10:31:38,922 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:31:38,922 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:31:38,923 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 17 states. [2022-04-27 10:31:38,923 INFO L87 Difference]: Start difference. First operand has 17 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 17 states. [2022-04-27 10:31:38,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:31:38,926 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2022-04-27 10:31:38,926 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2022-04-27 10:31:38,927 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:31:38,927 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:31:38,927 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:31:38,927 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:31:38,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 10:31:38,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2022-04-27 10:31:38,930 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 11 [2022-04-27 10:31:38,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:31:38,930 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2022-04-27 10:31:38,931 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:31:38,931 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2022-04-27 10:31:38,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-27 10:31:38,931 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:31:38,932 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:31:38,932 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 10:31:38,932 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:31:38,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:31:38,933 INFO L85 PathProgramCache]: Analyzing trace with hash -1655182042, now seen corresponding path program 1 times [2022-04-27 10:31:38,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:31:38,933 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639187699] [2022-04-27 10:31:38,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:31:38,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:31:38,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:31:39,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:31:39,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:31:39,033 INFO L290 TraceCheckUtils]: 0: Hoare triple {145#(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(16, 2);call #Ultimate.allocInit(12, 3); {139#true} is VALID [2022-04-27 10:31:39,033 INFO L290 TraceCheckUtils]: 1: Hoare triple {139#true} assume true; {139#true} is VALID [2022-04-27 10:31:39,033 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {139#true} {139#true} #42#return; {139#true} is VALID [2022-04-27 10:31:39,034 INFO L272 TraceCheckUtils]: 0: Hoare triple {139#true} call ULTIMATE.init(); {145#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:31:39,034 INFO L290 TraceCheckUtils]: 1: Hoare triple {145#(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(16, 2);call #Ultimate.allocInit(12, 3); {139#true} is VALID [2022-04-27 10:31:39,034 INFO L290 TraceCheckUtils]: 2: Hoare triple {139#true} assume true; {139#true} is VALID [2022-04-27 10:31:39,034 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {139#true} {139#true} #42#return; {139#true} is VALID [2022-04-27 10:31:39,034 INFO L272 TraceCheckUtils]: 4: Hoare triple {139#true} call #t~ret5 := main(); {139#true} is VALID [2022-04-27 10:31:39,035 INFO L290 TraceCheckUtils]: 5: Hoare triple {139#true} ~x~0 := 0; {144#(= main_~x~0 0)} is VALID [2022-04-27 10:31:39,035 INFO L290 TraceCheckUtils]: 6: Hoare triple {144#(= main_~x~0 0)} assume !(~x~0 % 4294967296 < 268435455); {140#false} is VALID [2022-04-27 10:31:39,035 INFO L272 TraceCheckUtils]: 7: Hoare triple {140#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {140#false} is VALID [2022-04-27 10:31:39,036 INFO L290 TraceCheckUtils]: 8: Hoare triple {140#false} ~cond := #in~cond; {140#false} is VALID [2022-04-27 10:31:39,036 INFO L290 TraceCheckUtils]: 9: Hoare triple {140#false} assume 0 == ~cond; {140#false} is VALID [2022-04-27 10:31:39,036 INFO L290 TraceCheckUtils]: 10: Hoare triple {140#false} assume !false; {140#false} is VALID [2022-04-27 10:31:39,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:31:39,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:31:39,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639187699] [2022-04-27 10:31:39,036 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639187699] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:31:39,036 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:31:39,036 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 10:31:39,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049112081] [2022-04-27 10:31:39,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:31:39,038 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-27 10:31:39,038 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:31:39,038 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:31:39,051 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:31:39,051 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 10:31:39,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:31:39,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 10:31:39,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 10:31:39,054 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:31:39,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:31:39,163 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2022-04-27 10:31:39,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 10:31:39,163 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-27 10:31:39,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:31:39,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:31:39,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 26 transitions. [2022-04-27 10:31:39,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:31:39,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 26 transitions. [2022-04-27 10:31:39,172 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 26 transitions. [2022-04-27 10:31:39,195 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:31:39,197 INFO L225 Difference]: With dead ends: 25 [2022-04-27 10:31:39,197 INFO L226 Difference]: Without dead ends: 20 [2022-04-27 10:31:39,200 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 10:31:39,203 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 12 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 10:31:39,203 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 22 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 10:31:39,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-04-27 10:31:39,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2022-04-27 10:31:39,210 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:31:39,210 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand has 18 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 10:31:39,211 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand has 18 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 10:31:39,211 INFO L87 Difference]: Start difference. First operand 20 states. Second operand has 18 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 10:31:39,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:31:39,213 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2022-04-27 10:31:39,213 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2022-04-27 10:31:39,214 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:31:39,215 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:31:39,215 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 20 states. [2022-04-27 10:31:39,215 INFO L87 Difference]: Start difference. First operand has 18 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 20 states. [2022-04-27 10:31:39,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:31:39,217 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2022-04-27 10:31:39,218 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2022-04-27 10:31:39,218 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:31:39,218 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:31:39,218 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:31:39,218 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:31:39,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 10:31:39,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2022-04-27 10:31:39,220 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 11 [2022-04-27 10:31:39,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:31:39,221 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2022-04-27 10:31:39,221 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:31:39,221 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2022-04-27 10:31:39,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-27 10:31:39,222 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:31:39,222 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:31:39,222 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 10:31:39,222 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:31:39,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:31:39,224 INFO L85 PathProgramCache]: Analyzing trace with hash 1503524740, now seen corresponding path program 1 times [2022-04-27 10:31:39,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:31:39,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525467463] [2022-04-27 10:31:39,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:31:39,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:31:39,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:31:39,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:31:39,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:31:39,336 INFO L290 TraceCheckUtils]: 0: Hoare triple {267#(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(16, 2);call #Ultimate.allocInit(12, 3); {256#true} is VALID [2022-04-27 10:31:39,336 INFO L290 TraceCheckUtils]: 1: Hoare triple {256#true} assume true; {256#true} is VALID [2022-04-27 10:31:39,336 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {256#true} {256#true} #42#return; {256#true} is VALID [2022-04-27 10:31:39,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-04-27 10:31:39,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:31:39,363 INFO L290 TraceCheckUtils]: 0: Hoare triple {256#true} ~z := #in~z;#res := 2 + ~z; {268#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:31:39,363 INFO L290 TraceCheckUtils]: 1: Hoare triple {268#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {268#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:31:39,364 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {268#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {261#(= main_~x~0 0)} #38#return; {265#(and (<= 2 |main_#t~ret4|) (<= |main_#t~ret4| 2))} is VALID [2022-04-27 10:31:39,365 INFO L272 TraceCheckUtils]: 0: Hoare triple {256#true} call ULTIMATE.init(); {267#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:31:39,365 INFO L290 TraceCheckUtils]: 1: Hoare triple {267#(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(16, 2);call #Ultimate.allocInit(12, 3); {256#true} is VALID [2022-04-27 10:31:39,365 INFO L290 TraceCheckUtils]: 2: Hoare triple {256#true} assume true; {256#true} is VALID [2022-04-27 10:31:39,366 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {256#true} {256#true} #42#return; {256#true} is VALID [2022-04-27 10:31:39,366 INFO L272 TraceCheckUtils]: 4: Hoare triple {256#true} call #t~ret5 := main(); {256#true} is VALID [2022-04-27 10:31:39,366 INFO L290 TraceCheckUtils]: 5: Hoare triple {256#true} ~x~0 := 0; {261#(= main_~x~0 0)} is VALID [2022-04-27 10:31:39,367 INFO L290 TraceCheckUtils]: 6: Hoare triple {261#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455); {261#(= main_~x~0 0)} is VALID [2022-04-27 10:31:39,367 INFO L272 TraceCheckUtils]: 7: Hoare triple {261#(= main_~x~0 0)} call #t~ret4 := f(~x~0); {256#true} is VALID [2022-04-27 10:31:39,367 INFO L290 TraceCheckUtils]: 8: Hoare triple {256#true} ~z := #in~z;#res := 2 + ~z; {268#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:31:39,368 INFO L290 TraceCheckUtils]: 9: Hoare triple {268#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {268#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:31:39,369 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {268#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {261#(= main_~x~0 0)} #38#return; {265#(and (<= 2 |main_#t~ret4|) (<= |main_#t~ret4| 2))} is VALID [2022-04-27 10:31:39,369 INFO L290 TraceCheckUtils]: 11: Hoare triple {265#(and (<= 2 |main_#t~ret4|) (<= |main_#t~ret4| 2))} ~x~0 := #t~ret4;havoc #t~ret4; {266#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 2))} is VALID [2022-04-27 10:31:39,370 INFO L290 TraceCheckUtils]: 12: Hoare triple {266#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 2))} assume !(~x~0 % 4294967296 < 268435455); {257#false} is VALID [2022-04-27 10:31:39,370 INFO L272 TraceCheckUtils]: 13: Hoare triple {257#false} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {257#false} is VALID [2022-04-27 10:31:39,373 INFO L290 TraceCheckUtils]: 14: Hoare triple {257#false} ~cond := #in~cond; {257#false} is VALID [2022-04-27 10:31:39,373 INFO L290 TraceCheckUtils]: 15: Hoare triple {257#false} assume 0 == ~cond; {257#false} is VALID [2022-04-27 10:31:39,373 INFO L290 TraceCheckUtils]: 16: Hoare triple {257#false} assume !false; {257#false} is VALID [2022-04-27 10:31:39,374 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:31:39,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:31:39,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525467463] [2022-04-27 10:31:39,377 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525467463] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:31:39,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [243800921] [2022-04-27 10:31:39,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:31:39,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:31:39,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:31:39,386 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 10:31:39,386 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-27 10:31:39,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:31:39,437 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-27 10:31:39,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:31:39,448 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:31:39,741 INFO L272 TraceCheckUtils]: 0: Hoare triple {256#true} call ULTIMATE.init(); {256#true} is VALID [2022-04-27 10:31:39,742 INFO L290 TraceCheckUtils]: 1: Hoare triple {256#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(16, 2);call #Ultimate.allocInit(12, 3); {256#true} is VALID [2022-04-27 10:31:39,743 INFO L290 TraceCheckUtils]: 2: Hoare triple {256#true} assume true; {256#true} is VALID [2022-04-27 10:31:39,743 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {256#true} {256#true} #42#return; {256#true} is VALID [2022-04-27 10:31:39,745 INFO L272 TraceCheckUtils]: 4: Hoare triple {256#true} call #t~ret5 := main(); {256#true} is VALID [2022-04-27 10:31:39,745 INFO L290 TraceCheckUtils]: 5: Hoare triple {256#true} ~x~0 := 0; {261#(= main_~x~0 0)} is VALID [2022-04-27 10:31:39,746 INFO L290 TraceCheckUtils]: 6: Hoare triple {261#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 268435455); {261#(= main_~x~0 0)} is VALID [2022-04-27 10:31:39,746 INFO L272 TraceCheckUtils]: 7: Hoare triple {261#(= main_~x~0 0)} call #t~ret4 := f(~x~0); {256#true} is VALID [2022-04-27 10:31:39,746 INFO L290 TraceCheckUtils]: 8: Hoare triple {256#true} ~z := #in~z;#res := 2 + ~z; {268#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:31:39,747 INFO L290 TraceCheckUtils]: 9: Hoare triple {268#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} assume true; {268#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} is VALID [2022-04-27 10:31:39,748 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {268#(and (<= |f_#res| (+ |f_#in~z| 2)) (<= (+ |f_#in~z| 2) |f_#res|))} {261#(= main_~x~0 0)} #38#return; {265#(and (<= 2 |main_#t~ret4|) (<= |main_#t~ret4| 2))} is VALID [2022-04-27 10:31:39,748 INFO L290 TraceCheckUtils]: 11: Hoare triple {265#(and (<= 2 |main_#t~ret4|) (<= |main_#t~ret4| 2))} ~x~0 := #t~ret4;havoc #t~ret4; {305#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 10:31:39,749 INFO L290 TraceCheckUtils]: 12: Hoare triple {305#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !(~x~0 % 4294967296 < 268435455); {305#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-27 10:31:39,750 INFO L272 TraceCheckUtils]: 13: Hoare triple {305#(and (<= 2 main_~x~0) (<= main_~x~0 2))} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {312#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 10:31:39,751 INFO L290 TraceCheckUtils]: 14: Hoare triple {312#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {316#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 10:31:39,751 INFO L290 TraceCheckUtils]: 15: Hoare triple {316#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {257#false} is VALID [2022-04-27 10:31:39,751 INFO L290 TraceCheckUtils]: 16: Hoare triple {257#false} assume !false; {257#false} is VALID [2022-04-27 10:31:39,752 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:31:39,752 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 10:31:39,950 INFO L290 TraceCheckUtils]: 16: Hoare triple {257#false} assume !false; {257#false} is VALID [2022-04-27 10:31:39,950 INFO L290 TraceCheckUtils]: 15: Hoare triple {316#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {257#false} is VALID [2022-04-27 10:31:39,951 INFO L290 TraceCheckUtils]: 14: Hoare triple {312#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {316#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-27 10:31:39,951 INFO L272 TraceCheckUtils]: 13: Hoare triple {332#(= (mod main_~x~0 2) 0)} call __VERIFIER_assert((if 0 == (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {312#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-27 10:31:39,952 INFO L290 TraceCheckUtils]: 12: Hoare triple {332#(= (mod main_~x~0 2) 0)} assume !(~x~0 % 4294967296 < 268435455); {332#(= (mod main_~x~0 2) 0)} is VALID [2022-04-27 10:31:39,952 INFO L290 TraceCheckUtils]: 11: Hoare triple {339#(= (mod |main_#t~ret4| 2) 0)} ~x~0 := #t~ret4;havoc #t~ret4; {332#(= (mod main_~x~0 2) 0)} is VALID [2022-04-27 10:31:39,954 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {346#(or (not (= (mod |f_#in~z| 2) 0)) (= (mod |f_#res| 2) 0))} {332#(= (mod main_~x~0 2) 0)} #38#return; {339#(= (mod |main_#t~ret4| 2) 0)} is VALID [2022-04-27 10:31:39,954 INFO L290 TraceCheckUtils]: 9: Hoare triple {346#(or (not (= (mod |f_#in~z| 2) 0)) (= (mod |f_#res| 2) 0))} assume true; {346#(or (not (= (mod |f_#in~z| 2) 0)) (= (mod |f_#res| 2) 0))} is VALID [2022-04-27 10:31:39,954 INFO L290 TraceCheckUtils]: 8: Hoare triple {256#true} ~z := #in~z;#res := 2 + ~z; {346#(or (not (= (mod |f_#in~z| 2) 0)) (= (mod |f_#res| 2) 0))} is VALID [2022-04-27 10:31:39,955 INFO L272 TraceCheckUtils]: 7: Hoare triple {332#(= (mod main_~x~0 2) 0)} call #t~ret4 := f(~x~0); {256#true} is VALID [2022-04-27 10:31:39,955 INFO L290 TraceCheckUtils]: 6: Hoare triple {332#(= (mod main_~x~0 2) 0)} assume !!(~x~0 % 4294967296 < 268435455); {332#(= (mod main_~x~0 2) 0)} is VALID [2022-04-27 10:31:39,955 INFO L290 TraceCheckUtils]: 5: Hoare triple {256#true} ~x~0 := 0; {332#(= (mod main_~x~0 2) 0)} is VALID [2022-04-27 10:31:39,955 INFO L272 TraceCheckUtils]: 4: Hoare triple {256#true} call #t~ret5 := main(); {256#true} is VALID [2022-04-27 10:31:39,956 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {256#true} {256#true} #42#return; {256#true} is VALID [2022-04-27 10:31:39,956 INFO L290 TraceCheckUtils]: 2: Hoare triple {256#true} assume true; {256#true} is VALID [2022-04-27 10:31:39,956 INFO L290 TraceCheckUtils]: 1: Hoare triple {256#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(16, 2);call #Ultimate.allocInit(12, 3); {256#true} is VALID [2022-04-27 10:31:39,956 INFO L272 TraceCheckUtils]: 0: Hoare triple {256#true} call ULTIMATE.init(); {256#true} is VALID [2022-04-27 10:31:39,956 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-27 10:31:39,956 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [243800921] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-27 10:31:39,956 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-27 10:31:39,956 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7, 8] total 13 [2022-04-27 10:31:39,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182833035] [2022-04-27 10:31:39,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:31:39,957 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2022-04-27 10:31:39,957 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:31:39,957 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 10:31:39,969 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:31:39,969 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-27 10:31:39,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:31:39,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-27 10:31:39,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2022-04-27 10:31:39,969 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 10:31:40,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:31:40,059 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2022-04-27 10:31:40,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 10:31:40,059 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2022-04-27 10:31:40,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:31:40,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 10:31:40,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 17 transitions. [2022-04-27 10:31:40,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 10:31:40,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 17 transitions. [2022-04-27 10:31:40,061 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 17 transitions. [2022-04-27 10:31:40,073 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:31:40,073 INFO L225 Difference]: With dead ends: 18 [2022-04-27 10:31:40,073 INFO L226 Difference]: Without dead ends: 0 [2022-04-27 10:31:40,073 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2022-04-27 10:31:40,074 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 1 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 10:31:40,074 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 47 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 10:31:40,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-27 10:31:40,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-27 10:31:40,075 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:31:40,075 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 10:31:40,075 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 10:31:40,075 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 10:31:40,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:31:40,075 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 10:31:40,075 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 10:31:40,075 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:31:40,075 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:31:40,075 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 10:31:40,076 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 10:31:40,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:31:40,076 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 10:31:40,076 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 10:31:40,076 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:31:40,076 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:31:40,076 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:31:40,076 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:31:40,076 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 10:31:40,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-27 10:31:40,076 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 17 [2022-04-27 10:31:40,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:31:40,076 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-27 10:31:40,076 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 5 states have internal predecessors, (11), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 10:31:40,076 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 10:31:40,077 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:31:40,078 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 10:31:40,098 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-27 10:31:40,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:31:40,300 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-27 10:31:40,319 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 3) no Hoare annotation was computed. [2022-04-27 10:31:40,319 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 3) no Hoare annotation was computed. [2022-04-27 10:31:40,320 INFO L899 garLoopResultBuilder]: For program point reach_errorFINAL(line 3) no Hoare annotation was computed. [2022-04-27 10:31:40,320 INFO L899 garLoopResultBuilder]: For program point fEXIT(lines 12 14) no Hoare annotation was computed. [2022-04-27 10:31:40,320 INFO L902 garLoopResultBuilder]: At program point fENTRY(lines 12 14) the Hoare annotation is: true [2022-04-27 10:31:40,320 INFO L899 garLoopResultBuilder]: For program point fFINAL(lines 12 14) no Hoare annotation was computed. [2022-04-27 10:31:40,320 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 16 24) the Hoare annotation is: true [2022-04-27 10:31:40,320 INFO L899 garLoopResultBuilder]: For program point mainEXIT(lines 16 24) no Hoare annotation was computed. [2022-04-27 10:31:40,320 INFO L895 garLoopResultBuilder]: At program point L20(line 20) the Hoare annotation is: (= (mod main_~x~0 2) 0) [2022-04-27 10:31:40,320 INFO L899 garLoopResultBuilder]: For program point L20-1(line 20) no Hoare annotation was computed. [2022-04-27 10:31:40,320 INFO L895 garLoopResultBuilder]: At program point L19-2(lines 19 21) the Hoare annotation is: (= (mod main_~x~0 2) 0) [2022-04-27 10:31:40,320 INFO L895 garLoopResultBuilder]: At program point L19-3(lines 19 21) the Hoare annotation is: (= (mod main_~x~0 2) 0) [2022-04-27 10:31:40,320 INFO L899 garLoopResultBuilder]: For program point mainFINAL(lines 16 24) no Hoare annotation was computed. [2022-04-27 10:31:40,320 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-27 10:31:40,320 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 10:31:40,320 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-27 10:31:40,321 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-27 10:31:40,324 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-27 10:31:40,324 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-27 10:31:40,325 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-27 10:31:40,325 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 5 10) the Hoare annotation is: true [2022-04-27 10:31:40,325 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 5 10) no Hoare annotation was computed. [2022-04-27 10:31:40,325 INFO L899 garLoopResultBuilder]: For program point L7(line 7) no Hoare annotation was computed. [2022-04-27 10:31:40,326 INFO L899 garLoopResultBuilder]: For program point L6(lines 6 8) no Hoare annotation was computed. [2022-04-27 10:31:40,326 INFO L899 garLoopResultBuilder]: For program point L6-2(lines 5 10) no Hoare annotation was computed. [2022-04-27 10:31:40,329 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 7) no Hoare annotation was computed. [2022-04-27 10:31:40,331 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-04-27 10:31:40,333 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 10:31:40,336 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-27 10:31:40,336 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 10:31:40,336 WARN L170 areAnnotationChecker]: fFINAL has no Hoare annotation [2022-04-27 10:31:40,337 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2022-04-27 10:31:40,337 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-27 10:31:40,337 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 10:31:40,337 WARN L170 areAnnotationChecker]: fFINAL has no Hoare annotation [2022-04-27 10:31:40,337 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 10:31:40,337 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2022-04-27 10:31:40,338 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2022-04-27 10:31:40,338 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-27 10:31:40,338 WARN L170 areAnnotationChecker]: fEXIT has no Hoare annotation [2022-04-27 10:31:40,338 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 10:31:40,338 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 10:31:40,338 WARN L170 areAnnotationChecker]: L20-1 has no Hoare annotation [2022-04-27 10:31:40,338 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-04-27 10:31:40,338 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-04-27 10:31:40,338 WARN L170 areAnnotationChecker]: L6-2 has no Hoare annotation [2022-04-27 10:31:40,338 WARN L170 areAnnotationChecker]: L20-1 has no Hoare annotation [2022-04-27 10:31:40,338 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 10:31:40,338 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 10:31:40,338 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-27 10:31:40,338 INFO L163 areAnnotationChecker]: CFG has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-27 10:31:40,343 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 10:31:40 BoogieIcfgContainer [2022-04-27 10:31:40,343 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 10:31:40,344 INFO L158 Benchmark]: Toolchain (without parser) took 2329.62ms. Allocated memory is still 185.6MB. Free memory was 135.0MB in the beginning and 91.6MB in the end (delta: 43.3MB). Peak memory consumption was 42.5MB. Max. memory is 8.0GB. [2022-04-27 10:31:40,344 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 185.6MB. Free memory was 151.0MB in the beginning and 150.9MB in the end (delta: 77.4kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 10:31:40,344 INFO L158 Benchmark]: CACSL2BoogieTranslator took 225.62ms. Allocated memory is still 185.6MB. Free memory was 134.8MB in the beginning and 162.6MB in the end (delta: -27.8MB). Peak memory consumption was 14.0MB. Max. memory is 8.0GB. [2022-04-27 10:31:40,344 INFO L158 Benchmark]: Boogie Preprocessor took 20.36ms. Allocated memory is still 185.6MB. Free memory was 162.6MB in the beginning and 161.3MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-27 10:31:40,344 INFO L158 Benchmark]: RCFGBuilder took 249.94ms. Allocated memory is still 185.6MB. Free memory was 161.0MB in the beginning and 151.3MB in the end (delta: 9.7MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-27 10:31:40,345 INFO L158 Benchmark]: TraceAbstraction took 1827.28ms. Allocated memory is still 185.6MB. Free memory was 150.8MB in the beginning and 91.6MB in the end (delta: 59.2MB). Peak memory consumption was 58.9MB. Max. memory is 8.0GB. [2022-04-27 10:31:40,346 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.09ms. Allocated memory is still 185.6MB. Free memory was 151.0MB in the beginning and 150.9MB in the end (delta: 77.4kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 225.62ms. Allocated memory is still 185.6MB. Free memory was 134.8MB in the beginning and 162.6MB in the end (delta: -27.8MB). Peak memory consumption was 14.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 20.36ms. Allocated memory is still 185.6MB. Free memory was 162.6MB in the beginning and 161.3MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 249.94ms. Allocated memory is still 185.6MB. Free memory was 161.0MB in the beginning and 151.3MB in the end (delta: 9.7MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 1827.28ms. Allocated memory is still 185.6MB. Free memory was 150.8MB in the beginning and 91.6MB in the end (delta: 59.2MB). Peak memory consumption was 58.9MB. 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 6 procedures, 26 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.8s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 29 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 25 mSDsluCounter, 93 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 47 mSDsCounter, 9 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 51 IncrementalHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 9 mSolverCounterUnsat, 46 mSDtfsCounter, 51 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 56 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=23occurred 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, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 11 PreInvPairs, 13 NumberOfFragments, 27 HoareAnnotationTreeSize, 11 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 9 FomulaSimplificationsInter, 10 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 56 NumberOfCodeBlocks, 56 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 68 ConstructedInterpolants, 0 QuantifiedInterpolants, 221 SizeOfPredicates, 3 NumberOfNonLiveVariables, 65 ConjunctsInSsa, 15 ConjunctsInUnsatCore, 5 InterpolantComputations, 3 PerfectInterpolantSequences, 1/3 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: 19]: Loop Invariant Derived loop invariant: x % 2 == 0 RESULT: Ultimate proved your program to be correct! [2022-04-27 10:31:40,370 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...