/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-industry-pattern/mod3.c.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 10:58:02,059 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 10:58:02,062 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 10:58:02,091 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 10:58:02,091 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 10:58:02,092 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 10:58:02,093 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 10:58:02,094 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 10:58:02,096 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 10:58:02,096 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 10:58:02,097 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 10:58:02,098 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 10:58:02,098 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 10:58:02,099 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 10:58:02,100 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 10:58:02,101 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 10:58:02,102 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 10:58:02,102 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 10:58:02,104 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 10:58:02,106 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 10:58:02,107 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 10:58:02,108 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 10:58:02,109 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 10:58:02,111 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 10:58:02,115 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 10:58:02,121 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 10:58:02,122 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 10:58:02,122 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 10:58:02,122 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 10:58:02,123 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 10:58:02,123 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 10:58:02,124 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 10:58:02,124 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 10:58:02,125 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 10:58:02,125 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 10:58:02,126 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 10:58:02,126 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 10:58:02,127 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 10:58:02,127 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 10:58:02,127 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 10:58:02,128 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 10:58:02,137 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 10:58:02,137 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:58:02,164 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 10:58:02,164 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 10:58:02,164 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 10:58:02,164 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 10:58:02,165 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 10:58:02,165 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 10:58:02,165 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 10:58:02,166 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 10:58:02,166 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 10:58:02,166 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 10:58:02,166 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 10:58:02,166 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 10:58:02,166 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 10:58:02,166 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 10:58:02,166 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 10:58:02,166 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 10:58:02,167 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 10:58:02,167 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 10:58:02,167 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 10:58:02,167 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 10:58:02,167 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 10:58:02,167 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 10:58:02,167 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 10:58:02,167 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 10:58:02,167 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 10:58:02,168 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 10:58:02,168 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 10:58:02,168 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 10:58:02,168 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 10:58:02,168 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 10:58:02,168 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 10:58:02,168 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 10:58:02,168 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 10:58:02,168 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:58:02,386 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 10:58:02,406 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 10:58:02,409 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 10:58:02,409 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 10:58:02,410 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 10:58:02,411 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-industry-pattern/mod3.c.v+lhb-reducer.c [2022-04-27 10:58:02,466 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47a3cbf15/a57ea424f068495cb28b4627f8b34ec1/FLAGff56bbca8 [2022-04-27 10:58:02,845 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 10:58:02,846 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-industry-pattern/mod3.c.v+lhb-reducer.c [2022-04-27 10:58:02,853 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47a3cbf15/a57ea424f068495cb28b4627f8b34ec1/FLAGff56bbca8 [2022-04-27 10:58:03,275 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47a3cbf15/a57ea424f068495cb28b4627f8b34ec1 [2022-04-27 10:58:03,277 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 10:58:03,278 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 10:58:03,285 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 10:58:03,285 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 10:58:03,288 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 10:58:03,289 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 10:58:03" (1/1) ... [2022-04-27 10:58:03,290 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47d3addc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:58:03, skipping insertion in model container [2022-04-27 10:58:03,290 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 10:58:03" (1/1) ... [2022-04-27 10:58:03,295 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 10:58:03,310 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 10:58:03,461 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-industry-pattern/mod3.c.v+lhb-reducer.c[2265,2278] [2022-04-27 10:58:03,468 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 10:58:03,478 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 10:58:03,496 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-industry-pattern/mod3.c.v+lhb-reducer.c[2265,2278] [2022-04-27 10:58:03,500 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 10:58:03,511 INFO L208 MainTranslator]: Completed translation [2022-04-27 10:58:03,511 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:58:03 WrapperNode [2022-04-27 10:58:03,511 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 10:58:03,512 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 10:58:03,512 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 10:58:03,512 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 10:58:03,521 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:58:03" (1/1) ... [2022-04-27 10:58:03,521 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:58:03" (1/1) ... [2022-04-27 10:58:03,526 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:58:03" (1/1) ... [2022-04-27 10:58:03,527 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:58:03" (1/1) ... [2022-04-27 10:58:03,533 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:58:03" (1/1) ... [2022-04-27 10:58:03,535 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:58:03" (1/1) ... [2022-04-27 10:58:03,536 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:58:03" (1/1) ... [2022-04-27 10:58:03,538 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 10:58:03,539 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 10:58:03,539 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 10:58:03,539 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 10:58:03,540 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:58:03" (1/1) ... [2022-04-27 10:58:03,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 10:58:03,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:58:03,568 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:58:03,570 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:58:03,600 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 10:58:03,600 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 10:58:03,601 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 10:58:03,601 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 10:58:03,604 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 10:58:03,604 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 10:58:03,604 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 10:58:03,604 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 10:58:03,605 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 10:58:03,605 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 10:58:03,605 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 10:58:03,605 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 10:58:03,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 10:58:03,605 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 10:58:03,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 10:58:03,606 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 10:58:03,606 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 10:58:03,671 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 10:58:03,672 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 10:58:12,505 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 10:58:12,510 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 10:58:12,511 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-04-27 10:58:12,512 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 10:58:12 BoogieIcfgContainer [2022-04-27 10:58:12,512 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 10:58:12,513 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 10:58:12,513 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 10:58:12,521 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 10:58:12,521 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 10:58:03" (1/3) ... [2022-04-27 10:58:12,521 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3695f1da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 10:58:12, skipping insertion in model container [2022-04-27 10:58:12,521 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:58:03" (2/3) ... [2022-04-27 10:58:12,522 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3695f1da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 10:58:12, skipping insertion in model container [2022-04-27 10:58:12,522 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 10:58:12" (3/3) ... [2022-04-27 10:58:12,523 INFO L111 eAbstractionObserver]: Analyzing ICFG mod3.c.v+lhb-reducer.c [2022-04-27 10:58:12,533 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 10:58:12,533 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 10:58:12,565 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 10:58:12,570 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@4b09e1d6, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@4f91b2ac [2022-04-27 10:58:12,570 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 10:58:12,577 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 22 states have (on average 1.5) internal successors, (33), 23 states have internal predecessors, (33), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 10:58:12,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-27 10:58:12,583 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:58:12,583 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:58:12,584 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:58:12,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:58:12,587 INFO L85 PathProgramCache]: Analyzing trace with hash 1261463571, now seen corresponding path program 1 times [2022-04-27 10:58:12,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:58:12,594 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189346177] [2022-04-27 10:58:12,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:58:12,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:58:12,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:58:13,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:58:13,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:58:13,194 INFO L290 TraceCheckUtils]: 0: Hoare triple {39#(and (= ~__tmp_91_0~0 |old(~__tmp_91_0~0)|) (= ~__tmp_91_1~0 |old(~__tmp_91_1~0)|) (= ~__return_main~0 |old(~__return_main~0)|) (= ~__tmp_88_1~0 |old(~__tmp_88_1~0)|) (= ~__tmp_94_0~0 |old(~__tmp_94_0~0)|) (= ~__tmp_88_0~0 |old(~__tmp_88_0~0)|) (= |old(~__tmp_112_0~0)| ~__tmp_112_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~__return_121~0)| ~__return_121~0) (= ~__tmp_93_0~0 |old(~__tmp_93_0~0)|) (= |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(23, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__tmp_112_0~0 := 0;~__tmp_94_0~0 := 0;~__tmp_93_0~0 := 0;~__tmp_88_0~0 := 0;~__tmp_88_1~0 := 0;~__tmp_91_0~0 := 0;~__tmp_91_1~0 := 0;~__return_121~0 := 0; {31#true} is VALID [2022-04-27 10:58:13,195 INFO L290 TraceCheckUtils]: 1: Hoare triple {31#true} assume true; {31#true} is VALID [2022-04-27 10:58:13,195 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {31#true} {31#true} #72#return; {31#true} is VALID [2022-04-27 10:58:13,198 INFO L272 TraceCheckUtils]: 0: Hoare triple {31#true} call ULTIMATE.init(); {39#(and (= ~__tmp_91_0~0 |old(~__tmp_91_0~0)|) (= ~__tmp_91_1~0 |old(~__tmp_91_1~0)|) (= ~__return_main~0 |old(~__return_main~0)|) (= ~__tmp_88_1~0 |old(~__tmp_88_1~0)|) (= ~__tmp_94_0~0 |old(~__tmp_94_0~0)|) (= ~__tmp_88_0~0 |old(~__tmp_88_0~0)|) (= |old(~__tmp_112_0~0)| ~__tmp_112_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~__return_121~0)| ~__return_121~0) (= ~__tmp_93_0~0 |old(~__tmp_93_0~0)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:58:13,198 INFO L290 TraceCheckUtils]: 1: Hoare triple {39#(and (= ~__tmp_91_0~0 |old(~__tmp_91_0~0)|) (= ~__tmp_91_1~0 |old(~__tmp_91_1~0)|) (= ~__return_main~0 |old(~__return_main~0)|) (= ~__tmp_88_1~0 |old(~__tmp_88_1~0)|) (= ~__tmp_94_0~0 |old(~__tmp_94_0~0)|) (= ~__tmp_88_0~0 |old(~__tmp_88_0~0)|) (= |old(~__tmp_112_0~0)| ~__tmp_112_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~__return_121~0)| ~__return_121~0) (= ~__tmp_93_0~0 |old(~__tmp_93_0~0)|) (= |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(23, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__tmp_112_0~0 := 0;~__tmp_94_0~0 := 0;~__tmp_93_0~0 := 0;~__tmp_88_0~0 := 0;~__tmp_88_1~0 := 0;~__tmp_91_0~0 := 0;~__tmp_91_1~0 := 0;~__return_121~0 := 0; {31#true} is VALID [2022-04-27 10:58:13,198 INFO L290 TraceCheckUtils]: 2: Hoare triple {31#true} assume true; {31#true} is VALID [2022-04-27 10:58:13,198 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31#true} {31#true} #72#return; {31#true} is VALID [2022-04-27 10:58:13,199 INFO L272 TraceCheckUtils]: 4: Hoare triple {31#true} call #t~ret9 := main(); {31#true} is VALID [2022-04-27 10:58:13,200 INFO L290 TraceCheckUtils]: 5: Hoare triple {31#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__x~0 := #t~nondet4;havoc #t~nondet4;~main__y~0 := 1; {36#(and (<= main_~main__x~0 2147483647) (or (<= 0 (+ 2147483648 main_~main__x~0)) (< 1431655764 (+ (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 1431655765)))))} is VALID [2022-04-27 10:58:13,201 INFO L290 TraceCheckUtils]: 6: Hoare triple {36#(and (<= main_~main__x~0 2147483647) (or (<= 0 (+ 2147483648 main_~main__x~0)) (< 1431655764 (+ (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 1431655765)))))} havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet5;havoc #t~nondet5; {36#(and (<= main_~main__x~0 2147483647) (or (<= 0 (+ 2147483648 main_~main__x~0)) (< 1431655764 (+ (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 1431655765)))))} is VALID [2022-04-27 10:58:13,202 INFO L290 TraceCheckUtils]: 7: Hoare triple {36#(and (<= main_~main__x~0 2147483647) (or (<= 0 (+ 2147483648 main_~main__x~0)) (< 1431655764 (+ (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 1431655765)))))} assume !(0 == ~main____CPAchecker_TMP_0~0); {36#(and (<= main_~main__x~0 2147483647) (or (<= 0 (+ 2147483648 main_~main__x~0)) (< 1431655764 (+ (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 1431655765)))))} is VALID [2022-04-27 10:58:15,298 WARN L290 TraceCheckUtils]: 8: Hoare triple {36#(and (<= main_~main__x~0 2147483647) (or (<= 0 (+ 2147483648 main_~main__x~0)) (< 1431655764 (+ (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 1431655765)))))} assume 1 == (if ~main__x~0 % 4294967296 < 0 && 0 != ~main__x~0 % 4294967296 % 3 then ~main__x~0 % 4294967296 % 3 - 3 else ~main__x~0 % 4294967296 % 3) % 4294967296;~main__x~0 := 2 + ~main__x~0;~main__y~0 := 0;~__tmp_112_0~0 := ~main____CPAchecker_TMP_0~0; {37#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} is UNKNOWN [2022-04-27 10:58:15,310 INFO L290 TraceCheckUtils]: 9: Hoare triple {37#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} ~main____CPAchecker_TMP_0~0 := ~__tmp_112_0~0;~__tmp_94_0~0 := ~main____CPAchecker_TMP_0~0; {37#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 10:58:15,311 INFO L290 TraceCheckUtils]: 10: Hoare triple {37#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} ~main____CPAchecker_TMP_0~0 := ~__tmp_94_0~0;havoc ~main____CPAchecker_TMP_0~1;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main____CPAchecker_TMP_0~1 := #t~nondet6;havoc #t~nondet6; {37#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 10:58:15,312 INFO L290 TraceCheckUtils]: 11: Hoare triple {37#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} assume !!(0 == ~main____CPAchecker_TMP_0~1); {37#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 10:58:15,318 INFO L290 TraceCheckUtils]: 12: Hoare triple {37#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} assume 0 == ~main__y~0 % 4294967296;havoc ~__tmp_1~0;~__tmp_1~0 := (if 0 == (if ~main__x~0 % 4294967296 < 0 && 0 != ~main__x~0 % 4294967296 % 3 then ~main__x~0 % 4294967296 % 3 - 3 else ~main__x~0 % 4294967296 % 3) % 4294967296 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {38#(not (= main_~__VERIFIER_assert__cond~0 0))} is VALID [2022-04-27 10:58:15,319 INFO L290 TraceCheckUtils]: 13: Hoare triple {38#(not (= main_~__VERIFIER_assert__cond~0 0))} assume 0 == ~__VERIFIER_assert__cond~0; {32#false} is VALID [2022-04-27 10:58:15,319 INFO L290 TraceCheckUtils]: 14: Hoare triple {32#false} assume !false; {32#false} is VALID [2022-04-27 10:58:15,320 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:58:15,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:58:15,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189346177] [2022-04-27 10:58:15,321 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189346177] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:58:15,321 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:58:15,321 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 10:58:15,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935939975] [2022-04-27 10:58:15,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:58:15,327 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-27 10:58:15,329 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:58:15,331 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:58:17,511 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 14 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-27 10:58:17,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 10:58:17,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:58:17,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 10:58:17,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 10:58:17,533 INFO L87 Difference]: Start difference. First operand has 28 states, 22 states have (on average 1.5) internal successors, (33), 23 states have internal predecessors, (33), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:58:21,957 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 10:58:30,841 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 10:58:32,992 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 10:58:35,143 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 10:58:37,314 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 10:58:39,472 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 10:58:45,988 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 10:58:50,319 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 10:58:54,651 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 10:58:56,938 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 10:58:57,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:58:57,122 INFO L93 Difference]: Finished difference Result 71 states and 99 transitions. [2022-04-27 10:58:57,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 10:58:57,123 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-27 10:58:57,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:58:57,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:58:57,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 99 transitions. [2022-04-27 10:58:57,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:58:57,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 99 transitions. [2022-04-27 10:58:57,137 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 99 transitions. [2022-04-27 10:58:59,362 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 98 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-27 10:58:59,369 INFO L225 Difference]: With dead ends: 71 [2022-04-27 10:58:59,369 INFO L226 Difference]: Without dead ends: 35 [2022-04-27 10:58:59,371 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-27 10:58:59,373 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 21 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 4 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 21.7s IncrementalHoareTripleChecker+Time [2022-04-27 10:58:59,374 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 95 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 82 Invalid, 10 Unknown, 0 Unchecked, 21.7s Time] [2022-04-27 10:58:59,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-27 10:58:59,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2022-04-27 10:58:59,400 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:58:59,401 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 32 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 28 states have internal predecessors, (36), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:58:59,401 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 32 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 28 states have internal predecessors, (36), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:58:59,402 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 32 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 28 states have internal predecessors, (36), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:58:59,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:58:59,405 INFO L93 Difference]: Finished difference Result 35 states and 45 transitions. [2022-04-27 10:58:59,405 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 45 transitions. [2022-04-27 10:58:59,406 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:58:59,406 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:58:59,406 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 28 states have internal predecessors, (36), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 35 states. [2022-04-27 10:58:59,407 INFO L87 Difference]: Start difference. First operand has 32 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 28 states have internal predecessors, (36), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 35 states. [2022-04-27 10:58:59,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:58:59,409 INFO L93 Difference]: Finished difference Result 35 states and 45 transitions. [2022-04-27 10:58:59,410 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 45 transitions. [2022-04-27 10:58:59,410 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:58:59,410 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:58:59,410 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:58:59,410 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:58:59,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 28 states have internal predecessors, (36), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:58:59,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2022-04-27 10:58:59,413 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 39 transitions. Word has length 15 [2022-04-27 10:58:59,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:58:59,414 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 39 transitions. [2022-04-27 10:58:59,414 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:58:59,414 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2022-04-27 10:58:59,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-27 10:58:59,415 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:58:59,415 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:58:59,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 10:58:59,415 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:58:59,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:58:59,416 INFO L85 PathProgramCache]: Analyzing trace with hash 489359351, now seen corresponding path program 1 times [2022-04-27 10:58:59,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:58:59,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846220956] [2022-04-27 10:58:59,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:58:59,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:58:59,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:58:59,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:58:59,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:58:59,737 INFO L290 TraceCheckUtils]: 0: Hoare triple {259#(and (= ~__tmp_91_0~0 |old(~__tmp_91_0~0)|) (= ~__tmp_91_1~0 |old(~__tmp_91_1~0)|) (= ~__return_main~0 |old(~__return_main~0)|) (= ~__tmp_88_1~0 |old(~__tmp_88_1~0)|) (= ~__tmp_94_0~0 |old(~__tmp_94_0~0)|) (= ~__tmp_88_0~0 |old(~__tmp_88_0~0)|) (= |old(~__tmp_112_0~0)| ~__tmp_112_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~__return_121~0)| ~__return_121~0) (= ~__tmp_93_0~0 |old(~__tmp_93_0~0)|) (= |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(23, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__tmp_112_0~0 := 0;~__tmp_94_0~0 := 0;~__tmp_93_0~0 := 0;~__tmp_88_0~0 := 0;~__tmp_88_1~0 := 0;~__tmp_91_0~0 := 0;~__tmp_91_1~0 := 0;~__return_121~0 := 0; {251#true} is VALID [2022-04-27 10:58:59,737 INFO L290 TraceCheckUtils]: 1: Hoare triple {251#true} assume true; {251#true} is VALID [2022-04-27 10:58:59,737 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {251#true} {251#true} #72#return; {251#true} is VALID [2022-04-27 10:58:59,739 INFO L272 TraceCheckUtils]: 0: Hoare triple {251#true} call ULTIMATE.init(); {259#(and (= ~__tmp_91_0~0 |old(~__tmp_91_0~0)|) (= ~__tmp_91_1~0 |old(~__tmp_91_1~0)|) (= ~__return_main~0 |old(~__return_main~0)|) (= ~__tmp_88_1~0 |old(~__tmp_88_1~0)|) (= ~__tmp_94_0~0 |old(~__tmp_94_0~0)|) (= ~__tmp_88_0~0 |old(~__tmp_88_0~0)|) (= |old(~__tmp_112_0~0)| ~__tmp_112_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~__return_121~0)| ~__return_121~0) (= ~__tmp_93_0~0 |old(~__tmp_93_0~0)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:58:59,739 INFO L290 TraceCheckUtils]: 1: Hoare triple {259#(and (= ~__tmp_91_0~0 |old(~__tmp_91_0~0)|) (= ~__tmp_91_1~0 |old(~__tmp_91_1~0)|) (= ~__return_main~0 |old(~__return_main~0)|) (= ~__tmp_88_1~0 |old(~__tmp_88_1~0)|) (= ~__tmp_94_0~0 |old(~__tmp_94_0~0)|) (= ~__tmp_88_0~0 |old(~__tmp_88_0~0)|) (= |old(~__tmp_112_0~0)| ~__tmp_112_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~__return_121~0)| ~__return_121~0) (= ~__tmp_93_0~0 |old(~__tmp_93_0~0)|) (= |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(23, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__tmp_112_0~0 := 0;~__tmp_94_0~0 := 0;~__tmp_93_0~0 := 0;~__tmp_88_0~0 := 0;~__tmp_88_1~0 := 0;~__tmp_91_0~0 := 0;~__tmp_91_1~0 := 0;~__return_121~0 := 0; {251#true} is VALID [2022-04-27 10:58:59,739 INFO L290 TraceCheckUtils]: 2: Hoare triple {251#true} assume true; {251#true} is VALID [2022-04-27 10:58:59,739 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {251#true} {251#true} #72#return; {251#true} is VALID [2022-04-27 10:58:59,740 INFO L272 TraceCheckUtils]: 4: Hoare triple {251#true} call #t~ret9 := main(); {251#true} is VALID [2022-04-27 10:58:59,740 INFO L290 TraceCheckUtils]: 5: Hoare triple {251#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__x~0 := #t~nondet4;havoc #t~nondet4;~main__y~0 := 1; {256#(and (<= main_~main__x~0 2147483647) (or (<= 0 (+ 2147483648 main_~main__x~0)) (< 2863311527 (+ (* 2 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (div main_~main__x~0 4294967296) (* 2863311531 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296))))))} is VALID [2022-04-27 10:58:59,741 INFO L290 TraceCheckUtils]: 6: Hoare triple {256#(and (<= main_~main__x~0 2147483647) (or (<= 0 (+ 2147483648 main_~main__x~0)) (< 2863311527 (+ (* 2 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (div main_~main__x~0 4294967296) (* 2863311531 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296))))))} havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet5;havoc #t~nondet5; {256#(and (<= main_~main__x~0 2147483647) (or (<= 0 (+ 2147483648 main_~main__x~0)) (< 2863311527 (+ (* 2 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (div main_~main__x~0 4294967296) (* 2863311531 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296))))))} is VALID [2022-04-27 10:58:59,742 INFO L290 TraceCheckUtils]: 7: Hoare triple {256#(and (<= main_~main__x~0 2147483647) (or (<= 0 (+ 2147483648 main_~main__x~0)) (< 2863311527 (+ (* 2 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (div main_~main__x~0 4294967296) (* 2863311531 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296))))))} assume !(0 == ~main____CPAchecker_TMP_0~0); {256#(and (<= main_~main__x~0 2147483647) (or (<= 0 (+ 2147483648 main_~main__x~0)) (< 2863311527 (+ (* 2 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (div main_~main__x~0 4294967296) (* 2863311531 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296))))))} is VALID [2022-04-27 10:58:59,743 INFO L290 TraceCheckUtils]: 8: Hoare triple {256#(and (<= main_~main__x~0 2147483647) (or (<= 0 (+ 2147483648 main_~main__x~0)) (< 2863311527 (+ (* 2 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (div main_~main__x~0 4294967296) (* 2863311531 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296))))))} assume !(1 == (if ~main__x~0 % 4294967296 < 0 && 0 != ~main__x~0 % 4294967296 % 3 then ~main__x~0 % 4294967296 % 3 - 3 else ~main__x~0 % 4294967296 % 3) % 4294967296); {256#(and (<= main_~main__x~0 2147483647) (or (<= 0 (+ 2147483648 main_~main__x~0)) (< 2863311527 (+ (* 2 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (div main_~main__x~0 4294967296) (* 2863311531 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296))))))} is VALID [2022-04-27 10:59:01,881 WARN L290 TraceCheckUtils]: 9: Hoare triple {256#(and (<= main_~main__x~0 2147483647) (or (<= 0 (+ 2147483648 main_~main__x~0)) (< 2863311527 (+ (* 2 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (div main_~main__x~0 4294967296) (* 2863311531 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296))))))} assume 2 == (if ~main__x~0 % 4294967296 < 0 && 0 != ~main__x~0 % 4294967296 % 3 then ~main__x~0 % 4294967296 % 3 - 3 else ~main__x~0 % 4294967296 % 3) % 4294967296;~main__x~0 := 1 + ~main__x~0;~main__y~0 := 0;~__tmp_93_0~0 := ~main____CPAchecker_TMP_0~0; {257#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} is UNKNOWN [2022-04-27 10:59:01,882 INFO L290 TraceCheckUtils]: 10: Hoare triple {257#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} ~main____CPAchecker_TMP_0~1 := ~__tmp_93_0~0;~__tmp_94_0~0 := ~main____CPAchecker_TMP_0~1; {257#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 10:59:01,883 INFO L290 TraceCheckUtils]: 11: Hoare triple {257#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} ~main____CPAchecker_TMP_0~0 := ~__tmp_94_0~0;havoc ~main____CPAchecker_TMP_0~1;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main____CPAchecker_TMP_0~1 := #t~nondet6;havoc #t~nondet6; {257#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 10:59:01,884 INFO L290 TraceCheckUtils]: 12: Hoare triple {257#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} assume !!(0 == ~main____CPAchecker_TMP_0~1); {257#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 10:59:01,889 INFO L290 TraceCheckUtils]: 13: Hoare triple {257#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} assume 0 == ~main__y~0 % 4294967296;havoc ~__tmp_1~0;~__tmp_1~0 := (if 0 == (if ~main__x~0 % 4294967296 < 0 && 0 != ~main__x~0 % 4294967296 % 3 then ~main__x~0 % 4294967296 % 3 - 3 else ~main__x~0 % 4294967296 % 3) % 4294967296 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {258#(not (= main_~__VERIFIER_assert__cond~0 0))} is VALID [2022-04-27 10:59:01,890 INFO L290 TraceCheckUtils]: 14: Hoare triple {258#(not (= main_~__VERIFIER_assert__cond~0 0))} assume 0 == ~__VERIFIER_assert__cond~0; {252#false} is VALID [2022-04-27 10:59:01,890 INFO L290 TraceCheckUtils]: 15: Hoare triple {252#false} assume !false; {252#false} is VALID [2022-04-27 10:59:01,890 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:59:01,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:59:01,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846220956] [2022-04-27 10:59:01,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846220956] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:59:01,891 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:59:01,891 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 10:59:01,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343055640] [2022-04-27 10:59:01,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:59:01,893 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-27 10:59:01,893 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:59:01,893 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:59:04,031 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 15 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-27 10:59:04,031 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 10:59:04,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:59:04,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 10:59:04,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 10:59:04,034 INFO L87 Difference]: Start difference. First operand 32 states and 39 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:59:06,198 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 10:59:08,359 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 10:59:10,550 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 10:59:12,719 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 10:59:25,905 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 10:59:28,132 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 10:59:30,289 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 10:59:34,575 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 10:59:39,030 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 10:59:41,035 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 10:59:45,353 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 10:59:49,672 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 10:59:53,994 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 10:59:56,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:59:56,298 INFO L93 Difference]: Finished difference Result 60 states and 79 transitions. [2022-04-27 10:59:56,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-27 10:59:56,298 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-27 10:59:56,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:59:56,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:59:56,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 74 transitions. [2022-04-27 10:59:56,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:59:56,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 74 transitions. [2022-04-27 10:59:56,303 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 74 transitions. [2022-04-27 10:59:58,509 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 73 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-27 10:59:58,510 INFO L225 Difference]: With dead ends: 60 [2022-04-27 10:59:58,511 INFO L226 Difference]: Without dead ends: 40 [2022-04-27 10:59:58,511 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-27 10:59:58,515 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 10 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 3 mSolverCounterUnsat, 12 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 26.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 12 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 26.9s IncrementalHoareTripleChecker+Time [2022-04-27 10:59:58,515 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 80 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 74 Invalid, 12 Unknown, 0 Unchecked, 26.9s Time] [2022-04-27 10:59:58,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-04-27 10:59:58,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 34. [2022-04-27 10:59:58,530 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:59:58,530 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand has 34 states, 30 states have (on average 1.3) internal successors, (39), 30 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:59:58,530 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand has 34 states, 30 states have (on average 1.3) internal successors, (39), 30 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:59:58,531 INFO L87 Difference]: Start difference. First operand 40 states. Second operand has 34 states, 30 states have (on average 1.3) internal successors, (39), 30 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:59:58,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:59:58,532 INFO L93 Difference]: Finished difference Result 40 states and 50 transitions. [2022-04-27 10:59:58,533 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 50 transitions. [2022-04-27 10:59:58,533 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:59:58,533 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:59:58,533 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 30 states have (on average 1.3) internal successors, (39), 30 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 40 states. [2022-04-27 10:59:58,534 INFO L87 Difference]: Start difference. First operand has 34 states, 30 states have (on average 1.3) internal successors, (39), 30 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 40 states. [2022-04-27 10:59:58,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:59:58,540 INFO L93 Difference]: Finished difference Result 40 states and 50 transitions. [2022-04-27 10:59:58,540 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 50 transitions. [2022-04-27 10:59:58,540 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:59:58,541 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:59:58,541 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:59:58,541 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:59:58,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 30 states have (on average 1.3) internal successors, (39), 30 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:59:58,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 42 transitions. [2022-04-27 10:59:58,545 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 42 transitions. Word has length 16 [2022-04-27 10:59:58,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:59:58,545 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 42 transitions. [2022-04-27 10:59:58,545 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:59:58,546 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 42 transitions. [2022-04-27 10:59:58,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-27 10:59:58,547 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:59:58,547 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:59:58,547 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 10:59:58,548 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:59:58,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:59:58,549 INFO L85 PathProgramCache]: Analyzing trace with hash 7180197, now seen corresponding path program 1 times [2022-04-27 10:59:58,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:59:58,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154423474] [2022-04-27 10:59:58,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:59:58,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:59:58,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:59:58,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:59:58,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:59:58,773 INFO L290 TraceCheckUtils]: 0: Hoare triple {482#(and (= ~__tmp_91_0~0 |old(~__tmp_91_0~0)|) (= ~__tmp_91_1~0 |old(~__tmp_91_1~0)|) (= ~__return_main~0 |old(~__return_main~0)|) (= ~__tmp_88_1~0 |old(~__tmp_88_1~0)|) (= ~__tmp_94_0~0 |old(~__tmp_94_0~0)|) (= ~__tmp_88_0~0 |old(~__tmp_88_0~0)|) (= |old(~__tmp_112_0~0)| ~__tmp_112_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~__return_121~0)| ~__return_121~0) (= ~__tmp_93_0~0 |old(~__tmp_93_0~0)|) (= |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(23, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__tmp_112_0~0 := 0;~__tmp_94_0~0 := 0;~__tmp_93_0~0 := 0;~__tmp_88_0~0 := 0;~__tmp_88_1~0 := 0;~__tmp_91_0~0 := 0;~__tmp_91_1~0 := 0;~__return_121~0 := 0; {475#true} is VALID [2022-04-27 10:59:58,774 INFO L290 TraceCheckUtils]: 1: Hoare triple {475#true} assume true; {475#true} is VALID [2022-04-27 10:59:58,774 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {475#true} {475#true} #72#return; {475#true} is VALID [2022-04-27 10:59:58,775 INFO L272 TraceCheckUtils]: 0: Hoare triple {475#true} call ULTIMATE.init(); {482#(and (= ~__tmp_91_0~0 |old(~__tmp_91_0~0)|) (= ~__tmp_91_1~0 |old(~__tmp_91_1~0)|) (= ~__return_main~0 |old(~__return_main~0)|) (= ~__tmp_88_1~0 |old(~__tmp_88_1~0)|) (= ~__tmp_94_0~0 |old(~__tmp_94_0~0)|) (= ~__tmp_88_0~0 |old(~__tmp_88_0~0)|) (= |old(~__tmp_112_0~0)| ~__tmp_112_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~__return_121~0)| ~__return_121~0) (= ~__tmp_93_0~0 |old(~__tmp_93_0~0)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:59:58,775 INFO L290 TraceCheckUtils]: 1: Hoare triple {482#(and (= ~__tmp_91_0~0 |old(~__tmp_91_0~0)|) (= ~__tmp_91_1~0 |old(~__tmp_91_1~0)|) (= ~__return_main~0 |old(~__return_main~0)|) (= ~__tmp_88_1~0 |old(~__tmp_88_1~0)|) (= ~__tmp_94_0~0 |old(~__tmp_94_0~0)|) (= ~__tmp_88_0~0 |old(~__tmp_88_0~0)|) (= |old(~__tmp_112_0~0)| ~__tmp_112_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~__return_121~0)| ~__return_121~0) (= ~__tmp_93_0~0 |old(~__tmp_93_0~0)|) (= |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(23, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__tmp_112_0~0 := 0;~__tmp_94_0~0 := 0;~__tmp_93_0~0 := 0;~__tmp_88_0~0 := 0;~__tmp_88_1~0 := 0;~__tmp_91_0~0 := 0;~__tmp_91_1~0 := 0;~__return_121~0 := 0; {475#true} is VALID [2022-04-27 10:59:58,776 INFO L290 TraceCheckUtils]: 2: Hoare triple {475#true} assume true; {475#true} is VALID [2022-04-27 10:59:58,776 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {475#true} {475#true} #72#return; {475#true} is VALID [2022-04-27 10:59:58,776 INFO L272 TraceCheckUtils]: 4: Hoare triple {475#true} call #t~ret9 := main(); {475#true} is VALID [2022-04-27 10:59:58,776 INFO L290 TraceCheckUtils]: 5: Hoare triple {475#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__x~0 := #t~nondet4;havoc #t~nondet4;~main__y~0 := 1; {475#true} is VALID [2022-04-27 10:59:58,776 INFO L290 TraceCheckUtils]: 6: Hoare triple {475#true} havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet5;havoc #t~nondet5; {475#true} is VALID [2022-04-27 10:59:58,776 INFO L290 TraceCheckUtils]: 7: Hoare triple {475#true} assume !(0 == ~main____CPAchecker_TMP_0~0); {475#true} is VALID [2022-04-27 10:59:58,777 INFO L290 TraceCheckUtils]: 8: Hoare triple {475#true} assume !(1 == (if ~main__x~0 % 4294967296 < 0 && 0 != ~main__x~0 % 4294967296 % 3 then ~main__x~0 % 4294967296 % 3 - 3 else ~main__x~0 % 4294967296 % 3) % 4294967296); {475#true} is VALID [2022-04-27 10:59:58,777 INFO L290 TraceCheckUtils]: 9: Hoare triple {475#true} assume !(2 == (if ~main__x~0 % 4294967296 < 0 && 0 != ~main__x~0 % 4294967296 % 3 then ~main__x~0 % 4294967296 % 3 - 3 else ~main__x~0 % 4294967296 % 3) % 4294967296);havoc ~main____CPAchecker_TMP_1~1;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~main____CPAchecker_TMP_1~1 := #t~nondet8;havoc #t~nondet8; {475#true} is VALID [2022-04-27 10:59:58,777 INFO L290 TraceCheckUtils]: 10: Hoare triple {475#true} assume !(0 == ~main____CPAchecker_TMP_1~1);~main__x~0 := 4 + ~main__x~0;~main__y~0 := 1;~__tmp_88_0~0 := ~main____CPAchecker_TMP_0~0;~__tmp_88_1~0 := ~main____CPAchecker_TMP_1~1; {475#true} is VALID [2022-04-27 10:59:58,777 INFO L290 TraceCheckUtils]: 11: Hoare triple {475#true} ~main____CPAchecker_TMP_0~1 := ~__tmp_88_0~0;~main____CPAchecker_TMP_1~0 := ~__tmp_88_1~0; {475#true} is VALID [2022-04-27 10:59:58,777 INFO L290 TraceCheckUtils]: 12: Hoare triple {475#true} havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet5;havoc #t~nondet5; {475#true} is VALID [2022-04-27 10:59:58,778 INFO L290 TraceCheckUtils]: 13: Hoare triple {475#true} assume !(0 == ~main____CPAchecker_TMP_0~0); {475#true} is VALID [2022-04-27 11:00:00,942 WARN L290 TraceCheckUtils]: 14: Hoare triple {475#true} assume 1 == (if ~main__x~0 % 4294967296 < 0 && 0 != ~main__x~0 % 4294967296 % 3 then ~main__x~0 % 4294967296 % 3 - 3 else ~main__x~0 % 4294967296 % 3) % 4294967296;~main__x~0 := 2 + ~main__x~0;~main__y~0 := 0;~__tmp_112_0~0 := ~main____CPAchecker_TMP_0~0; {480#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} is UNKNOWN [2022-04-27 11:00:00,943 INFO L290 TraceCheckUtils]: 15: Hoare triple {480#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} ~main____CPAchecker_TMP_0~0 := ~__tmp_112_0~0;~__tmp_94_0~0 := ~main____CPAchecker_TMP_0~0; {480#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:00:00,943 INFO L290 TraceCheckUtils]: 16: Hoare triple {480#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} ~main____CPAchecker_TMP_0~0 := ~__tmp_94_0~0;havoc ~main____CPAchecker_TMP_0~1;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main____CPAchecker_TMP_0~1 := #t~nondet6;havoc #t~nondet6; {480#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:00:00,944 INFO L290 TraceCheckUtils]: 17: Hoare triple {480#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} assume !!(0 == ~main____CPAchecker_TMP_0~1); {480#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:00:00,948 INFO L290 TraceCheckUtils]: 18: Hoare triple {480#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} assume 0 == ~main__y~0 % 4294967296;havoc ~__tmp_1~0;~__tmp_1~0 := (if 0 == (if ~main__x~0 % 4294967296 < 0 && 0 != ~main__x~0 % 4294967296 % 3 then ~main__x~0 % 4294967296 % 3 - 3 else ~main__x~0 % 4294967296 % 3) % 4294967296 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {481#(not (= main_~__VERIFIER_assert__cond~0 0))} is VALID [2022-04-27 11:00:00,948 INFO L290 TraceCheckUtils]: 19: Hoare triple {481#(not (= main_~__VERIFIER_assert__cond~0 0))} assume 0 == ~__VERIFIER_assert__cond~0; {476#false} is VALID [2022-04-27 11:00:00,948 INFO L290 TraceCheckUtils]: 20: Hoare triple {476#false} assume !false; {476#false} is VALID [2022-04-27 11:00:00,949 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-27 11:00:00,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:00:00,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154423474] [2022-04-27 11:00:00,949 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1154423474] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 11:00:00,949 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 11:00:00,949 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 11:00:00,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022683763] [2022-04-27 11:00:00,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 11:00:00,950 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-27 11:00:00,950 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:00:00,950 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:00:03,131 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 18 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-27 11:00:03,131 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 11:00:03,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:00:03,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 11:00:03,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 11:00:03,132 INFO L87 Difference]: Start difference. First operand 34 states and 42 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:00:07,349 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 11:00:09,502 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 11:00:13,823 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 11:00:15,977 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 11:00:20,293 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 11:00:24,682 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 11:00:29,070 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 11:00:31,228 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 11:00:35,546 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 11:00:39,894 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 11:00:42,056 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 11:00:44,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:00:44,384 INFO L93 Difference]: Finished difference Result 65 states and 84 transitions. [2022-04-27 11:00:44,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 11:00:44,384 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-27 11:00:44,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:00:44,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:00:44,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 74 transitions. [2022-04-27 11:00:44,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:00:44,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 74 transitions. [2022-04-27 11:00:44,387 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 74 transitions. [2022-04-27 11:00:48,767 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 72 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-27 11:00:48,768 INFO L225 Difference]: With dead ends: 65 [2022-04-27 11:00:48,768 INFO L226 Difference]: Without dead ends: 45 [2022-04-27 11:00:48,768 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 11:00:48,769 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 9 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 3 mSolverCounterUnsat, 11 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 22.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 11 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 23.4s IncrementalHoareTripleChecker+Time [2022-04-27 11:00:48,770 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 56 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 49 Invalid, 11 Unknown, 0 Unchecked, 23.4s Time] [2022-04-27 11:00:48,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-04-27 11:00:48,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 34. [2022-04-27 11:00:48,781 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:00:48,782 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand has 34 states, 30 states have (on average 1.3) internal successors, (39), 30 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:00:48,782 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand has 34 states, 30 states have (on average 1.3) internal successors, (39), 30 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:00:48,782 INFO L87 Difference]: Start difference. First operand 45 states. Second operand has 34 states, 30 states have (on average 1.3) internal successors, (39), 30 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:00:48,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:00:48,784 INFO L93 Difference]: Finished difference Result 45 states and 55 transitions. [2022-04-27 11:00:48,784 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 55 transitions. [2022-04-27 11:00:48,785 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:00:48,785 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:00:48,785 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 30 states have (on average 1.3) internal successors, (39), 30 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 45 states. [2022-04-27 11:00:48,785 INFO L87 Difference]: Start difference. First operand has 34 states, 30 states have (on average 1.3) internal successors, (39), 30 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 45 states. [2022-04-27 11:00:48,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:00:48,787 INFO L93 Difference]: Finished difference Result 45 states and 55 transitions. [2022-04-27 11:00:48,787 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 55 transitions. [2022-04-27 11:00:48,788 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:00:48,788 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:00:48,788 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:00:48,788 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:00:48,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 30 states have (on average 1.3) internal successors, (39), 30 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:00:48,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 42 transitions. [2022-04-27 11:00:48,789 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 42 transitions. Word has length 21 [2022-04-27 11:00:48,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:00:48,790 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 42 transitions. [2022-04-27 11:00:48,790 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:00:48,790 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 42 transitions. [2022-04-27 11:00:48,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-27 11:00:48,790 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 11:00:48,790 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 11:00:48,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-27 11:00:48,791 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 11:00:48,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 11:00:48,791 INFO L85 PathProgramCache]: Analyzing trace with hash 261280421, now seen corresponding path program 1 times [2022-04-27 11:00:48,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 11:00:48,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650752495] [2022-04-27 11:00:48,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 11:00:48,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 11:00:48,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:00:48,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 11:00:48,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 11:00:48,962 INFO L290 TraceCheckUtils]: 0: Hoare triple {720#(and (= ~__tmp_91_0~0 |old(~__tmp_91_0~0)|) (= ~__tmp_91_1~0 |old(~__tmp_91_1~0)|) (= ~__return_main~0 |old(~__return_main~0)|) (= ~__tmp_88_1~0 |old(~__tmp_88_1~0)|) (= ~__tmp_94_0~0 |old(~__tmp_94_0~0)|) (= ~__tmp_88_0~0 |old(~__tmp_88_0~0)|) (= |old(~__tmp_112_0~0)| ~__tmp_112_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~__return_121~0)| ~__return_121~0) (= ~__tmp_93_0~0 |old(~__tmp_93_0~0)|) (= |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(23, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__tmp_112_0~0 := 0;~__tmp_94_0~0 := 0;~__tmp_93_0~0 := 0;~__tmp_88_0~0 := 0;~__tmp_88_1~0 := 0;~__tmp_91_0~0 := 0;~__tmp_91_1~0 := 0;~__return_121~0 := 0; {713#true} is VALID [2022-04-27 11:00:48,962 INFO L290 TraceCheckUtils]: 1: Hoare triple {713#true} assume true; {713#true} is VALID [2022-04-27 11:00:48,963 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {713#true} {713#true} #72#return; {713#true} is VALID [2022-04-27 11:00:48,964 INFO L272 TraceCheckUtils]: 0: Hoare triple {713#true} call ULTIMATE.init(); {720#(and (= ~__tmp_91_0~0 |old(~__tmp_91_0~0)|) (= ~__tmp_91_1~0 |old(~__tmp_91_1~0)|) (= ~__return_main~0 |old(~__return_main~0)|) (= ~__tmp_88_1~0 |old(~__tmp_88_1~0)|) (= ~__tmp_94_0~0 |old(~__tmp_94_0~0)|) (= ~__tmp_88_0~0 |old(~__tmp_88_0~0)|) (= |old(~__tmp_112_0~0)| ~__tmp_112_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~__return_121~0)| ~__return_121~0) (= ~__tmp_93_0~0 |old(~__tmp_93_0~0)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 11:00:48,964 INFO L290 TraceCheckUtils]: 1: Hoare triple {720#(and (= ~__tmp_91_0~0 |old(~__tmp_91_0~0)|) (= ~__tmp_91_1~0 |old(~__tmp_91_1~0)|) (= ~__return_main~0 |old(~__return_main~0)|) (= ~__tmp_88_1~0 |old(~__tmp_88_1~0)|) (= ~__tmp_94_0~0 |old(~__tmp_94_0~0)|) (= ~__tmp_88_0~0 |old(~__tmp_88_0~0)|) (= |old(~__tmp_112_0~0)| ~__tmp_112_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~__return_121~0)| ~__return_121~0) (= ~__tmp_93_0~0 |old(~__tmp_93_0~0)|) (= |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(23, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__tmp_112_0~0 := 0;~__tmp_94_0~0 := 0;~__tmp_93_0~0 := 0;~__tmp_88_0~0 := 0;~__tmp_88_1~0 := 0;~__tmp_91_0~0 := 0;~__tmp_91_1~0 := 0;~__return_121~0 := 0; {713#true} is VALID [2022-04-27 11:00:48,964 INFO L290 TraceCheckUtils]: 2: Hoare triple {713#true} assume true; {713#true} is VALID [2022-04-27 11:00:48,965 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {713#true} {713#true} #72#return; {713#true} is VALID [2022-04-27 11:00:48,965 INFO L272 TraceCheckUtils]: 4: Hoare triple {713#true} call #t~ret9 := main(); {713#true} is VALID [2022-04-27 11:00:48,965 INFO L290 TraceCheckUtils]: 5: Hoare triple {713#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~main__x~0 := #t~nondet4;havoc #t~nondet4;~main__y~0 := 1; {713#true} is VALID [2022-04-27 11:00:48,965 INFO L290 TraceCheckUtils]: 6: Hoare triple {713#true} havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet5;havoc #t~nondet5; {713#true} is VALID [2022-04-27 11:00:48,965 INFO L290 TraceCheckUtils]: 7: Hoare triple {713#true} assume !(0 == ~main____CPAchecker_TMP_0~0); {713#true} is VALID [2022-04-27 11:00:48,965 INFO L290 TraceCheckUtils]: 8: Hoare triple {713#true} assume !(1 == (if ~main__x~0 % 4294967296 < 0 && 0 != ~main__x~0 % 4294967296 % 3 then ~main__x~0 % 4294967296 % 3 - 3 else ~main__x~0 % 4294967296 % 3) % 4294967296); {713#true} is VALID [2022-04-27 11:00:48,966 INFO L290 TraceCheckUtils]: 9: Hoare triple {713#true} assume !(2 == (if ~main__x~0 % 4294967296 < 0 && 0 != ~main__x~0 % 4294967296 % 3 then ~main__x~0 % 4294967296 % 3 - 3 else ~main__x~0 % 4294967296 % 3) % 4294967296);havoc ~main____CPAchecker_TMP_1~1;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~main____CPAchecker_TMP_1~1 := #t~nondet8;havoc #t~nondet8; {713#true} is VALID [2022-04-27 11:00:48,966 INFO L290 TraceCheckUtils]: 10: Hoare triple {713#true} assume !(0 == ~main____CPAchecker_TMP_1~1);~main__x~0 := 4 + ~main__x~0;~main__y~0 := 1;~__tmp_88_0~0 := ~main____CPAchecker_TMP_0~0;~__tmp_88_1~0 := ~main____CPAchecker_TMP_1~1; {713#true} is VALID [2022-04-27 11:00:48,966 INFO L290 TraceCheckUtils]: 11: Hoare triple {713#true} ~main____CPAchecker_TMP_0~1 := ~__tmp_88_0~0;~main____CPAchecker_TMP_1~0 := ~__tmp_88_1~0; {713#true} is VALID [2022-04-27 11:00:48,966 INFO L290 TraceCheckUtils]: 12: Hoare triple {713#true} havoc ~main____CPAchecker_TMP_0~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~main____CPAchecker_TMP_0~0 := #t~nondet5;havoc #t~nondet5; {713#true} is VALID [2022-04-27 11:00:48,966 INFO L290 TraceCheckUtils]: 13: Hoare triple {713#true} assume !(0 == ~main____CPAchecker_TMP_0~0); {713#true} is VALID [2022-04-27 11:00:48,966 INFO L290 TraceCheckUtils]: 14: Hoare triple {713#true} assume !(1 == (if ~main__x~0 % 4294967296 < 0 && 0 != ~main__x~0 % 4294967296 % 3 then ~main__x~0 % 4294967296 % 3 - 3 else ~main__x~0 % 4294967296 % 3) % 4294967296); {713#true} is VALID [2022-04-27 11:00:51,128 WARN L290 TraceCheckUtils]: 15: Hoare triple {713#true} assume 2 == (if ~main__x~0 % 4294967296 < 0 && 0 != ~main__x~0 % 4294967296 % 3 then ~main__x~0 % 4294967296 % 3 - 3 else ~main__x~0 % 4294967296 % 3) % 4294967296;~main__x~0 := 1 + ~main__x~0;~main__y~0 := 0;~__tmp_93_0~0 := ~main____CPAchecker_TMP_0~0; {718#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} is UNKNOWN [2022-04-27 11:00:51,134 INFO L290 TraceCheckUtils]: 16: Hoare triple {718#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} ~main____CPAchecker_TMP_0~1 := ~__tmp_93_0~0;~__tmp_94_0~0 := ~main____CPAchecker_TMP_0~1; {718#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:00:51,135 INFO L290 TraceCheckUtils]: 17: Hoare triple {718#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} ~main____CPAchecker_TMP_0~0 := ~__tmp_94_0~0;havoc ~main____CPAchecker_TMP_0~1;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~main____CPAchecker_TMP_0~1 := #t~nondet6;havoc #t~nondet6; {718#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:00:51,135 INFO L290 TraceCheckUtils]: 18: Hoare triple {718#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} assume !!(0 == ~main____CPAchecker_TMP_0~1); {718#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} is VALID [2022-04-27 11:00:51,141 INFO L290 TraceCheckUtils]: 19: Hoare triple {718#(<= main_~main__x~0 (+ (* (div main_~main__x~0 4294967296) 4294967296) (* 3 (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) (* (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) (* (- 3) (div (+ (* (div main_~main__x~0 4294967296) (- 4294967296)) main_~main__x~0) 3)) main_~main__x~0) 4294967296) 4294967296)))} assume 0 == ~main__y~0 % 4294967296;havoc ~__tmp_1~0;~__tmp_1~0 := (if 0 == (if ~main__x~0 % 4294967296 < 0 && 0 != ~main__x~0 % 4294967296 % 3 then ~main__x~0 % 4294967296 % 3 - 3 else ~main__x~0 % 4294967296 % 3) % 4294967296 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {719#(not (= main_~__VERIFIER_assert__cond~0 0))} is VALID [2022-04-27 11:00:51,142 INFO L290 TraceCheckUtils]: 20: Hoare triple {719#(not (= main_~__VERIFIER_assert__cond~0 0))} assume 0 == ~__VERIFIER_assert__cond~0; {714#false} is VALID [2022-04-27 11:00:51,142 INFO L290 TraceCheckUtils]: 21: Hoare triple {714#false} assume !false; {714#false} is VALID [2022-04-27 11:00:51,142 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 11:00:51,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 11:00:51,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650752495] [2022-04-27 11:00:51,143 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650752495] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 11:00:51,143 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 11:00:51,143 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 11:00:51,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036111375] [2022-04-27 11:00:51,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 11:00:51,144 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-27 11:00:51,144 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 11:00:51,144 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:00:53,318 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 18 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-27 11:00:53,318 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 11:00:53,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 11:00:53,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 11:00:53,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-27 11:00:53,319 INFO L87 Difference]: Start difference. First operand 34 states and 42 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:00:57,532 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 11:00:59,691 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 11:01:01,858 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 11:01:06,206 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 11:01:10,538 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 11:01:12,775 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 11:01:14,938 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 11:01:19,254 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 11:01:21,409 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 11:01:25,751 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-27 11:01:25,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:01:25,967 INFO L93 Difference]: Finished difference Result 59 states and 75 transitions. [2022-04-27 11:01:25,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 11:01:25,968 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-27 11:01:25,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 11:01:25,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:01:25,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2022-04-27 11:01:25,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:01:25,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2022-04-27 11:01:25,970 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 65 transitions. [2022-04-27 11:01:30,355 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 63 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-27 11:01:30,355 INFO L225 Difference]: With dead ends: 59 [2022-04-27 11:01:30,355 INFO L226 Difference]: Without dead ends: 0 [2022-04-27 11:01:30,356 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-27 11:01:30,356 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 8 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 3 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 21.0s IncrementalHoareTripleChecker+Time [2022-04-27 11:01:30,357 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 59 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 44 Invalid, 10 Unknown, 0 Unchecked, 21.0s Time] [2022-04-27 11:01:30,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-27 11:01:30,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-27 11:01:30,360 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 11:01:30,360 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 11:01:30,360 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 11:01:30,361 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 11:01:30,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:01:30,361 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 11:01:30,361 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 11:01:30,361 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:01:30,361 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:01:30,361 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-27 11:01:30,361 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-27 11:01:30,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 11:01:30,361 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 11:01:30,361 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 11:01:30,361 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:01:30,361 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 11:01:30,361 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 11:01:30,361 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 11:01:30,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 11:01:30,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-27 11:01:30,362 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 22 [2022-04-27 11:01:30,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 11:01:30,362 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-27 11:01:30,362 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 11:01:30,362 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 11:01:30,362 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 11:01:30,364 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 11:01:30,364 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-27 11:01:30,366 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-27 11:01:30,416 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 4) no Hoare annotation was computed. [2022-04-27 11:01:30,417 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 4) no Hoare annotation was computed. [2022-04-27 11:01:30,417 INFO L899 garLoopResultBuilder]: For program point reach_errorFINAL(line 4) no Hoare annotation was computed. [2022-04-27 11:01:30,417 INFO L899 garLoopResultBuilder]: For program point L97(lines 97 106) no Hoare annotation was computed. [2022-04-27 11:01:30,417 INFO L895 garLoopResultBuilder]: At program point L122(lines 25 145) the Hoare annotation is: (<= main_~main__x~0 (let ((.cse0 (div main_~main__x~0 4294967296))) (let ((.cse2 (* .cse0 (- 4294967296)))) (let ((.cse1 (div (+ .cse2 main_~main__x~0) 3))) (+ (* .cse0 4294967296) (* 3 .cse1) (* (div (+ .cse2 (* (- 3) .cse1) main_~main__x~0) 4294967296) 4294967296)))))) [2022-04-27 11:01:30,417 INFO L899 garLoopResultBuilder]: For program point mainEXIT(lines 16 151) no Hoare annotation was computed. [2022-04-27 11:01:30,417 INFO L895 garLoopResultBuilder]: At program point L56(lines 26 114) the Hoare annotation is: (<= main_~main__x~0 (let ((.cse0 (div main_~main__x~0 4294967296))) (let ((.cse2 (* .cse0 (- 4294967296)))) (let ((.cse1 (div (+ .cse2 main_~main__x~0) 3))) (+ (* .cse0 4294967296) (* 3 .cse1) (* (div (+ .cse2 (* (- 3) .cse1) main_~main__x~0) 4294967296) 4294967296)))))) [2022-04-27 11:01:30,417 INFO L899 garLoopResultBuilder]: For program point L23(lines 23 150) no Hoare annotation was computed. [2022-04-27 11:01:30,417 INFO L899 garLoopResultBuilder]: For program point L48(lines 48 85) no Hoare annotation was computed. [2022-04-27 11:01:30,417 INFO L895 garLoopResultBuilder]: At program point L44(lines 26 114) the Hoare annotation is: (<= main_~main__x~0 (let ((.cse0 (div main_~main__x~0 4294967296))) (let ((.cse2 (* .cse0 (- 4294967296)))) (let ((.cse1 (div (+ .cse2 main_~main__x~0) 3))) (+ (* .cse0 4294967296) (* 3 .cse1) (* (div (+ .cse2 (* (- 3) .cse1) main_~main__x~0) 4294967296) 4294967296)))))) [2022-04-27 11:01:30,418 INFO L899 garLoopResultBuilder]: For program point L90(lines 90 112) no Hoare annotation was computed. [2022-04-27 11:01:30,418 INFO L899 garLoopResultBuilder]: For program point L37(lines 37 113) no Hoare annotation was computed. [2022-04-27 11:01:30,418 INFO L899 garLoopResultBuilder]: For program point L99(line 99) no Hoare annotation was computed. [2022-04-27 11:01:30,418 INFO L899 garLoopResultBuilder]: For program point L128(lines 128 143) no Hoare annotation was computed. [2022-04-27 11:01:30,418 INFO L899 garLoopResultBuilder]: For program point L62(lines 62 84) no Hoare annotation was computed. [2022-04-27 11:01:30,418 INFO L899 garLoopResultBuilder]: For program point L25(lines 25 145) no Hoare annotation was computed. [2022-04-27 11:01:30,418 INFO L902 garLoopResultBuilder]: At program point L83(lines 17 151) the Hoare annotation is: true [2022-04-27 11:01:30,418 INFO L899 garLoopResultBuilder]: For program point mainFINAL(lines 16 151) no Hoare annotation was computed. [2022-04-27 11:01:30,418 INFO L899 garLoopResultBuilder]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 99) no Hoare annotation was computed. [2022-04-27 11:01:30,418 INFO L895 garLoopResultBuilder]: At program point mainENTRY(lines 16 151) the Hoare annotation is: (and (= ~__tmp_91_0~0 |old(~__tmp_91_0~0)|) (= ~__tmp_91_1~0 |old(~__tmp_91_1~0)|) (= ~__tmp_88_1~0 |old(~__tmp_88_1~0)|) (= ~__tmp_94_0~0 |old(~__tmp_94_0~0)|) (= ~__tmp_88_0~0 |old(~__tmp_88_0~0)|) (= |old(~__tmp_112_0~0)| ~__tmp_112_0~0) (= |old(~__return_121~0)| ~__return_121~0) (= ~__tmp_93_0~0 |old(~__tmp_93_0~0)|)) [2022-04-27 11:01:30,419 INFO L899 garLoopResultBuilder]: For program point L117(lines 117 144) no Hoare annotation was computed. [2022-04-27 11:01:30,419 INFO L902 garLoopResultBuilder]: At program point L142(lines 25 145) the Hoare annotation is: true [2022-04-27 11:01:30,419 INFO L899 garLoopResultBuilder]: For program point L39(lines 39 86) no Hoare annotation was computed. [2022-04-27 11:01:30,419 INFO L902 garLoopResultBuilder]: At program point L134(lines 25 145) the Hoare annotation is: true [2022-04-27 11:01:30,419 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-27 11:01:30,419 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~__tmp_91_0~0 |old(~__tmp_91_0~0)|) (= ~__tmp_91_1~0 |old(~__tmp_91_1~0)|) (= ~__return_main~0 |old(~__return_main~0)|) (= ~__tmp_88_1~0 |old(~__tmp_88_1~0)|) (= ~__tmp_94_0~0 |old(~__tmp_94_0~0)|) (= ~__tmp_88_0~0 |old(~__tmp_88_0~0)|) (= |old(~__tmp_112_0~0)| ~__tmp_112_0~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~__return_121~0)| ~__return_121~0) (= ~__tmp_93_0~0 |old(~__tmp_93_0~0)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-27 11:01:30,419 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-27 11:01:30,419 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-27 11:01:30,419 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-27 11:01:30,419 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-27 11:01:30,419 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-27 11:01:30,422 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2022-04-27 11:01:30,424 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 11:01:30,427 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-27 11:01:30,427 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 11:01:30,428 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-27 11:01:30,428 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 11:01:30,428 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 11:01:30,429 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2022-04-27 11:01:30,429 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-27 11:01:30,429 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 11:01:30,429 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2022-04-27 11:01:30,429 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2022-04-27 11:01:30,429 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2022-04-27 11:01:30,430 WARN L170 areAnnotationChecker]: L25 has no Hoare annotation [2022-04-27 11:01:30,430 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 11:01:30,434 WARN L170 areAnnotationChecker]: L117 has no Hoare annotation [2022-04-27 11:01:30,434 WARN L170 areAnnotationChecker]: L117 has no Hoare annotation [2022-04-27 11:01:30,436 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-27 11:01:30,436 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2022-04-27 11:01:30,437 WARN L170 areAnnotationChecker]: L128 has no Hoare annotation [2022-04-27 11:01:30,437 WARN L170 areAnnotationChecker]: L128 has no Hoare annotation [2022-04-27 11:01:30,437 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2022-04-27 11:01:30,437 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2022-04-27 11:01:30,437 WARN L170 areAnnotationChecker]: L39 has no Hoare annotation [2022-04-27 11:01:30,438 WARN L170 areAnnotationChecker]: L39 has no Hoare annotation [2022-04-27 11:01:30,438 WARN L170 areAnnotationChecker]: L90 has no Hoare annotation [2022-04-27 11:01:30,438 WARN L170 areAnnotationChecker]: L90 has no Hoare annotation [2022-04-27 11:01:30,438 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2022-04-27 11:01:30,438 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2022-04-27 11:01:30,438 WARN L170 areAnnotationChecker]: L97 has no Hoare annotation [2022-04-27 11:01:30,438 WARN L170 areAnnotationChecker]: L97 has no Hoare annotation [2022-04-27 11:01:30,438 WARN L170 areAnnotationChecker]: L62 has no Hoare annotation [2022-04-27 11:01:30,438 WARN L170 areAnnotationChecker]: L62 has no Hoare annotation [2022-04-27 11:01:30,438 WARN L170 areAnnotationChecker]: L99 has no Hoare annotation [2022-04-27 11:01:30,438 WARN L170 areAnnotationChecker]: L99 has no Hoare annotation [2022-04-27 11:01:30,438 INFO L163 areAnnotationChecker]: CFG has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-27 11:01:30,455 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 11:01:30 BoogieIcfgContainer [2022-04-27 11:01:30,456 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 11:01:30,457 INFO L158 Benchmark]: Toolchain (without parser) took 207178.02ms. Allocated memory was 180.4MB in the beginning and 222.3MB in the end (delta: 41.9MB). Free memory was 127.4MB in the beginning and 109.7MB in the end (delta: 17.7MB). Peak memory consumption was 59.7MB. Max. memory is 8.0GB. [2022-04-27 11:01:30,457 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 180.4MB. Free memory was 143.9MB in the beginning and 143.8MB in the end (delta: 69.8kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 11:01:30,457 INFO L158 Benchmark]: CACSL2BoogieTranslator took 226.35ms. Allocated memory was 180.4MB in the beginning and 222.3MB in the end (delta: 41.9MB). Free memory was 127.2MB in the beginning and 197.0MB in the end (delta: -69.8MB). Peak memory consumption was 15.0MB. Max. memory is 8.0GB. [2022-04-27 11:01:30,457 INFO L158 Benchmark]: Boogie Preprocessor took 25.88ms. Allocated memory is still 222.3MB. Free memory was 197.0MB in the beginning and 195.5MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-27 11:01:30,457 INFO L158 Benchmark]: RCFGBuilder took 8973.32ms. Allocated memory is still 222.3MB. Free memory was 195.3MB in the beginning and 181.2MB in the end (delta: 14.1MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2022-04-27 11:01:30,458 INFO L158 Benchmark]: TraceAbstraction took 197942.26ms. Allocated memory is still 222.3MB. Free memory was 180.8MB in the beginning and 109.7MB in the end (delta: 71.1MB). Peak memory consumption was 72.0MB. Max. memory is 8.0GB. [2022-04-27 11:01:30,459 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.11ms. Allocated memory is still 180.4MB. Free memory was 143.9MB in the beginning and 143.8MB in the end (delta: 69.8kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 226.35ms. Allocated memory was 180.4MB in the beginning and 222.3MB in the end (delta: 41.9MB). Free memory was 127.2MB in the beginning and 197.0MB in the end (delta: -69.8MB). Peak memory consumption was 15.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 25.88ms. Allocated memory is still 222.3MB. Free memory was 197.0MB in the beginning and 195.5MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 8973.32ms. Allocated memory is still 222.3MB. Free memory was 195.3MB in the beginning and 181.2MB in the end (delta: 14.1MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * TraceAbstraction took 197942.26ms. Allocated memory is still 222.3MB. Free memory was 180.8MB in the beginning and 109.7MB in the end (delta: 71.1MB). Peak memory consumption was 72.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 99]: 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 4 procedures, 31 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 197.9s, OverallIterations: 4, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 179.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 43 mSolverCounterUnknown, 48 SdHoareTripleChecker+Valid, 93.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 48 mSDsluCounter, 290 SdHoareTripleChecker+Invalid, 88.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 186 mSDsCounter, 13 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 249 IncrementalHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 13 mSolverCounterUnsat, 104 mSDtfsCounter, 249 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 38 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=34occurred in iteration=2, InterpolantAutomatonStates: 23, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 20 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 10 LocationsWithAnnotation, 10 PreInvPairs, 17 NumberOfFragments, 187 HoareAnnotationTreeSize, 10 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 10 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 9.7s InterpolantComputationTime, 74 NumberOfCodeBlocks, 74 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 70 ConstructedInterpolants, 0 QuantifiedInterpolants, 1175 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 7/7 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: 26]: Loop Invariant Derived loop invariant: main__x <= main__x / 4294967296 * 4294967296 + 3 * ((main__x / 4294967296 * -4294967296 + main__x) / 3) + (main__x / 4294967296 * -4294967296 + -3 * ((main__x / 4294967296 * -4294967296 + main__x) / 3) + main__x) / 4294967296 * 4294967296 - InvariantResult [Line: 25]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 26]: Loop Invariant Derived loop invariant: main__x <= main__x / 4294967296 * 4294967296 + 3 * ((main__x / 4294967296 * -4294967296 + main__x) / 3) + (main__x / 4294967296 * -4294967296 + -3 * ((main__x / 4294967296 * -4294967296 + main__x) / 3) + main__x) / 4294967296 * 4294967296 - InvariantResult [Line: 25]: Loop Invariant Derived loop invariant: main__x <= main__x / 4294967296 * 4294967296 + 3 * ((main__x / 4294967296 * -4294967296 + main__x) / 3) + (main__x / 4294967296 * -4294967296 + -3 * ((main__x / 4294967296 * -4294967296 + main__x) / 3) + main__x) / 4294967296 * 4294967296 - InvariantResult [Line: 25]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2022-04-27 11:01:30,496 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...