/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/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/locks/test_locks_8.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 08:19:38,710 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 08:19:38,711 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 08:19:38,746 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 08:19:38,746 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 08:19:38,748 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 08:19:38,752 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 08:19:38,754 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 08:19:38,755 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 08:19:38,756 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 08:19:38,756 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 08:19:38,757 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 08:19:38,757 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 08:19:38,758 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 08:19:38,759 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 08:19:38,759 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 08:19:38,760 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 08:19:38,761 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 08:19:38,762 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 08:19:38,763 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 08:19:38,765 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 08:19:38,765 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 08:19:38,766 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 08:19:38,767 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 08:19:38,768 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 08:19:38,770 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 08:19:38,770 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 08:19:38,771 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 08:19:38,771 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 08:19:38,772 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 08:19:38,772 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 08:19:38,773 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 08:19:38,773 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 08:19:38,774 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 08:19:38,774 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 08:19:38,775 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 08:19:38,775 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 08:19:38,776 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 08:19:38,776 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 08:19:38,776 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 08:19:38,777 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 08:19:38,781 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 08:19:38,782 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-08 08:19:38,788 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 08:19:38,788 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 08:19:38,789 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 08:19:38,789 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-08 08:19:38,789 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 08:19:38,789 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-08 08:19:38,790 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 08:19:38,790 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 08:19:38,790 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 08:19:38,790 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 08:19:38,790 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-08 08:19:38,790 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 08:19:38,790 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 08:19:38,790 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 08:19:38,791 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 08:19:38,791 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 08:19:38,791 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 08:19:38,791 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 08:19:38,791 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 08:19:38,791 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 08:19:38,791 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 08:19:38,791 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 08:19:38,792 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 08:19:38,792 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 08:19:38,792 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-08 08:19:38,792 INFO L138 SettingsManager]: * Use separate solver for trace checks=false 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-08 08:19:39,001 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 08:19:39,021 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 08:19:39,023 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 08:19:39,024 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 08:19:39,026 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 08:19:39,027 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_8.c [2022-04-08 08:19:39,107 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cde9da75d/a56c2b4c3fee43ed8ca7dfd6afda5375/FLAG6fef4b604 [2022-04-08 08:19:39,479 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 08:19:39,480 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_8.c [2022-04-08 08:19:39,495 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cde9da75d/a56c2b4c3fee43ed8ca7dfd6afda5375/FLAG6fef4b604 [2022-04-08 08:19:39,503 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cde9da75d/a56c2b4c3fee43ed8ca7dfd6afda5375 [2022-04-08 08:19:39,504 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 08:19:39,505 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 08:19:39,508 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 08:19:39,508 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 08:19:39,510 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 08:19:39,511 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 08:19:39" (1/1) ... [2022-04-08 08:19:39,511 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b81dc0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:19:39, skipping insertion in model container [2022-04-08 08:19:39,511 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 08:19:39" (1/1) ... [2022-04-08 08:19:39,523 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 08:19:39,539 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 08:19:39,689 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_8.c[3218,3231] [2022-04-08 08:19:39,691 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 08:19:39,703 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 08:19:39,739 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_8.c[3218,3231] [2022-04-08 08:19:39,745 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 08:19:39,756 INFO L208 MainTranslator]: Completed translation [2022-04-08 08:19:39,756 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:19:39 WrapperNode [2022-04-08 08:19:39,756 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 08:19:39,757 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 08:19:39,757 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 08:19:39,757 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 08:19:39,764 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:19:39" (1/1) ... [2022-04-08 08:19:39,764 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:19:39" (1/1) ... [2022-04-08 08:19:39,768 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:19:39" (1/1) ... [2022-04-08 08:19:39,768 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:19:39" (1/1) ... [2022-04-08 08:19:39,781 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:19:39" (1/1) ... [2022-04-08 08:19:39,786 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:19:39" (1/1) ... [2022-04-08 08:19:39,786 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:19:39" (1/1) ... [2022-04-08 08:19:39,788 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 08:19:39,788 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 08:19:39,788 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 08:19:39,788 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 08:19:39,789 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:19:39" (1/1) ... [2022-04-08 08:19:39,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 08:19:39,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 08:19:39,821 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-08 08:19:39,823 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-08 08:19:39,847 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 08:19:39,847 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 08:19:39,847 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 08:19:39,847 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 08:19:39,847 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 08:19:39,848 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 08:19:39,848 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 08:19:39,848 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 08:19:39,848 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-08 08:19:39,848 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 08:19:39,848 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 08:19:39,848 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 08:19:39,849 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 08:19:39,849 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 08:19:39,849 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 08:19:39,849 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 08:19:39,896 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 08:19:39,897 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 08:19:40,071 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 08:19:40,076 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 08:19:40,076 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-08 08:19:40,077 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 08:19:40 BoogieIcfgContainer [2022-04-08 08:19:40,078 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 08:19:40,079 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 08:19:40,079 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 08:19:40,094 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 08:19:40,094 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 08:19:39" (1/3) ... [2022-04-08 08:19:40,095 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@869f711 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 08:19:40, skipping insertion in model container [2022-04-08 08:19:40,095 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:19:39" (2/3) ... [2022-04-08 08:19:40,095 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@869f711 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 08:19:40, skipping insertion in model container [2022-04-08 08:19:40,095 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 08:19:40" (3/3) ... [2022-04-08 08:19:40,096 INFO L111 eAbstractionObserver]: Analyzing ICFG test_locks_8.c [2022-04-08 08:19:40,102 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 08:19:40,102 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 08:19:40,136 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 08:19:40,141 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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 [2022-04-08 08:19:40,141 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 08:19:40,160 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 33 states have (on average 1.8484848484848484) internal successors, (61), 34 states have internal predecessors, (61), 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-08 08:19:40,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-08 08:19:40,165 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:19:40,165 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:19:40,166 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:19:40,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:19:40,169 INFO L85 PathProgramCache]: Analyzing trace with hash 957163615, now seen corresponding path program 1 times [2022-04-08 08:19:40,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:19:40,175 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [616737231] [2022-04-08 08:19:40,182 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:19:40,182 INFO L85 PathProgramCache]: Analyzing trace with hash 957163615, now seen corresponding path program 2 times [2022-04-08 08:19:40,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:19:40,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556927568] [2022-04-08 08:19:40,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:19:40,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:19:40,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:19:40,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:19:40,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:19:40,415 INFO L290 TraceCheckUtils]: 0: Hoare triple {48#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {42#true} is VALID [2022-04-08 08:19:40,415 INFO L290 TraceCheckUtils]: 1: Hoare triple {42#true} assume true; {42#true} is VALID [2022-04-08 08:19:40,416 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {42#true} {42#true} #166#return; {42#true} is VALID [2022-04-08 08:19:40,418 INFO L272 TraceCheckUtils]: 0: Hoare triple {42#true} call ULTIMATE.init(); {48#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:19:40,418 INFO L290 TraceCheckUtils]: 1: Hoare triple {48#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {42#true} is VALID [2022-04-08 08:19:40,418 INFO L290 TraceCheckUtils]: 2: Hoare triple {42#true} assume true; {42#true} is VALID [2022-04-08 08:19:40,418 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42#true} {42#true} #166#return; {42#true} is VALID [2022-04-08 08:19:40,418 INFO L272 TraceCheckUtils]: 4: Hoare triple {42#true} call #t~ret13 := main(); {42#true} is VALID [2022-04-08 08:19:40,419 INFO L290 TraceCheckUtils]: 5: Hoare triple {42#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;havoc ~cond~0; {42#true} is VALID [2022-04-08 08:19:40,419 INFO L290 TraceCheckUtils]: 6: Hoare triple {42#true} assume !false;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~cond~0 := #t~nondet12;havoc #t~nondet12; {42#true} is VALID [2022-04-08 08:19:40,420 INFO L290 TraceCheckUtils]: 7: Hoare triple {42#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0; {42#true} is VALID [2022-04-08 08:19:40,420 INFO L290 TraceCheckUtils]: 8: Hoare triple {42#true} assume 0 != ~p1~0;~lk1~0 := 1; {47#(= main_~lk1~0 1)} is VALID [2022-04-08 08:19:40,421 INFO L290 TraceCheckUtils]: 9: Hoare triple {47#(= main_~lk1~0 1)} assume !(0 != ~p2~0); {47#(= main_~lk1~0 1)} is VALID [2022-04-08 08:19:40,422 INFO L290 TraceCheckUtils]: 10: Hoare triple {47#(= main_~lk1~0 1)} assume 0 != ~p3~0;~lk3~0 := 1; {47#(= main_~lk1~0 1)} is VALID [2022-04-08 08:19:40,423 INFO L290 TraceCheckUtils]: 11: Hoare triple {47#(= main_~lk1~0 1)} assume 0 != ~p4~0;~lk4~0 := 1; {47#(= main_~lk1~0 1)} is VALID [2022-04-08 08:19:40,425 INFO L290 TraceCheckUtils]: 12: Hoare triple {47#(= main_~lk1~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {47#(= main_~lk1~0 1)} is VALID [2022-04-08 08:19:40,428 INFO L290 TraceCheckUtils]: 13: Hoare triple {47#(= main_~lk1~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {47#(= main_~lk1~0 1)} is VALID [2022-04-08 08:19:40,429 INFO L290 TraceCheckUtils]: 14: Hoare triple {47#(= main_~lk1~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {47#(= main_~lk1~0 1)} is VALID [2022-04-08 08:19:40,430 INFO L290 TraceCheckUtils]: 15: Hoare triple {47#(= main_~lk1~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {47#(= main_~lk1~0 1)} is VALID [2022-04-08 08:19:40,431 INFO L290 TraceCheckUtils]: 16: Hoare triple {47#(= main_~lk1~0 1)} assume 0 != ~p1~0; {47#(= main_~lk1~0 1)} is VALID [2022-04-08 08:19:40,432 INFO L290 TraceCheckUtils]: 17: Hoare triple {47#(= main_~lk1~0 1)} assume 1 != ~lk1~0; {43#false} is VALID [2022-04-08 08:19:40,432 INFO L290 TraceCheckUtils]: 18: Hoare triple {43#false} assume !false; {43#false} is VALID [2022-04-08 08:19:40,433 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-08 08:19:40,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:19:40,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556927568] [2022-04-08 08:19:40,435 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556927568] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:19:40,435 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:19:40,435 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:19:40,439 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:19:40,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [616737231] [2022-04-08 08:19:40,440 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [616737231] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:19:40,440 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:19:40,440 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:19:40,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009879724] [2022-04-08 08:19:40,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:19:40,445 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 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 19 [2022-04-08 08:19:40,446 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:19:40,448 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 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-08 08:19:40,474 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:19:40,475 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:19:40,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:19:40,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:19:40,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:19:40,495 INFO L87 Difference]: Start difference. First operand has 39 states, 33 states have (on average 1.8484848484848484) internal successors, (61), 34 states have internal predecessors, (61), 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 4 states, 4 states have (on average 4.0) internal successors, (16), 3 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-08 08:19:40,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:19:40,738 INFO L93 Difference]: Finished difference Result 76 states and 127 transitions. [2022-04-08 08:19:40,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:19:40,738 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 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 19 [2022-04-08 08:19:40,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:19:40,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 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-08 08:19:40,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 127 transitions. [2022-04-08 08:19:40,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 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-08 08:19:40,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 127 transitions. [2022-04-08 08:19:40,760 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 127 transitions. [2022-04-08 08:19:40,852 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 127 edges. 127 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:19:40,860 INFO L225 Difference]: With dead ends: 76 [2022-04-08 08:19:40,861 INFO L226 Difference]: Without dead ends: 61 [2022-04-08 08:19:40,863 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:19:40,865 INFO L913 BasicCegarLoop]: 68 mSDtfsCounter, 140 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 08:19:40,865 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [140 Valid, 77 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 08:19:40,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-04-08 08:19:40,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 43. [2022-04-08 08:19:40,888 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:19:40,889 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand has 43 states, 39 states have (on average 1.8205128205128205) internal successors, (71), 39 states have internal predecessors, (71), 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-08 08:19:40,889 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand has 43 states, 39 states have (on average 1.8205128205128205) internal successors, (71), 39 states have internal predecessors, (71), 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-08 08:19:40,889 INFO L87 Difference]: Start difference. First operand 61 states. Second operand has 43 states, 39 states have (on average 1.8205128205128205) internal successors, (71), 39 states have internal predecessors, (71), 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-08 08:19:40,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:19:40,901 INFO L93 Difference]: Finished difference Result 61 states and 105 transitions. [2022-04-08 08:19:40,902 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 105 transitions. [2022-04-08 08:19:40,902 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:19:40,902 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:19:40,902 INFO L74 IsIncluded]: Start isIncluded. First operand has 43 states, 39 states have (on average 1.8205128205128205) internal successors, (71), 39 states have internal predecessors, (71), 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 61 states. [2022-04-08 08:19:40,903 INFO L87 Difference]: Start difference. First operand has 43 states, 39 states have (on average 1.8205128205128205) internal successors, (71), 39 states have internal predecessors, (71), 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 61 states. [2022-04-08 08:19:40,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:19:40,906 INFO L93 Difference]: Finished difference Result 61 states and 105 transitions. [2022-04-08 08:19:40,906 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 105 transitions. [2022-04-08 08:19:40,907 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:19:40,907 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:19:40,907 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:19:40,907 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:19:40,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 39 states have (on average 1.8205128205128205) internal successors, (71), 39 states have internal predecessors, (71), 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-08 08:19:40,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 74 transitions. [2022-04-08 08:19:40,910 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 74 transitions. Word has length 19 [2022-04-08 08:19:40,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:19:40,910 INFO L478 AbstractCegarLoop]: Abstraction has 43 states and 74 transitions. [2022-04-08 08:19:40,910 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 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-08 08:19:40,910 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 43 states and 74 transitions. [2022-04-08 08:19:40,972 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:19:40,972 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 74 transitions. [2022-04-08 08:19:40,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-08 08:19:40,973 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:19:40,973 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:19:40,974 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 08:19:40,974 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:19:40,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:19:40,975 INFO L85 PathProgramCache]: Analyzing trace with hash 1658228193, now seen corresponding path program 1 times [2022-04-08 08:19:40,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:19:40,975 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [690447449] [2022-04-08 08:19:40,977 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:19:40,978 INFO L85 PathProgramCache]: Analyzing trace with hash 1658228193, now seen corresponding path program 2 times [2022-04-08 08:19:40,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:19:40,978 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732946850] [2022-04-08 08:19:40,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:19:40,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:19:41,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:19:41,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:19:41,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:19:41,064 INFO L290 TraceCheckUtils]: 0: Hoare triple {420#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {414#true} is VALID [2022-04-08 08:19:41,064 INFO L290 TraceCheckUtils]: 1: Hoare triple {414#true} assume true; {414#true} is VALID [2022-04-08 08:19:41,064 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {414#true} {414#true} #166#return; {414#true} is VALID [2022-04-08 08:19:41,065 INFO L272 TraceCheckUtils]: 0: Hoare triple {414#true} call ULTIMATE.init(); {420#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:19:41,065 INFO L290 TraceCheckUtils]: 1: Hoare triple {420#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {414#true} is VALID [2022-04-08 08:19:41,065 INFO L290 TraceCheckUtils]: 2: Hoare triple {414#true} assume true; {414#true} is VALID [2022-04-08 08:19:41,065 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {414#true} {414#true} #166#return; {414#true} is VALID [2022-04-08 08:19:41,065 INFO L272 TraceCheckUtils]: 4: Hoare triple {414#true} call #t~ret13 := main(); {414#true} is VALID [2022-04-08 08:19:41,066 INFO L290 TraceCheckUtils]: 5: Hoare triple {414#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;havoc ~cond~0; {414#true} is VALID [2022-04-08 08:19:41,066 INFO L290 TraceCheckUtils]: 6: Hoare triple {414#true} assume !false;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~cond~0 := #t~nondet12;havoc #t~nondet12; {414#true} is VALID [2022-04-08 08:19:41,066 INFO L290 TraceCheckUtils]: 7: Hoare triple {414#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0; {414#true} is VALID [2022-04-08 08:19:41,066 INFO L290 TraceCheckUtils]: 8: Hoare triple {414#true} assume !(0 != ~p1~0); {419#(= main_~p1~0 0)} is VALID [2022-04-08 08:19:41,067 INFO L290 TraceCheckUtils]: 9: Hoare triple {419#(= main_~p1~0 0)} assume !(0 != ~p2~0); {419#(= main_~p1~0 0)} is VALID [2022-04-08 08:19:41,067 INFO L290 TraceCheckUtils]: 10: Hoare triple {419#(= main_~p1~0 0)} assume 0 != ~p3~0;~lk3~0 := 1; {419#(= main_~p1~0 0)} is VALID [2022-04-08 08:19:41,067 INFO L290 TraceCheckUtils]: 11: Hoare triple {419#(= main_~p1~0 0)} assume 0 != ~p4~0;~lk4~0 := 1; {419#(= main_~p1~0 0)} is VALID [2022-04-08 08:19:41,068 INFO L290 TraceCheckUtils]: 12: Hoare triple {419#(= main_~p1~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {419#(= main_~p1~0 0)} is VALID [2022-04-08 08:19:41,068 INFO L290 TraceCheckUtils]: 13: Hoare triple {419#(= main_~p1~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {419#(= main_~p1~0 0)} is VALID [2022-04-08 08:19:41,068 INFO L290 TraceCheckUtils]: 14: Hoare triple {419#(= main_~p1~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {419#(= main_~p1~0 0)} is VALID [2022-04-08 08:19:41,069 INFO L290 TraceCheckUtils]: 15: Hoare triple {419#(= main_~p1~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {419#(= main_~p1~0 0)} is VALID [2022-04-08 08:19:41,069 INFO L290 TraceCheckUtils]: 16: Hoare triple {419#(= main_~p1~0 0)} assume 0 != ~p1~0; {415#false} is VALID [2022-04-08 08:19:41,069 INFO L290 TraceCheckUtils]: 17: Hoare triple {415#false} assume 1 != ~lk1~0; {415#false} is VALID [2022-04-08 08:19:41,070 INFO L290 TraceCheckUtils]: 18: Hoare triple {415#false} assume !false; {415#false} is VALID [2022-04-08 08:19:41,070 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-08 08:19:41,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:19:41,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732946850] [2022-04-08 08:19:41,070 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732946850] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:19:41,070 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:19:41,070 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:19:41,071 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:19:41,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [690447449] [2022-04-08 08:19:41,071 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [690447449] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:19:41,071 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:19:41,071 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:19:41,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091347970] [2022-04-08 08:19:41,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:19:41,072 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 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 19 [2022-04-08 08:19:41,072 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:19:41,072 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 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-08 08:19:41,085 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:19:41,085 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:19:41,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:19:41,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:19:41,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:19:41,086 INFO L87 Difference]: Start difference. First operand 43 states and 74 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 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-08 08:19:41,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:19:41,257 INFO L93 Difference]: Finished difference Result 98 states and 173 transitions. [2022-04-08 08:19:41,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:19:41,257 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 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 19 [2022-04-08 08:19:41,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:19:41,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 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-08 08:19:41,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 156 transitions. [2022-04-08 08:19:41,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 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-08 08:19:41,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 156 transitions. [2022-04-08 08:19:41,262 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 156 transitions. [2022-04-08 08:19:41,373 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 156 edges. 156 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:19:41,377 INFO L225 Difference]: With dead ends: 98 [2022-04-08 08:19:41,377 INFO L226 Difference]: Without dead ends: 61 [2022-04-08 08:19:41,378 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:19:41,380 INFO L913 BasicCegarLoop]: 72 mSDtfsCounter, 118 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 08:19:41,381 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [118 Valid, 79 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 08:19:41,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-04-08 08:19:41,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59. [2022-04-08 08:19:41,392 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:19:41,393 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand has 59 states, 55 states have (on average 1.8) internal successors, (99), 55 states have internal predecessors, (99), 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-08 08:19:41,393 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand has 59 states, 55 states have (on average 1.8) internal successors, (99), 55 states have internal predecessors, (99), 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-08 08:19:41,393 INFO L87 Difference]: Start difference. First operand 61 states. Second operand has 59 states, 55 states have (on average 1.8) internal successors, (99), 55 states have internal predecessors, (99), 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-08 08:19:41,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:19:41,395 INFO L93 Difference]: Finished difference Result 61 states and 103 transitions. [2022-04-08 08:19:41,395 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 103 transitions. [2022-04-08 08:19:41,396 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:19:41,396 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:19:41,396 INFO L74 IsIncluded]: Start isIncluded. First operand has 59 states, 55 states have (on average 1.8) internal successors, (99), 55 states have internal predecessors, (99), 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 61 states. [2022-04-08 08:19:41,396 INFO L87 Difference]: Start difference. First operand has 59 states, 55 states have (on average 1.8) internal successors, (99), 55 states have internal predecessors, (99), 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 61 states. [2022-04-08 08:19:41,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:19:41,398 INFO L93 Difference]: Finished difference Result 61 states and 103 transitions. [2022-04-08 08:19:41,398 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 103 transitions. [2022-04-08 08:19:41,399 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:19:41,399 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:19:41,399 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:19:41,399 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:19:41,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 55 states have (on average 1.8) internal successors, (99), 55 states have internal predecessors, (99), 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-08 08:19:41,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 102 transitions. [2022-04-08 08:19:41,401 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 102 transitions. Word has length 19 [2022-04-08 08:19:41,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:19:41,401 INFO L478 AbstractCegarLoop]: Abstraction has 59 states and 102 transitions. [2022-04-08 08:19:41,401 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 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-08 08:19:41,401 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 59 states and 102 transitions. [2022-04-08 08:19:41,471 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:19:41,471 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 102 transitions. [2022-04-08 08:19:41,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-08 08:19:41,472 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:19:41,472 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:19:41,472 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-08 08:19:41,472 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:19:41,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:19:41,473 INFO L85 PathProgramCache]: Analyzing trace with hash -392484976, now seen corresponding path program 1 times [2022-04-08 08:19:41,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:19:41,473 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1704910261] [2022-04-08 08:19:41,473 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:19:41,473 INFO L85 PathProgramCache]: Analyzing trace with hash -392484976, now seen corresponding path program 2 times [2022-04-08 08:19:41,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:19:41,474 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647864488] [2022-04-08 08:19:41,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:19:41,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:19:41,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:19:41,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:19:41,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:19:41,551 INFO L290 TraceCheckUtils]: 0: Hoare triple {868#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {862#true} is VALID [2022-04-08 08:19:41,551 INFO L290 TraceCheckUtils]: 1: Hoare triple {862#true} assume true; {862#true} is VALID [2022-04-08 08:19:41,551 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {862#true} {862#true} #166#return; {862#true} is VALID [2022-04-08 08:19:41,552 INFO L272 TraceCheckUtils]: 0: Hoare triple {862#true} call ULTIMATE.init(); {868#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:19:41,552 INFO L290 TraceCheckUtils]: 1: Hoare triple {868#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {862#true} is VALID [2022-04-08 08:19:41,552 INFO L290 TraceCheckUtils]: 2: Hoare triple {862#true} assume true; {862#true} is VALID [2022-04-08 08:19:41,552 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {862#true} {862#true} #166#return; {862#true} is VALID [2022-04-08 08:19:41,552 INFO L272 TraceCheckUtils]: 4: Hoare triple {862#true} call #t~ret13 := main(); {862#true} is VALID [2022-04-08 08:19:41,552 INFO L290 TraceCheckUtils]: 5: Hoare triple {862#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;havoc ~cond~0; {862#true} is VALID [2022-04-08 08:19:41,553 INFO L290 TraceCheckUtils]: 6: Hoare triple {862#true} assume !false;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~cond~0 := #t~nondet12;havoc #t~nondet12; {862#true} is VALID [2022-04-08 08:19:41,553 INFO L290 TraceCheckUtils]: 7: Hoare triple {862#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0; {862#true} is VALID [2022-04-08 08:19:41,558 INFO L290 TraceCheckUtils]: 8: Hoare triple {862#true} assume 0 != ~p1~0;~lk1~0 := 1; {867#(not (= main_~p1~0 0))} is VALID [2022-04-08 08:19:41,559 INFO L290 TraceCheckUtils]: 9: Hoare triple {867#(not (= main_~p1~0 0))} assume !(0 != ~p2~0); {867#(not (= main_~p1~0 0))} is VALID [2022-04-08 08:19:41,559 INFO L290 TraceCheckUtils]: 10: Hoare triple {867#(not (= main_~p1~0 0))} assume 0 != ~p3~0;~lk3~0 := 1; {867#(not (= main_~p1~0 0))} is VALID [2022-04-08 08:19:41,559 INFO L290 TraceCheckUtils]: 11: Hoare triple {867#(not (= main_~p1~0 0))} assume 0 != ~p4~0;~lk4~0 := 1; {867#(not (= main_~p1~0 0))} is VALID [2022-04-08 08:19:41,559 INFO L290 TraceCheckUtils]: 12: Hoare triple {867#(not (= main_~p1~0 0))} assume 0 != ~p5~0;~lk5~0 := 1; {867#(not (= main_~p1~0 0))} is VALID [2022-04-08 08:19:41,560 INFO L290 TraceCheckUtils]: 13: Hoare triple {867#(not (= main_~p1~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {867#(not (= main_~p1~0 0))} is VALID [2022-04-08 08:19:41,560 INFO L290 TraceCheckUtils]: 14: Hoare triple {867#(not (= main_~p1~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {867#(not (= main_~p1~0 0))} is VALID [2022-04-08 08:19:41,560 INFO L290 TraceCheckUtils]: 15: Hoare triple {867#(not (= main_~p1~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {867#(not (= main_~p1~0 0))} is VALID [2022-04-08 08:19:41,561 INFO L290 TraceCheckUtils]: 16: Hoare triple {867#(not (= main_~p1~0 0))} assume !(0 != ~p1~0); {863#false} is VALID [2022-04-08 08:19:41,561 INFO L290 TraceCheckUtils]: 17: Hoare triple {863#false} assume 0 != ~p2~0; {863#false} is VALID [2022-04-08 08:19:41,561 INFO L290 TraceCheckUtils]: 18: Hoare triple {863#false} assume 1 != ~lk2~0; {863#false} is VALID [2022-04-08 08:19:41,561 INFO L290 TraceCheckUtils]: 19: Hoare triple {863#false} assume !false; {863#false} is VALID [2022-04-08 08:19:41,561 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-08 08:19:41,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:19:41,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647864488] [2022-04-08 08:19:41,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647864488] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:19:41,562 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:19:41,562 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:19:41,562 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:19:41,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1704910261] [2022-04-08 08:19:41,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1704910261] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:19:41,562 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:19:41,562 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:19:41,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083967691] [2022-04-08 08:19:41,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:19:41,571 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 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 20 [2022-04-08 08:19:41,571 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:19:41,572 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 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-08 08:19:41,583 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:19:41,583 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:19:41,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:19:41,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:19:41,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:19:41,584 INFO L87 Difference]: Start difference. First operand 59 states and 102 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 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-08 08:19:41,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:19:41,696 INFO L93 Difference]: Finished difference Result 91 states and 154 transitions. [2022-04-08 08:19:41,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:19:41,697 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 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 20 [2022-04-08 08:19:41,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:19:41,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 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-08 08:19:41,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 151 transitions. [2022-04-08 08:19:41,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 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-08 08:19:41,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 151 transitions. [2022-04-08 08:19:41,701 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 151 transitions. [2022-04-08 08:19:41,783 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 151 edges. 151 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:19:41,784 INFO L225 Difference]: With dead ends: 91 [2022-04-08 08:19:41,784 INFO L226 Difference]: Without dead ends: 64 [2022-04-08 08:19:41,784 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:19:41,785 INFO L913 BasicCegarLoop]: 86 mSDtfsCounter, 105 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 08:19:41,785 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [105 Valid, 93 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 08:19:41,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-04-08 08:19:41,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 62. [2022-04-08 08:19:41,799 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:19:41,799 INFO L82 GeneralOperation]: Start isEquivalent. First operand 64 states. Second operand has 62 states, 58 states have (on average 1.7413793103448276) internal successors, (101), 58 states have internal predecessors, (101), 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-08 08:19:41,799 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand has 62 states, 58 states have (on average 1.7413793103448276) internal successors, (101), 58 states have internal predecessors, (101), 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-08 08:19:41,799 INFO L87 Difference]: Start difference. First operand 64 states. Second operand has 62 states, 58 states have (on average 1.7413793103448276) internal successors, (101), 58 states have internal predecessors, (101), 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-08 08:19:41,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:19:41,801 INFO L93 Difference]: Finished difference Result 64 states and 105 transitions. [2022-04-08 08:19:41,802 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 105 transitions. [2022-04-08 08:19:41,806 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:19:41,806 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:19:41,806 INFO L74 IsIncluded]: Start isIncluded. First operand has 62 states, 58 states have (on average 1.7413793103448276) internal successors, (101), 58 states have internal predecessors, (101), 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 64 states. [2022-04-08 08:19:41,807 INFO L87 Difference]: Start difference. First operand has 62 states, 58 states have (on average 1.7413793103448276) internal successors, (101), 58 states have internal predecessors, (101), 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 64 states. [2022-04-08 08:19:41,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:19:41,812 INFO L93 Difference]: Finished difference Result 64 states and 105 transitions. [2022-04-08 08:19:41,812 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 105 transitions. [2022-04-08 08:19:41,812 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:19:41,812 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:19:41,812 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:19:41,812 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:19:41,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 58 states have (on average 1.7413793103448276) internal successors, (101), 58 states have internal predecessors, (101), 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-08 08:19:41,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 104 transitions. [2022-04-08 08:19:41,814 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 104 transitions. Word has length 20 [2022-04-08 08:19:41,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:19:41,814 INFO L478 AbstractCegarLoop]: Abstraction has 62 states and 104 transitions. [2022-04-08 08:19:41,814 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 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-08 08:19:41,814 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 62 states and 104 transitions. [2022-04-08 08:19:41,880 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:19:41,880 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 104 transitions. [2022-04-08 08:19:41,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-08 08:19:41,880 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:19:41,880 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:19:41,881 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-08 08:19:41,882 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:19:41,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:19:41,882 INFO L85 PathProgramCache]: Analyzing trace with hash -134319538, now seen corresponding path program 1 times [2022-04-08 08:19:41,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:19:41,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1740845949] [2022-04-08 08:19:41,885 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:19:41,885 INFO L85 PathProgramCache]: Analyzing trace with hash -134319538, now seen corresponding path program 2 times [2022-04-08 08:19:41,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:19:41,885 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79145556] [2022-04-08 08:19:41,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:19:41,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:19:41,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:19:41,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:19:41,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:19:41,948 INFO L290 TraceCheckUtils]: 0: Hoare triple {1314#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {1308#true} is VALID [2022-04-08 08:19:41,948 INFO L290 TraceCheckUtils]: 1: Hoare triple {1308#true} assume true; {1308#true} is VALID [2022-04-08 08:19:41,948 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1308#true} {1308#true} #166#return; {1308#true} is VALID [2022-04-08 08:19:41,949 INFO L272 TraceCheckUtils]: 0: Hoare triple {1308#true} call ULTIMATE.init(); {1314#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:19:41,949 INFO L290 TraceCheckUtils]: 1: Hoare triple {1314#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {1308#true} is VALID [2022-04-08 08:19:41,949 INFO L290 TraceCheckUtils]: 2: Hoare triple {1308#true} assume true; {1308#true} is VALID [2022-04-08 08:19:41,949 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1308#true} {1308#true} #166#return; {1308#true} is VALID [2022-04-08 08:19:41,949 INFO L272 TraceCheckUtils]: 4: Hoare triple {1308#true} call #t~ret13 := main(); {1308#true} is VALID [2022-04-08 08:19:41,950 INFO L290 TraceCheckUtils]: 5: Hoare triple {1308#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;havoc ~cond~0; {1308#true} is VALID [2022-04-08 08:19:41,950 INFO L290 TraceCheckUtils]: 6: Hoare triple {1308#true} assume !false;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~cond~0 := #t~nondet12;havoc #t~nondet12; {1308#true} is VALID [2022-04-08 08:19:41,950 INFO L290 TraceCheckUtils]: 7: Hoare triple {1308#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0; {1308#true} is VALID [2022-04-08 08:19:41,950 INFO L290 TraceCheckUtils]: 8: Hoare triple {1308#true} assume !(0 != ~p1~0); {1308#true} is VALID [2022-04-08 08:19:41,950 INFO L290 TraceCheckUtils]: 9: Hoare triple {1308#true} assume !(0 != ~p2~0); {1313#(= main_~p2~0 0)} is VALID [2022-04-08 08:19:41,951 INFO L290 TraceCheckUtils]: 10: Hoare triple {1313#(= main_~p2~0 0)} assume 0 != ~p3~0;~lk3~0 := 1; {1313#(= main_~p2~0 0)} is VALID [2022-04-08 08:19:41,951 INFO L290 TraceCheckUtils]: 11: Hoare triple {1313#(= main_~p2~0 0)} assume 0 != ~p4~0;~lk4~0 := 1; {1313#(= main_~p2~0 0)} is VALID [2022-04-08 08:19:41,951 INFO L290 TraceCheckUtils]: 12: Hoare triple {1313#(= main_~p2~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {1313#(= main_~p2~0 0)} is VALID [2022-04-08 08:19:41,952 INFO L290 TraceCheckUtils]: 13: Hoare triple {1313#(= main_~p2~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {1313#(= main_~p2~0 0)} is VALID [2022-04-08 08:19:41,954 INFO L290 TraceCheckUtils]: 14: Hoare triple {1313#(= main_~p2~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {1313#(= main_~p2~0 0)} is VALID [2022-04-08 08:19:41,955 INFO L290 TraceCheckUtils]: 15: Hoare triple {1313#(= main_~p2~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {1313#(= main_~p2~0 0)} is VALID [2022-04-08 08:19:41,958 INFO L290 TraceCheckUtils]: 16: Hoare triple {1313#(= main_~p2~0 0)} assume !(0 != ~p1~0); {1313#(= main_~p2~0 0)} is VALID [2022-04-08 08:19:41,958 INFO L290 TraceCheckUtils]: 17: Hoare triple {1313#(= main_~p2~0 0)} assume 0 != ~p2~0; {1309#false} is VALID [2022-04-08 08:19:41,958 INFO L290 TraceCheckUtils]: 18: Hoare triple {1309#false} assume 1 != ~lk2~0; {1309#false} is VALID [2022-04-08 08:19:41,958 INFO L290 TraceCheckUtils]: 19: Hoare triple {1309#false} assume !false; {1309#false} is VALID [2022-04-08 08:19:41,958 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-08 08:19:41,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:19:41,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79145556] [2022-04-08 08:19:41,959 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79145556] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:19:41,959 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:19:41,959 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:19:41,959 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:19:41,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1740845949] [2022-04-08 08:19:41,959 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1740845949] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:19:41,959 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:19:41,959 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:19:41,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746661588] [2022-04-08 08:19:41,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:19:41,960 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 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 20 [2022-04-08 08:19:41,960 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:19:41,960 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 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-08 08:19:41,971 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:19:41,971 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:19:41,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:19:41,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:19:41,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:19:41,972 INFO L87 Difference]: Start difference. First operand 62 states and 104 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 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-08 08:19:42,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:19:42,100 INFO L93 Difference]: Finished difference Result 166 states and 288 transitions. [2022-04-08 08:19:42,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:19:42,101 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 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 20 [2022-04-08 08:19:42,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:19:42,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 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-08 08:19:42,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 154 transitions. [2022-04-08 08:19:42,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 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-08 08:19:42,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 154 transitions. [2022-04-08 08:19:42,104 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 154 transitions. [2022-04-08 08:19:42,199 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 154 edges. 154 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:19:42,201 INFO L225 Difference]: With dead ends: 166 [2022-04-08 08:19:42,201 INFO L226 Difference]: Without dead ends: 113 [2022-04-08 08:19:42,202 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:19:42,203 INFO L913 BasicCegarLoop]: 60 mSDtfsCounter, 129 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 08:19:42,203 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [129 Valid, 67 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 08:19:42,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2022-04-08 08:19:42,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 111. [2022-04-08 08:19:42,213 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:19:42,214 INFO L82 GeneralOperation]: Start isEquivalent. First operand 113 states. Second operand has 111 states, 107 states have (on average 1.7383177570093458) internal successors, (186), 107 states have internal predecessors, (186), 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-08 08:19:42,214 INFO L74 IsIncluded]: Start isIncluded. First operand 113 states. Second operand has 111 states, 107 states have (on average 1.7383177570093458) internal successors, (186), 107 states have internal predecessors, (186), 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-08 08:19:42,214 INFO L87 Difference]: Start difference. First operand 113 states. Second operand has 111 states, 107 states have (on average 1.7383177570093458) internal successors, (186), 107 states have internal predecessors, (186), 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-08 08:19:42,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:19:42,217 INFO L93 Difference]: Finished difference Result 113 states and 190 transitions. [2022-04-08 08:19:42,217 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 190 transitions. [2022-04-08 08:19:42,217 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:19:42,217 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:19:42,218 INFO L74 IsIncluded]: Start isIncluded. First operand has 111 states, 107 states have (on average 1.7383177570093458) internal successors, (186), 107 states have internal predecessors, (186), 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 113 states. [2022-04-08 08:19:42,218 INFO L87 Difference]: Start difference. First operand has 111 states, 107 states have (on average 1.7383177570093458) internal successors, (186), 107 states have internal predecessors, (186), 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 113 states. [2022-04-08 08:19:42,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:19:42,221 INFO L93 Difference]: Finished difference Result 113 states and 190 transitions. [2022-04-08 08:19:42,221 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 190 transitions. [2022-04-08 08:19:42,221 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:19:42,221 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:19:42,221 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:19:42,221 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:19:42,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 107 states have (on average 1.7383177570093458) internal successors, (186), 107 states have internal predecessors, (186), 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-08 08:19:42,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 189 transitions. [2022-04-08 08:19:42,224 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 189 transitions. Word has length 20 [2022-04-08 08:19:42,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:19:42,224 INFO L478 AbstractCegarLoop]: Abstraction has 111 states and 189 transitions. [2022-04-08 08:19:42,224 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 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-08 08:19:42,224 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 111 states and 189 transitions. [2022-04-08 08:19:42,384 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 189 edges. 189 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:19:42,384 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 189 transitions. [2022-04-08 08:19:42,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-08 08:19:42,384 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:19:42,384 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:19:42,385 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-08 08:19:42,385 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:19:42,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:19:42,385 INFO L85 PathProgramCache]: Analyzing trace with hash -835384116, now seen corresponding path program 1 times [2022-04-08 08:19:42,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:19:42,385 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1452354263] [2022-04-08 08:19:42,385 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:19:42,386 INFO L85 PathProgramCache]: Analyzing trace with hash -835384116, now seen corresponding path program 2 times [2022-04-08 08:19:42,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:19:42,386 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383228723] [2022-04-08 08:19:42,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:19:42,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:19:42,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:19:42,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:19:42,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:19:42,430 INFO L290 TraceCheckUtils]: 0: Hoare triple {2106#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {2100#true} is VALID [2022-04-08 08:19:42,431 INFO L290 TraceCheckUtils]: 1: Hoare triple {2100#true} assume true; {2100#true} is VALID [2022-04-08 08:19:42,431 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2100#true} {2100#true} #166#return; {2100#true} is VALID [2022-04-08 08:19:42,431 INFO L272 TraceCheckUtils]: 0: Hoare triple {2100#true} call ULTIMATE.init(); {2106#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:19:42,431 INFO L290 TraceCheckUtils]: 1: Hoare triple {2106#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {2100#true} is VALID [2022-04-08 08:19:42,432 INFO L290 TraceCheckUtils]: 2: Hoare triple {2100#true} assume true; {2100#true} is VALID [2022-04-08 08:19:42,432 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2100#true} {2100#true} #166#return; {2100#true} is VALID [2022-04-08 08:19:42,432 INFO L272 TraceCheckUtils]: 4: Hoare triple {2100#true} call #t~ret13 := main(); {2100#true} is VALID [2022-04-08 08:19:42,432 INFO L290 TraceCheckUtils]: 5: Hoare triple {2100#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;havoc ~cond~0; {2100#true} is VALID [2022-04-08 08:19:42,432 INFO L290 TraceCheckUtils]: 6: Hoare triple {2100#true} assume !false;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~cond~0 := #t~nondet12;havoc #t~nondet12; {2100#true} is VALID [2022-04-08 08:19:42,432 INFO L290 TraceCheckUtils]: 7: Hoare triple {2100#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0; {2100#true} is VALID [2022-04-08 08:19:42,432 INFO L290 TraceCheckUtils]: 8: Hoare triple {2100#true} assume !(0 != ~p1~0); {2100#true} is VALID [2022-04-08 08:19:42,433 INFO L290 TraceCheckUtils]: 9: Hoare triple {2100#true} assume 0 != ~p2~0;~lk2~0 := 1; {2105#(= main_~lk2~0 1)} is VALID [2022-04-08 08:19:42,435 INFO L290 TraceCheckUtils]: 10: Hoare triple {2105#(= main_~lk2~0 1)} assume 0 != ~p3~0;~lk3~0 := 1; {2105#(= main_~lk2~0 1)} is VALID [2022-04-08 08:19:42,435 INFO L290 TraceCheckUtils]: 11: Hoare triple {2105#(= main_~lk2~0 1)} assume 0 != ~p4~0;~lk4~0 := 1; {2105#(= main_~lk2~0 1)} is VALID [2022-04-08 08:19:42,435 INFO L290 TraceCheckUtils]: 12: Hoare triple {2105#(= main_~lk2~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {2105#(= main_~lk2~0 1)} is VALID [2022-04-08 08:19:42,436 INFO L290 TraceCheckUtils]: 13: Hoare triple {2105#(= main_~lk2~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {2105#(= main_~lk2~0 1)} is VALID [2022-04-08 08:19:42,436 INFO L290 TraceCheckUtils]: 14: Hoare triple {2105#(= main_~lk2~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {2105#(= main_~lk2~0 1)} is VALID [2022-04-08 08:19:42,436 INFO L290 TraceCheckUtils]: 15: Hoare triple {2105#(= main_~lk2~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {2105#(= main_~lk2~0 1)} is VALID [2022-04-08 08:19:42,436 INFO L290 TraceCheckUtils]: 16: Hoare triple {2105#(= main_~lk2~0 1)} assume !(0 != ~p1~0); {2105#(= main_~lk2~0 1)} is VALID [2022-04-08 08:19:42,437 INFO L290 TraceCheckUtils]: 17: Hoare triple {2105#(= main_~lk2~0 1)} assume 0 != ~p2~0; {2105#(= main_~lk2~0 1)} is VALID [2022-04-08 08:19:42,437 INFO L290 TraceCheckUtils]: 18: Hoare triple {2105#(= main_~lk2~0 1)} assume 1 != ~lk2~0; {2101#false} is VALID [2022-04-08 08:19:42,437 INFO L290 TraceCheckUtils]: 19: Hoare triple {2101#false} assume !false; {2101#false} is VALID [2022-04-08 08:19:42,438 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-08 08:19:42,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:19:42,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383228723] [2022-04-08 08:19:42,438 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383228723] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:19:42,438 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:19:42,438 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:19:42,438 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:19:42,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1452354263] [2022-04-08 08:19:42,438 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1452354263] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:19:42,438 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:19:42,438 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:19:42,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766479234] [2022-04-08 08:19:42,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:19:42,439 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 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 20 [2022-04-08 08:19:42,439 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:19:42,439 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 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-08 08:19:42,452 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:19:42,452 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:19:42,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:19:42,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:19:42,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:19:42,453 INFO L87 Difference]: Start difference. First operand 111 states and 189 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 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-08 08:19:42,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:19:42,562 INFO L93 Difference]: Finished difference Result 143 states and 243 transitions. [2022-04-08 08:19:42,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:19:42,562 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 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 20 [2022-04-08 08:19:42,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:19:42,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 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-08 08:19:42,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 100 transitions. [2022-04-08 08:19:42,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 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-08 08:19:42,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 100 transitions. [2022-04-08 08:19:42,566 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 100 transitions. [2022-04-08 08:19:42,631 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:19:42,633 INFO L225 Difference]: With dead ends: 143 [2022-04-08 08:19:42,633 INFO L226 Difference]: Without dead ends: 141 [2022-04-08 08:19:42,634 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:19:42,634 INFO L913 BasicCegarLoop]: 97 mSDtfsCounter, 84 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 08:19:42,634 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [84 Valid, 104 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 08:19:42,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2022-04-08 08:19:42,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 111. [2022-04-08 08:19:42,642 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:19:42,643 INFO L82 GeneralOperation]: Start isEquivalent. First operand 141 states. Second operand has 111 states, 107 states have (on average 1.719626168224299) internal successors, (184), 107 states have internal predecessors, (184), 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-08 08:19:42,643 INFO L74 IsIncluded]: Start isIncluded. First operand 141 states. Second operand has 111 states, 107 states have (on average 1.719626168224299) internal successors, (184), 107 states have internal predecessors, (184), 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-08 08:19:42,643 INFO L87 Difference]: Start difference. First operand 141 states. Second operand has 111 states, 107 states have (on average 1.719626168224299) internal successors, (184), 107 states have internal predecessors, (184), 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-08 08:19:42,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:19:42,646 INFO L93 Difference]: Finished difference Result 141 states and 240 transitions. [2022-04-08 08:19:42,646 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 240 transitions. [2022-04-08 08:19:42,647 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:19:42,647 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:19:42,647 INFO L74 IsIncluded]: Start isIncluded. First operand has 111 states, 107 states have (on average 1.719626168224299) internal successors, (184), 107 states have internal predecessors, (184), 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 141 states. [2022-04-08 08:19:42,647 INFO L87 Difference]: Start difference. First operand has 111 states, 107 states have (on average 1.719626168224299) internal successors, (184), 107 states have internal predecessors, (184), 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 141 states. [2022-04-08 08:19:42,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:19:42,651 INFO L93 Difference]: Finished difference Result 141 states and 240 transitions. [2022-04-08 08:19:42,651 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 240 transitions. [2022-04-08 08:19:42,651 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:19:42,651 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:19:42,651 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:19:42,651 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:19:42,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 107 states have (on average 1.719626168224299) internal successors, (184), 107 states have internal predecessors, (184), 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-08 08:19:42,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 187 transitions. [2022-04-08 08:19:42,655 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 187 transitions. Word has length 20 [2022-04-08 08:19:42,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:19:42,656 INFO L478 AbstractCegarLoop]: Abstraction has 111 states and 187 transitions. [2022-04-08 08:19:42,656 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 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-08 08:19:42,656 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 111 states and 187 transitions. [2022-04-08 08:19:42,805 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 187 edges. 187 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:19:42,806 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 187 transitions. [2022-04-08 08:19:42,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-08 08:19:42,806 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:19:42,806 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:19:42,806 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-08 08:19:42,806 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:19:42,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:19:42,807 INFO L85 PathProgramCache]: Analyzing trace with hash 131275990, now seen corresponding path program 1 times [2022-04-08 08:19:42,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:19:42,807 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1869096532] [2022-04-08 08:19:42,807 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:19:42,807 INFO L85 PathProgramCache]: Analyzing trace with hash 131275990, now seen corresponding path program 2 times [2022-04-08 08:19:42,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:19:42,807 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556698487] [2022-04-08 08:19:42,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:19:42,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:19:42,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:19:42,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:19:42,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:19:42,839 INFO L290 TraceCheckUtils]: 0: Hoare triple {2908#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {2902#true} is VALID [2022-04-08 08:19:42,839 INFO L290 TraceCheckUtils]: 1: Hoare triple {2902#true} assume true; {2902#true} is VALID [2022-04-08 08:19:42,839 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2902#true} {2902#true} #166#return; {2902#true} is VALID [2022-04-08 08:19:42,840 INFO L272 TraceCheckUtils]: 0: Hoare triple {2902#true} call ULTIMATE.init(); {2908#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:19:42,840 INFO L290 TraceCheckUtils]: 1: Hoare triple {2908#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {2902#true} is VALID [2022-04-08 08:19:42,840 INFO L290 TraceCheckUtils]: 2: Hoare triple {2902#true} assume true; {2902#true} is VALID [2022-04-08 08:19:42,840 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2902#true} {2902#true} #166#return; {2902#true} is VALID [2022-04-08 08:19:42,840 INFO L272 TraceCheckUtils]: 4: Hoare triple {2902#true} call #t~ret13 := main(); {2902#true} is VALID [2022-04-08 08:19:42,840 INFO L290 TraceCheckUtils]: 5: Hoare triple {2902#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;havoc ~cond~0; {2902#true} is VALID [2022-04-08 08:19:42,841 INFO L290 TraceCheckUtils]: 6: Hoare triple {2902#true} assume !false;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~cond~0 := #t~nondet12;havoc #t~nondet12; {2902#true} is VALID [2022-04-08 08:19:42,841 INFO L290 TraceCheckUtils]: 7: Hoare triple {2902#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0; {2902#true} is VALID [2022-04-08 08:19:42,841 INFO L290 TraceCheckUtils]: 8: Hoare triple {2902#true} assume !(0 != ~p1~0); {2902#true} is VALID [2022-04-08 08:19:42,841 INFO L290 TraceCheckUtils]: 9: Hoare triple {2902#true} assume !(0 != ~p2~0); {2902#true} is VALID [2022-04-08 08:19:42,841 INFO L290 TraceCheckUtils]: 10: Hoare triple {2902#true} assume 0 != ~p3~0;~lk3~0 := 1; {2907#(= main_~lk3~0 1)} is VALID [2022-04-08 08:19:42,841 INFO L290 TraceCheckUtils]: 11: Hoare triple {2907#(= main_~lk3~0 1)} assume 0 != ~p4~0;~lk4~0 := 1; {2907#(= main_~lk3~0 1)} is VALID [2022-04-08 08:19:42,842 INFO L290 TraceCheckUtils]: 12: Hoare triple {2907#(= main_~lk3~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {2907#(= main_~lk3~0 1)} is VALID [2022-04-08 08:19:42,842 INFO L290 TraceCheckUtils]: 13: Hoare triple {2907#(= main_~lk3~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {2907#(= main_~lk3~0 1)} is VALID [2022-04-08 08:19:42,842 INFO L290 TraceCheckUtils]: 14: Hoare triple {2907#(= main_~lk3~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {2907#(= main_~lk3~0 1)} is VALID [2022-04-08 08:19:42,842 INFO L290 TraceCheckUtils]: 15: Hoare triple {2907#(= main_~lk3~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {2907#(= main_~lk3~0 1)} is VALID [2022-04-08 08:19:42,843 INFO L290 TraceCheckUtils]: 16: Hoare triple {2907#(= main_~lk3~0 1)} assume !(0 != ~p1~0); {2907#(= main_~lk3~0 1)} is VALID [2022-04-08 08:19:42,843 INFO L290 TraceCheckUtils]: 17: Hoare triple {2907#(= main_~lk3~0 1)} assume !(0 != ~p2~0); {2907#(= main_~lk3~0 1)} is VALID [2022-04-08 08:19:42,843 INFO L290 TraceCheckUtils]: 18: Hoare triple {2907#(= main_~lk3~0 1)} assume 0 != ~p3~0; {2907#(= main_~lk3~0 1)} is VALID [2022-04-08 08:19:42,844 INFO L290 TraceCheckUtils]: 19: Hoare triple {2907#(= main_~lk3~0 1)} assume 1 != ~lk3~0; {2903#false} is VALID [2022-04-08 08:19:42,844 INFO L290 TraceCheckUtils]: 20: Hoare triple {2903#false} assume !false; {2903#false} is VALID [2022-04-08 08:19:42,844 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-08 08:19:42,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:19:42,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556698487] [2022-04-08 08:19:42,844 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556698487] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:19:42,844 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:19:42,844 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:19:42,844 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:19:42,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1869096532] [2022-04-08 08:19:42,844 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1869096532] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:19:42,844 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:19:42,845 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:19:42,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356617737] [2022-04-08 08:19:42,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:19:42,845 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 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-08 08:19:42,845 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:19:42,845 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 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-08 08:19:42,856 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:19:42,856 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:19:42,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:19:42,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:19:42,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:19:42,857 INFO L87 Difference]: Start difference. First operand 111 states and 187 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 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-08 08:19:42,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:19:42,998 INFO L93 Difference]: Finished difference Result 203 states and 347 transitions. [2022-04-08 08:19:42,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:19:42,998 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 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-08 08:19:42,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:19:42,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 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-08 08:19:42,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 99 transitions. [2022-04-08 08:19:42,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 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-08 08:19:43,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 99 transitions. [2022-04-08 08:19:43,000 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 99 transitions. [2022-04-08 08:19:43,062 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 99 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:19:43,064 INFO L225 Difference]: With dead ends: 203 [2022-04-08 08:19:43,064 INFO L226 Difference]: Without dead ends: 201 [2022-04-08 08:19:43,065 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:19:43,065 INFO L913 BasicCegarLoop]: 57 mSDtfsCounter, 120 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 08:19:43,065 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [120 Valid, 64 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 08:19:43,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2022-04-08 08:19:43,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 151. [2022-04-08 08:19:43,075 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:19:43,076 INFO L82 GeneralOperation]: Start isEquivalent. First operand 201 states. Second operand has 151 states, 147 states have (on average 1.7006802721088434) internal successors, (250), 147 states have internal predecessors, (250), 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-08 08:19:43,076 INFO L74 IsIncluded]: Start isIncluded. First operand 201 states. Second operand has 151 states, 147 states have (on average 1.7006802721088434) internal successors, (250), 147 states have internal predecessors, (250), 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-08 08:19:43,077 INFO L87 Difference]: Start difference. First operand 201 states. Second operand has 151 states, 147 states have (on average 1.7006802721088434) internal successors, (250), 147 states have internal predecessors, (250), 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-08 08:19:43,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:19:43,081 INFO L93 Difference]: Finished difference Result 201 states and 342 transitions. [2022-04-08 08:19:43,081 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 342 transitions. [2022-04-08 08:19:43,081 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:19:43,081 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:19:43,082 INFO L74 IsIncluded]: Start isIncluded. First operand has 151 states, 147 states have (on average 1.7006802721088434) internal successors, (250), 147 states have internal predecessors, (250), 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 201 states. [2022-04-08 08:19:43,082 INFO L87 Difference]: Start difference. First operand has 151 states, 147 states have (on average 1.7006802721088434) internal successors, (250), 147 states have internal predecessors, (250), 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 201 states. [2022-04-08 08:19:43,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:19:43,086 INFO L93 Difference]: Finished difference Result 201 states and 342 transitions. [2022-04-08 08:19:43,086 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 342 transitions. [2022-04-08 08:19:43,087 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:19:43,087 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:19:43,087 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:19:43,087 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:19:43,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 147 states have (on average 1.7006802721088434) internal successors, (250), 147 states have internal predecessors, (250), 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-08 08:19:43,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 253 transitions. [2022-04-08 08:19:43,090 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 253 transitions. Word has length 21 [2022-04-08 08:19:43,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:19:43,090 INFO L478 AbstractCegarLoop]: Abstraction has 151 states and 253 transitions. [2022-04-08 08:19:43,090 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 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-08 08:19:43,090 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 151 states and 253 transitions. [2022-04-08 08:19:43,327 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 253 edges. 253 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:19:43,327 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 253 transitions. [2022-04-08 08:19:43,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-08 08:19:43,328 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:19:43,328 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:19:43,328 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-08 08:19:43,328 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:19:43,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:19:43,328 INFO L85 PathProgramCache]: Analyzing trace with hash 832340568, now seen corresponding path program 1 times [2022-04-08 08:19:43,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:19:43,329 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1452348202] [2022-04-08 08:19:43,329 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:19:43,329 INFO L85 PathProgramCache]: Analyzing trace with hash 832340568, now seen corresponding path program 2 times [2022-04-08 08:19:43,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:19:43,329 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995896742] [2022-04-08 08:19:43,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:19:43,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:19:43,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:19:43,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:19:43,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:19:43,378 INFO L290 TraceCheckUtils]: 0: Hoare triple {4030#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {4024#true} is VALID [2022-04-08 08:19:43,378 INFO L290 TraceCheckUtils]: 1: Hoare triple {4024#true} assume true; {4024#true} is VALID [2022-04-08 08:19:43,378 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4024#true} {4024#true} #166#return; {4024#true} is VALID [2022-04-08 08:19:43,379 INFO L272 TraceCheckUtils]: 0: Hoare triple {4024#true} call ULTIMATE.init(); {4030#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:19:43,379 INFO L290 TraceCheckUtils]: 1: Hoare triple {4030#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {4024#true} is VALID [2022-04-08 08:19:43,379 INFO L290 TraceCheckUtils]: 2: Hoare triple {4024#true} assume true; {4024#true} is VALID [2022-04-08 08:19:43,379 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4024#true} {4024#true} #166#return; {4024#true} is VALID [2022-04-08 08:19:43,379 INFO L272 TraceCheckUtils]: 4: Hoare triple {4024#true} call #t~ret13 := main(); {4024#true} is VALID [2022-04-08 08:19:43,379 INFO L290 TraceCheckUtils]: 5: Hoare triple {4024#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;havoc ~cond~0; {4024#true} is VALID [2022-04-08 08:19:43,380 INFO L290 TraceCheckUtils]: 6: Hoare triple {4024#true} assume !false;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~cond~0 := #t~nondet12;havoc #t~nondet12; {4024#true} is VALID [2022-04-08 08:19:43,380 INFO L290 TraceCheckUtils]: 7: Hoare triple {4024#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0; {4024#true} is VALID [2022-04-08 08:19:43,380 INFO L290 TraceCheckUtils]: 8: Hoare triple {4024#true} assume !(0 != ~p1~0); {4024#true} is VALID [2022-04-08 08:19:43,380 INFO L290 TraceCheckUtils]: 9: Hoare triple {4024#true} assume !(0 != ~p2~0); {4024#true} is VALID [2022-04-08 08:19:43,380 INFO L290 TraceCheckUtils]: 10: Hoare triple {4024#true} assume !(0 != ~p3~0); {4029#(= main_~p3~0 0)} is VALID [2022-04-08 08:19:43,380 INFO L290 TraceCheckUtils]: 11: Hoare triple {4029#(= main_~p3~0 0)} assume 0 != ~p4~0;~lk4~0 := 1; {4029#(= main_~p3~0 0)} is VALID [2022-04-08 08:19:43,381 INFO L290 TraceCheckUtils]: 12: Hoare triple {4029#(= main_~p3~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {4029#(= main_~p3~0 0)} is VALID [2022-04-08 08:19:43,381 INFO L290 TraceCheckUtils]: 13: Hoare triple {4029#(= main_~p3~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {4029#(= main_~p3~0 0)} is VALID [2022-04-08 08:19:43,381 INFO L290 TraceCheckUtils]: 14: Hoare triple {4029#(= main_~p3~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {4029#(= main_~p3~0 0)} is VALID [2022-04-08 08:19:43,381 INFO L290 TraceCheckUtils]: 15: Hoare triple {4029#(= main_~p3~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {4029#(= main_~p3~0 0)} is VALID [2022-04-08 08:19:43,384 INFO L290 TraceCheckUtils]: 16: Hoare triple {4029#(= main_~p3~0 0)} assume !(0 != ~p1~0); {4029#(= main_~p3~0 0)} is VALID [2022-04-08 08:19:43,384 INFO L290 TraceCheckUtils]: 17: Hoare triple {4029#(= main_~p3~0 0)} assume !(0 != ~p2~0); {4029#(= main_~p3~0 0)} is VALID [2022-04-08 08:19:43,384 INFO L290 TraceCheckUtils]: 18: Hoare triple {4029#(= main_~p3~0 0)} assume 0 != ~p3~0; {4025#false} is VALID [2022-04-08 08:19:43,384 INFO L290 TraceCheckUtils]: 19: Hoare triple {4025#false} assume 1 != ~lk3~0; {4025#false} is VALID [2022-04-08 08:19:43,384 INFO L290 TraceCheckUtils]: 20: Hoare triple {4025#false} assume !false; {4025#false} is VALID [2022-04-08 08:19:43,385 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-08 08:19:43,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:19:43,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995896742] [2022-04-08 08:19:43,385 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995896742] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:19:43,385 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:19:43,385 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:19:43,385 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:19:43,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1452348202] [2022-04-08 08:19:43,385 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1452348202] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:19:43,385 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:19:43,385 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:19:43,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663878471] [2022-04-08 08:19:43,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:19:43,386 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 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-08 08:19:43,386 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:19:43,386 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 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-08 08:19:43,397 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:19:43,397 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:19:43,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:19:43,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:19:43,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:19:43,398 INFO L87 Difference]: Start difference. First operand 151 states and 253 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 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-08 08:19:43,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:19:43,534 INFO L93 Difference]: Finished difference Result 351 states and 595 transitions. [2022-04-08 08:19:43,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:19:43,535 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 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-08 08:19:43,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:19:43,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 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-08 08:19:43,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 150 transitions. [2022-04-08 08:19:43,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 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-08 08:19:43,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 150 transitions. [2022-04-08 08:19:43,538 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 150 transitions. [2022-04-08 08:19:43,642 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 150 edges. 150 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:19:43,645 INFO L225 Difference]: With dead ends: 351 [2022-04-08 08:19:43,645 INFO L226 Difference]: Without dead ends: 209 [2022-04-08 08:19:43,646 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:19:43,646 INFO L913 BasicCegarLoop]: 76 mSDtfsCounter, 106 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 08:19:43,647 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [106 Valid, 83 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 08:19:43,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2022-04-08 08:19:43,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 207. [2022-04-08 08:19:43,669 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:19:43,669 INFO L82 GeneralOperation]: Start isEquivalent. First operand 209 states. Second operand has 207 states, 203 states have (on average 1.6748768472906403) internal successors, (340), 203 states have internal predecessors, (340), 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-08 08:19:43,669 INFO L74 IsIncluded]: Start isIncluded. First operand 209 states. Second operand has 207 states, 203 states have (on average 1.6748768472906403) internal successors, (340), 203 states have internal predecessors, (340), 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-08 08:19:43,670 INFO L87 Difference]: Start difference. First operand 209 states. Second operand has 207 states, 203 states have (on average 1.6748768472906403) internal successors, (340), 203 states have internal predecessors, (340), 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-08 08:19:43,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:19:43,675 INFO L93 Difference]: Finished difference Result 209 states and 344 transitions. [2022-04-08 08:19:43,675 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 344 transitions. [2022-04-08 08:19:43,676 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:19:43,676 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:19:43,676 INFO L74 IsIncluded]: Start isIncluded. First operand has 207 states, 203 states have (on average 1.6748768472906403) internal successors, (340), 203 states have internal predecessors, (340), 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 209 states. [2022-04-08 08:19:43,676 INFO L87 Difference]: Start difference. First operand has 207 states, 203 states have (on average 1.6748768472906403) internal successors, (340), 203 states have internal predecessors, (340), 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 209 states. [2022-04-08 08:19:43,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:19:43,680 INFO L93 Difference]: Finished difference Result 209 states and 344 transitions. [2022-04-08 08:19:43,680 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 344 transitions. [2022-04-08 08:19:43,681 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:19:43,681 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:19:43,681 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:19:43,681 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:19:43,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 203 states have (on average 1.6748768472906403) internal successors, (340), 203 states have internal predecessors, (340), 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-08 08:19:43,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 343 transitions. [2022-04-08 08:19:43,686 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 343 transitions. Word has length 21 [2022-04-08 08:19:43,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:19:43,686 INFO L478 AbstractCegarLoop]: Abstraction has 207 states and 343 transitions. [2022-04-08 08:19:43,686 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 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-08 08:19:43,686 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 207 states and 343 transitions. [2022-04-08 08:19:44,042 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 343 edges. 343 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:19:44,043 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 343 transitions. [2022-04-08 08:19:44,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-08 08:19:44,043 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:19:44,043 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:19:44,043 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-08 08:19:44,043 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:19:44,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:19:44,044 INFO L85 PathProgramCache]: Analyzing trace with hash -225196893, now seen corresponding path program 1 times [2022-04-08 08:19:44,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:19:44,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [999033963] [2022-04-08 08:19:44,044 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:19:44,044 INFO L85 PathProgramCache]: Analyzing trace with hash -225196893, now seen corresponding path program 2 times [2022-04-08 08:19:44,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:19:44,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991362288] [2022-04-08 08:19:44,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:19:44,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:19:44,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:19:44,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:19:44,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:19:44,079 INFO L290 TraceCheckUtils]: 0: Hoare triple {5576#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {5570#true} is VALID [2022-04-08 08:19:44,079 INFO L290 TraceCheckUtils]: 1: Hoare triple {5570#true} assume true; {5570#true} is VALID [2022-04-08 08:19:44,079 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5570#true} {5570#true} #166#return; {5570#true} is VALID [2022-04-08 08:19:44,080 INFO L272 TraceCheckUtils]: 0: Hoare triple {5570#true} call ULTIMATE.init(); {5576#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:19:44,080 INFO L290 TraceCheckUtils]: 1: Hoare triple {5576#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {5570#true} is VALID [2022-04-08 08:19:44,080 INFO L290 TraceCheckUtils]: 2: Hoare triple {5570#true} assume true; {5570#true} is VALID [2022-04-08 08:19:44,080 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5570#true} {5570#true} #166#return; {5570#true} is VALID [2022-04-08 08:19:44,080 INFO L272 TraceCheckUtils]: 4: Hoare triple {5570#true} call #t~ret13 := main(); {5570#true} is VALID [2022-04-08 08:19:44,080 INFO L290 TraceCheckUtils]: 5: Hoare triple {5570#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;havoc ~cond~0; {5570#true} is VALID [2022-04-08 08:19:44,080 INFO L290 TraceCheckUtils]: 6: Hoare triple {5570#true} assume !false;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~cond~0 := #t~nondet12;havoc #t~nondet12; {5570#true} is VALID [2022-04-08 08:19:44,080 INFO L290 TraceCheckUtils]: 7: Hoare triple {5570#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0; {5570#true} is VALID [2022-04-08 08:19:44,080 INFO L290 TraceCheckUtils]: 8: Hoare triple {5570#true} assume !(0 != ~p1~0); {5570#true} is VALID [2022-04-08 08:19:44,081 INFO L290 TraceCheckUtils]: 9: Hoare triple {5570#true} assume !(0 != ~p2~0); {5570#true} is VALID [2022-04-08 08:19:44,081 INFO L290 TraceCheckUtils]: 10: Hoare triple {5570#true} assume 0 != ~p3~0;~lk3~0 := 1; {5575#(not (= main_~p3~0 0))} is VALID [2022-04-08 08:19:44,081 INFO L290 TraceCheckUtils]: 11: Hoare triple {5575#(not (= main_~p3~0 0))} assume 0 != ~p4~0;~lk4~0 := 1; {5575#(not (= main_~p3~0 0))} is VALID [2022-04-08 08:19:44,081 INFO L290 TraceCheckUtils]: 12: Hoare triple {5575#(not (= main_~p3~0 0))} assume 0 != ~p5~0;~lk5~0 := 1; {5575#(not (= main_~p3~0 0))} is VALID [2022-04-08 08:19:44,082 INFO L290 TraceCheckUtils]: 13: Hoare triple {5575#(not (= main_~p3~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {5575#(not (= main_~p3~0 0))} is VALID [2022-04-08 08:19:44,082 INFO L290 TraceCheckUtils]: 14: Hoare triple {5575#(not (= main_~p3~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {5575#(not (= main_~p3~0 0))} is VALID [2022-04-08 08:19:44,082 INFO L290 TraceCheckUtils]: 15: Hoare triple {5575#(not (= main_~p3~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {5575#(not (= main_~p3~0 0))} is VALID [2022-04-08 08:19:44,082 INFO L290 TraceCheckUtils]: 16: Hoare triple {5575#(not (= main_~p3~0 0))} assume !(0 != ~p1~0); {5575#(not (= main_~p3~0 0))} is VALID [2022-04-08 08:19:44,083 INFO L290 TraceCheckUtils]: 17: Hoare triple {5575#(not (= main_~p3~0 0))} assume !(0 != ~p2~0); {5575#(not (= main_~p3~0 0))} is VALID [2022-04-08 08:19:44,083 INFO L290 TraceCheckUtils]: 18: Hoare triple {5575#(not (= main_~p3~0 0))} assume !(0 != ~p3~0); {5571#false} is VALID [2022-04-08 08:19:44,083 INFO L290 TraceCheckUtils]: 19: Hoare triple {5571#false} assume 0 != ~p4~0; {5571#false} is VALID [2022-04-08 08:19:44,083 INFO L290 TraceCheckUtils]: 20: Hoare triple {5571#false} assume 1 != ~lk4~0; {5571#false} is VALID [2022-04-08 08:19:44,083 INFO L290 TraceCheckUtils]: 21: Hoare triple {5571#false} assume !false; {5571#false} is VALID [2022-04-08 08:19:44,083 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-08 08:19:44,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:19:44,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991362288] [2022-04-08 08:19:44,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991362288] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:19:44,084 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:19:44,084 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:19:44,084 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:19:44,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [999033963] [2022-04-08 08:19:44,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [999033963] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:19:44,084 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:19:44,084 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:19:44,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157906826] [2022-04-08 08:19:44,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:19:44,084 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 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-08 08:19:44,084 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:19:44,085 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 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-08 08:19:44,102 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:19:44,102 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:19:44,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:19:44,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:19:44,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:19:44,102 INFO L87 Difference]: Start difference. First operand 207 states and 343 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 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-08 08:19:44,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:19:44,239 INFO L93 Difference]: Finished difference Result 313 states and 517 transitions. [2022-04-08 08:19:44,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:19:44,239 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 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-08 08:19:44,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:19:44,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 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-08 08:19:44,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 145 transitions. [2022-04-08 08:19:44,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 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-08 08:19:44,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 145 transitions. [2022-04-08 08:19:44,241 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 145 transitions. [2022-04-08 08:19:44,334 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 145 edges. 145 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:19:44,337 INFO L225 Difference]: With dead ends: 313 [2022-04-08 08:19:44,337 INFO L226 Difference]: Without dead ends: 215 [2022-04-08 08:19:44,338 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:19:44,338 INFO L913 BasicCegarLoop]: 80 mSDtfsCounter, 103 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 08:19:44,338 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [103 Valid, 87 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 08:19:44,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2022-04-08 08:19:44,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 213. [2022-04-08 08:19:44,349 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:19:44,349 INFO L82 GeneralOperation]: Start isEquivalent. First operand 215 states. Second operand has 213 states, 209 states have (on average 1.645933014354067) internal successors, (344), 209 states have internal predecessors, (344), 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-08 08:19:44,350 INFO L74 IsIncluded]: Start isIncluded. First operand 215 states. Second operand has 213 states, 209 states have (on average 1.645933014354067) internal successors, (344), 209 states have internal predecessors, (344), 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-08 08:19:44,350 INFO L87 Difference]: Start difference. First operand 215 states. Second operand has 213 states, 209 states have (on average 1.645933014354067) internal successors, (344), 209 states have internal predecessors, (344), 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-08 08:19:44,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:19:44,354 INFO L93 Difference]: Finished difference Result 215 states and 348 transitions. [2022-04-08 08:19:44,354 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 348 transitions. [2022-04-08 08:19:44,354 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:19:44,354 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:19:44,354 INFO L74 IsIncluded]: Start isIncluded. First operand has 213 states, 209 states have (on average 1.645933014354067) internal successors, (344), 209 states have internal predecessors, (344), 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 215 states. [2022-04-08 08:19:44,355 INFO L87 Difference]: Start difference. First operand has 213 states, 209 states have (on average 1.645933014354067) internal successors, (344), 209 states have internal predecessors, (344), 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 215 states. [2022-04-08 08:19:44,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:19:44,358 INFO L93 Difference]: Finished difference Result 215 states and 348 transitions. [2022-04-08 08:19:44,358 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 348 transitions. [2022-04-08 08:19:44,358 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:19:44,359 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:19:44,359 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:19:44,359 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:19:44,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 209 states have (on average 1.645933014354067) internal successors, (344), 209 states have internal predecessors, (344), 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-08 08:19:44,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 347 transitions. [2022-04-08 08:19:44,363 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 347 transitions. Word has length 22 [2022-04-08 08:19:44,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:19:44,363 INFO L478 AbstractCegarLoop]: Abstraction has 213 states and 347 transitions. [2022-04-08 08:19:44,364 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 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-08 08:19:44,364 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 213 states and 347 transitions. [2022-04-08 08:19:44,672 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 347 edges. 347 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:19:44,673 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 347 transitions. [2022-04-08 08:19:44,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-08 08:19:44,673 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:19:44,673 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:19:44,673 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-08 08:19:44,673 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:19:44,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:19:44,674 INFO L85 PathProgramCache]: Analyzing trace with hash 32968545, now seen corresponding path program 1 times [2022-04-08 08:19:44,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:19:44,674 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1483683425] [2022-04-08 08:19:44,674 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:19:44,674 INFO L85 PathProgramCache]: Analyzing trace with hash 32968545, now seen corresponding path program 2 times [2022-04-08 08:19:44,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:19:44,674 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147899629] [2022-04-08 08:19:44,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:19:44,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:19:44,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:19:44,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:19:44,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:19:44,707 INFO L290 TraceCheckUtils]: 0: Hoare triple {7070#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {7064#true} is VALID [2022-04-08 08:19:44,707 INFO L290 TraceCheckUtils]: 1: Hoare triple {7064#true} assume true; {7064#true} is VALID [2022-04-08 08:19:44,707 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7064#true} {7064#true} #166#return; {7064#true} is VALID [2022-04-08 08:19:44,708 INFO L272 TraceCheckUtils]: 0: Hoare triple {7064#true} call ULTIMATE.init(); {7070#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:19:44,708 INFO L290 TraceCheckUtils]: 1: Hoare triple {7070#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {7064#true} is VALID [2022-04-08 08:19:44,708 INFO L290 TraceCheckUtils]: 2: Hoare triple {7064#true} assume true; {7064#true} is VALID [2022-04-08 08:19:44,708 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7064#true} {7064#true} #166#return; {7064#true} is VALID [2022-04-08 08:19:44,708 INFO L272 TraceCheckUtils]: 4: Hoare triple {7064#true} call #t~ret13 := main(); {7064#true} is VALID [2022-04-08 08:19:44,708 INFO L290 TraceCheckUtils]: 5: Hoare triple {7064#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;havoc ~cond~0; {7064#true} is VALID [2022-04-08 08:19:44,708 INFO L290 TraceCheckUtils]: 6: Hoare triple {7064#true} assume !false;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~cond~0 := #t~nondet12;havoc #t~nondet12; {7064#true} is VALID [2022-04-08 08:19:44,708 INFO L290 TraceCheckUtils]: 7: Hoare triple {7064#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0; {7064#true} is VALID [2022-04-08 08:19:44,708 INFO L290 TraceCheckUtils]: 8: Hoare triple {7064#true} assume !(0 != ~p1~0); {7064#true} is VALID [2022-04-08 08:19:44,708 INFO L290 TraceCheckUtils]: 9: Hoare triple {7064#true} assume !(0 != ~p2~0); {7064#true} is VALID [2022-04-08 08:19:44,709 INFO L290 TraceCheckUtils]: 10: Hoare triple {7064#true} assume !(0 != ~p3~0); {7064#true} is VALID [2022-04-08 08:19:44,716 INFO L290 TraceCheckUtils]: 11: Hoare triple {7064#true} assume 0 != ~p4~0;~lk4~0 := 1; {7069#(= main_~lk4~0 1)} is VALID [2022-04-08 08:19:44,716 INFO L290 TraceCheckUtils]: 12: Hoare triple {7069#(= main_~lk4~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {7069#(= main_~lk4~0 1)} is VALID [2022-04-08 08:19:44,717 INFO L290 TraceCheckUtils]: 13: Hoare triple {7069#(= main_~lk4~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {7069#(= main_~lk4~0 1)} is VALID [2022-04-08 08:19:44,717 INFO L290 TraceCheckUtils]: 14: Hoare triple {7069#(= main_~lk4~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {7069#(= main_~lk4~0 1)} is VALID [2022-04-08 08:19:44,717 INFO L290 TraceCheckUtils]: 15: Hoare triple {7069#(= main_~lk4~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {7069#(= main_~lk4~0 1)} is VALID [2022-04-08 08:19:44,717 INFO L290 TraceCheckUtils]: 16: Hoare triple {7069#(= main_~lk4~0 1)} assume !(0 != ~p1~0); {7069#(= main_~lk4~0 1)} is VALID [2022-04-08 08:19:44,718 INFO L290 TraceCheckUtils]: 17: Hoare triple {7069#(= main_~lk4~0 1)} assume !(0 != ~p2~0); {7069#(= main_~lk4~0 1)} is VALID [2022-04-08 08:19:44,718 INFO L290 TraceCheckUtils]: 18: Hoare triple {7069#(= main_~lk4~0 1)} assume !(0 != ~p3~0); {7069#(= main_~lk4~0 1)} is VALID [2022-04-08 08:19:44,718 INFO L290 TraceCheckUtils]: 19: Hoare triple {7069#(= main_~lk4~0 1)} assume 0 != ~p4~0; {7069#(= main_~lk4~0 1)} is VALID [2022-04-08 08:19:44,718 INFO L290 TraceCheckUtils]: 20: Hoare triple {7069#(= main_~lk4~0 1)} assume 1 != ~lk4~0; {7065#false} is VALID [2022-04-08 08:19:44,719 INFO L290 TraceCheckUtils]: 21: Hoare triple {7065#false} assume !false; {7065#false} is VALID [2022-04-08 08:19:44,719 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-08 08:19:44,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:19:44,719 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147899629] [2022-04-08 08:19:44,719 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147899629] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:19:44,719 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:19:44,719 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:19:44,719 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:19:44,719 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1483683425] [2022-04-08 08:19:44,719 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1483683425] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:19:44,719 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:19:44,719 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:19:44,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677767887] [2022-04-08 08:19:44,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:19:44,720 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 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-08 08:19:44,720 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:19:44,720 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 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-08 08:19:44,731 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:19:44,731 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:19:44,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:19:44,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:19:44,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:19:44,731 INFO L87 Difference]: Start difference. First operand 213 states and 347 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 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-08 08:19:44,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:19:44,863 INFO L93 Difference]: Finished difference Result 381 states and 629 transitions. [2022-04-08 08:19:44,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:19:44,863 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 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-08 08:19:44,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:19:44,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 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-08 08:19:44,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 95 transitions. [2022-04-08 08:19:44,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 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-08 08:19:44,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 95 transitions. [2022-04-08 08:19:44,867 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 95 transitions. [2022-04-08 08:19:44,928 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:19:44,935 INFO L225 Difference]: With dead ends: 381 [2022-04-08 08:19:44,935 INFO L226 Difference]: Without dead ends: 379 [2022-04-08 08:19:44,935 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:19:44,936 INFO L913 BasicCegarLoop]: 56 mSDtfsCounter, 113 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 08:19:44,936 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [113 Valid, 63 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 08:19:44,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2022-04-08 08:19:44,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 297. [2022-04-08 08:19:44,965 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:19:44,966 INFO L82 GeneralOperation]: Start isEquivalent. First operand 379 states. Second operand has 297 states, 293 states have (on average 1.6109215017064846) internal successors, (472), 293 states have internal predecessors, (472), 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-08 08:19:44,967 INFO L74 IsIncluded]: Start isIncluded. First operand 379 states. Second operand has 297 states, 293 states have (on average 1.6109215017064846) internal successors, (472), 293 states have internal predecessors, (472), 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-08 08:19:44,967 INFO L87 Difference]: Start difference. First operand 379 states. Second operand has 297 states, 293 states have (on average 1.6109215017064846) internal successors, (472), 293 states have internal predecessors, (472), 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-08 08:19:44,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:19:44,975 INFO L93 Difference]: Finished difference Result 379 states and 620 transitions. [2022-04-08 08:19:44,975 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 620 transitions. [2022-04-08 08:19:44,975 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:19:44,975 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:19:44,976 INFO L74 IsIncluded]: Start isIncluded. First operand has 297 states, 293 states have (on average 1.6109215017064846) internal successors, (472), 293 states have internal predecessors, (472), 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 379 states. [2022-04-08 08:19:44,976 INFO L87 Difference]: Start difference. First operand has 297 states, 293 states have (on average 1.6109215017064846) internal successors, (472), 293 states have internal predecessors, (472), 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 379 states. [2022-04-08 08:19:44,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:19:44,984 INFO L93 Difference]: Finished difference Result 379 states and 620 transitions. [2022-04-08 08:19:44,984 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 620 transitions. [2022-04-08 08:19:44,984 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:19:44,984 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:19:44,984 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:19:44,984 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:19:44,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 293 states have (on average 1.6109215017064846) internal successors, (472), 293 states have internal predecessors, (472), 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-08 08:19:44,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 475 transitions. [2022-04-08 08:19:44,991 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 475 transitions. Word has length 22 [2022-04-08 08:19:44,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:19:44,991 INFO L478 AbstractCegarLoop]: Abstraction has 297 states and 475 transitions. [2022-04-08 08:19:44,991 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 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-08 08:19:44,991 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 297 states and 475 transitions. [2022-04-08 08:19:45,411 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 475 edges. 475 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:19:45,411 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 475 transitions. [2022-04-08 08:19:45,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-08 08:19:45,412 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:19:45,412 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:19:45,412 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-08 08:19:45,412 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:19:45,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:19:45,413 INFO L85 PathProgramCache]: Analyzing trace with hash 734033123, now seen corresponding path program 1 times [2022-04-08 08:19:45,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:19:45,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [178395095] [2022-04-08 08:19:45,413 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:19:45,413 INFO L85 PathProgramCache]: Analyzing trace with hash 734033123, now seen corresponding path program 2 times [2022-04-08 08:19:45,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:19:45,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004241134] [2022-04-08 08:19:45,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:19:45,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:19:45,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:19:45,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:19:45,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:19:45,443 INFO L290 TraceCheckUtils]: 0: Hoare triple {9196#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {9190#true} is VALID [2022-04-08 08:19:45,443 INFO L290 TraceCheckUtils]: 1: Hoare triple {9190#true} assume true; {9190#true} is VALID [2022-04-08 08:19:45,444 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9190#true} {9190#true} #166#return; {9190#true} is VALID [2022-04-08 08:19:45,444 INFO L272 TraceCheckUtils]: 0: Hoare triple {9190#true} call ULTIMATE.init(); {9196#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:19:45,444 INFO L290 TraceCheckUtils]: 1: Hoare triple {9196#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {9190#true} is VALID [2022-04-08 08:19:45,444 INFO L290 TraceCheckUtils]: 2: Hoare triple {9190#true} assume true; {9190#true} is VALID [2022-04-08 08:19:45,444 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9190#true} {9190#true} #166#return; {9190#true} is VALID [2022-04-08 08:19:45,444 INFO L272 TraceCheckUtils]: 4: Hoare triple {9190#true} call #t~ret13 := main(); {9190#true} is VALID [2022-04-08 08:19:45,444 INFO L290 TraceCheckUtils]: 5: Hoare triple {9190#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;havoc ~cond~0; {9190#true} is VALID [2022-04-08 08:19:45,444 INFO L290 TraceCheckUtils]: 6: Hoare triple {9190#true} assume !false;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~cond~0 := #t~nondet12;havoc #t~nondet12; {9190#true} is VALID [2022-04-08 08:19:45,445 INFO L290 TraceCheckUtils]: 7: Hoare triple {9190#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0; {9190#true} is VALID [2022-04-08 08:19:45,445 INFO L290 TraceCheckUtils]: 8: Hoare triple {9190#true} assume !(0 != ~p1~0); {9190#true} is VALID [2022-04-08 08:19:45,445 INFO L290 TraceCheckUtils]: 9: Hoare triple {9190#true} assume !(0 != ~p2~0); {9190#true} is VALID [2022-04-08 08:19:45,445 INFO L290 TraceCheckUtils]: 10: Hoare triple {9190#true} assume !(0 != ~p3~0); {9190#true} is VALID [2022-04-08 08:19:45,445 INFO L290 TraceCheckUtils]: 11: Hoare triple {9190#true} assume !(0 != ~p4~0); {9195#(= main_~p4~0 0)} is VALID [2022-04-08 08:19:45,445 INFO L290 TraceCheckUtils]: 12: Hoare triple {9195#(= main_~p4~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {9195#(= main_~p4~0 0)} is VALID [2022-04-08 08:19:45,446 INFO L290 TraceCheckUtils]: 13: Hoare triple {9195#(= main_~p4~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {9195#(= main_~p4~0 0)} is VALID [2022-04-08 08:19:45,446 INFO L290 TraceCheckUtils]: 14: Hoare triple {9195#(= main_~p4~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {9195#(= main_~p4~0 0)} is VALID [2022-04-08 08:19:45,446 INFO L290 TraceCheckUtils]: 15: Hoare triple {9195#(= main_~p4~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {9195#(= main_~p4~0 0)} is VALID [2022-04-08 08:19:45,446 INFO L290 TraceCheckUtils]: 16: Hoare triple {9195#(= main_~p4~0 0)} assume !(0 != ~p1~0); {9195#(= main_~p4~0 0)} is VALID [2022-04-08 08:19:45,447 INFO L290 TraceCheckUtils]: 17: Hoare triple {9195#(= main_~p4~0 0)} assume !(0 != ~p2~0); {9195#(= main_~p4~0 0)} is VALID [2022-04-08 08:19:45,447 INFO L290 TraceCheckUtils]: 18: Hoare triple {9195#(= main_~p4~0 0)} assume !(0 != ~p3~0); {9195#(= main_~p4~0 0)} is VALID [2022-04-08 08:19:45,447 INFO L290 TraceCheckUtils]: 19: Hoare triple {9195#(= main_~p4~0 0)} assume 0 != ~p4~0; {9191#false} is VALID [2022-04-08 08:19:45,447 INFO L290 TraceCheckUtils]: 20: Hoare triple {9191#false} assume 1 != ~lk4~0; {9191#false} is VALID [2022-04-08 08:19:45,447 INFO L290 TraceCheckUtils]: 21: Hoare triple {9191#false} assume !false; {9191#false} is VALID [2022-04-08 08:19:45,447 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-08 08:19:45,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:19:45,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004241134] [2022-04-08 08:19:45,448 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004241134] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:19:45,448 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:19:45,448 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:19:45,448 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:19:45,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [178395095] [2022-04-08 08:19:45,448 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [178395095] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:19:45,448 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:19:45,448 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:19:45,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045203087] [2022-04-08 08:19:45,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:19:45,449 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 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-08 08:19:45,449 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:19:45,449 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 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-08 08:19:45,460 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:19:45,460 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:19:45,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:19:45,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:19:45,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:19:45,460 INFO L87 Difference]: Start difference. First operand 297 states and 475 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 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-08 08:19:45,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:19:45,623 INFO L93 Difference]: Finished difference Result 685 states and 1101 transitions. [2022-04-08 08:19:45,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:19:45,623 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 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-08 08:19:45,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:19:45,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 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-08 08:19:45,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 147 transitions. [2022-04-08 08:19:45,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 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-08 08:19:45,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 147 transitions. [2022-04-08 08:19:45,626 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 147 transitions. [2022-04-08 08:19:45,736 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 147 edges. 147 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:19:45,747 INFO L225 Difference]: With dead ends: 685 [2022-04-08 08:19:45,747 INFO L226 Difference]: Without dead ends: 403 [2022-04-08 08:19:45,751 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:19:45,751 INFO L913 BasicCegarLoop]: 78 mSDtfsCounter, 100 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 08:19:45,752 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [100 Valid, 85 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 08:19:45,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2022-04-08 08:19:45,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 401. [2022-04-08 08:19:45,778 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:19:45,779 INFO L82 GeneralOperation]: Start isEquivalent. First operand 403 states. Second operand has 401 states, 397 states have (on average 1.5818639798488665) internal successors, (628), 397 states have internal predecessors, (628), 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-08 08:19:45,780 INFO L74 IsIncluded]: Start isIncluded. First operand 403 states. Second operand has 401 states, 397 states have (on average 1.5818639798488665) internal successors, (628), 397 states have internal predecessors, (628), 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-08 08:19:45,781 INFO L87 Difference]: Start difference. First operand 403 states. Second operand has 401 states, 397 states have (on average 1.5818639798488665) internal successors, (628), 397 states have internal predecessors, (628), 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-08 08:19:45,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:19:45,790 INFO L93 Difference]: Finished difference Result 403 states and 632 transitions. [2022-04-08 08:19:45,790 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 632 transitions. [2022-04-08 08:19:45,790 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:19:45,790 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:19:45,791 INFO L74 IsIncluded]: Start isIncluded. First operand has 401 states, 397 states have (on average 1.5818639798488665) internal successors, (628), 397 states have internal predecessors, (628), 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 403 states. [2022-04-08 08:19:45,792 INFO L87 Difference]: Start difference. First operand has 401 states, 397 states have (on average 1.5818639798488665) internal successors, (628), 397 states have internal predecessors, (628), 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 403 states. [2022-04-08 08:19:45,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:19:45,800 INFO L93 Difference]: Finished difference Result 403 states and 632 transitions. [2022-04-08 08:19:45,800 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 632 transitions. [2022-04-08 08:19:45,801 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:19:45,801 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:19:45,801 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:19:45,801 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:19:45,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 401 states, 397 states have (on average 1.5818639798488665) internal successors, (628), 397 states have internal predecessors, (628), 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-08 08:19:45,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 631 transitions. [2022-04-08 08:19:45,813 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 631 transitions. Word has length 22 [2022-04-08 08:19:45,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:19:45,813 INFO L478 AbstractCegarLoop]: Abstraction has 401 states and 631 transitions. [2022-04-08 08:19:45,813 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 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-08 08:19:45,813 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 401 states and 631 transitions. [2022-04-08 08:19:46,353 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 631 edges. 631 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:19:46,353 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 631 transitions. [2022-04-08 08:19:46,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-08 08:19:46,354 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:19:46,354 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:19:46,354 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-08 08:19:46,354 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:19:46,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:19:46,355 INFO L85 PathProgramCache]: Analyzing trace with hash 1022239949, now seen corresponding path program 1 times [2022-04-08 08:19:46,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:19:46,355 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [358333436] [2022-04-08 08:19:46,355 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:19:46,355 INFO L85 PathProgramCache]: Analyzing trace with hash 1022239949, now seen corresponding path program 2 times [2022-04-08 08:19:46,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:19:46,355 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110508155] [2022-04-08 08:19:46,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:19:46,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:19:46,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:19:46,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:19:46,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:19:46,419 INFO L290 TraceCheckUtils]: 0: Hoare triple {12186#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {12180#true} is VALID [2022-04-08 08:19:46,420 INFO L290 TraceCheckUtils]: 1: Hoare triple {12180#true} assume true; {12180#true} is VALID [2022-04-08 08:19:46,420 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12180#true} {12180#true} #166#return; {12180#true} is VALID [2022-04-08 08:19:46,427 INFO L272 TraceCheckUtils]: 0: Hoare triple {12180#true} call ULTIMATE.init(); {12186#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:19:46,427 INFO L290 TraceCheckUtils]: 1: Hoare triple {12186#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {12180#true} is VALID [2022-04-08 08:19:46,427 INFO L290 TraceCheckUtils]: 2: Hoare triple {12180#true} assume true; {12180#true} is VALID [2022-04-08 08:19:46,427 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12180#true} {12180#true} #166#return; {12180#true} is VALID [2022-04-08 08:19:46,428 INFO L272 TraceCheckUtils]: 4: Hoare triple {12180#true} call #t~ret13 := main(); {12180#true} is VALID [2022-04-08 08:19:46,428 INFO L290 TraceCheckUtils]: 5: Hoare triple {12180#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;havoc ~cond~0; {12180#true} is VALID [2022-04-08 08:19:46,428 INFO L290 TraceCheckUtils]: 6: Hoare triple {12180#true} assume !false;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~cond~0 := #t~nondet12;havoc #t~nondet12; {12180#true} is VALID [2022-04-08 08:19:46,428 INFO L290 TraceCheckUtils]: 7: Hoare triple {12180#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0; {12180#true} is VALID [2022-04-08 08:19:46,428 INFO L290 TraceCheckUtils]: 8: Hoare triple {12180#true} assume !(0 != ~p1~0); {12180#true} is VALID [2022-04-08 08:19:46,428 INFO L290 TraceCheckUtils]: 9: Hoare triple {12180#true} assume !(0 != ~p2~0); {12180#true} is VALID [2022-04-08 08:19:46,428 INFO L290 TraceCheckUtils]: 10: Hoare triple {12180#true} assume !(0 != ~p3~0); {12180#true} is VALID [2022-04-08 08:19:46,429 INFO L290 TraceCheckUtils]: 11: Hoare triple {12180#true} assume 0 != ~p4~0;~lk4~0 := 1; {12185#(not (= main_~p4~0 0))} is VALID [2022-04-08 08:19:46,429 INFO L290 TraceCheckUtils]: 12: Hoare triple {12185#(not (= main_~p4~0 0))} assume 0 != ~p5~0;~lk5~0 := 1; {12185#(not (= main_~p4~0 0))} is VALID [2022-04-08 08:19:46,429 INFO L290 TraceCheckUtils]: 13: Hoare triple {12185#(not (= main_~p4~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {12185#(not (= main_~p4~0 0))} is VALID [2022-04-08 08:19:46,430 INFO L290 TraceCheckUtils]: 14: Hoare triple {12185#(not (= main_~p4~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {12185#(not (= main_~p4~0 0))} is VALID [2022-04-08 08:19:46,430 INFO L290 TraceCheckUtils]: 15: Hoare triple {12185#(not (= main_~p4~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {12185#(not (= main_~p4~0 0))} is VALID [2022-04-08 08:19:46,435 INFO L290 TraceCheckUtils]: 16: Hoare triple {12185#(not (= main_~p4~0 0))} assume !(0 != ~p1~0); {12185#(not (= main_~p4~0 0))} is VALID [2022-04-08 08:19:46,436 INFO L290 TraceCheckUtils]: 17: Hoare triple {12185#(not (= main_~p4~0 0))} assume !(0 != ~p2~0); {12185#(not (= main_~p4~0 0))} is VALID [2022-04-08 08:19:46,436 INFO L290 TraceCheckUtils]: 18: Hoare triple {12185#(not (= main_~p4~0 0))} assume !(0 != ~p3~0); {12185#(not (= main_~p4~0 0))} is VALID [2022-04-08 08:19:46,437 INFO L290 TraceCheckUtils]: 19: Hoare triple {12185#(not (= main_~p4~0 0))} assume !(0 != ~p4~0); {12181#false} is VALID [2022-04-08 08:19:46,437 INFO L290 TraceCheckUtils]: 20: Hoare triple {12181#false} assume 0 != ~p5~0; {12181#false} is VALID [2022-04-08 08:19:46,437 INFO L290 TraceCheckUtils]: 21: Hoare triple {12181#false} assume 1 != ~lk5~0; {12181#false} is VALID [2022-04-08 08:19:46,437 INFO L290 TraceCheckUtils]: 22: Hoare triple {12181#false} assume !false; {12181#false} is VALID [2022-04-08 08:19:46,437 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-08 08:19:46,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:19:46,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110508155] [2022-04-08 08:19:46,437 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110508155] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:19:46,437 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:19:46,437 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:19:46,438 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:19:46,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [358333436] [2022-04-08 08:19:46,438 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [358333436] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:19:46,438 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:19:46,438 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:19:46,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200748091] [2022-04-08 08:19:46,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:19:46,438 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 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 23 [2022-04-08 08:19:46,438 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:19:46,438 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 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-08 08:19:46,450 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:19:46,450 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:19:46,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:19:46,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:19:46,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:19:46,451 INFO L87 Difference]: Start difference. First operand 401 states and 631 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 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-08 08:19:46,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:19:46,594 INFO L93 Difference]: Finished difference Result 601 states and 941 transitions. [2022-04-08 08:19:46,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:19:46,594 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 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 23 [2022-04-08 08:19:46,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:19:46,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 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-08 08:19:46,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 142 transitions. [2022-04-08 08:19:46,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 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-08 08:19:46,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 142 transitions. [2022-04-08 08:19:46,596 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 142 transitions. [2022-04-08 08:19:46,682 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 142 edges. 142 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:19:46,689 INFO L225 Difference]: With dead ends: 601 [2022-04-08 08:19:46,689 INFO L226 Difference]: Without dead ends: 411 [2022-04-08 08:19:46,690 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:19:46,690 INFO L913 BasicCegarLoop]: 77 mSDtfsCounter, 102 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 08:19:46,690 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [102 Valid, 84 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 08:19:46,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2022-04-08 08:19:46,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 409. [2022-04-08 08:19:46,711 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:19:46,711 INFO L82 GeneralOperation]: Start isEquivalent. First operand 411 states. Second operand has 409 states, 405 states have (on average 1.5506172839506174) internal successors, (628), 405 states have internal predecessors, (628), 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-08 08:19:46,712 INFO L74 IsIncluded]: Start isIncluded. First operand 411 states. Second operand has 409 states, 405 states have (on average 1.5506172839506174) internal successors, (628), 405 states have internal predecessors, (628), 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-08 08:19:46,712 INFO L87 Difference]: Start difference. First operand 411 states. Second operand has 409 states, 405 states have (on average 1.5506172839506174) internal successors, (628), 405 states have internal predecessors, (628), 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-08 08:19:46,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:19:46,720 INFO L93 Difference]: Finished difference Result 411 states and 632 transitions. [2022-04-08 08:19:46,720 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 632 transitions. [2022-04-08 08:19:46,721 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:19:46,721 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:19:46,721 INFO L74 IsIncluded]: Start isIncluded. First operand has 409 states, 405 states have (on average 1.5506172839506174) internal successors, (628), 405 states have internal predecessors, (628), 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 411 states. [2022-04-08 08:19:46,722 INFO L87 Difference]: Start difference. First operand has 409 states, 405 states have (on average 1.5506172839506174) internal successors, (628), 405 states have internal predecessors, (628), 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 411 states. [2022-04-08 08:19:46,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:19:46,730 INFO L93 Difference]: Finished difference Result 411 states and 632 transitions. [2022-04-08 08:19:46,730 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 632 transitions. [2022-04-08 08:19:46,731 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:19:46,731 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:19:46,731 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:19:46,731 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:19:46,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 409 states, 405 states have (on average 1.5506172839506174) internal successors, (628), 405 states have internal predecessors, (628), 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-08 08:19:46,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 631 transitions. [2022-04-08 08:19:46,741 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 631 transitions. Word has length 23 [2022-04-08 08:19:46,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:19:46,741 INFO L478 AbstractCegarLoop]: Abstraction has 409 states and 631 transitions. [2022-04-08 08:19:46,741 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 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-08 08:19:46,741 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 409 states and 631 transitions. [2022-04-08 08:19:47,293 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 631 edges. 631 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:19:47,293 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 631 transitions. [2022-04-08 08:19:47,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-08 08:19:47,299 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:19:47,299 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:19:47,300 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-08 08:19:47,300 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:19:47,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:19:47,300 INFO L85 PathProgramCache]: Analyzing trace with hash 1280405387, now seen corresponding path program 1 times [2022-04-08 08:19:47,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:19:47,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1553649653] [2022-04-08 08:19:47,300 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:19:47,300 INFO L85 PathProgramCache]: Analyzing trace with hash 1280405387, now seen corresponding path program 2 times [2022-04-08 08:19:47,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:19:47,301 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2147275746] [2022-04-08 08:19:47,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:19:47,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:19:47,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:19:47,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:19:47,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:19:47,344 INFO L290 TraceCheckUtils]: 0: Hoare triple {15040#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {15034#true} is VALID [2022-04-08 08:19:47,344 INFO L290 TraceCheckUtils]: 1: Hoare triple {15034#true} assume true; {15034#true} is VALID [2022-04-08 08:19:47,345 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {15034#true} {15034#true} #166#return; {15034#true} is VALID [2022-04-08 08:19:47,345 INFO L272 TraceCheckUtils]: 0: Hoare triple {15034#true} call ULTIMATE.init(); {15040#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:19:47,345 INFO L290 TraceCheckUtils]: 1: Hoare triple {15040#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {15034#true} is VALID [2022-04-08 08:19:47,345 INFO L290 TraceCheckUtils]: 2: Hoare triple {15034#true} assume true; {15034#true} is VALID [2022-04-08 08:19:47,345 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15034#true} {15034#true} #166#return; {15034#true} is VALID [2022-04-08 08:19:47,345 INFO L272 TraceCheckUtils]: 4: Hoare triple {15034#true} call #t~ret13 := main(); {15034#true} is VALID [2022-04-08 08:19:47,345 INFO L290 TraceCheckUtils]: 5: Hoare triple {15034#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;havoc ~cond~0; {15034#true} is VALID [2022-04-08 08:19:47,345 INFO L290 TraceCheckUtils]: 6: Hoare triple {15034#true} assume !false;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~cond~0 := #t~nondet12;havoc #t~nondet12; {15034#true} is VALID [2022-04-08 08:19:47,346 INFO L290 TraceCheckUtils]: 7: Hoare triple {15034#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0; {15034#true} is VALID [2022-04-08 08:19:47,346 INFO L290 TraceCheckUtils]: 8: Hoare triple {15034#true} assume !(0 != ~p1~0); {15034#true} is VALID [2022-04-08 08:19:47,346 INFO L290 TraceCheckUtils]: 9: Hoare triple {15034#true} assume !(0 != ~p2~0); {15034#true} is VALID [2022-04-08 08:19:47,346 INFO L290 TraceCheckUtils]: 10: Hoare triple {15034#true} assume !(0 != ~p3~0); {15034#true} is VALID [2022-04-08 08:19:47,346 INFO L290 TraceCheckUtils]: 11: Hoare triple {15034#true} assume !(0 != ~p4~0); {15034#true} is VALID [2022-04-08 08:19:47,346 INFO L290 TraceCheckUtils]: 12: Hoare triple {15034#true} assume 0 != ~p5~0;~lk5~0 := 1; {15039#(= main_~lk5~0 1)} is VALID [2022-04-08 08:19:47,346 INFO L290 TraceCheckUtils]: 13: Hoare triple {15039#(= main_~lk5~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {15039#(= main_~lk5~0 1)} is VALID [2022-04-08 08:19:47,347 INFO L290 TraceCheckUtils]: 14: Hoare triple {15039#(= main_~lk5~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {15039#(= main_~lk5~0 1)} is VALID [2022-04-08 08:19:47,347 INFO L290 TraceCheckUtils]: 15: Hoare triple {15039#(= main_~lk5~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {15039#(= main_~lk5~0 1)} is VALID [2022-04-08 08:19:47,347 INFO L290 TraceCheckUtils]: 16: Hoare triple {15039#(= main_~lk5~0 1)} assume !(0 != ~p1~0); {15039#(= main_~lk5~0 1)} is VALID [2022-04-08 08:19:47,347 INFO L290 TraceCheckUtils]: 17: Hoare triple {15039#(= main_~lk5~0 1)} assume !(0 != ~p2~0); {15039#(= main_~lk5~0 1)} is VALID [2022-04-08 08:19:47,348 INFO L290 TraceCheckUtils]: 18: Hoare triple {15039#(= main_~lk5~0 1)} assume !(0 != ~p3~0); {15039#(= main_~lk5~0 1)} is VALID [2022-04-08 08:19:47,348 INFO L290 TraceCheckUtils]: 19: Hoare triple {15039#(= main_~lk5~0 1)} assume !(0 != ~p4~0); {15039#(= main_~lk5~0 1)} is VALID [2022-04-08 08:19:47,348 INFO L290 TraceCheckUtils]: 20: Hoare triple {15039#(= main_~lk5~0 1)} assume 0 != ~p5~0; {15039#(= main_~lk5~0 1)} is VALID [2022-04-08 08:19:47,348 INFO L290 TraceCheckUtils]: 21: Hoare triple {15039#(= main_~lk5~0 1)} assume 1 != ~lk5~0; {15035#false} is VALID [2022-04-08 08:19:47,349 INFO L290 TraceCheckUtils]: 22: Hoare triple {15035#false} assume !false; {15035#false} is VALID [2022-04-08 08:19:47,350 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-08 08:19:47,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:19:47,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2147275746] [2022-04-08 08:19:47,350 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2147275746] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:19:47,350 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:19:47,350 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:19:47,351 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:19:47,351 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1553649653] [2022-04-08 08:19:47,351 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1553649653] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:19:47,351 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:19:47,351 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:19:47,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245041544] [2022-04-08 08:19:47,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:19:47,351 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 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 23 [2022-04-08 08:19:47,351 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:19:47,351 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 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-08 08:19:47,364 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:19:47,364 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:19:47,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:19:47,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:19:47,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:19:47,365 INFO L87 Difference]: Start difference. First operand 409 states and 631 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 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-08 08:19:47,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:19:47,530 INFO L93 Difference]: Finished difference Result 717 states and 1121 transitions. [2022-04-08 08:19:47,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:19:47,530 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 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 23 [2022-04-08 08:19:47,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:19:47,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 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-08 08:19:47,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 91 transitions. [2022-04-08 08:19:47,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 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-08 08:19:47,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 91 transitions. [2022-04-08 08:19:47,532 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 91 transitions. [2022-04-08 08:19:47,585 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:19:47,605 INFO L225 Difference]: With dead ends: 717 [2022-04-08 08:19:47,606 INFO L226 Difference]: Without dead ends: 715 [2022-04-08 08:19:47,606 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:19:47,606 INFO L913 BasicCegarLoop]: 55 mSDtfsCounter, 106 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 08:19:47,607 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [106 Valid, 62 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 08:19:47,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 715 states. [2022-04-08 08:19:47,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 715 to 585. [2022-04-08 08:19:47,639 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:19:47,641 INFO L82 GeneralOperation]: Start isEquivalent. First operand 715 states. Second operand has 585 states, 581 states have (on average 1.5077452667814113) internal successors, (876), 581 states have internal predecessors, (876), 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-08 08:19:47,642 INFO L74 IsIncluded]: Start isIncluded. First operand 715 states. Second operand has 585 states, 581 states have (on average 1.5077452667814113) internal successors, (876), 581 states have internal predecessors, (876), 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-08 08:19:47,643 INFO L87 Difference]: Start difference. First operand 715 states. Second operand has 585 states, 581 states have (on average 1.5077452667814113) internal successors, (876), 581 states have internal predecessors, (876), 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-08 08:19:47,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:19:47,662 INFO L93 Difference]: Finished difference Result 715 states and 1104 transitions. [2022-04-08 08:19:47,662 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 1104 transitions. [2022-04-08 08:19:47,668 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:19:47,668 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:19:47,669 INFO L74 IsIncluded]: Start isIncluded. First operand has 585 states, 581 states have (on average 1.5077452667814113) internal successors, (876), 581 states have internal predecessors, (876), 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 715 states. [2022-04-08 08:19:47,669 INFO L87 Difference]: Start difference. First operand has 585 states, 581 states have (on average 1.5077452667814113) internal successors, (876), 581 states have internal predecessors, (876), 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 715 states. [2022-04-08 08:19:47,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:19:47,688 INFO L93 Difference]: Finished difference Result 715 states and 1104 transitions. [2022-04-08 08:19:47,688 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 1104 transitions. [2022-04-08 08:19:47,689 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:19:47,689 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:19:47,689 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:19:47,689 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:19:47,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 585 states, 581 states have (on average 1.5077452667814113) internal successors, (876), 581 states have internal predecessors, (876), 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-08 08:19:47,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 879 transitions. [2022-04-08 08:19:47,707 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 879 transitions. Word has length 23 [2022-04-08 08:19:47,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:19:47,707 INFO L478 AbstractCegarLoop]: Abstraction has 585 states and 879 transitions. [2022-04-08 08:19:47,708 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 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-08 08:19:47,708 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 585 states and 879 transitions. [2022-04-08 08:19:48,470 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 879 edges. 879 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:19:48,470 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 879 transitions. [2022-04-08 08:19:48,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-08 08:19:48,471 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:19:48,471 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:19:48,471 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-08 08:19:48,471 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:19:48,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:19:48,472 INFO L85 PathProgramCache]: Analyzing trace with hash 1981469965, now seen corresponding path program 1 times [2022-04-08 08:19:48,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:19:48,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [432235512] [2022-04-08 08:19:48,472 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:19:48,472 INFO L85 PathProgramCache]: Analyzing trace with hash 1981469965, now seen corresponding path program 2 times [2022-04-08 08:19:48,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:19:48,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373405225] [2022-04-08 08:19:48,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:19:48,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:19:48,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:19:48,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:19:48,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:19:48,526 INFO L290 TraceCheckUtils]: 0: Hoare triple {19086#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {19080#true} is VALID [2022-04-08 08:19:48,526 INFO L290 TraceCheckUtils]: 1: Hoare triple {19080#true} assume true; {19080#true} is VALID [2022-04-08 08:19:48,526 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {19080#true} {19080#true} #166#return; {19080#true} is VALID [2022-04-08 08:19:48,527 INFO L272 TraceCheckUtils]: 0: Hoare triple {19080#true} call ULTIMATE.init(); {19086#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:19:48,527 INFO L290 TraceCheckUtils]: 1: Hoare triple {19086#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {19080#true} is VALID [2022-04-08 08:19:48,527 INFO L290 TraceCheckUtils]: 2: Hoare triple {19080#true} assume true; {19080#true} is VALID [2022-04-08 08:19:48,527 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19080#true} {19080#true} #166#return; {19080#true} is VALID [2022-04-08 08:19:48,527 INFO L272 TraceCheckUtils]: 4: Hoare triple {19080#true} call #t~ret13 := main(); {19080#true} is VALID [2022-04-08 08:19:48,527 INFO L290 TraceCheckUtils]: 5: Hoare triple {19080#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;havoc ~cond~0; {19080#true} is VALID [2022-04-08 08:19:48,528 INFO L290 TraceCheckUtils]: 6: Hoare triple {19080#true} assume !false;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~cond~0 := #t~nondet12;havoc #t~nondet12; {19080#true} is VALID [2022-04-08 08:19:48,528 INFO L290 TraceCheckUtils]: 7: Hoare triple {19080#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0; {19080#true} is VALID [2022-04-08 08:19:48,529 INFO L290 TraceCheckUtils]: 8: Hoare triple {19080#true} assume !(0 != ~p1~0); {19080#true} is VALID [2022-04-08 08:19:48,529 INFO L290 TraceCheckUtils]: 9: Hoare triple {19080#true} assume !(0 != ~p2~0); {19080#true} is VALID [2022-04-08 08:19:48,529 INFO L290 TraceCheckUtils]: 10: Hoare triple {19080#true} assume !(0 != ~p3~0); {19080#true} is VALID [2022-04-08 08:19:48,529 INFO L290 TraceCheckUtils]: 11: Hoare triple {19080#true} assume !(0 != ~p4~0); {19080#true} is VALID [2022-04-08 08:19:48,529 INFO L290 TraceCheckUtils]: 12: Hoare triple {19080#true} assume !(0 != ~p5~0); {19085#(= main_~p5~0 0)} is VALID [2022-04-08 08:19:48,529 INFO L290 TraceCheckUtils]: 13: Hoare triple {19085#(= main_~p5~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {19085#(= main_~p5~0 0)} is VALID [2022-04-08 08:19:48,530 INFO L290 TraceCheckUtils]: 14: Hoare triple {19085#(= main_~p5~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {19085#(= main_~p5~0 0)} is VALID [2022-04-08 08:19:48,530 INFO L290 TraceCheckUtils]: 15: Hoare triple {19085#(= main_~p5~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {19085#(= main_~p5~0 0)} is VALID [2022-04-08 08:19:48,531 INFO L290 TraceCheckUtils]: 16: Hoare triple {19085#(= main_~p5~0 0)} assume !(0 != ~p1~0); {19085#(= main_~p5~0 0)} is VALID [2022-04-08 08:19:48,531 INFO L290 TraceCheckUtils]: 17: Hoare triple {19085#(= main_~p5~0 0)} assume !(0 != ~p2~0); {19085#(= main_~p5~0 0)} is VALID [2022-04-08 08:19:48,533 INFO L290 TraceCheckUtils]: 18: Hoare triple {19085#(= main_~p5~0 0)} assume !(0 != ~p3~0); {19085#(= main_~p5~0 0)} is VALID [2022-04-08 08:19:48,534 INFO L290 TraceCheckUtils]: 19: Hoare triple {19085#(= main_~p5~0 0)} assume !(0 != ~p4~0); {19085#(= main_~p5~0 0)} is VALID [2022-04-08 08:19:48,534 INFO L290 TraceCheckUtils]: 20: Hoare triple {19085#(= main_~p5~0 0)} assume 0 != ~p5~0; {19081#false} is VALID [2022-04-08 08:19:48,535 INFO L290 TraceCheckUtils]: 21: Hoare triple {19081#false} assume 1 != ~lk5~0; {19081#false} is VALID [2022-04-08 08:19:48,535 INFO L290 TraceCheckUtils]: 22: Hoare triple {19081#false} assume !false; {19081#false} is VALID [2022-04-08 08:19:48,535 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-08 08:19:48,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:19:48,535 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373405225] [2022-04-08 08:19:48,535 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373405225] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:19:48,535 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:19:48,535 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:19:48,535 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:19:48,535 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [432235512] [2022-04-08 08:19:48,535 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [432235512] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:19:48,536 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:19:48,536 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:19:48,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909196735] [2022-04-08 08:19:48,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:19:48,537 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 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 23 [2022-04-08 08:19:48,537 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:19:48,537 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 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-08 08:19:48,547 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:19:48,547 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:19:48,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:19:48,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:19:48,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:19:48,548 INFO L87 Difference]: Start difference. First operand 585 states and 879 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 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-08 08:19:48,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:19:48,797 INFO L93 Difference]: Finished difference Result 1341 states and 2017 transitions. [2022-04-08 08:19:48,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:19:48,797 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 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 23 [2022-04-08 08:19:48,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:19:48,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 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-08 08:19:48,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 144 transitions. [2022-04-08 08:19:48,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 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-08 08:19:48,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 144 transitions. [2022-04-08 08:19:48,799 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 144 transitions. [2022-04-08 08:19:48,880 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 144 edges. 144 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:19:48,905 INFO L225 Difference]: With dead ends: 1341 [2022-04-08 08:19:48,905 INFO L226 Difference]: Without dead ends: 779 [2022-04-08 08:19:48,906 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:19:48,907 INFO L913 BasicCegarLoop]: 80 mSDtfsCounter, 94 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 08:19:48,908 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [94 Valid, 87 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 08:19:48,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 779 states. [2022-04-08 08:19:48,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 779 to 777. [2022-04-08 08:19:48,952 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:19:48,954 INFO L82 GeneralOperation]: Start isEquivalent. First operand 779 states. Second operand has 777 states, 773 states have (on average 1.4747736093143597) internal successors, (1140), 773 states have internal predecessors, (1140), 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-08 08:19:48,954 INFO L74 IsIncluded]: Start isIncluded. First operand 779 states. Second operand has 777 states, 773 states have (on average 1.4747736093143597) internal successors, (1140), 773 states have internal predecessors, (1140), 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-08 08:19:48,955 INFO L87 Difference]: Start difference. First operand 779 states. Second operand has 777 states, 773 states have (on average 1.4747736093143597) internal successors, (1140), 773 states have internal predecessors, (1140), 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-08 08:19:48,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:19:48,978 INFO L93 Difference]: Finished difference Result 779 states and 1144 transitions. [2022-04-08 08:19:48,978 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 1144 transitions. [2022-04-08 08:19:48,979 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:19:48,979 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:19:48,980 INFO L74 IsIncluded]: Start isIncluded. First operand has 777 states, 773 states have (on average 1.4747736093143597) internal successors, (1140), 773 states have internal predecessors, (1140), 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 779 states. [2022-04-08 08:19:48,981 INFO L87 Difference]: Start difference. First operand has 777 states, 773 states have (on average 1.4747736093143597) internal successors, (1140), 773 states have internal predecessors, (1140), 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 779 states. [2022-04-08 08:19:49,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:19:49,006 INFO L93 Difference]: Finished difference Result 779 states and 1144 transitions. [2022-04-08 08:19:49,006 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 1144 transitions. [2022-04-08 08:19:49,006 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:19:49,007 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:19:49,007 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:19:49,007 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:19:49,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 777 states, 773 states have (on average 1.4747736093143597) internal successors, (1140), 773 states have internal predecessors, (1140), 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-08 08:19:49,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 1143 transitions. [2022-04-08 08:19:49,039 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 1143 transitions. Word has length 23 [2022-04-08 08:19:49,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:19:49,039 INFO L478 AbstractCegarLoop]: Abstraction has 777 states and 1143 transitions. [2022-04-08 08:19:49,042 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 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-08 08:19:49,042 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 777 states and 1143 transitions. [2022-04-08 08:19:50,065 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1143 edges. 1143 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:19:50,065 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 1143 transitions. [2022-04-08 08:19:50,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-08 08:19:50,066 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:19:50,066 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:19:50,067 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-08 08:19:50,067 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:19:50,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:19:50,067 INFO L85 PathProgramCache]: Analyzing trace with hash 1038076728, now seen corresponding path program 1 times [2022-04-08 08:19:50,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:19:50,067 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [918003339] [2022-04-08 08:19:50,067 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:19:50,067 INFO L85 PathProgramCache]: Analyzing trace with hash 1038076728, now seen corresponding path program 2 times [2022-04-08 08:19:50,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:19:50,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342811855] [2022-04-08 08:19:50,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:19:50,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:19:50,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:19:50,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:19:50,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:19:50,117 INFO L290 TraceCheckUtils]: 0: Hoare triple {24892#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {24886#true} is VALID [2022-04-08 08:19:50,117 INFO L290 TraceCheckUtils]: 1: Hoare triple {24886#true} assume true; {24886#true} is VALID [2022-04-08 08:19:50,117 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {24886#true} {24886#true} #166#return; {24886#true} is VALID [2022-04-08 08:19:50,118 INFO L272 TraceCheckUtils]: 0: Hoare triple {24886#true} call ULTIMATE.init(); {24892#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:19:50,118 INFO L290 TraceCheckUtils]: 1: Hoare triple {24892#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {24886#true} is VALID [2022-04-08 08:19:50,118 INFO L290 TraceCheckUtils]: 2: Hoare triple {24886#true} assume true; {24886#true} is VALID [2022-04-08 08:19:50,118 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24886#true} {24886#true} #166#return; {24886#true} is VALID [2022-04-08 08:19:50,118 INFO L272 TraceCheckUtils]: 4: Hoare triple {24886#true} call #t~ret13 := main(); {24886#true} is VALID [2022-04-08 08:19:50,118 INFO L290 TraceCheckUtils]: 5: Hoare triple {24886#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;havoc ~cond~0; {24886#true} is VALID [2022-04-08 08:19:50,118 INFO L290 TraceCheckUtils]: 6: Hoare triple {24886#true} assume !false;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~cond~0 := #t~nondet12;havoc #t~nondet12; {24886#true} is VALID [2022-04-08 08:19:50,119 INFO L290 TraceCheckUtils]: 7: Hoare triple {24886#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0; {24886#true} is VALID [2022-04-08 08:19:50,119 INFO L290 TraceCheckUtils]: 8: Hoare triple {24886#true} assume !(0 != ~p1~0); {24886#true} is VALID [2022-04-08 08:19:50,119 INFO L290 TraceCheckUtils]: 9: Hoare triple {24886#true} assume !(0 != ~p2~0); {24886#true} is VALID [2022-04-08 08:19:50,119 INFO L290 TraceCheckUtils]: 10: Hoare triple {24886#true} assume !(0 != ~p3~0); {24886#true} is VALID [2022-04-08 08:19:50,119 INFO L290 TraceCheckUtils]: 11: Hoare triple {24886#true} assume !(0 != ~p4~0); {24886#true} is VALID [2022-04-08 08:19:50,119 INFO L290 TraceCheckUtils]: 12: Hoare triple {24886#true} assume 0 != ~p5~0;~lk5~0 := 1; {24891#(not (= main_~p5~0 0))} is VALID [2022-04-08 08:19:50,119 INFO L290 TraceCheckUtils]: 13: Hoare triple {24891#(not (= main_~p5~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {24891#(not (= main_~p5~0 0))} is VALID [2022-04-08 08:19:50,120 INFO L290 TraceCheckUtils]: 14: Hoare triple {24891#(not (= main_~p5~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {24891#(not (= main_~p5~0 0))} is VALID [2022-04-08 08:19:50,120 INFO L290 TraceCheckUtils]: 15: Hoare triple {24891#(not (= main_~p5~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {24891#(not (= main_~p5~0 0))} is VALID [2022-04-08 08:19:50,120 INFO L290 TraceCheckUtils]: 16: Hoare triple {24891#(not (= main_~p5~0 0))} assume !(0 != ~p1~0); {24891#(not (= main_~p5~0 0))} is VALID [2022-04-08 08:19:50,120 INFO L290 TraceCheckUtils]: 17: Hoare triple {24891#(not (= main_~p5~0 0))} assume !(0 != ~p2~0); {24891#(not (= main_~p5~0 0))} is VALID [2022-04-08 08:19:50,121 INFO L290 TraceCheckUtils]: 18: Hoare triple {24891#(not (= main_~p5~0 0))} assume !(0 != ~p3~0); {24891#(not (= main_~p5~0 0))} is VALID [2022-04-08 08:19:50,121 INFO L290 TraceCheckUtils]: 19: Hoare triple {24891#(not (= main_~p5~0 0))} assume !(0 != ~p4~0); {24891#(not (= main_~p5~0 0))} is VALID [2022-04-08 08:19:50,121 INFO L290 TraceCheckUtils]: 20: Hoare triple {24891#(not (= main_~p5~0 0))} assume !(0 != ~p5~0); {24887#false} is VALID [2022-04-08 08:19:50,121 INFO L290 TraceCheckUtils]: 21: Hoare triple {24887#false} assume 0 != ~p6~0; {24887#false} is VALID [2022-04-08 08:19:50,121 INFO L290 TraceCheckUtils]: 22: Hoare triple {24887#false} assume 1 != ~lk6~0; {24887#false} is VALID [2022-04-08 08:19:50,121 INFO L290 TraceCheckUtils]: 23: Hoare triple {24887#false} assume !false; {24887#false} is VALID [2022-04-08 08:19:50,122 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-08 08:19:50,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:19:50,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342811855] [2022-04-08 08:19:50,122 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342811855] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:19:50,122 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:19:50,122 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:19:50,122 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:19:50,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [918003339] [2022-04-08 08:19:50,122 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [918003339] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:19:50,122 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:19:50,122 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:19:50,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991709388] [2022-04-08 08:19:50,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:19:50,123 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 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 24 [2022-04-08 08:19:50,123 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:19:50,123 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 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-08 08:19:50,135 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:19:50,135 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:19:50,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:19:50,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:19:50,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:19:50,136 INFO L87 Difference]: Start difference. First operand 777 states and 1143 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 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-08 08:19:50,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:19:50,368 INFO L93 Difference]: Finished difference Result 1165 states and 1705 transitions. [2022-04-08 08:19:50,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:19:50,369 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 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 24 [2022-04-08 08:19:50,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:19:50,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 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-08 08:19:50,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 139 transitions. [2022-04-08 08:19:50,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 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-08 08:19:50,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 139 transitions. [2022-04-08 08:19:50,371 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 139 transitions. [2022-04-08 08:19:50,449 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 139 edges. 139 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:19:50,477 INFO L225 Difference]: With dead ends: 1165 [2022-04-08 08:19:50,477 INFO L226 Difference]: Without dead ends: 795 [2022-04-08 08:19:50,478 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:19:50,478 INFO L913 BasicCegarLoop]: 74 mSDtfsCounter, 101 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 08:19:50,478 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [101 Valid, 81 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 08:19:50,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 795 states. [2022-04-08 08:19:50,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 795 to 793. [2022-04-08 08:19:50,526 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:19:50,527 INFO L82 GeneralOperation]: Start isEquivalent. First operand 795 states. Second operand has 793 states, 789 states have (on average 1.4448669201520912) internal successors, (1140), 789 states have internal predecessors, (1140), 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-08 08:19:50,528 INFO L74 IsIncluded]: Start isIncluded. First operand 795 states. Second operand has 793 states, 789 states have (on average 1.4448669201520912) internal successors, (1140), 789 states have internal predecessors, (1140), 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-08 08:19:50,528 INFO L87 Difference]: Start difference. First operand 795 states. Second operand has 793 states, 789 states have (on average 1.4448669201520912) internal successors, (1140), 789 states have internal predecessors, (1140), 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-08 08:19:50,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:19:50,557 INFO L93 Difference]: Finished difference Result 795 states and 1144 transitions. [2022-04-08 08:19:50,557 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 1144 transitions. [2022-04-08 08:19:50,558 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:19:50,558 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:19:50,559 INFO L74 IsIncluded]: Start isIncluded. First operand has 793 states, 789 states have (on average 1.4448669201520912) internal successors, (1140), 789 states have internal predecessors, (1140), 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 795 states. [2022-04-08 08:19:50,560 INFO L87 Difference]: Start difference. First operand has 793 states, 789 states have (on average 1.4448669201520912) internal successors, (1140), 789 states have internal predecessors, (1140), 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 795 states. [2022-04-08 08:19:50,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:19:50,584 INFO L93 Difference]: Finished difference Result 795 states and 1144 transitions. [2022-04-08 08:19:50,584 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 1144 transitions. [2022-04-08 08:19:50,585 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:19:50,585 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:19:50,585 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:19:50,585 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:19:50,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 793 states, 789 states have (on average 1.4448669201520912) internal successors, (1140), 789 states have internal predecessors, (1140), 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-08 08:19:50,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 1143 transitions. [2022-04-08 08:19:50,618 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 1143 transitions. Word has length 24 [2022-04-08 08:19:50,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:19:50,619 INFO L478 AbstractCegarLoop]: Abstraction has 793 states and 1143 transitions. [2022-04-08 08:19:50,619 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 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-08 08:19:50,619 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 793 states and 1143 transitions. [2022-04-08 08:19:51,640 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1143 edges. 1143 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:19:51,641 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 1143 transitions. [2022-04-08 08:19:51,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-08 08:19:51,641 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:19:51,641 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:19:51,642 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-08 08:19:51,642 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:19:51,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:19:51,642 INFO L85 PathProgramCache]: Analyzing trace with hash 1296242166, now seen corresponding path program 1 times [2022-04-08 08:19:51,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:19:51,642 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [761500127] [2022-04-08 08:19:51,655 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:19:51,655 INFO L85 PathProgramCache]: Analyzing trace with hash 1296242166, now seen corresponding path program 2 times [2022-04-08 08:19:51,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:19:51,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953910641] [2022-04-08 08:19:51,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:19:51,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:19:51,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:19:51,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:19:51,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:19:51,696 INFO L290 TraceCheckUtils]: 0: Hoare triple {30410#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {30404#true} is VALID [2022-04-08 08:19:51,696 INFO L290 TraceCheckUtils]: 1: Hoare triple {30404#true} assume true; {30404#true} is VALID [2022-04-08 08:19:51,696 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {30404#true} {30404#true} #166#return; {30404#true} is VALID [2022-04-08 08:19:51,696 INFO L272 TraceCheckUtils]: 0: Hoare triple {30404#true} call ULTIMATE.init(); {30410#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:19:51,696 INFO L290 TraceCheckUtils]: 1: Hoare triple {30410#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {30404#true} is VALID [2022-04-08 08:19:51,696 INFO L290 TraceCheckUtils]: 2: Hoare triple {30404#true} assume true; {30404#true} is VALID [2022-04-08 08:19:51,697 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30404#true} {30404#true} #166#return; {30404#true} is VALID [2022-04-08 08:19:51,697 INFO L272 TraceCheckUtils]: 4: Hoare triple {30404#true} call #t~ret13 := main(); {30404#true} is VALID [2022-04-08 08:19:51,697 INFO L290 TraceCheckUtils]: 5: Hoare triple {30404#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;havoc ~cond~0; {30404#true} is VALID [2022-04-08 08:19:51,697 INFO L290 TraceCheckUtils]: 6: Hoare triple {30404#true} assume !false;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~cond~0 := #t~nondet12;havoc #t~nondet12; {30404#true} is VALID [2022-04-08 08:19:51,697 INFO L290 TraceCheckUtils]: 7: Hoare triple {30404#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0; {30404#true} is VALID [2022-04-08 08:19:51,697 INFO L290 TraceCheckUtils]: 8: Hoare triple {30404#true} assume !(0 != ~p1~0); {30404#true} is VALID [2022-04-08 08:19:51,697 INFO L290 TraceCheckUtils]: 9: Hoare triple {30404#true} assume !(0 != ~p2~0); {30404#true} is VALID [2022-04-08 08:19:51,697 INFO L290 TraceCheckUtils]: 10: Hoare triple {30404#true} assume !(0 != ~p3~0); {30404#true} is VALID [2022-04-08 08:19:51,697 INFO L290 TraceCheckUtils]: 11: Hoare triple {30404#true} assume !(0 != ~p4~0); {30404#true} is VALID [2022-04-08 08:19:51,697 INFO L290 TraceCheckUtils]: 12: Hoare triple {30404#true} assume !(0 != ~p5~0); {30404#true} is VALID [2022-04-08 08:19:51,697 INFO L290 TraceCheckUtils]: 13: Hoare triple {30404#true} assume 0 != ~p6~0;~lk6~0 := 1; {30409#(= main_~lk6~0 1)} is VALID [2022-04-08 08:19:51,698 INFO L290 TraceCheckUtils]: 14: Hoare triple {30409#(= main_~lk6~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {30409#(= main_~lk6~0 1)} is VALID [2022-04-08 08:19:51,698 INFO L290 TraceCheckUtils]: 15: Hoare triple {30409#(= main_~lk6~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {30409#(= main_~lk6~0 1)} is VALID [2022-04-08 08:19:51,698 INFO L290 TraceCheckUtils]: 16: Hoare triple {30409#(= main_~lk6~0 1)} assume !(0 != ~p1~0); {30409#(= main_~lk6~0 1)} is VALID [2022-04-08 08:19:51,698 INFO L290 TraceCheckUtils]: 17: Hoare triple {30409#(= main_~lk6~0 1)} assume !(0 != ~p2~0); {30409#(= main_~lk6~0 1)} is VALID [2022-04-08 08:19:51,699 INFO L290 TraceCheckUtils]: 18: Hoare triple {30409#(= main_~lk6~0 1)} assume !(0 != ~p3~0); {30409#(= main_~lk6~0 1)} is VALID [2022-04-08 08:19:51,699 INFO L290 TraceCheckUtils]: 19: Hoare triple {30409#(= main_~lk6~0 1)} assume !(0 != ~p4~0); {30409#(= main_~lk6~0 1)} is VALID [2022-04-08 08:19:51,699 INFO L290 TraceCheckUtils]: 20: Hoare triple {30409#(= main_~lk6~0 1)} assume !(0 != ~p5~0); {30409#(= main_~lk6~0 1)} is VALID [2022-04-08 08:19:51,699 INFO L290 TraceCheckUtils]: 21: Hoare triple {30409#(= main_~lk6~0 1)} assume 0 != ~p6~0; {30409#(= main_~lk6~0 1)} is VALID [2022-04-08 08:19:51,700 INFO L290 TraceCheckUtils]: 22: Hoare triple {30409#(= main_~lk6~0 1)} assume 1 != ~lk6~0; {30405#false} is VALID [2022-04-08 08:19:51,701 INFO L290 TraceCheckUtils]: 23: Hoare triple {30405#false} assume !false; {30405#false} is VALID [2022-04-08 08:19:51,701 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-08 08:19:51,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:19:51,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953910641] [2022-04-08 08:19:51,701 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953910641] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:19:51,701 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:19:51,701 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:19:51,702 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:19:51,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [761500127] [2022-04-08 08:19:51,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [761500127] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:19:51,702 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:19:51,702 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:19:51,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285808009] [2022-04-08 08:19:51,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:19:51,702 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 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 24 [2022-04-08 08:19:51,702 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:19:51,703 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 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-08 08:19:51,717 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:19:51,717 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:19:51,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:19:51,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:19:51,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:19:51,718 INFO L87 Difference]: Start difference. First operand 793 states and 1143 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 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-08 08:19:52,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:19:52,003 INFO L93 Difference]: Finished difference Result 1357 states and 1977 transitions. [2022-04-08 08:19:52,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:19:52,003 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 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 24 [2022-04-08 08:19:52,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:19:52,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 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-08 08:19:52,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 87 transitions. [2022-04-08 08:19:52,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 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-08 08:19:52,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 87 transitions. [2022-04-08 08:19:52,007 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 87 transitions. [2022-04-08 08:19:52,069 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:19:52,144 INFO L225 Difference]: With dead ends: 1357 [2022-04-08 08:19:52,144 INFO L226 Difference]: Without dead ends: 1355 [2022-04-08 08:19:52,146 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:19:52,147 INFO L913 BasicCegarLoop]: 54 mSDtfsCounter, 99 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 08:19:52,147 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [99 Valid, 61 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 08:19:52,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1355 states. [2022-04-08 08:19:52,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1355 to 1161. [2022-04-08 08:19:52,224 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:19:52,226 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1355 states. Second operand has 1161 states, 1157 states have (on average 1.400172860847018) internal successors, (1620), 1157 states have internal predecessors, (1620), 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-08 08:19:52,228 INFO L74 IsIncluded]: Start isIncluded. First operand 1355 states. Second operand has 1161 states, 1157 states have (on average 1.400172860847018) internal successors, (1620), 1157 states have internal predecessors, (1620), 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-08 08:19:52,229 INFO L87 Difference]: Start difference. First operand 1355 states. Second operand has 1161 states, 1157 states have (on average 1.400172860847018) internal successors, (1620), 1157 states have internal predecessors, (1620), 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-08 08:19:52,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:19:52,283 INFO L93 Difference]: Finished difference Result 1355 states and 1944 transitions. [2022-04-08 08:19:52,283 INFO L276 IsEmpty]: Start isEmpty. Operand 1355 states and 1944 transitions. [2022-04-08 08:19:52,284 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:19:52,284 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:19:52,286 INFO L74 IsIncluded]: Start isIncluded. First operand has 1161 states, 1157 states have (on average 1.400172860847018) internal successors, (1620), 1157 states have internal predecessors, (1620), 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 1355 states. [2022-04-08 08:19:52,287 INFO L87 Difference]: Start difference. First operand has 1161 states, 1157 states have (on average 1.400172860847018) internal successors, (1620), 1157 states have internal predecessors, (1620), 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 1355 states. [2022-04-08 08:19:52,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:19:52,350 INFO L93 Difference]: Finished difference Result 1355 states and 1944 transitions. [2022-04-08 08:19:52,350 INFO L276 IsEmpty]: Start isEmpty. Operand 1355 states and 1944 transitions. [2022-04-08 08:19:52,352 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:19:52,352 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:19:52,352 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:19:52,352 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:19:52,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1161 states, 1157 states have (on average 1.400172860847018) internal successors, (1620), 1157 states have internal predecessors, (1620), 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-08 08:19:52,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1161 states to 1161 states and 1623 transitions. [2022-04-08 08:19:52,419 INFO L78 Accepts]: Start accepts. Automaton has 1161 states and 1623 transitions. Word has length 24 [2022-04-08 08:19:52,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:19:52,420 INFO L478 AbstractCegarLoop]: Abstraction has 1161 states and 1623 transitions. [2022-04-08 08:19:52,420 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 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-08 08:19:52,420 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1161 states and 1623 transitions. [2022-04-08 08:19:53,924 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1623 edges. 1623 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:19:53,925 INFO L276 IsEmpty]: Start isEmpty. Operand 1161 states and 1623 transitions. [2022-04-08 08:19:53,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-08 08:19:53,927 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:19:53,927 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:19:53,927 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-08 08:19:53,928 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:19:53,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:19:53,928 INFO L85 PathProgramCache]: Analyzing trace with hash 1997306744, now seen corresponding path program 1 times [2022-04-08 08:19:53,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:19:53,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [287654087] [2022-04-08 08:19:53,928 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:19:53,928 INFO L85 PathProgramCache]: Analyzing trace with hash 1997306744, now seen corresponding path program 2 times [2022-04-08 08:19:53,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:19:53,929 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388174374] [2022-04-08 08:19:53,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:19:53,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:19:53,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:19:53,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:19:53,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:19:53,975 INFO L290 TraceCheckUtils]: 0: Hoare triple {38168#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {38162#true} is VALID [2022-04-08 08:19:53,975 INFO L290 TraceCheckUtils]: 1: Hoare triple {38162#true} assume true; {38162#true} is VALID [2022-04-08 08:19:53,975 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {38162#true} {38162#true} #166#return; {38162#true} is VALID [2022-04-08 08:19:53,977 INFO L272 TraceCheckUtils]: 0: Hoare triple {38162#true} call ULTIMATE.init(); {38168#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:19:53,978 INFO L290 TraceCheckUtils]: 1: Hoare triple {38168#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {38162#true} is VALID [2022-04-08 08:19:53,978 INFO L290 TraceCheckUtils]: 2: Hoare triple {38162#true} assume true; {38162#true} is VALID [2022-04-08 08:19:53,978 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38162#true} {38162#true} #166#return; {38162#true} is VALID [2022-04-08 08:19:53,978 INFO L272 TraceCheckUtils]: 4: Hoare triple {38162#true} call #t~ret13 := main(); {38162#true} is VALID [2022-04-08 08:19:53,978 INFO L290 TraceCheckUtils]: 5: Hoare triple {38162#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;havoc ~cond~0; {38162#true} is VALID [2022-04-08 08:19:53,979 INFO L290 TraceCheckUtils]: 6: Hoare triple {38162#true} assume !false;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~cond~0 := #t~nondet12;havoc #t~nondet12; {38162#true} is VALID [2022-04-08 08:19:53,979 INFO L290 TraceCheckUtils]: 7: Hoare triple {38162#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0; {38162#true} is VALID [2022-04-08 08:19:53,979 INFO L290 TraceCheckUtils]: 8: Hoare triple {38162#true} assume !(0 != ~p1~0); {38162#true} is VALID [2022-04-08 08:19:53,980 INFO L290 TraceCheckUtils]: 9: Hoare triple {38162#true} assume !(0 != ~p2~0); {38162#true} is VALID [2022-04-08 08:19:53,980 INFO L290 TraceCheckUtils]: 10: Hoare triple {38162#true} assume !(0 != ~p3~0); {38162#true} is VALID [2022-04-08 08:19:53,980 INFO L290 TraceCheckUtils]: 11: Hoare triple {38162#true} assume !(0 != ~p4~0); {38162#true} is VALID [2022-04-08 08:19:53,980 INFO L290 TraceCheckUtils]: 12: Hoare triple {38162#true} assume !(0 != ~p5~0); {38162#true} is VALID [2022-04-08 08:19:53,980 INFO L290 TraceCheckUtils]: 13: Hoare triple {38162#true} assume !(0 != ~p6~0); {38167#(= main_~p6~0 0)} is VALID [2022-04-08 08:19:53,980 INFO L290 TraceCheckUtils]: 14: Hoare triple {38167#(= main_~p6~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {38167#(= main_~p6~0 0)} is VALID [2022-04-08 08:19:53,980 INFO L290 TraceCheckUtils]: 15: Hoare triple {38167#(= main_~p6~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {38167#(= main_~p6~0 0)} is VALID [2022-04-08 08:19:53,981 INFO L290 TraceCheckUtils]: 16: Hoare triple {38167#(= main_~p6~0 0)} assume !(0 != ~p1~0); {38167#(= main_~p6~0 0)} is VALID [2022-04-08 08:19:53,981 INFO L290 TraceCheckUtils]: 17: Hoare triple {38167#(= main_~p6~0 0)} assume !(0 != ~p2~0); {38167#(= main_~p6~0 0)} is VALID [2022-04-08 08:19:53,981 INFO L290 TraceCheckUtils]: 18: Hoare triple {38167#(= main_~p6~0 0)} assume !(0 != ~p3~0); {38167#(= main_~p6~0 0)} is VALID [2022-04-08 08:19:53,981 INFO L290 TraceCheckUtils]: 19: Hoare triple {38167#(= main_~p6~0 0)} assume !(0 != ~p4~0); {38167#(= main_~p6~0 0)} is VALID [2022-04-08 08:19:53,982 INFO L290 TraceCheckUtils]: 20: Hoare triple {38167#(= main_~p6~0 0)} assume !(0 != ~p5~0); {38167#(= main_~p6~0 0)} is VALID [2022-04-08 08:19:53,982 INFO L290 TraceCheckUtils]: 21: Hoare triple {38167#(= main_~p6~0 0)} assume 0 != ~p6~0; {38163#false} is VALID [2022-04-08 08:19:53,982 INFO L290 TraceCheckUtils]: 22: Hoare triple {38163#false} assume 1 != ~lk6~0; {38163#false} is VALID [2022-04-08 08:19:53,982 INFO L290 TraceCheckUtils]: 23: Hoare triple {38163#false} assume !false; {38163#false} is VALID [2022-04-08 08:19:53,982 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-08 08:19:53,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:19:53,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388174374] [2022-04-08 08:19:53,984 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388174374] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:19:53,984 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:19:53,984 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:19:53,984 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:19:53,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [287654087] [2022-04-08 08:19:53,984 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [287654087] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:19:53,984 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:19:53,984 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:19:53,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929706068] [2022-04-08 08:19:53,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:19:53,984 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 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 24 [2022-04-08 08:19:53,985 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:19:53,985 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 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-08 08:19:53,998 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:19:53,998 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:19:53,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:19:53,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:19:53,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:19:53,998 INFO L87 Difference]: Start difference. First operand 1161 states and 1623 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 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-08 08:19:54,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:19:54,575 INFO L93 Difference]: Finished difference Result 2637 states and 3673 transitions. [2022-04-08 08:19:54,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:19:54,575 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 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 24 [2022-04-08 08:19:54,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:19:54,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 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-08 08:19:54,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 141 transitions. [2022-04-08 08:19:54,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 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-08 08:19:54,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 141 transitions. [2022-04-08 08:19:54,578 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 141 transitions. [2022-04-08 08:19:54,661 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 141 edges. 141 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:19:54,776 INFO L225 Difference]: With dead ends: 2637 [2022-04-08 08:19:54,776 INFO L226 Difference]: Without dead ends: 1515 [2022-04-08 08:19:54,777 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:19:54,778 INFO L913 BasicCegarLoop]: 82 mSDtfsCounter, 88 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 08:19:54,778 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [88 Valid, 89 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 08:19:54,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1515 states. [2022-04-08 08:19:54,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1515 to 1513. [2022-04-08 08:19:54,884 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:19:54,885 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1515 states. Second operand has 1513 states, 1509 states have (on average 1.359840954274354) internal successors, (2052), 1509 states have internal predecessors, (2052), 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-08 08:19:54,887 INFO L74 IsIncluded]: Start isIncluded. First operand 1515 states. Second operand has 1513 states, 1509 states have (on average 1.359840954274354) internal successors, (2052), 1509 states have internal predecessors, (2052), 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-08 08:19:54,888 INFO L87 Difference]: Start difference. First operand 1515 states. Second operand has 1513 states, 1509 states have (on average 1.359840954274354) internal successors, (2052), 1509 states have internal predecessors, (2052), 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-08 08:19:54,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:19:54,963 INFO L93 Difference]: Finished difference Result 1515 states and 2056 transitions. [2022-04-08 08:19:54,963 INFO L276 IsEmpty]: Start isEmpty. Operand 1515 states and 2056 transitions. [2022-04-08 08:19:54,965 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:19:54,965 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:19:54,968 INFO L74 IsIncluded]: Start isIncluded. First operand has 1513 states, 1509 states have (on average 1.359840954274354) internal successors, (2052), 1509 states have internal predecessors, (2052), 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 1515 states. [2022-04-08 08:19:54,969 INFO L87 Difference]: Start difference. First operand has 1513 states, 1509 states have (on average 1.359840954274354) internal successors, (2052), 1509 states have internal predecessors, (2052), 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 1515 states. [2022-04-08 08:19:55,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:19:55,041 INFO L93 Difference]: Finished difference Result 1515 states and 2056 transitions. [2022-04-08 08:19:55,041 INFO L276 IsEmpty]: Start isEmpty. Operand 1515 states and 2056 transitions. [2022-04-08 08:19:55,042 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:19:55,042 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:19:55,042 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:19:55,042 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:19:55,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1513 states, 1509 states have (on average 1.359840954274354) internal successors, (2052), 1509 states have internal predecessors, (2052), 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-08 08:19:55,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1513 states to 1513 states and 2055 transitions. [2022-04-08 08:19:55,157 INFO L78 Accepts]: Start accepts. Automaton has 1513 states and 2055 transitions. Word has length 24 [2022-04-08 08:19:55,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:19:55,157 INFO L478 AbstractCegarLoop]: Abstraction has 1513 states and 2055 transitions. [2022-04-08 08:19:55,157 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 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-08 08:19:55,157 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1513 states and 2055 transitions. [2022-04-08 08:19:57,071 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2055 edges. 2055 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:19:57,072 INFO L276 IsEmpty]: Start isEmpty. Operand 1513 states and 2055 transitions. [2022-04-08 08:19:57,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-08 08:19:57,073 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:19:57,073 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:19:57,073 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-08 08:19:57,073 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:19:57,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:19:57,073 INFO L85 PathProgramCache]: Analyzing trace with hash 1529017218, now seen corresponding path program 1 times [2022-04-08 08:19:57,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:19:57,073 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1024274414] [2022-04-08 08:19:57,074 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:19:57,074 INFO L85 PathProgramCache]: Analyzing trace with hash 1529017218, now seen corresponding path program 2 times [2022-04-08 08:19:57,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:19:57,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497457260] [2022-04-08 08:19:57,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:19:57,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:19:57,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:19:57,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:19:57,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:19:57,124 INFO L290 TraceCheckUtils]: 0: Hoare triple {49510#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {49504#true} is VALID [2022-04-08 08:19:57,124 INFO L290 TraceCheckUtils]: 1: Hoare triple {49504#true} assume true; {49504#true} is VALID [2022-04-08 08:19:57,124 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {49504#true} {49504#true} #166#return; {49504#true} is VALID [2022-04-08 08:19:57,124 INFO L272 TraceCheckUtils]: 0: Hoare triple {49504#true} call ULTIMATE.init(); {49510#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:19:57,124 INFO L290 TraceCheckUtils]: 1: Hoare triple {49510#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {49504#true} is VALID [2022-04-08 08:19:57,124 INFO L290 TraceCheckUtils]: 2: Hoare triple {49504#true} assume true; {49504#true} is VALID [2022-04-08 08:19:57,124 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {49504#true} {49504#true} #166#return; {49504#true} is VALID [2022-04-08 08:19:57,125 INFO L272 TraceCheckUtils]: 4: Hoare triple {49504#true} call #t~ret13 := main(); {49504#true} is VALID [2022-04-08 08:19:57,125 INFO L290 TraceCheckUtils]: 5: Hoare triple {49504#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;havoc ~cond~0; {49504#true} is VALID [2022-04-08 08:19:57,125 INFO L290 TraceCheckUtils]: 6: Hoare triple {49504#true} assume !false;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~cond~0 := #t~nondet12;havoc #t~nondet12; {49504#true} is VALID [2022-04-08 08:19:57,125 INFO L290 TraceCheckUtils]: 7: Hoare triple {49504#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0; {49504#true} is VALID [2022-04-08 08:19:57,125 INFO L290 TraceCheckUtils]: 8: Hoare triple {49504#true} assume !(0 != ~p1~0); {49504#true} is VALID [2022-04-08 08:19:57,125 INFO L290 TraceCheckUtils]: 9: Hoare triple {49504#true} assume !(0 != ~p2~0); {49504#true} is VALID [2022-04-08 08:19:57,125 INFO L290 TraceCheckUtils]: 10: Hoare triple {49504#true} assume !(0 != ~p3~0); {49504#true} is VALID [2022-04-08 08:19:57,125 INFO L290 TraceCheckUtils]: 11: Hoare triple {49504#true} assume !(0 != ~p4~0); {49504#true} is VALID [2022-04-08 08:19:57,125 INFO L290 TraceCheckUtils]: 12: Hoare triple {49504#true} assume !(0 != ~p5~0); {49504#true} is VALID [2022-04-08 08:19:57,125 INFO L290 TraceCheckUtils]: 13: Hoare triple {49504#true} assume 0 != ~p6~0;~lk6~0 := 1; {49509#(not (= main_~p6~0 0))} is VALID [2022-04-08 08:19:57,126 INFO L290 TraceCheckUtils]: 14: Hoare triple {49509#(not (= main_~p6~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {49509#(not (= main_~p6~0 0))} is VALID [2022-04-08 08:19:57,126 INFO L290 TraceCheckUtils]: 15: Hoare triple {49509#(not (= main_~p6~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {49509#(not (= main_~p6~0 0))} is VALID [2022-04-08 08:19:57,126 INFO L290 TraceCheckUtils]: 16: Hoare triple {49509#(not (= main_~p6~0 0))} assume !(0 != ~p1~0); {49509#(not (= main_~p6~0 0))} is VALID [2022-04-08 08:19:57,126 INFO L290 TraceCheckUtils]: 17: Hoare triple {49509#(not (= main_~p6~0 0))} assume !(0 != ~p2~0); {49509#(not (= main_~p6~0 0))} is VALID [2022-04-08 08:19:57,127 INFO L290 TraceCheckUtils]: 18: Hoare triple {49509#(not (= main_~p6~0 0))} assume !(0 != ~p3~0); {49509#(not (= main_~p6~0 0))} is VALID [2022-04-08 08:19:57,127 INFO L290 TraceCheckUtils]: 19: Hoare triple {49509#(not (= main_~p6~0 0))} assume !(0 != ~p4~0); {49509#(not (= main_~p6~0 0))} is VALID [2022-04-08 08:19:57,127 INFO L290 TraceCheckUtils]: 20: Hoare triple {49509#(not (= main_~p6~0 0))} assume !(0 != ~p5~0); {49509#(not (= main_~p6~0 0))} is VALID [2022-04-08 08:19:57,127 INFO L290 TraceCheckUtils]: 21: Hoare triple {49509#(not (= main_~p6~0 0))} assume !(0 != ~p6~0); {49505#false} is VALID [2022-04-08 08:19:57,127 INFO L290 TraceCheckUtils]: 22: Hoare triple {49505#false} assume 0 != ~p7~0; {49505#false} is VALID [2022-04-08 08:19:57,127 INFO L290 TraceCheckUtils]: 23: Hoare triple {49505#false} assume 1 != ~lk7~0; {49505#false} is VALID [2022-04-08 08:19:57,128 INFO L290 TraceCheckUtils]: 24: Hoare triple {49505#false} assume !false; {49505#false} is VALID [2022-04-08 08:19:57,128 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-08 08:19:57,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:19:57,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497457260] [2022-04-08 08:19:57,128 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497457260] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:19:57,128 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:19:57,128 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:19:57,128 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:19:57,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1024274414] [2022-04-08 08:19:57,128 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1024274414] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:19:57,128 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:19:57,128 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:19:57,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858986046] [2022-04-08 08:19:57,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:19:57,129 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 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 25 [2022-04-08 08:19:57,129 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:19:57,129 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 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-08 08:19:57,141 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:19:57,141 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:19:57,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:19:57,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:19:57,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:19:57,141 INFO L87 Difference]: Start difference. First operand 1513 states and 2055 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 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-08 08:19:57,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:19:57,605 INFO L93 Difference]: Finished difference Result 2269 states and 3065 transitions. [2022-04-08 08:19:57,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:19:57,605 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 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 25 [2022-04-08 08:19:57,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:19:57,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 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-08 08:19:57,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 136 transitions. [2022-04-08 08:19:57,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 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-08 08:19:57,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 136 transitions. [2022-04-08 08:19:57,607 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 136 transitions. [2022-04-08 08:19:57,684 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 136 edges. 136 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:19:57,804 INFO L225 Difference]: With dead ends: 2269 [2022-04-08 08:19:57,804 INFO L226 Difference]: Without dead ends: 1547 [2022-04-08 08:19:57,805 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:19:57,806 INFO L913 BasicCegarLoop]: 71 mSDtfsCounter, 100 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 08:19:57,806 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [100 Valid, 78 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 08:19:57,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1547 states. [2022-04-08 08:19:57,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1547 to 1545. [2022-04-08 08:19:57,906 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:19:57,907 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1547 states. Second operand has 1545 states, 1541 states have (on average 1.3316028552887735) internal successors, (2052), 1541 states have internal predecessors, (2052), 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-08 08:19:57,909 INFO L74 IsIncluded]: Start isIncluded. First operand 1547 states. Second operand has 1545 states, 1541 states have (on average 1.3316028552887735) internal successors, (2052), 1541 states have internal predecessors, (2052), 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-08 08:19:57,910 INFO L87 Difference]: Start difference. First operand 1547 states. Second operand has 1545 states, 1541 states have (on average 1.3316028552887735) internal successors, (2052), 1541 states have internal predecessors, (2052), 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-08 08:19:57,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:19:57,982 INFO L93 Difference]: Finished difference Result 1547 states and 2056 transitions. [2022-04-08 08:19:57,982 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2056 transitions. [2022-04-08 08:19:57,984 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:19:57,984 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:19:57,986 INFO L74 IsIncluded]: Start isIncluded. First operand has 1545 states, 1541 states have (on average 1.3316028552887735) internal successors, (2052), 1541 states have internal predecessors, (2052), 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 1547 states. [2022-04-08 08:19:57,988 INFO L87 Difference]: Start difference. First operand has 1545 states, 1541 states have (on average 1.3316028552887735) internal successors, (2052), 1541 states have internal predecessors, (2052), 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 1547 states. [2022-04-08 08:19:58,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:19:58,059 INFO L93 Difference]: Finished difference Result 1547 states and 2056 transitions. [2022-04-08 08:19:58,060 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2056 transitions. [2022-04-08 08:19:58,061 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:19:58,061 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:19:58,061 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:19:58,061 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:19:58,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1545 states, 1541 states have (on average 1.3316028552887735) internal successors, (2052), 1541 states have internal predecessors, (2052), 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-08 08:19:58,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1545 states to 1545 states and 2055 transitions. [2022-04-08 08:19:58,175 INFO L78 Accepts]: Start accepts. Automaton has 1545 states and 2055 transitions. Word has length 25 [2022-04-08 08:19:58,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:19:58,175 INFO L478 AbstractCegarLoop]: Abstraction has 1545 states and 2055 transitions. [2022-04-08 08:19:58,175 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 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-08 08:19:58,175 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1545 states and 2055 transitions. [2022-04-08 08:20:00,072 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2055 edges. 2055 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:20:00,073 INFO L276 IsEmpty]: Start isEmpty. Operand 1545 states and 2055 transitions. [2022-04-08 08:20:00,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-08 08:20:00,074 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:20:00,074 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:20:00,074 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-04-08 08:20:00,074 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:20:00,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:20:00,074 INFO L85 PathProgramCache]: Analyzing trace with hash 1787182656, now seen corresponding path program 1 times [2022-04-08 08:20:00,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:20:00,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [708687620] [2022-04-08 08:20:00,075 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:20:00,075 INFO L85 PathProgramCache]: Analyzing trace with hash 1787182656, now seen corresponding path program 2 times [2022-04-08 08:20:00,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:20:00,075 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451173348] [2022-04-08 08:20:00,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:20:00,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:20:00,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:20:00,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:20:00,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:20:00,126 INFO L290 TraceCheckUtils]: 0: Hoare triple {60244#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {60238#true} is VALID [2022-04-08 08:20:00,126 INFO L290 TraceCheckUtils]: 1: Hoare triple {60238#true} assume true; {60238#true} is VALID [2022-04-08 08:20:00,126 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {60238#true} {60238#true} #166#return; {60238#true} is VALID [2022-04-08 08:20:00,126 INFO L272 TraceCheckUtils]: 0: Hoare triple {60238#true} call ULTIMATE.init(); {60244#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:20:00,127 INFO L290 TraceCheckUtils]: 1: Hoare triple {60244#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {60238#true} is VALID [2022-04-08 08:20:00,127 INFO L290 TraceCheckUtils]: 2: Hoare triple {60238#true} assume true; {60238#true} is VALID [2022-04-08 08:20:00,127 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {60238#true} {60238#true} #166#return; {60238#true} is VALID [2022-04-08 08:20:00,127 INFO L272 TraceCheckUtils]: 4: Hoare triple {60238#true} call #t~ret13 := main(); {60238#true} is VALID [2022-04-08 08:20:00,127 INFO L290 TraceCheckUtils]: 5: Hoare triple {60238#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;havoc ~cond~0; {60238#true} is VALID [2022-04-08 08:20:00,127 INFO L290 TraceCheckUtils]: 6: Hoare triple {60238#true} assume !false;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~cond~0 := #t~nondet12;havoc #t~nondet12; {60238#true} is VALID [2022-04-08 08:20:00,127 INFO L290 TraceCheckUtils]: 7: Hoare triple {60238#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0; {60238#true} is VALID [2022-04-08 08:20:00,127 INFO L290 TraceCheckUtils]: 8: Hoare triple {60238#true} assume !(0 != ~p1~0); {60238#true} is VALID [2022-04-08 08:20:00,127 INFO L290 TraceCheckUtils]: 9: Hoare triple {60238#true} assume !(0 != ~p2~0); {60238#true} is VALID [2022-04-08 08:20:00,127 INFO L290 TraceCheckUtils]: 10: Hoare triple {60238#true} assume !(0 != ~p3~0); {60238#true} is VALID [2022-04-08 08:20:00,127 INFO L290 TraceCheckUtils]: 11: Hoare triple {60238#true} assume !(0 != ~p4~0); {60238#true} is VALID [2022-04-08 08:20:00,127 INFO L290 TraceCheckUtils]: 12: Hoare triple {60238#true} assume !(0 != ~p5~0); {60238#true} is VALID [2022-04-08 08:20:00,127 INFO L290 TraceCheckUtils]: 13: Hoare triple {60238#true} assume !(0 != ~p6~0); {60238#true} is VALID [2022-04-08 08:20:00,128 INFO L290 TraceCheckUtils]: 14: Hoare triple {60238#true} assume 0 != ~p7~0;~lk7~0 := 1; {60243#(= main_~lk7~0 1)} is VALID [2022-04-08 08:20:00,128 INFO L290 TraceCheckUtils]: 15: Hoare triple {60243#(= main_~lk7~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {60243#(= main_~lk7~0 1)} is VALID [2022-04-08 08:20:00,128 INFO L290 TraceCheckUtils]: 16: Hoare triple {60243#(= main_~lk7~0 1)} assume !(0 != ~p1~0); {60243#(= main_~lk7~0 1)} is VALID [2022-04-08 08:20:00,128 INFO L290 TraceCheckUtils]: 17: Hoare triple {60243#(= main_~lk7~0 1)} assume !(0 != ~p2~0); {60243#(= main_~lk7~0 1)} is VALID [2022-04-08 08:20:00,129 INFO L290 TraceCheckUtils]: 18: Hoare triple {60243#(= main_~lk7~0 1)} assume !(0 != ~p3~0); {60243#(= main_~lk7~0 1)} is VALID [2022-04-08 08:20:00,129 INFO L290 TraceCheckUtils]: 19: Hoare triple {60243#(= main_~lk7~0 1)} assume !(0 != ~p4~0); {60243#(= main_~lk7~0 1)} is VALID [2022-04-08 08:20:00,129 INFO L290 TraceCheckUtils]: 20: Hoare triple {60243#(= main_~lk7~0 1)} assume !(0 != ~p5~0); {60243#(= main_~lk7~0 1)} is VALID [2022-04-08 08:20:00,129 INFO L290 TraceCheckUtils]: 21: Hoare triple {60243#(= main_~lk7~0 1)} assume !(0 != ~p6~0); {60243#(= main_~lk7~0 1)} is VALID [2022-04-08 08:20:00,130 INFO L290 TraceCheckUtils]: 22: Hoare triple {60243#(= main_~lk7~0 1)} assume 0 != ~p7~0; {60243#(= main_~lk7~0 1)} is VALID [2022-04-08 08:20:00,130 INFO L290 TraceCheckUtils]: 23: Hoare triple {60243#(= main_~lk7~0 1)} assume 1 != ~lk7~0; {60239#false} is VALID [2022-04-08 08:20:00,130 INFO L290 TraceCheckUtils]: 24: Hoare triple {60239#false} assume !false; {60239#false} is VALID [2022-04-08 08:20:00,130 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-08 08:20:00,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:20:00,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451173348] [2022-04-08 08:20:00,130 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451173348] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:20:00,130 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:20:00,130 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:20:00,131 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:20:00,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [708687620] [2022-04-08 08:20:00,131 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [708687620] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:20:00,131 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:20:00,131 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:20:00,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571400477] [2022-04-08 08:20:00,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:20:00,131 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 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 25 [2022-04-08 08:20:00,131 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:20:00,131 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 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-08 08:20:00,154 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:20:00,155 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:20:00,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:20:00,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:20:00,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:20:00,156 INFO L87 Difference]: Start difference. First operand 1545 states and 2055 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 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-08 08:20:00,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:20:00,701 INFO L93 Difference]: Finished difference Result 2573 states and 3433 transitions. [2022-04-08 08:20:00,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:20:00,702 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 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 25 [2022-04-08 08:20:00,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:20:00,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 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-08 08:20:00,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 83 transitions. [2022-04-08 08:20:00,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 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-08 08:20:00,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 83 transitions. [2022-04-08 08:20:00,703 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 83 transitions. [2022-04-08 08:20:00,758 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:20:01,012 INFO L225 Difference]: With dead ends: 2573 [2022-04-08 08:20:01,012 INFO L226 Difference]: Without dead ends: 2571 [2022-04-08 08:20:01,013 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:20:01,013 INFO L913 BasicCegarLoop]: 53 mSDtfsCounter, 92 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 08:20:01,013 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [92 Valid, 60 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 08:20:01,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2571 states. [2022-04-08 08:20:01,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2571 to 2313. [2022-04-08 08:20:01,176 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:20:01,179 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2571 states. Second operand has 2313 states, 2309 states have (on average 1.2906019922044174) internal successors, (2980), 2309 states have internal predecessors, (2980), 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-08 08:20:01,181 INFO L74 IsIncluded]: Start isIncluded. First operand 2571 states. Second operand has 2313 states, 2309 states have (on average 1.2906019922044174) internal successors, (2980), 2309 states have internal predecessors, (2980), 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-08 08:20:01,182 INFO L87 Difference]: Start difference. First operand 2571 states. Second operand has 2313 states, 2309 states have (on average 1.2906019922044174) internal successors, (2980), 2309 states have internal predecessors, (2980), 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-08 08:20:01,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:20:01,368 INFO L93 Difference]: Finished difference Result 2571 states and 3368 transitions. [2022-04-08 08:20:01,368 INFO L276 IsEmpty]: Start isEmpty. Operand 2571 states and 3368 transitions. [2022-04-08 08:20:01,370 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:20:01,370 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:20:01,373 INFO L74 IsIncluded]: Start isIncluded. First operand has 2313 states, 2309 states have (on average 1.2906019922044174) internal successors, (2980), 2309 states have internal predecessors, (2980), 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 2571 states. [2022-04-08 08:20:01,374 INFO L87 Difference]: Start difference. First operand has 2313 states, 2309 states have (on average 1.2906019922044174) internal successors, (2980), 2309 states have internal predecessors, (2980), 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 2571 states. [2022-04-08 08:20:01,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:20:01,558 INFO L93 Difference]: Finished difference Result 2571 states and 3368 transitions. [2022-04-08 08:20:01,558 INFO L276 IsEmpty]: Start isEmpty. Operand 2571 states and 3368 transitions. [2022-04-08 08:20:01,560 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:20:01,560 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:20:01,560 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:20:01,560 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:20:01,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2313 states, 2309 states have (on average 1.2906019922044174) internal successors, (2980), 2309 states have internal predecessors, (2980), 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-08 08:20:01,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2313 states to 2313 states and 2983 transitions. [2022-04-08 08:20:01,838 INFO L78 Accepts]: Start accepts. Automaton has 2313 states and 2983 transitions. Word has length 25 [2022-04-08 08:20:01,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:20:01,838 INFO L478 AbstractCegarLoop]: Abstraction has 2313 states and 2983 transitions. [2022-04-08 08:20:01,838 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 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-08 08:20:01,838 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 2313 states and 2983 transitions. [2022-04-08 08:20:04,692 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2983 edges. 2983 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:20:04,692 INFO L276 IsEmpty]: Start isEmpty. Operand 2313 states and 2983 transitions. [2022-04-08 08:20:04,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-08 08:20:04,694 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:20:04,695 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:20:04,695 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-04-08 08:20:04,695 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:20:04,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:20:04,695 INFO L85 PathProgramCache]: Analyzing trace with hash -1806720062, now seen corresponding path program 1 times [2022-04-08 08:20:04,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:20:04,695 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1438760469] [2022-04-08 08:20:04,695 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:20:04,695 INFO L85 PathProgramCache]: Analyzing trace with hash -1806720062, now seen corresponding path program 2 times [2022-04-08 08:20:04,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:20:04,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280109342] [2022-04-08 08:20:04,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:20:04,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:20:04,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:20:04,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:20:04,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:20:04,732 INFO L290 TraceCheckUtils]: 0: Hoare triple {75170#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {75164#true} is VALID [2022-04-08 08:20:04,732 INFO L290 TraceCheckUtils]: 1: Hoare triple {75164#true} assume true; {75164#true} is VALID [2022-04-08 08:20:04,732 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {75164#true} {75164#true} #166#return; {75164#true} is VALID [2022-04-08 08:20:04,733 INFO L272 TraceCheckUtils]: 0: Hoare triple {75164#true} call ULTIMATE.init(); {75170#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:20:04,733 INFO L290 TraceCheckUtils]: 1: Hoare triple {75170#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {75164#true} is VALID [2022-04-08 08:20:04,733 INFO L290 TraceCheckUtils]: 2: Hoare triple {75164#true} assume true; {75164#true} is VALID [2022-04-08 08:20:04,733 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {75164#true} {75164#true} #166#return; {75164#true} is VALID [2022-04-08 08:20:04,733 INFO L272 TraceCheckUtils]: 4: Hoare triple {75164#true} call #t~ret13 := main(); {75164#true} is VALID [2022-04-08 08:20:04,733 INFO L290 TraceCheckUtils]: 5: Hoare triple {75164#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;havoc ~cond~0; {75164#true} is VALID [2022-04-08 08:20:04,733 INFO L290 TraceCheckUtils]: 6: Hoare triple {75164#true} assume !false;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~cond~0 := #t~nondet12;havoc #t~nondet12; {75164#true} is VALID [2022-04-08 08:20:04,733 INFO L290 TraceCheckUtils]: 7: Hoare triple {75164#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0; {75164#true} is VALID [2022-04-08 08:20:04,733 INFO L290 TraceCheckUtils]: 8: Hoare triple {75164#true} assume !(0 != ~p1~0); {75164#true} is VALID [2022-04-08 08:20:04,733 INFO L290 TraceCheckUtils]: 9: Hoare triple {75164#true} assume !(0 != ~p2~0); {75164#true} is VALID [2022-04-08 08:20:04,733 INFO L290 TraceCheckUtils]: 10: Hoare triple {75164#true} assume !(0 != ~p3~0); {75164#true} is VALID [2022-04-08 08:20:04,733 INFO L290 TraceCheckUtils]: 11: Hoare triple {75164#true} assume !(0 != ~p4~0); {75164#true} is VALID [2022-04-08 08:20:04,733 INFO L290 TraceCheckUtils]: 12: Hoare triple {75164#true} assume !(0 != ~p5~0); {75164#true} is VALID [2022-04-08 08:20:04,734 INFO L290 TraceCheckUtils]: 13: Hoare triple {75164#true} assume !(0 != ~p6~0); {75164#true} is VALID [2022-04-08 08:20:04,735 INFO L290 TraceCheckUtils]: 14: Hoare triple {75164#true} assume !(0 != ~p7~0); {75169#(= main_~p7~0 0)} is VALID [2022-04-08 08:20:04,735 INFO L290 TraceCheckUtils]: 15: Hoare triple {75169#(= main_~p7~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {75169#(= main_~p7~0 0)} is VALID [2022-04-08 08:20:04,735 INFO L290 TraceCheckUtils]: 16: Hoare triple {75169#(= main_~p7~0 0)} assume !(0 != ~p1~0); {75169#(= main_~p7~0 0)} is VALID [2022-04-08 08:20:04,735 INFO L290 TraceCheckUtils]: 17: Hoare triple {75169#(= main_~p7~0 0)} assume !(0 != ~p2~0); {75169#(= main_~p7~0 0)} is VALID [2022-04-08 08:20:04,736 INFO L290 TraceCheckUtils]: 18: Hoare triple {75169#(= main_~p7~0 0)} assume !(0 != ~p3~0); {75169#(= main_~p7~0 0)} is VALID [2022-04-08 08:20:04,736 INFO L290 TraceCheckUtils]: 19: Hoare triple {75169#(= main_~p7~0 0)} assume !(0 != ~p4~0); {75169#(= main_~p7~0 0)} is VALID [2022-04-08 08:20:04,736 INFO L290 TraceCheckUtils]: 20: Hoare triple {75169#(= main_~p7~0 0)} assume !(0 != ~p5~0); {75169#(= main_~p7~0 0)} is VALID [2022-04-08 08:20:04,736 INFO L290 TraceCheckUtils]: 21: Hoare triple {75169#(= main_~p7~0 0)} assume !(0 != ~p6~0); {75169#(= main_~p7~0 0)} is VALID [2022-04-08 08:20:04,737 INFO L290 TraceCheckUtils]: 22: Hoare triple {75169#(= main_~p7~0 0)} assume 0 != ~p7~0; {75165#false} is VALID [2022-04-08 08:20:04,737 INFO L290 TraceCheckUtils]: 23: Hoare triple {75165#false} assume 1 != ~lk7~0; {75165#false} is VALID [2022-04-08 08:20:04,737 INFO L290 TraceCheckUtils]: 24: Hoare triple {75165#false} assume !false; {75165#false} is VALID [2022-04-08 08:20:04,737 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-08 08:20:04,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:20:04,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280109342] [2022-04-08 08:20:04,738 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280109342] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:20:04,738 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:20:04,738 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:20:04,738 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:20:04,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1438760469] [2022-04-08 08:20:04,738 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1438760469] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:20:04,738 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:20:04,738 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:20:04,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2147028199] [2022-04-08 08:20:04,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:20:04,738 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 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 25 [2022-04-08 08:20:04,738 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:20:04,739 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 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-08 08:20:04,751 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:20:04,751 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:20:04,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:20:04,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:20:04,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:20:04,752 INFO L87 Difference]: Start difference. First operand 2313 states and 2983 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 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-08 08:20:06,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:20:06,320 INFO L93 Difference]: Finished difference Result 5197 states and 6633 transitions. [2022-04-08 08:20:06,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:20:06,320 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 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 25 [2022-04-08 08:20:06,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:20:06,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 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-08 08:20:06,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 138 transitions. [2022-04-08 08:20:06,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 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-08 08:20:06,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 138 transitions. [2022-04-08 08:20:06,322 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 138 transitions. [2022-04-08 08:20:06,401 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 138 edges. 138 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:20:06,761 INFO L225 Difference]: With dead ends: 5197 [2022-04-08 08:20:06,761 INFO L226 Difference]: Without dead ends: 2955 [2022-04-08 08:20:06,764 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:20:06,764 INFO L913 BasicCegarLoop]: 84 mSDtfsCounter, 82 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 08:20:06,764 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [82 Valid, 91 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 08:20:06,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2955 states. [2022-04-08 08:20:06,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2955 to 2953. [2022-04-08 08:20:06,957 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:20:06,962 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2955 states. Second operand has 2953 states, 2949 states have (on average 1.2383858935232281) internal successors, (3652), 2949 states have internal predecessors, (3652), 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-08 08:20:06,964 INFO L74 IsIncluded]: Start isIncluded. First operand 2955 states. Second operand has 2953 states, 2949 states have (on average 1.2383858935232281) internal successors, (3652), 2949 states have internal predecessors, (3652), 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-08 08:20:06,967 INFO L87 Difference]: Start difference. First operand 2955 states. Second operand has 2953 states, 2949 states have (on average 1.2383858935232281) internal successors, (3652), 2949 states have internal predecessors, (3652), 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-08 08:20:07,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:20:07,273 INFO L93 Difference]: Finished difference Result 2955 states and 3656 transitions. [2022-04-08 08:20:07,273 INFO L276 IsEmpty]: Start isEmpty. Operand 2955 states and 3656 transitions. [2022-04-08 08:20:07,276 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:20:07,276 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:20:07,279 INFO L74 IsIncluded]: Start isIncluded. First operand has 2953 states, 2949 states have (on average 1.2383858935232281) internal successors, (3652), 2949 states have internal predecessors, (3652), 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 2955 states. [2022-04-08 08:20:07,281 INFO L87 Difference]: Start difference. First operand has 2953 states, 2949 states have (on average 1.2383858935232281) internal successors, (3652), 2949 states have internal predecessors, (3652), 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 2955 states. [2022-04-08 08:20:07,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:20:07,549 INFO L93 Difference]: Finished difference Result 2955 states and 3656 transitions. [2022-04-08 08:20:07,549 INFO L276 IsEmpty]: Start isEmpty. Operand 2955 states and 3656 transitions. [2022-04-08 08:20:07,552 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:20:07,552 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:20:07,552 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:20:07,552 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:20:07,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2953 states, 2949 states have (on average 1.2383858935232281) internal successors, (3652), 2949 states have internal predecessors, (3652), 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-08 08:20:07,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2953 states to 2953 states and 3655 transitions. [2022-04-08 08:20:07,984 INFO L78 Accepts]: Start accepts. Automaton has 2953 states and 3655 transitions. Word has length 25 [2022-04-08 08:20:07,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:20:07,984 INFO L478 AbstractCegarLoop]: Abstraction has 2953 states and 3655 transitions. [2022-04-08 08:20:07,984 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 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-08 08:20:07,984 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 2953 states and 3655 transitions. [2022-04-08 08:20:11,555 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 3655 edges. 3655 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:20:11,555 INFO L276 IsEmpty]: Start isEmpty. Operand 2953 states and 3655 transitions. [2022-04-08 08:20:11,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-08 08:20:11,558 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:20:11,558 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:20:11,558 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-04-08 08:20:11,558 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:20:11,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:20:11,559 INFO L85 PathProgramCache]: Analyzing trace with hash -431696435, now seen corresponding path program 1 times [2022-04-08 08:20:11,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:20:11,559 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1035612441] [2022-04-08 08:20:11,559 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:20:11,559 INFO L85 PathProgramCache]: Analyzing trace with hash -431696435, now seen corresponding path program 2 times [2022-04-08 08:20:11,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:20:11,559 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835892412] [2022-04-08 08:20:11,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:20:11,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:20:11,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:20:11,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:20:11,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:20:11,593 INFO L290 TraceCheckUtils]: 0: Hoare triple {97392#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {97386#true} is VALID [2022-04-08 08:20:11,593 INFO L290 TraceCheckUtils]: 1: Hoare triple {97386#true} assume true; {97386#true} is VALID [2022-04-08 08:20:11,593 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {97386#true} {97386#true} #166#return; {97386#true} is VALID [2022-04-08 08:20:11,614 INFO L272 TraceCheckUtils]: 0: Hoare triple {97386#true} call ULTIMATE.init(); {97392#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:20:11,615 INFO L290 TraceCheckUtils]: 1: Hoare triple {97392#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {97386#true} is VALID [2022-04-08 08:20:11,615 INFO L290 TraceCheckUtils]: 2: Hoare triple {97386#true} assume true; {97386#true} is VALID [2022-04-08 08:20:11,615 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {97386#true} {97386#true} #166#return; {97386#true} is VALID [2022-04-08 08:20:11,615 INFO L272 TraceCheckUtils]: 4: Hoare triple {97386#true} call #t~ret13 := main(); {97386#true} is VALID [2022-04-08 08:20:11,615 INFO L290 TraceCheckUtils]: 5: Hoare triple {97386#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;havoc ~cond~0; {97386#true} is VALID [2022-04-08 08:20:11,615 INFO L290 TraceCheckUtils]: 6: Hoare triple {97386#true} assume !false;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~cond~0 := #t~nondet12;havoc #t~nondet12; {97386#true} is VALID [2022-04-08 08:20:11,615 INFO L290 TraceCheckUtils]: 7: Hoare triple {97386#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0; {97386#true} is VALID [2022-04-08 08:20:11,615 INFO L290 TraceCheckUtils]: 8: Hoare triple {97386#true} assume !(0 != ~p1~0); {97386#true} is VALID [2022-04-08 08:20:11,615 INFO L290 TraceCheckUtils]: 9: Hoare triple {97386#true} assume !(0 != ~p2~0); {97386#true} is VALID [2022-04-08 08:20:11,615 INFO L290 TraceCheckUtils]: 10: Hoare triple {97386#true} assume !(0 != ~p3~0); {97386#true} is VALID [2022-04-08 08:20:11,615 INFO L290 TraceCheckUtils]: 11: Hoare triple {97386#true} assume !(0 != ~p4~0); {97386#true} is VALID [2022-04-08 08:20:11,615 INFO L290 TraceCheckUtils]: 12: Hoare triple {97386#true} assume !(0 != ~p5~0); {97386#true} is VALID [2022-04-08 08:20:11,615 INFO L290 TraceCheckUtils]: 13: Hoare triple {97386#true} assume !(0 != ~p6~0); {97386#true} is VALID [2022-04-08 08:20:11,616 INFO L290 TraceCheckUtils]: 14: Hoare triple {97386#true} assume 0 != ~p7~0;~lk7~0 := 1; {97391#(not (= main_~p7~0 0))} is VALID [2022-04-08 08:20:11,616 INFO L290 TraceCheckUtils]: 15: Hoare triple {97391#(not (= main_~p7~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {97391#(not (= main_~p7~0 0))} is VALID [2022-04-08 08:20:11,616 INFO L290 TraceCheckUtils]: 16: Hoare triple {97391#(not (= main_~p7~0 0))} assume !(0 != ~p1~0); {97391#(not (= main_~p7~0 0))} is VALID [2022-04-08 08:20:11,618 INFO L290 TraceCheckUtils]: 17: Hoare triple {97391#(not (= main_~p7~0 0))} assume !(0 != ~p2~0); {97391#(not (= main_~p7~0 0))} is VALID [2022-04-08 08:20:11,619 INFO L290 TraceCheckUtils]: 18: Hoare triple {97391#(not (= main_~p7~0 0))} assume !(0 != ~p3~0); {97391#(not (= main_~p7~0 0))} is VALID [2022-04-08 08:20:11,621 INFO L290 TraceCheckUtils]: 19: Hoare triple {97391#(not (= main_~p7~0 0))} assume !(0 != ~p4~0); {97391#(not (= main_~p7~0 0))} is VALID [2022-04-08 08:20:11,621 INFO L290 TraceCheckUtils]: 20: Hoare triple {97391#(not (= main_~p7~0 0))} assume !(0 != ~p5~0); {97391#(not (= main_~p7~0 0))} is VALID [2022-04-08 08:20:11,621 INFO L290 TraceCheckUtils]: 21: Hoare triple {97391#(not (= main_~p7~0 0))} assume !(0 != ~p6~0); {97391#(not (= main_~p7~0 0))} is VALID [2022-04-08 08:20:11,621 INFO L290 TraceCheckUtils]: 22: Hoare triple {97391#(not (= main_~p7~0 0))} assume !(0 != ~p7~0); {97387#false} is VALID [2022-04-08 08:20:11,622 INFO L290 TraceCheckUtils]: 23: Hoare triple {97387#false} assume 0 != ~p8~0; {97387#false} is VALID [2022-04-08 08:20:11,622 INFO L290 TraceCheckUtils]: 24: Hoare triple {97387#false} assume 1 != ~lk8~0; {97387#false} is VALID [2022-04-08 08:20:11,622 INFO L290 TraceCheckUtils]: 25: Hoare triple {97387#false} assume !false; {97387#false} is VALID [2022-04-08 08:20:11,622 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-08 08:20:11,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:20:11,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835892412] [2022-04-08 08:20:11,622 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835892412] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:20:11,622 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:20:11,622 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:20:11,622 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:20:11,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1035612441] [2022-04-08 08:20:11,622 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1035612441] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:20:11,622 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:20:11,622 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:20:11,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360695376] [2022-04-08 08:20:11,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:20:11,623 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 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 26 [2022-04-08 08:20:11,623 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:20:11,623 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 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-08 08:20:11,636 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:20:11,636 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:20:11,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:20:11,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:20:11,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:20:11,637 INFO L87 Difference]: Start difference. First operand 2953 states and 3655 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 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-08 08:20:12,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:20:12,883 INFO L93 Difference]: Finished difference Result 4429 states and 5449 transitions. [2022-04-08 08:20:12,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:20:12,883 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 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 26 [2022-04-08 08:20:12,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:20:12,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 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-08 08:20:12,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 133 transitions. [2022-04-08 08:20:12,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 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-08 08:20:12,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 133 transitions. [2022-04-08 08:20:12,885 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 133 transitions. [2022-04-08 08:20:12,959 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 133 edges. 133 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:20:13,309 INFO L225 Difference]: With dead ends: 4429 [2022-04-08 08:20:13,310 INFO L226 Difference]: Without dead ends: 3019 [2022-04-08 08:20:13,311 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:20:13,312 INFO L913 BasicCegarLoop]: 68 mSDtfsCounter, 99 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 08:20:13,312 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [99 Valid, 75 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 08:20:13,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3019 states. [2022-04-08 08:20:13,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3019 to 3017. [2022-04-08 08:20:13,553 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:20:13,556 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3019 states. Second operand has 3017 states, 3013 states have (on average 1.2120809824095586) internal successors, (3652), 3013 states have internal predecessors, (3652), 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-08 08:20:13,557 INFO L74 IsIncluded]: Start isIncluded. First operand 3019 states. Second operand has 3017 states, 3013 states have (on average 1.2120809824095586) internal successors, (3652), 3013 states have internal predecessors, (3652), 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-08 08:20:13,559 INFO L87 Difference]: Start difference. First operand 3019 states. Second operand has 3017 states, 3013 states have (on average 1.2120809824095586) internal successors, (3652), 3013 states have internal predecessors, (3652), 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-08 08:20:13,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:20:13,829 INFO L93 Difference]: Finished difference Result 3019 states and 3656 transitions. [2022-04-08 08:20:13,829 INFO L276 IsEmpty]: Start isEmpty. Operand 3019 states and 3656 transitions. [2022-04-08 08:20:13,832 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:20:13,832 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:20:13,835 INFO L74 IsIncluded]: Start isIncluded. First operand has 3017 states, 3013 states have (on average 1.2120809824095586) internal successors, (3652), 3013 states have internal predecessors, (3652), 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 3019 states. [2022-04-08 08:20:13,837 INFO L87 Difference]: Start difference. First operand has 3017 states, 3013 states have (on average 1.2120809824095586) internal successors, (3652), 3013 states have internal predecessors, (3652), 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 3019 states. [2022-04-08 08:20:14,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:20:14,093 INFO L93 Difference]: Finished difference Result 3019 states and 3656 transitions. [2022-04-08 08:20:14,093 INFO L276 IsEmpty]: Start isEmpty. Operand 3019 states and 3656 transitions. [2022-04-08 08:20:14,095 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:20:14,095 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:20:14,095 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:20:14,096 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:20:14,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3017 states, 3013 states have (on average 1.2120809824095586) internal successors, (3652), 3013 states have internal predecessors, (3652), 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-08 08:20:14,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3017 states to 3017 states and 3655 transitions. [2022-04-08 08:20:14,513 INFO L78 Accepts]: Start accepts. Automaton has 3017 states and 3655 transitions. Word has length 26 [2022-04-08 08:20:14,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:20:14,513 INFO L478 AbstractCegarLoop]: Abstraction has 3017 states and 3655 transitions. [2022-04-08 08:20:14,513 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 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-08 08:20:14,513 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3017 states and 3655 transitions. [2022-04-08 08:20:17,990 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 3655 edges. 3655 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:20:17,990 INFO L276 IsEmpty]: Start isEmpty. Operand 3017 states and 3655 transitions. [2022-04-08 08:20:17,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-08 08:20:17,992 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:20:17,993 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:20:17,993 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-04-08 08:20:17,993 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:20:17,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:20:17,993 INFO L85 PathProgramCache]: Analyzing trace with hash -173530997, now seen corresponding path program 1 times [2022-04-08 08:20:17,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:20:17,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1118881025] [2022-04-08 08:20:17,993 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:20:17,993 INFO L85 PathProgramCache]: Analyzing trace with hash -173530997, now seen corresponding path program 2 times [2022-04-08 08:20:17,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:20:17,994 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984735636] [2022-04-08 08:20:17,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:20:17,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:20:18,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:20:18,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:20:18,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:20:18,035 INFO L290 TraceCheckUtils]: 0: Hoare triple {118334#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {118328#true} is VALID [2022-04-08 08:20:18,035 INFO L290 TraceCheckUtils]: 1: Hoare triple {118328#true} assume true; {118328#true} is VALID [2022-04-08 08:20:18,035 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {118328#true} {118328#true} #166#return; {118328#true} is VALID [2022-04-08 08:20:18,036 INFO L272 TraceCheckUtils]: 0: Hoare triple {118328#true} call ULTIMATE.init(); {118334#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:20:18,036 INFO L290 TraceCheckUtils]: 1: Hoare triple {118334#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {118328#true} is VALID [2022-04-08 08:20:18,036 INFO L290 TraceCheckUtils]: 2: Hoare triple {118328#true} assume true; {118328#true} is VALID [2022-04-08 08:20:18,036 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {118328#true} {118328#true} #166#return; {118328#true} is VALID [2022-04-08 08:20:18,036 INFO L272 TraceCheckUtils]: 4: Hoare triple {118328#true} call #t~ret13 := main(); {118328#true} is VALID [2022-04-08 08:20:18,036 INFO L290 TraceCheckUtils]: 5: Hoare triple {118328#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;havoc ~cond~0; {118328#true} is VALID [2022-04-08 08:20:18,036 INFO L290 TraceCheckUtils]: 6: Hoare triple {118328#true} assume !false;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~cond~0 := #t~nondet12;havoc #t~nondet12; {118328#true} is VALID [2022-04-08 08:20:18,036 INFO L290 TraceCheckUtils]: 7: Hoare triple {118328#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0; {118328#true} is VALID [2022-04-08 08:20:18,036 INFO L290 TraceCheckUtils]: 8: Hoare triple {118328#true} assume !(0 != ~p1~0); {118328#true} is VALID [2022-04-08 08:20:18,036 INFO L290 TraceCheckUtils]: 9: Hoare triple {118328#true} assume !(0 != ~p2~0); {118328#true} is VALID [2022-04-08 08:20:18,036 INFO L290 TraceCheckUtils]: 10: Hoare triple {118328#true} assume !(0 != ~p3~0); {118328#true} is VALID [2022-04-08 08:20:18,036 INFO L290 TraceCheckUtils]: 11: Hoare triple {118328#true} assume !(0 != ~p4~0); {118328#true} is VALID [2022-04-08 08:20:18,036 INFO L290 TraceCheckUtils]: 12: Hoare triple {118328#true} assume !(0 != ~p5~0); {118328#true} is VALID [2022-04-08 08:20:18,036 INFO L290 TraceCheckUtils]: 13: Hoare triple {118328#true} assume !(0 != ~p6~0); {118328#true} is VALID [2022-04-08 08:20:18,037 INFO L290 TraceCheckUtils]: 14: Hoare triple {118328#true} assume !(0 != ~p7~0); {118328#true} is VALID [2022-04-08 08:20:18,037 INFO L290 TraceCheckUtils]: 15: Hoare triple {118328#true} assume 0 != ~p8~0;~lk8~0 := 1; {118333#(= main_~lk8~0 1)} is VALID [2022-04-08 08:20:18,037 INFO L290 TraceCheckUtils]: 16: Hoare triple {118333#(= main_~lk8~0 1)} assume !(0 != ~p1~0); {118333#(= main_~lk8~0 1)} is VALID [2022-04-08 08:20:18,037 INFO L290 TraceCheckUtils]: 17: Hoare triple {118333#(= main_~lk8~0 1)} assume !(0 != ~p2~0); {118333#(= main_~lk8~0 1)} is VALID [2022-04-08 08:20:18,038 INFO L290 TraceCheckUtils]: 18: Hoare triple {118333#(= main_~lk8~0 1)} assume !(0 != ~p3~0); {118333#(= main_~lk8~0 1)} is VALID [2022-04-08 08:20:18,038 INFO L290 TraceCheckUtils]: 19: Hoare triple {118333#(= main_~lk8~0 1)} assume !(0 != ~p4~0); {118333#(= main_~lk8~0 1)} is VALID [2022-04-08 08:20:18,038 INFO L290 TraceCheckUtils]: 20: Hoare triple {118333#(= main_~lk8~0 1)} assume !(0 != ~p5~0); {118333#(= main_~lk8~0 1)} is VALID [2022-04-08 08:20:18,038 INFO L290 TraceCheckUtils]: 21: Hoare triple {118333#(= main_~lk8~0 1)} assume !(0 != ~p6~0); {118333#(= main_~lk8~0 1)} is VALID [2022-04-08 08:20:18,038 INFO L290 TraceCheckUtils]: 22: Hoare triple {118333#(= main_~lk8~0 1)} assume !(0 != ~p7~0); {118333#(= main_~lk8~0 1)} is VALID [2022-04-08 08:20:18,039 INFO L290 TraceCheckUtils]: 23: Hoare triple {118333#(= main_~lk8~0 1)} assume 0 != ~p8~0; {118333#(= main_~lk8~0 1)} is VALID [2022-04-08 08:20:18,039 INFO L290 TraceCheckUtils]: 24: Hoare triple {118333#(= main_~lk8~0 1)} assume 1 != ~lk8~0; {118329#false} is VALID [2022-04-08 08:20:18,039 INFO L290 TraceCheckUtils]: 25: Hoare triple {118329#false} assume !false; {118329#false} is VALID [2022-04-08 08:20:18,039 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-08 08:20:18,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:20:18,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984735636] [2022-04-08 08:20:18,039 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984735636] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:20:18,039 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:20:18,039 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:20:18,040 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:20:18,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1118881025] [2022-04-08 08:20:18,040 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1118881025] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:20:18,040 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:20:18,040 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:20:18,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103718576] [2022-04-08 08:20:18,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:20:18,040 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 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 26 [2022-04-08 08:20:18,040 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:20:18,041 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 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-08 08:20:18,054 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:20:18,054 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:20:18,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:20:18,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:20:18,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:20:18,055 INFO L87 Difference]: Start difference. First operand 3017 states and 3655 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 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-08 08:20:19,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:20:19,594 INFO L93 Difference]: Finished difference Result 4875 states and 5832 transitions. [2022-04-08 08:20:19,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:20:19,594 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 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 26 [2022-04-08 08:20:19,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:20:19,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 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-08 08:20:19,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 78 transitions. [2022-04-08 08:20:19,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 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-08 08:20:19,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 78 transitions. [2022-04-08 08:20:19,596 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 78 transitions. [2022-04-08 08:20:19,644 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:20:20,638 INFO L225 Difference]: With dead ends: 4875 [2022-04-08 08:20:20,639 INFO L226 Difference]: Without dead ends: 4873 [2022-04-08 08:20:20,639 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:20:20,640 INFO L913 BasicCegarLoop]: 51 mSDtfsCounter, 84 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 08:20:20,640 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [84 Valid, 58 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 08:20:20,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4873 states. [2022-04-08 08:20:20,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4873 to 4617. [2022-04-08 08:20:20,975 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:20:20,981 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4873 states. Second operand has 4617 states, 4613 states have (on average 1.1801430739215262) internal successors, (5444), 4613 states have internal predecessors, (5444), 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-08 08:20:20,986 INFO L74 IsIncluded]: Start isIncluded. First operand 4873 states. Second operand has 4617 states, 4613 states have (on average 1.1801430739215262) internal successors, (5444), 4613 states have internal predecessors, (5444), 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-08 08:20:20,989 INFO L87 Difference]: Start difference. First operand 4873 states. Second operand has 4617 states, 4613 states have (on average 1.1801430739215262) internal successors, (5444), 4613 states have internal predecessors, (5444), 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-08 08:20:21,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:20:21,717 INFO L93 Difference]: Finished difference Result 4873 states and 5703 transitions. [2022-04-08 08:20:21,717 INFO L276 IsEmpty]: Start isEmpty. Operand 4873 states and 5703 transitions. [2022-04-08 08:20:21,721 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:20:21,721 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:20:21,727 INFO L74 IsIncluded]: Start isIncluded. First operand has 4617 states, 4613 states have (on average 1.1801430739215262) internal successors, (5444), 4613 states have internal predecessors, (5444), 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 4873 states. [2022-04-08 08:20:21,730 INFO L87 Difference]: Start difference. First operand has 4617 states, 4613 states have (on average 1.1801430739215262) internal successors, (5444), 4613 states have internal predecessors, (5444), 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 4873 states. [2022-04-08 08:20:22,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:20:22,454 INFO L93 Difference]: Finished difference Result 4873 states and 5703 transitions. [2022-04-08 08:20:22,455 INFO L276 IsEmpty]: Start isEmpty. Operand 4873 states and 5703 transitions. [2022-04-08 08:20:22,459 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:20:22,459 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:20:22,459 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:20:22,459 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:20:22,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4617 states, 4613 states have (on average 1.1801430739215262) internal successors, (5444), 4613 states have internal predecessors, (5444), 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-08 08:20:23,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4617 states to 4617 states and 5447 transitions. [2022-04-08 08:20:23,454 INFO L78 Accepts]: Start accepts. Automaton has 4617 states and 5447 transitions. Word has length 26 [2022-04-08 08:20:23,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:20:23,454 INFO L478 AbstractCegarLoop]: Abstraction has 4617 states and 5447 transitions. [2022-04-08 08:20:23,455 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 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-08 08:20:23,455 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4617 states and 5447 transitions. [2022-04-08 08:20:28,970 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 5447 edges. 5447 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:20:28,971 INFO L276 IsEmpty]: Start isEmpty. Operand 4617 states and 5447 transitions. [2022-04-08 08:20:28,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-08 08:20:28,975 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:20:28,975 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:20:28,975 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-04-08 08:20:28,975 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:20:28,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:20:28,975 INFO L85 PathProgramCache]: Analyzing trace with hash 527533581, now seen corresponding path program 1 times [2022-04-08 08:20:28,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:20:28,975 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1772655738] [2022-04-08 08:20:28,976 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:20:28,976 INFO L85 PathProgramCache]: Analyzing trace with hash 527533581, now seen corresponding path program 2 times [2022-04-08 08:20:28,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:20:28,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689115571] [2022-04-08 08:20:28,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:20:28,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:20:28,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:20:28,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:20:29,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:20:29,001 INFO L290 TraceCheckUtils]: 0: Hoare triple {147076#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {147070#true} is VALID [2022-04-08 08:20:29,002 INFO L290 TraceCheckUtils]: 1: Hoare triple {147070#true} assume true; {147070#true} is VALID [2022-04-08 08:20:29,002 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {147070#true} {147070#true} #166#return; {147070#true} is VALID [2022-04-08 08:20:29,002 INFO L272 TraceCheckUtils]: 0: Hoare triple {147070#true} call ULTIMATE.init(); {147076#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:20:29,002 INFO L290 TraceCheckUtils]: 1: Hoare triple {147076#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {147070#true} is VALID [2022-04-08 08:20:29,002 INFO L290 TraceCheckUtils]: 2: Hoare triple {147070#true} assume true; {147070#true} is VALID [2022-04-08 08:20:29,002 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {147070#true} {147070#true} #166#return; {147070#true} is VALID [2022-04-08 08:20:29,002 INFO L272 TraceCheckUtils]: 4: Hoare triple {147070#true} call #t~ret13 := main(); {147070#true} is VALID [2022-04-08 08:20:29,002 INFO L290 TraceCheckUtils]: 5: Hoare triple {147070#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;havoc ~cond~0; {147070#true} is VALID [2022-04-08 08:20:29,002 INFO L290 TraceCheckUtils]: 6: Hoare triple {147070#true} assume !false;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~cond~0 := #t~nondet12;havoc #t~nondet12; {147070#true} is VALID [2022-04-08 08:20:29,003 INFO L290 TraceCheckUtils]: 7: Hoare triple {147070#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0; {147070#true} is VALID [2022-04-08 08:20:29,003 INFO L290 TraceCheckUtils]: 8: Hoare triple {147070#true} assume !(0 != ~p1~0); {147070#true} is VALID [2022-04-08 08:20:29,003 INFO L290 TraceCheckUtils]: 9: Hoare triple {147070#true} assume !(0 != ~p2~0); {147070#true} is VALID [2022-04-08 08:20:29,003 INFO L290 TraceCheckUtils]: 10: Hoare triple {147070#true} assume !(0 != ~p3~0); {147070#true} is VALID [2022-04-08 08:20:29,003 INFO L290 TraceCheckUtils]: 11: Hoare triple {147070#true} assume !(0 != ~p4~0); {147070#true} is VALID [2022-04-08 08:20:29,003 INFO L290 TraceCheckUtils]: 12: Hoare triple {147070#true} assume !(0 != ~p5~0); {147070#true} is VALID [2022-04-08 08:20:29,003 INFO L290 TraceCheckUtils]: 13: Hoare triple {147070#true} assume !(0 != ~p6~0); {147070#true} is VALID [2022-04-08 08:20:29,003 INFO L290 TraceCheckUtils]: 14: Hoare triple {147070#true} assume !(0 != ~p7~0); {147070#true} is VALID [2022-04-08 08:20:29,003 INFO L290 TraceCheckUtils]: 15: Hoare triple {147070#true} assume !(0 != ~p8~0); {147075#(= main_~p8~0 0)} is VALID [2022-04-08 08:20:29,003 INFO L290 TraceCheckUtils]: 16: Hoare triple {147075#(= main_~p8~0 0)} assume !(0 != ~p1~0); {147075#(= main_~p8~0 0)} is VALID [2022-04-08 08:20:29,004 INFO L290 TraceCheckUtils]: 17: Hoare triple {147075#(= main_~p8~0 0)} assume !(0 != ~p2~0); {147075#(= main_~p8~0 0)} is VALID [2022-04-08 08:20:29,004 INFO L290 TraceCheckUtils]: 18: Hoare triple {147075#(= main_~p8~0 0)} assume !(0 != ~p3~0); {147075#(= main_~p8~0 0)} is VALID [2022-04-08 08:20:29,004 INFO L290 TraceCheckUtils]: 19: Hoare triple {147075#(= main_~p8~0 0)} assume !(0 != ~p4~0); {147075#(= main_~p8~0 0)} is VALID [2022-04-08 08:20:29,004 INFO L290 TraceCheckUtils]: 20: Hoare triple {147075#(= main_~p8~0 0)} assume !(0 != ~p5~0); {147075#(= main_~p8~0 0)} is VALID [2022-04-08 08:20:29,005 INFO L290 TraceCheckUtils]: 21: Hoare triple {147075#(= main_~p8~0 0)} assume !(0 != ~p6~0); {147075#(= main_~p8~0 0)} is VALID [2022-04-08 08:20:29,005 INFO L290 TraceCheckUtils]: 22: Hoare triple {147075#(= main_~p8~0 0)} assume !(0 != ~p7~0); {147075#(= main_~p8~0 0)} is VALID [2022-04-08 08:20:29,005 INFO L290 TraceCheckUtils]: 23: Hoare triple {147075#(= main_~p8~0 0)} assume 0 != ~p8~0; {147071#false} is VALID [2022-04-08 08:20:29,005 INFO L290 TraceCheckUtils]: 24: Hoare triple {147071#false} assume 1 != ~lk8~0; {147071#false} is VALID [2022-04-08 08:20:29,005 INFO L290 TraceCheckUtils]: 25: Hoare triple {147071#false} assume !false; {147071#false} is VALID [2022-04-08 08:20:29,005 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-08 08:20:29,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:20:29,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689115571] [2022-04-08 08:20:29,006 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689115571] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:20:29,006 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:20:29,006 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:20:29,006 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:20:29,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1772655738] [2022-04-08 08:20:29,006 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1772655738] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:20:29,006 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:20:29,006 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:20:29,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040427767] [2022-04-08 08:20:29,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:20:29,006 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 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 26 [2022-04-08 08:20:29,006 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:20:29,006 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 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-08 08:20:29,019 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:20:29,019 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:20:29,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:20:29,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:20:29,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:20:29,019 INFO L87 Difference]: Start difference. First operand 4617 states and 5447 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 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-08 08:20:34,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:20:34,340 INFO L93 Difference]: Finished difference Result 10249 states and 11847 transitions. [2022-04-08 08:20:34,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:20:34,341 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 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 26 [2022-04-08 08:20:34,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:20:34,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 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-08 08:20:34,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 133 transitions. [2022-04-08 08:20:34,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 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-08 08:20:34,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 133 transitions. [2022-04-08 08:20:34,342 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 133 transitions. [2022-04-08 08:20:34,416 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 133 edges. 133 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:20:34,416 INFO L225 Difference]: With dead ends: 10249 [2022-04-08 08:20:34,416 INFO L226 Difference]: Without dead ends: 0 [2022-04-08 08:20:34,428 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:20:34,428 INFO L913 BasicCegarLoop]: 85 mSDtfsCounter, 73 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 08:20:34,428 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [73 Valid, 92 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 08:20:34,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-08 08:20:34,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-08 08:20:34,429 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:20:34,429 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-08 08:20:34,429 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-08 08:20:34,429 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-08 08:20:34,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:20:34,429 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-08 08:20:34,429 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 08:20:34,429 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:20:34,429 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:20:34,429 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-08 08:20:34,429 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-08 08:20:34,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:20:34,429 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-08 08:20:34,430 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 08:20:34,430 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:20:34,430 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:20:34,430 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:20:34,430 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:20:34,430 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-08 08:20:34,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-08 08:20:34,430 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 26 [2022-04-08 08:20:34,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:20:34,430 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-08 08:20:34,430 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 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-08 08:20:34,430 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-08 08:20:34,430 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:20:34,430 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 08:20:34,430 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:20:34,432 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-08 08:20:34,433 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-04-08 08:20:34,434 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-08 08:20:45,396 WARN L232 SmtUtils]: Spent 6.66s on a formula simplification that was a NOOP. DAG size: 684 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-04-08 08:20:55,744 WARN L232 SmtUtils]: Spent 10.35s on a formula simplification that was a NOOP. DAG size: 1069 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-04-08 08:21:03,976 WARN L232 SmtUtils]: Spent 5.06s on a formula simplification that was a NOOP. DAG size: 492 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-04-08 08:21:13,225 WARN L232 SmtUtils]: Spent 9.25s on a formula simplification that was a NOOP. DAG size: 1069 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-04-08 08:22:04,775 WARN L232 SmtUtils]: Spent 10.06s on a formula simplification. DAG size of input: 297 DAG size of output: 291 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2022-04-08 08:22:33,206 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 3) no Hoare annotation was computed. [2022-04-08 08:22:33,206 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 3) no Hoare annotation was computed. [2022-04-08 08:22:33,206 INFO L882 garLoopResultBuilder]: For program point reach_errorFINAL(line 3) no Hoare annotation was computed. [2022-04-08 08:22:33,206 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-08 08:22:33,206 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-08 08:22:33,206 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-08 08:22:33,206 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-08 08:22:33,206 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-08 08:22:33,206 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-08 08:22:33,207 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-08 08:22:33,207 INFO L878 garLoopResultBuilder]: At program point L93(line 93) the Hoare annotation is: (let ((.cse3 (= main_~lk8~0 1)) (.cse4 (= main_~lk4~0 1)) (.cse0 (= main_~lk7~0 1)) (.cse14 (= main_~lk3~0 1)) (.cse5 (= main_~p5~0 0)) (.cse6 (= main_~p2~0 0)) (.cse7 (= main_~p6~0 0)) (.cse13 (= main_~p4~0 0)) (.cse9 (= main_~lk5~0 1)) (.cse1 (not (= main_~p1~0 0))) (.cse2 (= main_~lk1~0 1)) (.cse10 (= main_~p8~0 0)) (.cse11 (= main_~p7~0 0)) (.cse15 (= main_~lk6~0 1)) (.cse8 (= main_~p3~0 0)) (.cse12 (= main_~lk2~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse9 .cse1 .cse2 .cse10 .cse4 .cse6 .cse7 .cse8) (and .cse1 .cse2 .cse3 .cse4 .cse11 .cse5 .cse7 .cse8 .cse12) (and .cse13 .cse1 .cse2 .cse10 .cse11 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse13 .cse9 .cse1 .cse2 .cse3 .cse7 .cse8 .cse12) (and .cse0 .cse13 .cse1 .cse2 .cse3 .cse14 .cse5 .cse15 .cse12) (and .cse13 .cse9 .cse1 .cse2 .cse3 .cse11 .cse6 .cse7 .cse8) (and .cse0 .cse13 .cse9 .cse1 .cse2 .cse3 .cse14 .cse6 .cse15) (and .cse0 .cse9 .cse1 .cse2 .cse3 .cse4 .cse14 .cse6 .cse15) (and .cse0 .cse13 .cse9 .cse1 .cse2 .cse3 .cse6 .cse15 .cse8) (and .cse1 .cse2 .cse10 .cse4 .cse14 .cse11 .cse5 .cse6 .cse7) (and .cse1 .cse2 .cse10 .cse4 .cse11 .cse5 .cse15 .cse8 .cse12) (and .cse13 .cse9 .cse1 .cse2 .cse3 .cse14 .cse11 .cse6 .cse7) (and .cse0 .cse13 .cse9 .cse1 .cse2 .cse10 .cse7 .cse8 .cse12) (and .cse1 .cse2 .cse3 .cse4 .cse14 .cse11 .cse5 .cse6 .cse15) (and .cse13 .cse1 .cse2 .cse3 .cse14 .cse11 .cse5 .cse15 .cse12) (and .cse13 .cse9 .cse1 .cse2 .cse10 .cse11 .cse7 .cse8 .cse12) (and .cse13 .cse9 .cse1 .cse2 .cse10 .cse11 .cse6 .cse15 .cse8) (and .cse0 .cse13 .cse9 .cse1 .cse2 .cse3 .cse14 .cse7 .cse12) (and .cse0 .cse13 .cse9 .cse1 .cse2 .cse10 .cse6 .cse15 .cse8) (and .cse1 .cse2 .cse3 .cse4 .cse14 .cse11 .cse5 .cse15 .cse12) (and .cse0 .cse1 .cse2 .cse10 .cse4 .cse5 .cse15 .cse8 .cse12) (and .cse0 .cse13 .cse1 .cse2 .cse10 .cse14 .cse5 .cse15 .cse12) (and .cse0 .cse13 .cse9 .cse1 .cse2 .cse10 .cse14 .cse6 .cse15) (and .cse9 .cse1 .cse2 .cse3 .cse4 .cse14 .cse11 .cse6 .cse7) (and .cse1 .cse2 .cse10 .cse4 .cse14 .cse11 .cse5 .cse7 .cse12) (and .cse13 .cse1 .cse2 .cse10 .cse14 .cse11 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse10 .cse4 .cse14 .cse5 .cse6 .cse15) (and .cse1 .cse2 .cse3 .cse4 .cse11 .cse5 .cse15 .cse8 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse15 .cse8) (and .cse13 .cse1 .cse2 .cse3 .cse11 .cse5 .cse6 .cse15 .cse8) (and .cse0 .cse13 .cse9 .cse1 .cse2 .cse10 .cse14 .cse6 .cse7) (and .cse1 .cse2 .cse3 .cse4 .cse11 .cse5 .cse6 .cse15 .cse8) (and .cse1 .cse2 .cse3 .cse4 .cse14 .cse11 .cse5 .cse7 .cse12) (and .cse0 .cse9 .cse1 .cse2 .cse10 .cse4 .cse14 .cse15 .cse12) (and .cse1 .cse2 .cse10 .cse4 .cse11 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse14 .cse5 .cse6 .cse15) (and .cse0 .cse13 .cse9 .cse1 .cse2 .cse10 .cse6 .cse7 .cse8) (and .cse0 .cse13 .cse1 .cse2 .cse3 .cse5 .cse7 .cse8 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse14 .cse5 .cse7 .cse12) (and .cse13 .cse1 .cse2 .cse10 .cse14 .cse11 .cse5 .cse7 .cse12) (and .cse0 .cse9 .cse1 .cse2 .cse3 .cse4 .cse14 .cse7 .cse12) (and .cse0 .cse1 .cse2 .cse10 .cse4 .cse14 .cse5 .cse15 .cse12) (and .cse13 .cse9 .cse1 .cse2 .cse3 .cse11 .cse7 .cse8 .cse12) (and .cse0 .cse9 .cse1 .cse2 .cse10 .cse4 .cse7 .cse8 .cse12) (and .cse9 .cse1 .cse2 .cse10 .cse4 .cse14 .cse11 .cse6 .cse15) (and .cse0 .cse13 .cse1 .cse2 .cse10 .cse5 .cse7 .cse8 .cse12) (and .cse13 .cse1 .cse2 .cse10 .cse11 .cse5 .cse6 .cse15 .cse8) (and .cse13 .cse9 .cse1 .cse2 .cse3 .cse11 .cse6 .cse15 .cse8) (and .cse0 .cse9 .cse1 .cse2 .cse3 .cse4 .cse14 .cse6 .cse7) (and .cse0 .cse9 .cse1 .cse2 .cse3 .cse4 .cse6 .cse15 .cse8) (and .cse9 .cse1 .cse2 .cse10 .cse4 .cse14 .cse11 .cse15 .cse12) (and .cse13 .cse1 .cse2 .cse3 .cse11 .cse5 .cse7 .cse8 .cse12) (and .cse1 .cse2 .cse10 .cse4 .cse14 .cse11 .cse5 .cse6 .cse15) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse15 .cse8 .cse12) (and .cse0 .cse13 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse8) (and .cse13 .cse9 .cse1 .cse2 .cse3 .cse11 .cse15 .cse8 .cse12) (and .cse0 .cse1 .cse2 .cse10 .cse4 .cse5 .cse7 .cse8 .cse12) (and .cse9 .cse1 .cse2 .cse3 .cse4 .cse14 .cse11 .cse15 .cse12) (and .cse1 .cse2 .cse10 .cse4 .cse11 .cse5 .cse6 .cse15 .cse8) (and .cse0 .cse1 .cse2 .cse10 .cse4 .cse14 .cse5 .cse7 .cse12) (and .cse9 .cse1 .cse2 .cse3 .cse4 .cse14 .cse11 .cse7 .cse12) (and .cse9 .cse1 .cse2 .cse10 .cse4 .cse11 .cse7 .cse8 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse14 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse14 .cse5 .cse15 .cse12) (and .cse13 .cse1 .cse2 .cse10 .cse11 .cse5 .cse7 .cse8 .cse12) (and .cse0 .cse13 .cse1 .cse2 .cse3 .cse14 .cse5 .cse6 .cse7) (and .cse0 .cse13 .cse9 .cse1 .cse2 .cse10 .cse15 .cse8 .cse12) (and .cse0 .cse9 .cse1 .cse2 .cse3 .cse4 .cse7 .cse8 .cse12) (and .cse9 .cse1 .cse2 .cse10 .cse4 .cse11 .cse6 .cse7 .cse8) (and .cse13 .cse1 .cse2 .cse10 .cse14 .cse11 .cse5 .cse6 .cse15) (and .cse0 .cse9 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8) (and .cse0 .cse9 .cse1 .cse2 .cse3 .cse4 .cse14 .cse15 .cse12) (and .cse9 .cse1 .cse2 .cse10 .cse4 .cse14 .cse11 .cse6 .cse7) (and .cse9 .cse1 .cse2 .cse3 .cse4 .cse11 .cse15 .cse8 .cse12) (and .cse0 .cse9 .cse1 .cse2 .cse10 .cse4 .cse14 .cse6 .cse7) (and .cse13 .cse9 .cse1 .cse2 .cse3 .cse14 .cse11 .cse15 .cse12) (and .cse9 .cse1 .cse2 .cse3 .cse4 .cse14 .cse11 .cse6 .cse15) (and .cse13 .cse9 .cse1 .cse2 .cse10 .cse14 .cse11 .cse6 .cse15) (and .cse13 .cse1 .cse2 .cse10 .cse11 .cse5 .cse15 .cse8 .cse12) (and .cse13 .cse9 .cse1 .cse2 .cse10 .cse11 .cse6 .cse7 .cse8) (and .cse9 .cse1 .cse2 .cse3 .cse4 .cse11 .cse7 .cse8 .cse12) (and .cse13 .cse1 .cse2 .cse10 .cse14 .cse11 .cse5 .cse15 .cse12) (and .cse9 .cse1 .cse2 .cse10 .cse4 .cse11 .cse6 .cse15 .cse8) (and .cse0 .cse1 .cse2 .cse10 .cse4 .cse5 .cse6 .cse15 .cse8) (and .cse0 .cse9 .cse1 .cse2 .cse10 .cse4 .cse14 .cse7 .cse12) (and .cse0 .cse13 .cse1 .cse2 .cse3 .cse5 .cse15 .cse8 .cse12) (and .cse0 .cse13 .cse1 .cse2 .cse10 .cse5 .cse6 .cse15 .cse8) (and .cse0 .cse13 .cse9 .cse1 .cse2 .cse10 .cse14 .cse15 .cse12) (and .cse0 .cse9 .cse1 .cse2 .cse10 .cse4 .cse14 .cse6 .cse15) (and .cse13 .cse9 .cse1 .cse2 .cse10 .cse14 .cse11 .cse7 .cse12) (and .cse0 .cse13 .cse9 .cse1 .cse2 .cse3 .cse15 .cse8 .cse12) (and .cse0 .cse13 .cse9 .cse1 .cse2 .cse3 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse10 .cse4 .cse14 .cse5 .cse6 .cse7) (and .cse13 .cse1 .cse2 .cse3 .cse14 .cse11 .cse5 .cse7 .cse12) (and .cse0 .cse13 .cse1 .cse2 .cse10 .cse14 .cse5 .cse7 .cse12) (and .cse9 .cse1 .cse2 .cse3 .cse4 .cse11 .cse6 .cse7 .cse8) (and .cse0 .cse13 .cse9 .cse1 .cse2 .cse3 .cse14 .cse6 .cse7) (and .cse1 .cse2 .cse3 .cse4 .cse11 .cse5 .cse6 .cse7 .cse8) (and .cse9 .cse1 .cse2 .cse10 .cse4 .cse11 .cse15 .cse8 .cse12) (and .cse0 .cse13 .cse1 .cse2 .cse3 .cse5 .cse6 .cse15 .cse8) (and .cse0 .cse9 .cse1 .cse2 .cse10 .cse4 .cse6 .cse15 .cse8) (and .cse0 .cse13 .cse1 .cse2 .cse10 .cse14 .cse5 .cse6 .cse15) (and .cse13 .cse1 .cse2 .cse3 .cse14 .cse11 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse12) (and .cse13 .cse1 .cse2 .cse3 .cse11 .cse5 .cse6 .cse7 .cse8) (and .cse9 .cse1 .cse2 .cse10 .cse4 .cse14 .cse11 .cse7 .cse12) (and .cse0 .cse13 .cse9 .cse1 .cse2 .cse10 .cse14 .cse7 .cse12) (and .cse13 .cse9 .cse1 .cse2 .cse10 .cse14 .cse11 .cse6 .cse7) (and .cse0 .cse9 .cse1 .cse2 .cse3 .cse4 .cse15 .cse8 .cse12) (and .cse0 .cse13 .cse1 .cse2 .cse10 .cse5 .cse15 .cse8 .cse12) (and .cse13 .cse9 .cse1 .cse2 .cse3 .cse14 .cse11 .cse6 .cse15) (and .cse13 .cse9 .cse1 .cse2 .cse10 .cse14 .cse11 .cse15 .cse12) (and .cse9 .cse1 .cse2 .cse3 .cse4 .cse11 .cse6 .cse15 .cse8) (and .cse0 .cse13 .cse1 .cse2 .cse3 .cse14 .cse5 .cse6 .cse15) (and .cse13 .cse1 .cse2 .cse3 .cse14 .cse11 .cse5 .cse6 .cse15) (and .cse1 .cse2 .cse10 .cse4 .cse14 .cse11 .cse5 .cse15 .cse12) (and .cse0 .cse13 .cse1 .cse2 .cse10 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse13 .cse1 .cse2 .cse3 .cse14 .cse5 .cse7 .cse12) (and .cse1 .cse2 .cse3 .cse4 .cse14 .cse11 .cse5 .cse6 .cse7) (and .cse13 .cse9 .cse1 .cse2 .cse3 .cse14 .cse11 .cse7 .cse12) (and .cse0 .cse9 .cse1 .cse2 .cse10 .cse4 .cse15 .cse8 .cse12) (and .cse13 .cse1 .cse2 .cse3 .cse11 .cse5 .cse15 .cse8 .cse12) (and .cse0 .cse13 .cse9 .cse1 .cse2 .cse3 .cse14 .cse15 .cse12) (and .cse0 .cse1 .cse2 .cse10 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse1 .cse2 .cse10 .cse4 .cse11 .cse5 .cse7 .cse8 .cse12) (and .cse0 .cse13 .cse1 .cse2 .cse10 .cse14 .cse5 .cse6 .cse7) (and .cse13 .cse9 .cse1 .cse2 .cse10 .cse11 .cse15 .cse8 .cse12))) [2022-04-08 08:22:33,207 INFO L885 garLoopResultBuilder]: At program point mainEXIT(lines 6 137) the Hoare annotation is: true [2022-04-08 08:22:33,207 INFO L878 garLoopResultBuilder]: At program point L118(line 118) the Hoare annotation is: (let ((.cse0 (= main_~lk7~0 1)) (.cse1 (= main_~p8~0 0)) (.cse4 (= main_~lk8~0 1)) (.cse5 (= main_~p7~0 0)) (.cse2 (= main_~lk6~0 1)) (.cse3 (not (= main_~p6~0 0)))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse4 .cse2 .cse3) (and .cse1 .cse5 .cse2 .cse3) (and .cse4 .cse5 .cse2 .cse3))) [2022-04-08 08:22:33,208 INFO L878 garLoopResultBuilder]: At program point L102-1(lines 35 132) the Hoare annotation is: (let ((.cse1 (= main_~lk8~0 1)) (.cse2 (= main_~lk4~0 1)) (.cse3 (= main_~p7~0 0)) (.cse9 (= main_~p5~0 0)) (.cse4 (= main_~lk6~0 1)) (.cse5 (= main_~lk7~0 1)) (.cse8 (= main_~p4~0 0)) (.cse0 (= main_~lk5~0 1)) (.cse6 (= main_~p8~0 0)) (.cse7 (= main_~p6~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse0 .cse6 .cse2 .cse4) (and .cse0 .cse1 .cse2 .cse3 .cse7) (and .cse5 .cse8 .cse0 .cse6 .cse4) (and .cse5 .cse0 .cse1 .cse2 .cse4) (and .cse5 .cse8 .cse6 .cse9 .cse7) (and .cse5 .cse0 .cse6 .cse2 .cse7) (and .cse5 .cse6 .cse2 .cse9 .cse4) (and .cse8 .cse1 .cse3 .cse9 .cse7) (and .cse5 .cse8 .cse1 .cse9 .cse4) (and .cse5 .cse8 .cse1 .cse9 .cse7) (and .cse1 .cse2 .cse3 .cse9 .cse7) (and .cse5 .cse0 .cse1 .cse2 .cse7) (and .cse8 .cse0 .cse1 .cse3 .cse4) (and .cse8 .cse1 .cse3 .cse9 .cse4) (and .cse5 .cse8 .cse6 .cse9 .cse4) (and .cse5 .cse1 .cse2 .cse9 .cse7) (and .cse8 .cse0 .cse6 .cse3 .cse7) (and .cse5 .cse6 .cse2 .cse9 .cse7) (and .cse8 .cse6 .cse3 .cse9 .cse4) (and .cse0 .cse6 .cse2 .cse3 .cse7) (and .cse5 .cse1 .cse2 .cse9 .cse4) (and .cse5 .cse8 .cse0 .cse1 .cse4) (and .cse5 .cse8 .cse0 .cse1 .cse7) (and .cse8 .cse0 .cse6 .cse3 .cse4) (and .cse8 .cse6 .cse3 .cse9 .cse7) (and .cse6 .cse2 .cse3 .cse9 .cse7) (and .cse0 .cse6 .cse2 .cse3 .cse4) (and .cse8 .cse0 .cse1 .cse3 .cse7) (and .cse6 .cse2 .cse3 .cse9 .cse4) (and .cse1 .cse2 .cse3 .cse9 .cse4) (and .cse5 .cse8 .cse0 .cse6 .cse7))) [2022-04-08 08:22:33,208 INFO L885 garLoopResultBuilder]: At program point L127-1(lines 35 132) the Hoare annotation is: true [2022-04-08 08:22:33,209 INFO L878 garLoopResultBuilder]: At program point L86-1(lines 35 132) the Hoare annotation is: (let ((.cse3 (= main_~lk3~0 1)) (.cse1 (= main_~lk5~0 1)) (.cse4 (= main_~p1~0 0)) (.cse6 (= main_~p2~0 0)) (.cse8 (= main_~lk7~0 1)) (.cse13 (= main_~p8~0 0)) (.cse14 (= main_~lk4~0 1)) (.cse7 (= main_~lk6~0 1)) (.cse0 (= main_~p4~0 0)) (.cse12 (= main_~lk1~0 1)) (.cse2 (= main_~lk8~0 1)) (.cse5 (= main_~p7~0 0)) (.cse9 (= main_~p5~0 0)) (.cse10 (= main_~p6~0 0)) (.cse15 (= main_~p3~0 0)) (.cse11 (= main_~lk2~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse8 .cse0 .cse2 .cse3 .cse4 .cse9 .cse10 .cse11) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse9 .cse7 .cse11) (and .cse8 .cse0 .cse12 .cse13 .cse3 .cse9 .cse7 .cse11) (and .cse8 .cse1 .cse2 .cse14 .cse3 .cse4 .cse10 .cse11) (and .cse8 .cse2 .cse14 .cse4 .cse9 .cse10 .cse15 .cse11) (and .cse8 .cse1 .cse12 .cse2 .cse14 .cse3 .cse10 .cse11) (and .cse0 .cse13 .cse4 .cse5 .cse9 .cse6 .cse7 .cse15) (and .cse8 .cse1 .cse2 .cse14 .cse4 .cse6 .cse7 .cse15) (and .cse0 .cse2 .cse4 .cse5 .cse9 .cse6 .cse7 .cse15) (and .cse8 .cse12 .cse2 .cse14 .cse3 .cse9 .cse6 .cse7) (and .cse8 .cse0 .cse12 .cse2 .cse9 .cse6 .cse7 .cse15) (and .cse8 .cse0 .cse1 .cse2 .cse4 .cse7 .cse15 .cse11) (and .cse0 .cse12 .cse13 .cse5 .cse9 .cse7 .cse15 .cse11) (and .cse0 .cse1 .cse12 .cse13 .cse3 .cse5 .cse7 .cse11) (and .cse8 .cse2 .cse14 .cse3 .cse4 .cse9 .cse10 .cse11) (and .cse2 .cse14 .cse3 .cse4 .cse5 .cse9 .cse7 .cse11) (and .cse0 .cse2 .cse4 .cse5 .cse9 .cse7 .cse15 .cse11) (and .cse8 .cse12 .cse13 .cse14 .cse3 .cse9 .cse6 .cse7) (and .cse0 .cse13 .cse3 .cse4 .cse5 .cse9 .cse6 .cse10) (and .cse1 .cse13 .cse14 .cse4 .cse5 .cse6 .cse10 .cse15) (and .cse8 .cse0 .cse2 .cse4 .cse9 .cse6 .cse10 .cse15) (and .cse8 .cse12 .cse2 .cse14 .cse9 .cse7 .cse15 .cse11) (and .cse8 .cse0 .cse12 .cse13 .cse3 .cse9 .cse6 .cse7) (and .cse8 .cse0 .cse1 .cse12 .cse13 .cse6 .cse7 .cse15) (and .cse8 .cse0 .cse12 .cse13 .cse9 .cse6 .cse10 .cse15) (and .cse8 .cse0 .cse2 .cse3 .cse4 .cse9 .cse6 .cse10) (and .cse2 .cse14 .cse3 .cse4 .cse5 .cse9 .cse6 .cse7) (and .cse1 .cse12 .cse2 .cse14 .cse3 .cse5 .cse7 .cse11) (and .cse8 .cse0 .cse1 .cse12 .cse13 .cse10 .cse15 .cse11) (and .cse8 .cse0 .cse12 .cse13 .cse3 .cse9 .cse6 .cse10) (and .cse0 .cse1 .cse13 .cse3 .cse4 .cse5 .cse6 .cse10) (and .cse0 .cse12 .cse13 .cse3 .cse5 .cse9 .cse10 .cse11) (and .cse8 .cse12 .cse2 .cse14 .cse3 .cse9 .cse6 .cse10) (and .cse8 .cse13 .cse14 .cse3 .cse4 .cse9 .cse10 .cse11) (and .cse8 .cse0 .cse13 .cse3 .cse4 .cse9 .cse6 .cse10) (and .cse8 .cse12 .cse13 .cse14 .cse9 .cse10 .cse15 .cse11) (and .cse8 .cse0 .cse13 .cse3 .cse4 .cse9 .cse6 .cse7) (and .cse8 .cse0 .cse1 .cse12 .cse2 .cse10 .cse15 .cse11) (and .cse8 .cse0 .cse1 .cse12 .cse2 .cse3 .cse10 .cse11) (and .cse8 .cse0 .cse13 .cse3 .cse4 .cse9 .cse10 .cse11) (and .cse8 .cse2 .cse14 .cse4 .cse9 .cse6 .cse10 .cse15) (and .cse0 .cse1 .cse13 .cse4 .cse5 .cse6 .cse10 .cse15) (and .cse8 .cse0 .cse1 .cse12 .cse13 .cse6 .cse10 .cse15) (and .cse0 .cse1 .cse12 .cse2 .cse5 .cse10 .cse15 .cse11) (and .cse0 .cse1 .cse12 .cse13 .cse5 .cse6 .cse10 .cse15) (and .cse8 .cse12 .cse13 .cse14 .cse3 .cse9 .cse10 .cse11) (and .cse13 .cse14 .cse4 .cse5 .cse9 .cse6 .cse7 .cse15) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse10 .cse15 .cse11) (and .cse0 .cse1 .cse13 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse13 .cse4 .cse5 .cse10 .cse15 .cse11) (and .cse1 .cse13 .cse14 .cse3 .cse4 .cse5 .cse7 .cse11) (and .cse8 .cse0 .cse1 .cse12 .cse13 .cse3 .cse7 .cse11) (and .cse8 .cse1 .cse12 .cse13 .cse14 .cse10 .cse15 .cse11) (and .cse1 .cse2 .cse14 .cse4 .cse5 .cse6 .cse7 .cse15) (and .cse8 .cse13 .cse14 .cse3 .cse4 .cse9 .cse6 .cse10) (and .cse8 .cse0 .cse2 .cse4 .cse9 .cse6 .cse7 .cse15) (and .cse8 .cse1 .cse13 .cse14 .cse3 .cse4 .cse6 .cse10) (and .cse8 .cse0 .cse12 .cse2 .cse3 .cse9 .cse6 .cse10) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse7 .cse15 .cse11) (and .cse0 .cse2 .cse4 .cse5 .cse9 .cse10 .cse15 .cse11) (and .cse8 .cse0 .cse1 .cse13 .cse3 .cse4 .cse6 .cse10) (and .cse8 .cse2 .cse14 .cse4 .cse9 .cse6 .cse7 .cse15) (and .cse8 .cse0 .cse13 .cse4 .cse9 .cse6 .cse10 .cse15) (and .cse8 .cse2 .cse14 .cse3 .cse4 .cse9 .cse7 .cse11) (and .cse1 .cse2 .cse14 .cse4 .cse5 .cse10 .cse15 .cse11) (and .cse8 .cse2 .cse14 .cse3 .cse4 .cse9 .cse6 .cse7) (and .cse0 .cse12 .cse2 .cse3 .cse5 .cse9 .cse7 .cse11) (and .cse13 .cse14 .cse3 .cse4 .cse5 .cse9 .cse7 .cse11) (and .cse0 .cse12 .cse13 .cse5 .cse9 .cse6 .cse7 .cse15) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse9 .cse6 .cse10) (and .cse1 .cse13 .cse14 .cse3 .cse4 .cse5 .cse6 .cse10) (and .cse0 .cse12 .cse2 .cse3 .cse5 .cse9 .cse10 .cse11) (and .cse8 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7) (and .cse1 .cse13 .cse14 .cse3 .cse4 .cse5 .cse10 .cse11) (and .cse8 .cse0 .cse1 .cse12 .cse13 .cse7 .cse15 .cse11) (and .cse0 .cse1 .cse12 .cse13 .cse5 .cse7 .cse15 .cse11) (and .cse8 .cse0 .cse1 .cse12 .cse2 .cse3 .cse7 .cse11) (and .cse1 .cse2 .cse14 .cse3 .cse4 .cse5 .cse6 .cse10) (and .cse0 .cse1 .cse12 .cse2 .cse3 .cse5 .cse7 .cse11) (and .cse8 .cse0 .cse12 .cse2 .cse9 .cse6 .cse10 .cse15) (and .cse8 .cse0 .cse1 .cse2 .cse4 .cse6 .cse7 .cse15) (and .cse0 .cse12 .cse13 .cse5 .cse9 .cse6 .cse10 .cse15) (and .cse12 .cse13 .cse14 .cse5 .cse9 .cse7 .cse15 .cse11) (and .cse0 .cse1 .cse13 .cse4 .cse5 .cse6 .cse7 .cse15) (and .cse8 .cse0 .cse1 .cse12 .cse2 .cse7 .cse15 .cse11) (and .cse12 .cse2 .cse14 .cse5 .cse9 .cse6 .cse10 .cse15) (and .cse8 .cse0 .cse12 .cse13 .cse9 .cse10 .cse15 .cse11) (and .cse1 .cse12 .cse13 .cse14 .cse3 .cse5 .cse7 .cse11) (and .cse1 .cse12 .cse13 .cse14 .cse5 .cse7 .cse15 .cse11) (and .cse8 .cse0 .cse12 .cse13 .cse9 .cse7 .cse15 .cse11) (and .cse8 .cse0 .cse2 .cse3 .cse4 .cse9 .cse7 .cse11) (and .cse1 .cse2 .cse14 .cse4 .cse5 .cse6 .cse10 .cse15) (and .cse0 .cse1 .cse13 .cse3 .cse4 .cse5 .cse7 .cse11) (and .cse12 .cse13 .cse14 .cse3 .cse5 .cse9 .cse7 .cse11) (and .cse8 .cse1 .cse13 .cse14 .cse3 .cse4 .cse10 .cse11) (and .cse8 .cse1 .cse12 .cse13 .cse14 .cse6 .cse7 .cse15) (and .cse8 .cse0 .cse13 .cse4 .cse9 .cse10 .cse15 .cse11) (and .cse0 .cse12 .cse13 .cse3 .cse5 .cse9 .cse7 .cse11) (and .cse8 .cse0 .cse13 .cse3 .cse4 .cse9 .cse7 .cse11) (and .cse8 .cse1 .cse13 .cse14 .cse4 .cse10 .cse15 .cse11) (and .cse12 .cse13 .cse14 .cse3 .cse5 .cse9 .cse6 .cse10) (and .cse8 .cse2 .cse14 .cse4 .cse9 .cse7 .cse15 .cse11) (and .cse8 .cse0 .cse1 .cse12 .cse13 .cse3 .cse10 .cse11) (and .cse0 .cse12 .cse13 .cse3 .cse5 .cse9 .cse6 .cse7) (and .cse8 .cse1 .cse12 .cse13 .cse14 .cse3 .cse6 .cse10) (and .cse8 .cse13 .cse14 .cse4 .cse9 .cse7 .cse15 .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse10 .cse11) (and .cse0 .cse12 .cse2 .cse5 .cse9 .cse6 .cse10 .cse15) (and .cse12 .cse13 .cse14 .cse5 .cse9 .cse6 .cse10 .cse15) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse9 .cse10 .cse11) (and .cse2 .cse14 .cse4 .cse5 .cse9 .cse6 .cse7 .cse15) (and .cse1 .cse13 .cse14 .cse4 .cse5 .cse7 .cse15 .cse11) (and .cse1 .cse2 .cse14 .cse4 .cse5 .cse7 .cse15 .cse11) (and .cse12 .cse13 .cse14 .cse3 .cse5 .cse9 .cse6 .cse7) (and .cse8 .cse0 .cse1 .cse2 .cse3 .cse4 .cse10 .cse11) (and .cse2 .cse14 .cse4 .cse5 .cse9 .cse7 .cse15 .cse11) (and .cse8 .cse1 .cse12 .cse2 .cse14 .cse3 .cse6 .cse10) (and .cse0 .cse1 .cse12 .cse2 .cse5 .cse6 .cse10 .cse15) (and .cse13 .cse14 .cse4 .cse5 .cse9 .cse7 .cse15 .cse11) (and .cse12 .cse2 .cse14 .cse5 .cse9 .cse6 .cse7 .cse15) (and .cse8 .cse0 .cse1 .cse2 .cse4 .cse10 .cse15 .cse11) (and .cse8 .cse0 .cse12 .cse13 .cse3 .cse9 .cse10 .cse11) (and .cse12 .cse2 .cse14 .cse3 .cse5 .cse9 .cse10 .cse11) (and .cse8 .cse0 .cse13 .cse4 .cse9 .cse6 .cse7 .cse15) (and .cse0 .cse1 .cse12 .cse13 .cse3 .cse5 .cse6 .cse7) (and .cse8 .cse0 .cse1 .cse12 .cse13 .cse3 .cse6 .cse10) (and .cse8 .cse0 .cse1 .cse13 .cse4 .cse10 .cse15 .cse11) (and .cse8 .cse12 .cse2 .cse14 .cse3 .cse9 .cse7 .cse11) (and .cse8 .cse1 .cse12 .cse2 .cse14 .cse7 .cse15 .cse11) (and .cse8 .cse12 .cse13 .cse14 .cse9 .cse6 .cse7 .cse15) (and .cse0 .cse13 .cse3 .cse4 .cse5 .cse9 .cse6 .cse7) (and .cse8 .cse0 .cse1 .cse13 .cse4 .cse7 .cse15 .cse11) (and .cse8 .cse0 .cse1 .cse12 .cse13 .cse3 .cse6 .cse7) (and .cse1 .cse12 .cse2 .cse14 .cse5 .cse6 .cse7 .cse15) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse9 .cse6 .cse7) (and .cse2 .cse14 .cse4 .cse5 .cse9 .cse6 .cse10 .cse15) (and .cse8 .cse1 .cse12 .cse2 .cse14 .cse6 .cse7 .cse15) (and .cse8 .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse10) (and .cse1 .cse12 .cse2 .cse14 .cse5 .cse6 .cse10 .cse15) (and .cse8 .cse1 .cse13 .cse14 .cse4 .cse6 .cse10 .cse15) (and .cse8 .cse2 .cse14 .cse3 .cse4 .cse9 .cse6 .cse10) (and .cse12 .cse13 .cse14 .cse5 .cse9 .cse6 .cse7 .cse15) (and .cse0 .cse1 .cse12 .cse13 .cse3 .cse5 .cse10 .cse11) (and .cse0 .cse13 .cse3 .cse4 .cse5 .cse9 .cse10 .cse11) (and .cse0 .cse2 .cse4 .cse5 .cse9 .cse6 .cse10 .cse15) (and .cse0 .cse1 .cse12 .cse2 .cse3 .cse5 .cse10 .cse11) (and .cse12 .cse2 .cse14 .cse3 .cse5 .cse9 .cse6 .cse10) (and .cse8 .cse0 .cse1 .cse13 .cse3 .cse4 .cse10 .cse11) (and .cse0 .cse13 .cse3 .cse4 .cse5 .cse9 .cse7 .cse11) (and .cse8 .cse12 .cse13 .cse14 .cse9 .cse6 .cse10 .cse15) (and .cse8 .cse0 .cse12 .cse2 .cse3 .cse9 .cse6 .cse7) (and .cse8 .cse1 .cse2 .cse14 .cse3 .cse4 .cse6 .cse7) (and .cse1 .cse13 .cse14 .cse4 .cse5 .cse10 .cse15 .cse11) (and .cse8 .cse0 .cse13 .cse4 .cse9 .cse7 .cse15 .cse11) (and .cse8 .cse12 .cse2 .cse14 .cse9 .cse6 .cse7 .cse15) (and .cse0 .cse12 .cse13 .cse5 .cse9 .cse10 .cse15 .cse11) (and .cse8 .cse13 .cse14 .cse4 .cse9 .cse10 .cse15 .cse11) (and .cse13 .cse14 .cse3 .cse4 .cse5 .cse9 .cse10 .cse11) (and .cse8 .cse1 .cse12 .cse13 .cse14 .cse3 .cse7 .cse11) (and .cse0 .cse12 .cse2 .cse3 .cse5 .cse9 .cse6 .cse7) (and .cse8 .cse0 .cse1 .cse13 .cse3 .cse4 .cse7 .cse11) (and .cse1 .cse12 .cse13 .cse14 .cse5 .cse6 .cse7 .cse15) (and .cse2 .cse14 .cse4 .cse5 .cse9 .cse10 .cse15 .cse11) (and .cse1 .cse12 .cse13 .cse14 .cse5 .cse10 .cse15 .cse11) (and .cse8 .cse0 .cse12 .cse2 .cse3 .cse9 .cse7 .cse11) (and .cse8 .cse1 .cse2 .cse14 .cse4 .cse10 .cse15 .cse11) (and .cse0 .cse1 .cse12 .cse13 .cse3 .cse5 .cse6 .cse10) (and .cse0 .cse13 .cse4 .cse5 .cse9 .cse6 .cse10 .cse15) (and .cse12 .cse2 .cse14 .cse5 .cse9 .cse10 .cse15 .cse11) (and .cse8 .cse13 .cse14 .cse3 .cse4 .cse9 .cse7 .cse11) (and .cse8 .cse1 .cse13 .cse14 .cse3 .cse4 .cse7 .cse11) (and .cse8 .cse0 .cse12 .cse13 .cse9 .cse6 .cse7 .cse15) (and .cse13 .cse14 .cse3 .cse4 .cse5 .cse9 .cse6 .cse10) (and .cse0 .cse13 .cse4 .cse5 .cse9 .cse7 .cse15 .cse11) (and .cse8 .cse0 .cse1 .cse12 .cse2 .cse6 .cse10 .cse15) (and .cse8 .cse0 .cse1 .cse12 .cse2 .cse3 .cse6 .cse10) (and .cse1 .cse12 .cse13 .cse14 .cse3 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse12 .cse13 .cse5 .cse6 .cse7 .cse15) (and .cse2 .cse14 .cse3 .cse4 .cse5 .cse9 .cse10 .cse11) (and .cse8 .cse1 .cse13 .cse14 .cse4 .cse7 .cse15 .cse11) (and .cse8 .cse12 .cse13 .cse14 .cse3 .cse9 .cse6 .cse10) (and .cse1 .cse2 .cse14 .cse3 .cse4 .cse5 .cse7 .cse11) (and .cse12 .cse2 .cse14 .cse3 .cse5 .cse9 .cse6 .cse7) (and .cse1 .cse12 .cse13 .cse14 .cse3 .cse5 .cse6 .cse10) (and .cse0 .cse1 .cse12 .cse2 .cse3 .cse5 .cse6 .cse10) (and .cse8 .cse0 .cse2 .cse4 .cse9 .cse7 .cse15 .cse11) (and .cse8 .cse0 .cse2 .cse3 .cse4 .cse9 .cse6 .cse7) (and .cse1 .cse2 .cse14 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse10) (and .cse8 .cse13 .cse14 .cse4 .cse9 .cse6 .cse7 .cse15) (and .cse8 .cse1 .cse12 .cse2 .cse14 .cse10 .cse15 .cse11) (and .cse8 .cse1 .cse2 .cse14 .cse3 .cse4 .cse6 .cse10) (and .cse0 .cse1 .cse12 .cse2 .cse5 .cse6 .cse7 .cse15) (and .cse8 .cse1 .cse12 .cse13 .cse14 .cse3 .cse10 .cse11) (and .cse8 .cse0 .cse1 .cse13 .cse4 .cse6 .cse7 .cse15) (and .cse8 .cse0 .cse1 .cse12 .cse2 .cse6 .cse7 .cse15) (and .cse8 .cse0 .cse12 .cse2 .cse9 .cse7 .cse15 .cse11) (and .cse8 .cse1 .cse2 .cse14 .cse4 .cse7 .cse15 .cse11) (and .cse8 .cse13 .cse14 .cse3 .cse4 .cse9 .cse6 .cse7) (and .cse8 .cse0 .cse12 .cse2 .cse3 .cse9 .cse10 .cse11) (and .cse0 .cse1 .cse12 .cse2 .cse5 .cse7 .cse15 .cse11) (and .cse12 .cse13 .cse14 .cse5 .cse9 .cse10 .cse15 .cse11) (and .cse8 .cse1 .cse12 .cse2 .cse14 .cse3 .cse7 .cse11) (and .cse0 .cse1 .cse12 .cse2 .cse3 .cse5 .cse6 .cse7) (and .cse8 .cse12 .cse2 .cse14 .cse9 .cse6 .cse10 .cse15) (and .cse1 .cse13 .cse14 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse13 .cse3 .cse4 .cse5 .cse10 .cse11) (and .cse13 .cse14 .cse3 .cse4 .cse5 .cse9 .cse6 .cse7) (and .cse8 .cse0 .cse1 .cse13 .cse3 .cse4 .cse6 .cse7) (and .cse1 .cse12 .cse2 .cse14 .cse5 .cse7 .cse15 .cse11) (and .cse8 .cse1 .cse12 .cse13 .cse14 .cse3 .cse6 .cse7) (and .cse12 .cse2 .cse14 .cse5 .cse9 .cse7 .cse15 .cse11) (and .cse8 .cse1 .cse12 .cse2 .cse14 .cse6 .cse10 .cse15) (and .cse8 .cse1 .cse13 .cse14 .cse3 .cse4 .cse6 .cse7) (and .cse13 .cse14 .cse4 .cse5 .cse9 .cse10 .cse15 .cse11) (and .cse1 .cse2 .cse14 .cse3 .cse4 .cse5 .cse10 .cse11) (and .cse0 .cse1 .cse12 .cse13 .cse5 .cse10 .cse15 .cse11) (and .cse0 .cse1 .cse13 .cse4 .cse5 .cse7 .cse15 .cse11) (and .cse8 .cse12 .cse2 .cse14 .cse3 .cse9 .cse10 .cse11) (and .cse8 .cse12 .cse13 .cse14 .cse3 .cse9 .cse7 .cse11) (and .cse0 .cse12 .cse13 .cse3 .cse5 .cse9 .cse6 .cse10) (and .cse13 .cse14 .cse4 .cse5 .cse9 .cse6 .cse10 .cse15) (and .cse2 .cse14 .cse3 .cse4 .cse5 .cse9 .cse6 .cse10) (and .cse12 .cse13 .cse14 .cse3 .cse5 .cse9 .cse10 .cse11) (and .cse1 .cse13 .cse14 .cse4 .cse5 .cse6 .cse7 .cse15) (and .cse1 .cse12 .cse2 .cse14 .cse3 .cse5 .cse10 .cse11) (and .cse1 .cse12 .cse13 .cse14 .cse3 .cse5 .cse10 .cse11) (and .cse8 .cse1 .cse12 .cse13 .cse14 .cse6 .cse10 .cse15) (and .cse1 .cse12 .cse2 .cse14 .cse3 .cse5 .cse6 .cse10) (and .cse8 .cse1 .cse12 .cse2 .cse14 .cse3 .cse6 .cse7) (and .cse1 .cse12 .cse2 .cse14 .cse3 .cse5 .cse6 .cse7) (and .cse0 .cse13 .cse4 .cse5 .cse9 .cse10 .cse15 .cse11) (and .cse8 .cse1 .cse2 .cse14 .cse4 .cse6 .cse10 .cse15) (and .cse8 .cse1 .cse12 .cse13 .cse14 .cse7 .cse15 .cse11) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse10 .cse15) (and .cse8 .cse12 .cse2 .cse14 .cse9 .cse10 .cse15 .cse11) (and .cse8 .cse0 .cse1 .cse12 .cse2 .cse3 .cse6 .cse7) (and .cse12 .cse2 .cse14 .cse3 .cse5 .cse9 .cse7 .cse11) (and .cse8 .cse0 .cse1 .cse2 .cse4 .cse6 .cse10 .cse15) (and .cse0 .cse12 .cse2 .cse3 .cse5 .cse9 .cse6 .cse10) (and .cse8 .cse13 .cse14 .cse4 .cse9 .cse6 .cse10 .cse15) (and .cse8 .cse0 .cse2 .cse4 .cse9 .cse10 .cse15 .cse11) (and .cse8 .cse0 .cse1 .cse13 .cse4 .cse6 .cse10 .cse15) (and .cse1 .cse12 .cse2 .cse14 .cse5 .cse10 .cse15 .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse11) (and .cse8 .cse0 .cse12 .cse2 .cse9 .cse10 .cse15 .cse11) (and .cse8 .cse1 .cse2 .cse14 .cse3 .cse4 .cse7 .cse11) (and .cse8 .cse1 .cse13 .cse14 .cse4 .cse6 .cse7 .cse15) (and .cse0 .cse12 .cse2 .cse5 .cse9 .cse6 .cse7 .cse15) (and .cse8 .cse0 .cse1 .cse2 .cse3 .cse4 .cse7 .cse11) (and .cse0 .cse12 .cse2 .cse5 .cse9 .cse7 .cse15 .cse11) (and .cse1 .cse12 .cse13 .cse14 .cse5 .cse6 .cse10 .cse15) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse7 .cse15) (and .cse8 .cse12 .cse13 .cse14 .cse9 .cse7 .cse15 .cse11) (and .cse0 .cse12 .cse2 .cse5 .cse9 .cse10 .cse15 .cse11))) [2022-04-08 08:22:33,209 INFO L878 garLoopResultBuilder]: At program point L78-1(lines 35 132) the Hoare annotation is: (let ((.cse3 (= main_~p2~0 0)) (.cse7 (= main_~p4~0 0)) (.cse0 (= main_~lk5~0 1)) (.cse9 (= main_~p1~0 0)) (.cse4 (= main_~lk6~0 1)) (.cse8 (= main_~lk3~0 1)) (.cse1 (= main_~lk1~0 1)) (.cse2 (= main_~lk4~0 1)) (.cse11 (= main_~p5~0 0)) (.cse6 (= main_~p6~0 0)) (.cse5 (= main_~p3~0 0)) (.cse10 (= main_~lk2~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse3 .cse6 .cse5) (and .cse7 .cse0 .cse8 .cse9 .cse6 .cse10) (and .cse7 .cse8 .cse9 .cse11 .cse3 .cse4) (and .cse7 .cse1 .cse8 .cse11 .cse6 .cse10) (and .cse0 .cse2 .cse9 .cse4 .cse5 .cse10) (and .cse7 .cse1 .cse11 .cse4 .cse5 .cse10) (and .cse7 .cse0 .cse1 .cse3 .cse6 .cse5) (and .cse7 .cse0 .cse9 .cse3 .cse6 .cse5) (and .cse7 .cse0 .cse9 .cse6 .cse5 .cse10) (and .cse2 .cse8 .cse9 .cse11 .cse6 .cse10) (and .cse7 .cse1 .cse11 .cse3 .cse4 .cse5) (and .cse7 .cse0 .cse1 .cse4 .cse5 .cse10) (and .cse1 .cse2 .cse8 .cse11 .cse3 .cse6) (and .cse0 .cse1 .cse2 .cse8 .cse4 .cse10) (and .cse7 .cse0 .cse8 .cse9 .cse3 .cse6) (and .cse0 .cse2 .cse8 .cse9 .cse4 .cse10) (and .cse7 .cse9 .cse11 .cse3 .cse6 .cse5) (and .cse7 .cse0 .cse8 .cse9 .cse3 .cse4) (and .cse7 .cse8 .cse9 .cse11 .cse6 .cse10) (and .cse2 .cse9 .cse11 .cse4 .cse5 .cse10) (and .cse7 .cse0 .cse1 .cse8 .cse4 .cse10) (and .cse7 .cse1 .cse11 .cse3 .cse6 .cse5) (and .cse7 .cse0 .cse8 .cse9 .cse4 .cse10) (and .cse1 .cse2 .cse11 .cse4 .cse5 .cse10) (and .cse7 .cse9 .cse11 .cse4 .cse5 .cse10) (and .cse7 .cse8 .cse9 .cse11 .cse4 .cse10) (and .cse7 .cse1 .cse8 .cse11 .cse3 .cse6) (and .cse0 .cse2 .cse9 .cse6 .cse5 .cse10) (and .cse1 .cse2 .cse11 .cse3 .cse4 .cse5) (and .cse0 .cse2 .cse9 .cse3 .cse6 .cse5) (and .cse0 .cse2 .cse9 .cse3 .cse4 .cse5) (and .cse1 .cse2 .cse8 .cse11 .cse3 .cse4) (and .cse0 .cse2 .cse8 .cse9 .cse3 .cse6) (and .cse0 .cse1 .cse2 .cse8 .cse6 .cse10) (and .cse7 .cse0 .cse1 .cse8 .cse3 .cse4) (and .cse7 .cse9 .cse11 .cse6 .cse5 .cse10) (and .cse7 .cse0 .cse1 .cse6 .cse5 .cse10) (and .cse7 .cse0 .cse1 .cse8 .cse3 .cse6) (and .cse7 .cse0 .cse9 .cse3 .cse4 .cse5) (and .cse7 .cse0 .cse1 .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse8 .cse3 .cse6) (and .cse0 .cse2 .cse8 .cse9 .cse6 .cse10) (and .cse2 .cse8 .cse9 .cse11 .cse3 .cse6) (and .cse7 .cse0 .cse1 .cse8 .cse6 .cse10) (and .cse2 .cse9 .cse11 .cse6 .cse5 .cse10) (and .cse7 .cse1 .cse11 .cse6 .cse5 .cse10) (and .cse2 .cse9 .cse11 .cse3 .cse6 .cse5) (and .cse7 .cse9 .cse11 .cse3 .cse4 .cse5) (and .cse7 .cse8 .cse9 .cse11 .cse3 .cse6) (and .cse2 .cse8 .cse9 .cse11 .cse3 .cse4) (and .cse7 .cse1 .cse8 .cse11 .cse4 .cse10) (and .cse0 .cse1 .cse2 .cse6 .cse5 .cse10) (and .cse2 .cse8 .cse9 .cse11 .cse4 .cse10) (and .cse1 .cse2 .cse8 .cse11 .cse4 .cse10) (and .cse1 .cse2 .cse11 .cse3 .cse6 .cse5) (and .cse0 .cse1 .cse2 .cse8 .cse3 .cse4) (and .cse2 .cse9 .cse11 .cse3 .cse4 .cse5) (and .cse7 .cse1 .cse8 .cse11 .cse3 .cse4) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse10) (and .cse0 .cse2 .cse8 .cse9 .cse3 .cse4) (and .cse7 .cse0 .cse9 .cse4 .cse5 .cse10) (and .cse1 .cse2 .cse8 .cse11 .cse6 .cse10) (and .cse1 .cse2 .cse11 .cse6 .cse5 .cse10))) [2022-04-08 08:22:33,210 INFO L878 garLoopResultBuilder]: At program point L103(line 103) the Hoare annotation is: (let ((.cse2 (= main_~lk5~0 1)) (.cse6 (= main_~lk6~0 1)) (.cse7 (= main_~p4~0 0)) (.cse3 (= main_~lk8~0 1)) (.cse11 (= main_~p7~0 0)) (.cse0 (not (= main_~p3~0 0))) (.cse1 (= main_~lk7~0 1)) (.cse10 (= main_~p8~0 0)) (.cse4 (= main_~lk4~0 1)) (.cse5 (= main_~lk3~0 1)) (.cse8 (= main_~p5~0 0)) (.cse9 (= main_~p6~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse7 .cse3 .cse5 .cse8 .cse9) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse8 .cse6) (and .cse0 .cse1 .cse3 .cse4 .cse5 .cse8 .cse9) (and .cse0 .cse10 .cse4 .cse5 .cse11 .cse8 .cse9) (and .cse0 .cse1 .cse10 .cse4 .cse5 .cse8 .cse6) (and .cse0 .cse7 .cse3 .cse5 .cse11 .cse8 .cse6) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse11 .cse9) (and .cse0 .cse7 .cse2 .cse3 .cse5 .cse11 .cse6) (and .cse0 .cse2 .cse10 .cse4 .cse5 .cse11 .cse9) (and .cse0 .cse7 .cse10 .cse5 .cse11 .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse10 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse10 .cse4 .cse5 .cse9) (and .cse0 .cse1 .cse7 .cse2 .cse10 .cse5 .cse9) (and .cse0 .cse3 .cse4 .cse5 .cse11 .cse8 .cse9) (and .cse0 .cse7 .cse2 .cse3 .cse5 .cse11 .cse9) (and .cse0 .cse2 .cse10 .cse4 .cse5 .cse11 .cse6) (and .cse0 .cse2 .cse3 .cse4 .cse5 .cse11 .cse6) (and .cse0 .cse10 .cse4 .cse5 .cse11 .cse8 .cse6) (and .cse0 .cse3 .cse4 .cse5 .cse11 .cse8 .cse6) (and .cse0 .cse1 .cse7 .cse10 .cse5 .cse8 .cse9) (and .cse0 .cse1 .cse7 .cse2 .cse3 .cse5 .cse6) (and .cse0 .cse7 .cse2 .cse10 .cse5 .cse11 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse9) (and .cse0 .cse1 .cse7 .cse10 .cse5 .cse8 .cse6) (and .cse0 .cse7 .cse2 .cse10 .cse5 .cse11 .cse9) (and .cse0 .cse1 .cse7 .cse2 .cse3 .cse5 .cse9) (and .cse0 .cse7 .cse10 .cse5 .cse11 .cse8 .cse6) (and .cse0 .cse1 .cse7 .cse2 .cse10 .cse5 .cse6) (and .cse0 .cse1 .cse7 .cse3 .cse5 .cse8 .cse6) (and .cse0 .cse7 .cse3 .cse5 .cse11 .cse8 .cse9) (and .cse0 .cse1 .cse10 .cse4 .cse5 .cse8 .cse9))) [2022-04-08 08:22:33,210 INFO L885 garLoopResultBuilder]: At program point L37(lines 37 39) the Hoare annotation is: true [2022-04-08 08:22:33,210 INFO L878 garLoopResultBuilder]: At program point L70-1(lines 35 132) the Hoare annotation is: (let ((.cse5 (= main_~lk1~0 1)) (.cse0 (= main_~lk4~0 1)) (.cse1 (= main_~lk3~0 1)) (.cse3 (= main_~p2~0 0)) (.cse4 (= main_~p4~0 0)) (.cse2 (= main_~p1~0 0)) (.cse6 (= main_~p3~0 0)) (.cse7 (= main_~lk2~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse1 .cse3) (and .cse5 .cse0 .cse6 .cse7) (and .cse4 .cse2 .cse3 .cse6) (and .cse4 .cse1 .cse2 .cse3) (and .cse0 .cse2 .cse3 .cse6) (and .cse5 .cse0 .cse3 .cse6) (and .cse4 .cse5 .cse6 .cse7) (and .cse5 .cse0 .cse1 .cse7) (and .cse4 .cse1 .cse2 .cse7) (and .cse0 .cse1 .cse2 .cse7) (and .cse4 .cse5 .cse3 .cse6) (and .cse0 .cse2 .cse6 .cse7) (and .cse4 .cse5 .cse1 .cse7) (and .cse5 .cse0 .cse1 .cse3) (and .cse4 .cse2 .cse6 .cse7))) [2022-04-08 08:22:33,210 INFO L878 garLoopResultBuilder]: At program point L128(line 128) the Hoare annotation is: (= main_~lk8~0 1) [2022-04-08 08:22:33,210 INFO L878 garLoopResultBuilder]: At program point L128-1(lines 7 137) the Hoare annotation is: false [2022-04-08 08:22:33,210 INFO L878 garLoopResultBuilder]: At program point L62-1(lines 35 132) the Hoare annotation is: (let ((.cse0 (= main_~lk1~0 1)) (.cse3 (= main_~p2~0 0)) (.cse2 (= main_~p1~0 0)) (.cse1 (= main_~lk2~0 1))) (or (and .cse0 .cse1) (and .cse2 .cse3) (and .cse0 .cse3) (and .cse2 .cse1))) [2022-04-08 08:22:33,210 INFO L878 garLoopResultBuilder]: At program point L112-1(lines 35 132) the Hoare annotation is: (let ((.cse3 (= main_~lk8~0 1)) (.cse4 (= main_~p7~0 0)) (.cse2 (= main_~p6~0 0)) (.cse0 (= main_~lk7~0 1)) (.cse1 (= main_~p8~0 0)) (.cse5 (= main_~lk6~0 1))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse3 .cse2) (and .cse1 .cse4 .cse2) (and .cse3 .cse4 .cse5) (and .cse0 .cse3 .cse5) (and .cse1 .cse4 .cse5) (and .cse3 .cse4 .cse2) (and .cse0 .cse1 .cse5))) [2022-04-08 08:22:33,210 INFO L885 garLoopResultBuilder]: At program point mainFINAL(lines 6 137) the Hoare annotation is: true [2022-04-08 08:22:33,210 INFO L878 garLoopResultBuilder]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 135) the Hoare annotation is: false [2022-04-08 08:22:33,210 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 6 137) the Hoare annotation is: true [2022-04-08 08:22:33,210 INFO L878 garLoopResultBuilder]: At program point L113(line 113) the Hoare annotation is: (let ((.cse4 (= main_~lk6~0 1)) (.cse5 (= main_~lk8~0 1)) (.cse6 (= main_~p7~0 0)) (.cse0 (not (= main_~p5~0 0))) (.cse1 (= main_~lk7~0 1)) (.cse2 (= main_~lk5~0 1)) (.cse3 (= main_~p8~0 0)) (.cse7 (= main_~p6~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse2 .cse5 .cse6 .cse4) (and .cse0 .cse2 .cse3 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse5 .cse7) (and .cse0 .cse2 .cse3 .cse6 .cse4) (and .cse0 .cse1 .cse2 .cse5 .cse4) (and .cse0 .cse2 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse7))) [2022-04-08 08:22:33,211 INFO L878 garLoopResultBuilder]: At program point L97-1(lines 35 132) the Hoare annotation is: (let ((.cse11 (= main_~p4~0 0)) (.cse7 (= main_~p6~0 0)) (.cse10 (= main_~p5~0 0)) (.cse6 (= main_~p8~0 0)) (.cse4 (= main_~p7~0 0)) (.cse9 (= main_~p3~0 0)) (.cse8 (= main_~lk7~0 1)) (.cse0 (= main_~lk5~0 1)) (.cse1 (= main_~lk8~0 1)) (.cse2 (= main_~lk4~0 1)) (.cse3 (= main_~lk3~0 1)) (.cse5 (= main_~lk6~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse6 .cse2 .cse3 .cse4 .cse7) (and .cse8 .cse0 .cse6 .cse2 .cse5 .cse9) (and .cse8 .cse1 .cse2 .cse10 .cse7 .cse9) (and .cse8 .cse1 .cse2 .cse3 .cse10 .cse7) (and .cse8 .cse11 .cse0 .cse1 .cse3 .cse7) (and .cse8 .cse6 .cse2 .cse10 .cse7 .cse9) (and .cse11 .cse0 .cse6 .cse3 .cse4 .cse5) (and .cse8 .cse6 .cse2 .cse3 .cse10 .cse7) (and .cse8 .cse11 .cse6 .cse10 .cse7 .cse9) (and .cse8 .cse11 .cse0 .cse6 .cse7 .cse9) (and .cse6 .cse2 .cse3 .cse4 .cse10 .cse7) (and .cse11 .cse1 .cse3 .cse4 .cse10 .cse7) (and .cse11 .cse6 .cse3 .cse4 .cse10 .cse5) (and .cse8 .cse11 .cse0 .cse1 .cse5 .cse9) (and .cse8 .cse11 .cse6 .cse10 .cse5 .cse9) (and .cse8 .cse1 .cse2 .cse10 .cse5 .cse9) (and .cse11 .cse1 .cse4 .cse10 .cse7 .cse9) (and .cse8 .cse1 .cse2 .cse3 .cse10 .cse5) (and .cse8 .cse11 .cse1 .cse10 .cse5 .cse9) (and .cse8 .cse0 .cse6 .cse2 .cse7 .cse9) (and .cse1 .cse2 .cse3 .cse4 .cse10 .cse5) (and .cse8 .cse0 .cse1 .cse2 .cse7 .cse9) (and .cse1 .cse2 .cse4 .cse10 .cse7 .cse9) (and .cse6 .cse2 .cse4 .cse10 .cse5 .cse9) (and .cse6 .cse2 .cse4 .cse10 .cse7 .cse9) (and .cse8 .cse11 .cse0 .cse6 .cse5 .cse9) (and .cse6 .cse2 .cse3 .cse4 .cse10 .cse5) (and .cse11 .cse0 .cse1 .cse4 .cse5 .cse9) (and .cse11 .cse0 .cse6 .cse4 .cse7 .cse9) (and .cse8 .cse11 .cse1 .cse3 .cse10 .cse7) (and .cse1 .cse2 .cse3 .cse4 .cse10 .cse7) (and .cse11 .cse0 .cse6 .cse4 .cse5 .cse9) (and .cse11 .cse1 .cse3 .cse4 .cse10 .cse5) (and .cse11 .cse6 .cse3 .cse4 .cse10 .cse7) (and .cse8 .cse11 .cse0 .cse1 .cse3 .cse5) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse9) (and .cse8 .cse11 .cse0 .cse1 .cse7 .cse9) (and .cse8 .cse0 .cse1 .cse2 .cse5 .cse9) (and .cse11 .cse0 .cse1 .cse3 .cse4 .cse5) (and .cse0 .cse6 .cse2 .cse3 .cse4 .cse5) (and .cse11 .cse0 .cse1 .cse3 .cse4 .cse7) (and .cse8 .cse0 .cse1 .cse2 .cse3 .cse7) (and .cse8 .cse11 .cse6 .cse3 .cse10 .cse7) (and .cse0 .cse1 .cse2 .cse4 .cse7 .cse9) (and .cse11 .cse0 .cse1 .cse4 .cse7 .cse9) (and .cse8 .cse6 .cse2 .cse10 .cse5 .cse9) (and .cse8 .cse11 .cse6 .cse3 .cse10 .cse5) (and .cse8 .cse0 .cse6 .cse2 .cse3 .cse5) (and .cse11 .cse0 .cse6 .cse3 .cse4 .cse7) (and .cse8 .cse11 .cse1 .cse3 .cse10 .cse5) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse7) (and .cse0 .cse6 .cse2 .cse4 .cse7 .cse9) (and .cse8 .cse6 .cse2 .cse3 .cse10 .cse5) (and .cse8 .cse11 .cse1 .cse10 .cse7 .cse9) (and .cse8 .cse11 .cse0 .cse6 .cse3 .cse5) (and .cse8 .cse0 .cse6 .cse2 .cse3 .cse7) (and .cse11 .cse1 .cse4 .cse10 .cse5 .cse9) (and .cse11 .cse6 .cse4 .cse10 .cse5 .cse9) (and .cse8 .cse11 .cse0 .cse6 .cse3 .cse7) (and .cse11 .cse6 .cse4 .cse10 .cse7 .cse9) (and .cse1 .cse2 .cse4 .cse10 .cse5 .cse9) (and .cse0 .cse6 .cse2 .cse4 .cse5 .cse9) (and .cse8 .cse0 .cse1 .cse2 .cse3 .cse5))) [2022-04-08 08:22:33,211 INFO L878 garLoopResultBuilder]: At program point L122-1(lines 35 132) the Hoare annotation is: (or (= main_~p8~0 0) (= main_~lk8~0 1)) [2022-04-08 08:22:33,211 INFO L878 garLoopResultBuilder]: At program point L98(line 98) the Hoare annotation is: (let ((.cse11 (= main_~lk7~0 1)) (.cse5 (= main_~p6~0 0)) (.cse8 (= main_~lk4~0 1)) (.cse1 (= main_~lk5~0 1)) (.cse2 (= main_~lk8~0 1)) (.cse3 (= main_~lk3~0 1)) (.cse0 (= main_~p4~0 0)) (.cse7 (= main_~p8~0 0)) (.cse4 (= main_~p7~0 0)) (.cse10 (= main_~p5~0 0)) (.cse12 (= main_~lk6~0 1)) (.cse9 (= main_~p3~0 0)) (.cse6 (= main_~lk2~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse1 .cse7 .cse8 .cse4 .cse5 .cse9 .cse6) (and .cse7 .cse8 .cse4 .cse10 .cse5 .cse9 .cse6) (and .cse11 .cse0 .cse2 .cse3 .cse10 .cse5 .cse6) (and .cse2 .cse8 .cse3 .cse4 .cse10 .cse5 .cse6) (and .cse11 .cse0 .cse2 .cse3 .cse10 .cse12 .cse6) (and .cse11 .cse0 .cse1 .cse2 .cse5 .cse9 .cse6) (and .cse11 .cse0 .cse7 .cse3 .cse10 .cse5 .cse6) (and .cse11 .cse1 .cse2 .cse8 .cse3 .cse12 .cse6) (and .cse11 .cse7 .cse8 .cse10 .cse5 .cse9 .cse6) (and .cse2 .cse8 .cse4 .cse10 .cse12 .cse9 .cse6) (and .cse0 .cse1 .cse7 .cse4 .cse5 .cse9 .cse6) (and .cse11 .cse0 .cse1 .cse2 .cse3 .cse12 .cse6) (and .cse11 .cse1 .cse7 .cse8 .cse3 .cse5 .cse6) (and .cse1 .cse2 .cse8 .cse3 .cse4 .cse5 .cse6) (and .cse11 .cse2 .cse8 .cse3 .cse10 .cse5 .cse6) (and .cse11 .cse0 .cse7 .cse10 .cse12 .cse9 .cse6) (and .cse0 .cse1 .cse7 .cse4 .cse12 .cse9 .cse6) (and .cse1 .cse7 .cse8 .cse3 .cse4 .cse12 .cse6) (and .cse0 .cse2 .cse4 .cse10 .cse12 .cse9 .cse6) (and .cse0 .cse7 .cse4 .cse10 .cse5 .cse9 .cse6) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse9 .cse6) (and .cse1 .cse7 .cse8 .cse3 .cse4 .cse5 .cse6) (and .cse2 .cse8 .cse3 .cse4 .cse10 .cse12 .cse6) (and .cse0 .cse1 .cse2 .cse4 .cse12 .cse9 .cse6) (and .cse11 .cse7 .cse8 .cse3 .cse10 .cse12 .cse6) (and .cse11 .cse0 .cse1 .cse7 .cse5 .cse9 .cse6) (and .cse11 .cse1 .cse2 .cse8 .cse3 .cse5 .cse6) (and .cse11 .cse0 .cse1 .cse7 .cse3 .cse12 .cse6) (and .cse0 .cse7 .cse3 .cse4 .cse10 .cse12 .cse6) (and .cse11 .cse0 .cse2 .cse10 .cse12 .cse9 .cse6) (and .cse1 .cse2 .cse8 .cse4 .cse12 .cse9 .cse6) (and .cse11 .cse0 .cse1 .cse7 .cse12 .cse9 .cse6) (and .cse11 .cse0 .cse1 .cse2 .cse12 .cse9 .cse6) (and .cse1 .cse2 .cse8 .cse4 .cse5 .cse9 .cse6) (and .cse11 .cse0 .cse7 .cse10 .cse5 .cse9 .cse6) (and .cse11 .cse1 .cse2 .cse8 .cse5 .cse9 .cse6) (and .cse11 .cse1 .cse2 .cse8 .cse12 .cse9 .cse6) (and .cse11 .cse7 .cse8 .cse10 .cse12 .cse9 .cse6) (and .cse11 .cse0 .cse1 .cse7 .cse3 .cse5 .cse6) (and .cse7 .cse8 .cse3 .cse4 .cse10 .cse5 .cse6) (and .cse11 .cse1 .cse7 .cse8 .cse5 .cse9 .cse6) (and .cse1 .cse7 .cse8 .cse4 .cse12 .cse9 .cse6) (and .cse11 .cse2 .cse8 .cse3 .cse10 .cse12 .cse6) (and .cse11 .cse2 .cse8 .cse10 .cse12 .cse9 .cse6) (and .cse11 .cse0 .cse7 .cse3 .cse10 .cse12 .cse6) (and .cse0 .cse7 .cse3 .cse4 .cse10 .cse5 .cse6) (and .cse11 .cse0 .cse1 .cse2 .cse3 .cse5 .cse6) (and .cse0 .cse2 .cse3 .cse4 .cse10 .cse5 .cse6) (and .cse0 .cse1 .cse7 .cse3 .cse4 .cse5 .cse6) (and .cse11 .cse2 .cse8 .cse10 .cse5 .cse9 .cse6) (and .cse11 .cse0 .cse2 .cse10 .cse5 .cse9 .cse6) (and .cse0 .cse2 .cse3 .cse4 .cse10 .cse12 .cse6) (and .cse0 .cse2 .cse4 .cse10 .cse5 .cse9 .cse6) (and .cse1 .cse2 .cse8 .cse3 .cse4 .cse12 .cse6) (and .cse0 .cse1 .cse7 .cse3 .cse4 .cse12 .cse6) (and .cse7 .cse8 .cse4 .cse10 .cse12 .cse9 .cse6) (and .cse11 .cse1 .cse7 .cse8 .cse12 .cse9 .cse6) (and .cse2 .cse8 .cse4 .cse10 .cse5 .cse9 .cse6) (and .cse11 .cse1 .cse7 .cse8 .cse3 .cse12 .cse6) (and .cse11 .cse7 .cse8 .cse3 .cse10 .cse5 .cse6) (and .cse7 .cse8 .cse3 .cse4 .cse10 .cse12 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse12 .cse6) (and .cse0 .cse7 .cse4 .cse10 .cse12 .cse9 .cse6))) [2022-04-08 08:22:33,211 INFO L878 garLoopResultBuilder]: At program point L123(line 123) the Hoare annotation is: (let ((.cse0 (= main_~lk7~0 1)) (.cse1 (not (= main_~p7~0 0)))) (or (and .cse0 (= main_~p8~0 0) .cse1) (and .cse0 (= main_~lk8~0 1) .cse1))) [2022-04-08 08:22:33,211 INFO L878 garLoopResultBuilder]: At program point L82-1(lines 35 132) the Hoare annotation is: (let ((.cse9 (= main_~lk3~0 1)) (.cse7 (= main_~lk5~0 1)) (.cse8 (= main_~lk1~0 1)) (.cse11 (= main_~lk4~0 1)) (.cse2 (= main_~p7~0 0)) (.cse13 (= main_~p2~0 0)) (.cse4 (= main_~lk6~0 1)) (.cse12 (= main_~lk7~0 1)) (.cse0 (= main_~p4~0 0)) (.cse1 (= main_~p1~0 0)) (.cse3 (= main_~p5~0 0)) (.cse10 (= main_~p6~0 0)) (.cse5 (= main_~p3~0 0)) (.cse6 (= main_~lk2~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse7 .cse8 .cse9 .cse2 .cse10 .cse6) (and .cse7 .cse11 .cse1 .cse2 .cse4 .cse5 .cse6) (and .cse7 .cse8 .cse11 .cse2 .cse4 .cse5 .cse6) (and .cse12 .cse11 .cse1 .cse3 .cse13 .cse4 .cse5) (and .cse12 .cse8 .cse11 .cse3 .cse13 .cse4 .cse5) (and .cse8 .cse11 .cse9 .cse2 .cse3 .cse13 .cse4) (and .cse0 .cse8 .cse2 .cse3 .cse13 .cse10 .cse5) (and .cse12 .cse7 .cse11 .cse9 .cse1 .cse13 .cse10) (and .cse12 .cse0 .cse8 .cse9 .cse3 .cse10 .cse6) (and .cse0 .cse8 .cse9 .cse2 .cse3 .cse4 .cse6) (and .cse7 .cse8 .cse11 .cse9 .cse2 .cse13 .cse4) (and .cse7 .cse11 .cse9 .cse1 .cse2 .cse13 .cse4) (and .cse12 .cse8 .cse11 .cse9 .cse3 .cse10 .cse6) (and .cse7 .cse8 .cse11 .cse2 .cse13 .cse4 .cse5) (and .cse8 .cse11 .cse9 .cse2 .cse3 .cse13 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse13 .cse10 .cse5) (and .cse12 .cse0 .cse7 .cse1 .cse13 .cse4 .cse5) (and .cse8 .cse11 .cse9 .cse2 .cse3 .cse4 .cse6) (and .cse0 .cse7 .cse8 .cse2 .cse4 .cse5 .cse6) (and .cse0 .cse9 .cse1 .cse2 .cse3 .cse13 .cse10) (and .cse12 .cse0 .cse7 .cse9 .cse1 .cse13 .cse4) (and .cse0 .cse7 .cse1 .cse2 .cse13 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse3 .cse13 .cse4 .cse5) (and .cse12 .cse0 .cse8 .cse3 .cse4 .cse5 .cse6) (and .cse12 .cse0 .cse7 .cse1 .cse4 .cse5 .cse6) (and .cse11 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse8 .cse9 .cse2 .cse3 .cse13 .cse4) (and .cse12 .cse7 .cse11 .cse1 .cse13 .cse10 .cse5) (and .cse12 .cse7 .cse11 .cse1 .cse13 .cse4 .cse5) (and .cse12 .cse0 .cse7 .cse9 .cse1 .cse4 .cse6) (and .cse0 .cse9 .cse1 .cse2 .cse3 .cse10 .cse6) (and .cse12 .cse7 .cse11 .cse9 .cse1 .cse4 .cse6) (and .cse12 .cse0 .cse7 .cse8 .cse9 .cse4 .cse6) (and .cse7 .cse11 .cse9 .cse1 .cse2 .cse4 .cse6) (and .cse12 .cse7 .cse8 .cse11 .cse13 .cse10 .cse5) (and .cse12 .cse0 .cse8 .cse3 .cse13 .cse10 .cse5) (and .cse12 .cse0 .cse9 .cse1 .cse3 .cse13 .cse4) (and .cse0 .cse8 .cse2 .cse3 .cse13 .cse4 .cse5) (and .cse12 .cse0 .cse8 .cse3 .cse13 .cse4 .cse5) (and .cse12 .cse11 .cse1 .cse3 .cse13 .cse10 .cse5) (and .cse12 .cse11 .cse9 .cse1 .cse3 .cse4 .cse6) (and .cse0 .cse7 .cse1 .cse2 .cse10 .cse5 .cse6) (and .cse0 .cse7 .cse9 .cse1 .cse2 .cse10 .cse6) (and .cse11 .cse1 .cse2 .cse3 .cse10 .cse5 .cse6) (and .cse12 .cse7 .cse8 .cse11 .cse9 .cse10 .cse6) (and .cse11 .cse1 .cse2 .cse3 .cse13 .cse4 .cse5) (and .cse12 .cse8 .cse11 .cse9 .cse3 .cse4 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse10 .cse5 .cse6) (and .cse12 .cse0 .cse9 .cse1 .cse3 .cse4 .cse6) (and .cse12 .cse7 .cse8 .cse11 .cse9 .cse13 .cse4) (and .cse12 .cse0 .cse7 .cse8 .cse13 .cse4 .cse5) (and .cse0 .cse7 .cse9 .cse1 .cse2 .cse13 .cse10) (and .cse12 .cse0 .cse8 .cse9 .cse3 .cse13 .cse4) (and .cse0 .cse7 .cse8 .cse9 .cse2 .cse4 .cse6) (and .cse11 .cse9 .cse1 .cse2 .cse3 .cse4 .cse6) (and .cse0 .cse7 .cse1 .cse2 .cse13 .cse10 .cse5) (and .cse12 .cse0 .cse7 .cse9 .cse1 .cse13 .cse10) (and .cse0 .cse7 .cse9 .cse1 .cse2 .cse4 .cse6) (and .cse8 .cse11 .cse2 .cse3 .cse13 .cse10 .cse5) (and .cse12 .cse0 .cse7 .cse8 .cse9 .cse10 .cse6) (and .cse0 .cse9 .cse1 .cse2 .cse3 .cse13 .cse4) (and .cse12 .cse0 .cse7 .cse8 .cse10 .cse5 .cse6) (and .cse7 .cse11 .cse1 .cse2 .cse13 .cse10 .cse5) (and .cse11 .cse9 .cse1 .cse2 .cse3 .cse13 .cse4) (and .cse12 .cse8 .cse11 .cse3 .cse10 .cse5 .cse6) (and .cse7 .cse11 .cse9 .cse1 .cse2 .cse13 .cse10) (and .cse11 .cse1 .cse2 .cse3 .cse13 .cse10 .cse5) (and .cse12 .cse0 .cse7 .cse8 .cse9 .cse13 .cse4) (and .cse0 .cse8 .cse9 .cse2 .cse3 .cse13 .cse10) (and .cse0 .cse8 .cse9 .cse2 .cse3 .cse10 .cse6) (and .cse12 .cse7 .cse8 .cse11 .cse4 .cse5 .cse6) (and .cse7 .cse8 .cse11 .cse9 .cse2 .cse10 .cse6) (and .cse0 .cse8 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse12 .cse7 .cse11 .cse9 .cse1 .cse10 .cse6) (and .cse12 .cse0 .cse1 .cse3 .cse13 .cse4 .cse5) (and .cse0 .cse9 .cse1 .cse2 .cse3 .cse4 .cse6) (and .cse12 .cse7 .cse11 .cse9 .cse1 .cse13 .cse4) (and .cse12 .cse8 .cse11 .cse3 .cse13 .cse10 .cse5) (and .cse12 .cse11 .cse9 .cse1 .cse3 .cse10 .cse6) (and .cse12 .cse0 .cse7 .cse9 .cse1 .cse10 .cse6) (and .cse7 .cse11 .cse9 .cse1 .cse2 .cse10 .cse6) (and .cse12 .cse7 .cse8 .cse11 .cse13 .cse4 .cse5) (and .cse12 .cse11 .cse1 .cse3 .cse10 .cse5 .cse6) (and .cse7 .cse8 .cse11 .cse9 .cse2 .cse4 .cse6) (and .cse12 .cse0 .cse8 .cse9 .cse3 .cse4 .cse6) (and .cse7 .cse11 .cse1 .cse2 .cse13 .cse4 .cse5) (and .cse0 .cse7 .cse8 .cse2 .cse10 .cse5 .cse6) (and .cse12 .cse0 .cse9 .cse1 .cse3 .cse10 .cse6) (and .cse12 .cse0 .cse8 .cse3 .cse10 .cse5 .cse6) (and .cse12 .cse0 .cse1 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse7 .cse9 .cse1 .cse2 .cse13 .cse4) (and .cse8 .cse11 .cse9 .cse2 .cse3 .cse10 .cse6) (and .cse12 .cse11 .cse9 .cse1 .cse3 .cse13 .cse10) (and .cse7 .cse8 .cse11 .cse2 .cse13 .cse10 .cse5) (and .cse12 .cse8 .cse11 .cse3 .cse4 .cse5 .cse6) (and .cse12 .cse0 .cse1 .cse3 .cse13 .cse10 .cse5) (and .cse0 .cse7 .cse8 .cse9 .cse2 .cse13 .cse4) (and .cse12 .cse8 .cse11 .cse9 .cse3 .cse13 .cse4) (and .cse12 .cse0 .cse7 .cse8 .cse9 .cse13 .cse10) (and .cse0 .cse7 .cse1 .cse2 .cse4 .cse5 .cse6) (and .cse12 .cse7 .cse11 .cse1 .cse4 .cse5 .cse6) (and .cse12 .cse11 .cse1 .cse3 .cse4 .cse5 .cse6) (and .cse12 .cse0 .cse9 .cse1 .cse3 .cse13 .cse10) (and .cse12 .cse7 .cse8 .cse11 .cse10 .cse5 .cse6) (and .cse12 .cse7 .cse8 .cse11 .cse9 .cse13 .cse10) (and .cse12 .cse0 .cse7 .cse8 .cse4 .cse5 .cse6) (and .cse7 .cse11 .cse1 .cse2 .cse10 .cse5 .cse6) (and .cse12 .cse0 .cse7 .cse1 .cse13 .cse10 .cse5) (and .cse8 .cse11 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse7 .cse8 .cse2 .cse13 .cse4 .cse5) (and .cse7 .cse8 .cse11 .cse9 .cse2 .cse13 .cse10) (and .cse12 .cse7 .cse8 .cse11 .cse9 .cse4 .cse6) (and .cse11 .cse9 .cse1 .cse2 .cse3 .cse10 .cse6) (and .cse11 .cse9 .cse1 .cse2 .cse3 .cse13 .cse10) (and .cse12 .cse0 .cse7 .cse1 .cse10 .cse5 .cse6) (and .cse0 .cse7 .cse8 .cse9 .cse2 .cse13 .cse10) (and .cse0 .cse8 .cse2 .cse3 .cse10 .cse5 .cse6) (and .cse12 .cse0 .cse8 .cse9 .cse3 .cse13 .cse10) (and .cse12 .cse11 .cse9 .cse1 .cse3 .cse13 .cse4) (and .cse12 .cse7 .cse11 .cse1 .cse10 .cse5 .cse6) (and .cse12 .cse0 .cse7 .cse8 .cse13 .cse10 .cse5) (and .cse0 .cse7 .cse8 .cse2 .cse13 .cse10 .cse5) (and .cse12 .cse8 .cse11 .cse9 .cse3 .cse13 .cse10) (and .cse7 .cse8 .cse11 .cse2 .cse10 .cse5 .cse6) (and .cse8 .cse11 .cse2 .cse3 .cse10 .cse5 .cse6) (and .cse8 .cse11 .cse2 .cse3 .cse13 .cse4 .cse5) (and .cse12 .cse0 .cse1 .cse3 .cse10 .cse5 .cse6))) [2022-04-08 08:22:33,212 INFO L878 garLoopResultBuilder]: At program point L107-1(lines 35 132) the Hoare annotation is: (let ((.cse0 (= main_~lk7~0 1)) (.cse2 (= main_~lk8~0 1)) (.cse1 (= main_~lk5~0 1)) (.cse3 (= main_~lk6~0 1)) (.cse4 (= main_~p8~0 0)) (.cse5 (= main_~p7~0 0)) (.cse6 (= main_~p5~0 0)) (.cse7 (= main_~p6~0 0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6 .cse3) (and .cse1 .cse2 .cse5 .cse7) (and .cse0 .cse2 .cse6 .cse3) (and .cse1 .cse4 .cse5 .cse7) (and .cse0 .cse4 .cse6 .cse7) (and .cse0 .cse1 .cse4 .cse7) (and .cse2 .cse5 .cse6 .cse3) (and .cse0 .cse1 .cse4 .cse3) (and .cse2 .cse5 .cse6 .cse7) (and .cse1 .cse2 .cse5 .cse3) (and .cse0 .cse2 .cse6 .cse7) (and .cse0 .cse4 .cse6 .cse3) (and .cse0 .cse1 .cse2 .cse7) (and .cse1 .cse4 .cse5 .cse3) (and .cse4 .cse5 .cse6 .cse7))) [2022-04-08 08:22:33,212 INFO L878 garLoopResultBuilder]: At program point L74-1(lines 35 132) the Hoare annotation is: (let ((.cse9 (= main_~lk2~0 1)) (.cse4 (= main_~p3~0 0)) (.cse5 (= main_~p4~0 0)) (.cse0 (= main_~lk5~0 1)) (.cse1 (= main_~lk1~0 1)) (.cse2 (= main_~lk4~0 1)) (.cse6 (= main_~lk3~0 1)) (.cse8 (= main_~p1~0 0)) (.cse7 (= main_~p5~0 0)) (.cse3 (= main_~p2~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse1 .cse6 .cse7 .cse3) (and .cse1 .cse2 .cse7 .cse3 .cse4) (and .cse2 .cse8 .cse7 .cse4 .cse9) (and .cse0 .cse2 .cse8 .cse3 .cse4) (and .cse5 .cse0 .cse8 .cse4 .cse9) (and .cse0 .cse2 .cse6 .cse8 .cse9) (and .cse5 .cse1 .cse7 .cse3 .cse4) (and .cse5 .cse6 .cse8 .cse7 .cse9) (and .cse0 .cse1 .cse2 .cse6 .cse3) (and .cse5 .cse0 .cse6 .cse8 .cse3) (and .cse0 .cse1 .cse2 .cse4 .cse9) (and .cse0 .cse1 .cse2 .cse6 .cse9) (and .cse5 .cse0 .cse1 .cse6 .cse9) (and .cse1 .cse2 .cse6 .cse7 .cse9) (and .cse1 .cse2 .cse7 .cse4 .cse9) (and .cse5 .cse0 .cse6 .cse8 .cse9) (and .cse0 .cse2 .cse6 .cse8 .cse3) (and .cse5 .cse0 .cse8 .cse3 .cse4) (and .cse5 .cse1 .cse7 .cse4 .cse9) (and .cse5 .cse8 .cse7 .cse3 .cse4) (and .cse2 .cse6 .cse8 .cse7 .cse9) (and .cse5 .cse0 .cse1 .cse4 .cse9) (and .cse2 .cse8 .cse7 .cse3 .cse4) (and .cse5 .cse1 .cse6 .cse7 .cse9) (and .cse1 .cse2 .cse6 .cse7 .cse3) (and .cse0 .cse2 .cse8 .cse4 .cse9) (and .cse5 .cse8 .cse7 .cse4 .cse9) (and .cse5 .cse6 .cse8 .cse7 .cse3) (and .cse5 .cse0 .cse1 .cse3 .cse4) (and .cse5 .cse0 .cse1 .cse6 .cse3) (and .cse2 .cse6 .cse8 .cse7 .cse3))) [2022-04-08 08:22:33,212 INFO L878 garLoopResultBuilder]: At program point L66-1(lines 35 132) the Hoare annotation is: (let ((.cse4 (= main_~p1~0 0)) (.cse2 (= main_~p3~0 0)) (.cse5 (= main_~lk2~0 1)) (.cse0 (= main_~lk1~0 1)) (.cse3 (= main_~lk3~0 1)) (.cse1 (= main_~p2~0 0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse5) (and .cse4 .cse1 .cse2) (and .cse0 .cse3 .cse5) (and .cse3 .cse4 .cse1) (and .cse0 .cse2 .cse5) (and .cse4 .cse2 .cse5) (and .cse0 .cse3 .cse1))) [2022-04-08 08:22:33,212 INFO L885 garLoopResultBuilder]: At program point L58(lines 58 60) the Hoare annotation is: true [2022-04-08 08:22:33,212 INFO L878 garLoopResultBuilder]: At program point L58-2(lines 35 132) the Hoare annotation is: (or (= main_~lk1~0 1) (= main_~p1~0 0)) [2022-04-08 08:22:33,212 INFO L878 garLoopResultBuilder]: At program point L108(line 108) the Hoare annotation is: (let ((.cse0 (= main_~lk7~0 1)) (.cse9 (= main_~p6~0 0)) (.cse2 (= main_~p8~0 0)) (.cse7 (= main_~p5~0 0)) (.cse1 (= main_~lk5~0 1)) (.cse6 (= main_~lk8~0 1)) (.cse3 (not (= main_~p4~0 0))) (.cse4 (= main_~lk4~0 1)) (.cse8 (= main_~p7~0 0)) (.cse5 (= main_~lk6~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse6 .cse3 .cse4 .cse7 .cse5) (and .cse0 .cse1 .cse6 .cse3 .cse4 .cse5) (and .cse0 .cse2 .cse3 .cse4 .cse7 .cse5) (and .cse2 .cse3 .cse4 .cse8 .cse7 .cse9) (and .cse1 .cse6 .cse3 .cse4 .cse8 .cse9) (and .cse0 .cse1 .cse6 .cse3 .cse4 .cse9) (and .cse2 .cse3 .cse4 .cse8 .cse7 .cse5) (and .cse0 .cse2 .cse3 .cse4 .cse7 .cse9) (and .cse1 .cse2 .cse3 .cse4 .cse8 .cse9) (and .cse6 .cse3 .cse4 .cse8 .cse7 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse9) (and .cse0 .cse6 .cse3 .cse4 .cse7 .cse9) (and .cse1 .cse2 .cse3 .cse4 .cse8 .cse5) (and .cse6 .cse3 .cse4 .cse8 .cse7 .cse5) (and .cse1 .cse6 .cse3 .cse4 .cse8 .cse5))) [2022-04-08 08:22:33,212 INFO L885 garLoopResultBuilder]: At program point L133(lines 7 137) the Hoare annotation is: true [2022-04-08 08:22:33,212 INFO L878 garLoopResultBuilder]: At program point L92-1(lines 35 132) the Hoare annotation is: (let ((.cse6 (= main_~p6~0 0)) (.cse0 (= main_~lk7~0 1)) (.cse7 (= main_~p4~0 0)) (.cse11 (= main_~p8~0 0)) (.cse4 (= main_~p5~0 0)) (.cse12 (= main_~p3~0 0)) (.cse10 (= main_~lk2~0 1)) (.cse8 (= main_~lk5~0 1)) (.cse1 (= main_~lk8~0 1)) (.cse2 (= main_~lk4~0 1)) (.cse3 (= main_~lk3~0 1)) (.cse9 (= main_~p7~0 0)) (.cse5 (= main_~p2~0 0)) (.cse13 (= main_~lk6~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse8 .cse1 .cse3 .cse9 .cse6 .cse10) (and .cse8 .cse11 .cse2 .cse9 .cse6 .cse12 .cse10) (and .cse7 .cse11 .cse9 .cse4 .cse5 .cse6 .cse12) (and .cse11 .cse2 .cse9 .cse4 .cse6 .cse12 .cse10) (and .cse0 .cse7 .cse1 .cse4 .cse5 .cse6 .cse12) (and .cse0 .cse7 .cse1 .cse3 .cse4 .cse6 .cse10) (and .cse1 .cse2 .cse3 .cse9 .cse4 .cse6 .cse10) (and .cse0 .cse8 .cse1 .cse2 .cse5 .cse13 .cse12) (and .cse11 .cse2 .cse3 .cse9 .cse4 .cse5 .cse13) (and .cse7 .cse8 .cse1 .cse3 .cse9 .cse5 .cse6) (and .cse0 .cse7 .cse8 .cse1 .cse5 .cse6 .cse12) (and .cse0 .cse7 .cse1 .cse3 .cse4 .cse13 .cse10) (and .cse8 .cse11 .cse2 .cse9 .cse5 .cse13 .cse12) (and .cse11 .cse2 .cse9 .cse4 .cse5 .cse6 .cse12) (and .cse0 .cse8 .cse1 .cse2 .cse3 .cse5 .cse6) (and .cse0 .cse7 .cse8 .cse1 .cse6 .cse12 .cse10) (and .cse0 .cse7 .cse8 .cse1 .cse5 .cse13 .cse12) (and .cse0 .cse7 .cse11 .cse3 .cse4 .cse6 .cse10) (and .cse0 .cse8 .cse11 .cse2 .cse5 .cse13 .cse12) (and .cse0 .cse8 .cse1 .cse2 .cse3 .cse13 .cse10) (and .cse0 .cse11 .cse2 .cse4 .cse6 .cse12 .cse10) (and .cse1 .cse2 .cse3 .cse9 .cse4 .cse5 .cse6) (and .cse1 .cse2 .cse3 .cse9 .cse4 .cse5 .cse13) (and .cse1 .cse2 .cse9 .cse4 .cse13 .cse12 .cse10) (and .cse8 .cse1 .cse2 .cse9 .cse5 .cse13 .cse12) (and .cse7 .cse8 .cse11 .cse9 .cse6 .cse12 .cse10) (and .cse0 .cse7 .cse8 .cse1 .cse3 .cse13 .cse10) (and .cse0 .cse8 .cse11 .cse2 .cse3 .cse6 .cse10) (and .cse8 .cse1 .cse2 .cse3 .cse9 .cse6 .cse10) (and .cse0 .cse7 .cse8 .cse11 .cse3 .cse5 .cse13) (and .cse7 .cse11 .cse9 .cse4 .cse5 .cse13 .cse12) (and .cse0 .cse8 .cse11 .cse2 .cse3 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse10) (and .cse7 .cse1 .cse9 .cse4 .cse5 .cse6 .cse12) (and .cse11 .cse2 .cse3 .cse9 .cse4 .cse5 .cse6) (and .cse0 .cse7 .cse11 .cse4 .cse13 .cse12 .cse10) (and .cse0 .cse7 .cse1 .cse3 .cse4 .cse5 .cse13) (and .cse7 .cse8 .cse1 .cse9 .cse5 .cse6 .cse12) (and .cse7 .cse8 .cse11 .cse9 .cse13 .cse12 .cse10) (and .cse8 .cse11 .cse2 .cse3 .cse9 .cse13 .cse10) (and .cse0 .cse7 .cse1 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse7 .cse11 .cse4 .cse5 .cse13 .cse12) (and .cse7 .cse1 .cse9 .cse4 .cse13 .cse12 .cse10) (and .cse7 .cse8 .cse11 .cse3 .cse9 .cse5 .cse13) (and .cse7 .cse11 .cse9 .cse4 .cse6 .cse12 .cse10) (and .cse7 .cse8 .cse1 .cse9 .cse6 .cse12 .cse10) (and .cse8 .cse11 .cse2 .cse3 .cse9 .cse6 .cse10) (and .cse1 .cse2 .cse3 .cse9 .cse4 .cse13 .cse10) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse6 .cse12) (and .cse7 .cse8 .cse1 .cse9 .cse13 .cse12 .cse10) (and .cse0 .cse7 .cse8 .cse11 .cse5 .cse6 .cse12) (and .cse0 .cse11 .cse2 .cse3 .cse4 .cse13 .cse10) (and .cse0 .cse7 .cse8 .cse11 .cse6 .cse12 .cse10) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse13 .cse12) (and .cse0 .cse8 .cse1 .cse2 .cse3 .cse6 .cse10) (and .cse0 .cse7 .cse8 .cse11 .cse3 .cse13 .cse10) (and .cse7 .cse8 .cse11 .cse9 .cse5 .cse13 .cse12) (and .cse0 .cse8 .cse1 .cse2 .cse5 .cse6 .cse12) (and .cse7 .cse11 .cse3 .cse9 .cse4 .cse13 .cse10) (and .cse0 .cse7 .cse1 .cse4 .cse13 .cse12 .cse10) (and .cse8 .cse11 .cse2 .cse3 .cse9 .cse5 .cse13) (and .cse0 .cse7 .cse8 .cse1 .cse3 .cse5 .cse13) (and .cse8 .cse1 .cse2 .cse9 .cse13 .cse12 .cse10) (and .cse0 .cse8 .cse11 .cse2 .cse3 .cse5 .cse13) (and .cse0 .cse7 .cse8 .cse11 .cse13 .cse12 .cse10) (and .cse0 .cse7 .cse8 .cse1 .cse13 .cse12 .cse10) (and .cse7 .cse1 .cse3 .cse9 .cse4 .cse5 .cse6) (and .cse8 .cse1 .cse2 .cse9 .cse6 .cse12 .cse10) (and .cse7 .cse11 .cse3 .cse9 .cse4 .cse5 .cse13) (and .cse0 .cse7 .cse11 .cse4 .cse6 .cse12 .cse10) (and .cse0 .cse8 .cse1 .cse2 .cse6 .cse12 .cse10) (and .cse0 .cse8 .cse1 .cse2 .cse13 .cse12 .cse10) (and .cse0 .cse11 .cse2 .cse4 .cse13 .cse12 .cse10) (and .cse8 .cse11 .cse2 .cse3 .cse9 .cse5 .cse6) (and .cse7 .cse8 .cse11 .cse9 .cse5 .cse6 .cse12) (and .cse0 .cse11 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse7 .cse8 .cse11 .cse3 .cse6 .cse10) (and .cse11 .cse2 .cse3 .cse9 .cse4 .cse6 .cse10) (and .cse0 .cse8 .cse11 .cse2 .cse6 .cse12 .cse10) (and .cse8 .cse11 .cse2 .cse9 .cse13 .cse12 .cse10) (and .cse0 .cse7 .cse11 .cse4 .cse5 .cse6 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse13 .cse10) (and .cse0 .cse1 .cse2 .cse4 .cse13 .cse12 .cse10) (and .cse7 .cse1 .cse9 .cse4 .cse5 .cse13 .cse12) (and .cse0 .cse7 .cse11 .cse3 .cse4 .cse13 .cse10) (and .cse0 .cse7 .cse11 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse7 .cse8 .cse11 .cse3 .cse5 .cse6) (and .cse8 .cse1 .cse2 .cse9 .cse5 .cse6 .cse12) (and .cse7 .cse11 .cse3 .cse9 .cse4 .cse6 .cse10) (and .cse0 .cse7 .cse8 .cse1 .cse3 .cse6 .cse10) (and .cse0 .cse7 .cse8 .cse1 .cse3 .cse5 .cse6) (and .cse7 .cse1 .cse3 .cse9 .cse4 .cse6 .cse10) (and .cse7 .cse8 .cse11 .cse3 .cse9 .cse6 .cse10) (and .cse0 .cse7 .cse1 .cse4 .cse5 .cse13 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse13) (and .cse0 .cse8 .cse1 .cse2 .cse3 .cse5 .cse13) (and .cse0 .cse1 .cse2 .cse4 .cse6 .cse12 .cse10) (and .cse0 .cse7 .cse1 .cse4 .cse6 .cse12 .cse10) (and .cse7 .cse1 .cse3 .cse9 .cse4 .cse13 .cse10) (and .cse0 .cse7 .cse8 .cse11 .cse5 .cse13 .cse12) (and .cse1 .cse2 .cse9 .cse4 .cse5 .cse13 .cse12) (and .cse7 .cse1 .cse9 .cse4 .cse6 .cse12 .cse10) (and .cse8 .cse1 .cse2 .cse3 .cse9 .cse13 .cse10) (and .cse7 .cse8 .cse11 .cse3 .cse9 .cse13 .cse10) (and .cse11 .cse2 .cse9 .cse4 .cse13 .cse12 .cse10) (and .cse0 .cse8 .cse11 .cse2 .cse13 .cse12 .cse10) (and .cse1 .cse2 .cse9 .cse4 .cse6 .cse12 .cse10) (and .cse0 .cse8 .cse11 .cse2 .cse5 .cse6 .cse12) (and .cse0 .cse8 .cse11 .cse2 .cse3 .cse13 .cse10) (and .cse7 .cse8 .cse1 .cse9 .cse5 .cse13 .cse12) (and .cse0 .cse11 .cse2 .cse4 .cse5 .cse6 .cse12) (and .cse0 .cse11 .cse2 .cse3 .cse4 .cse6 .cse10) (and .cse0 .cse11 .cse2 .cse4 .cse5 .cse13 .cse12) (and .cse7 .cse8 .cse11 .cse3 .cse9 .cse5 .cse6) (and .cse7 .cse1 .cse3 .cse9 .cse4 .cse5 .cse13) (and .cse11 .cse2 .cse3 .cse9 .cse4 .cse13 .cse10) (and .cse8 .cse11 .cse2 .cse9 .cse5 .cse6 .cse12) (and .cse8 .cse1 .cse2 .cse3 .cse9 .cse5 .cse6) (and .cse7 .cse8 .cse1 .cse3 .cse9 .cse5 .cse13) (and .cse7 .cse8 .cse1 .cse3 .cse9 .cse13 .cse10) (and .cse7 .cse11 .cse3 .cse9 .cse4 .cse5 .cse6) (and .cse1 .cse2 .cse9 .cse4 .cse5 .cse6 .cse12) (and .cse0 .cse11 .cse2 .cse3 .cse4 .cse5 .cse13) (and .cse11 .cse2 .cse9 .cse4 .cse5 .cse13 .cse12) (and .cse0 .cse7 .cse11 .cse3 .cse4 .cse5 .cse13) (and .cse7 .cse11 .cse9 .cse4 .cse13 .cse12 .cse10) (and .cse8 .cse1 .cse2 .cse3 .cse9 .cse5 .cse13))) [2022-04-08 08:22:33,212 INFO L878 garLoopResultBuilder]: At program point L117-1(lines 35 132) the Hoare annotation is: (let ((.cse1 (= main_~p8~0 0)) (.cse3 (= main_~p7~0 0)) (.cse0 (= main_~lk7~0 1)) (.cse2 (= main_~lk8~0 1))) (or (and .cse0 .cse1) (and .cse2 .cse3) (and .cse1 .cse3) (and .cse0 .cse2))) [2022-04-08 08:22:33,215 INFO L719 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2] [2022-04-08 08:22:33,219 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-08 08:22:33,221 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-08 08:22:33,223 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-08 08:22:33,356 INFO L163 areAnnotationChecker]: CFG has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-08 08:22:33,362 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.04 08:22:33 BoogieIcfgContainer [2022-04-08 08:22:33,362 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-08 08:22:33,363 INFO L158 Benchmark]: Toolchain (without parser) took 173857.43ms. Allocated memory was 194.0MB in the beginning and 936.4MB in the end (delta: 742.4MB). Free memory was 142.2MB in the beginning and 698.8MB in the end (delta: -556.6MB). Peak memory consumption was 563.2MB. Max. memory is 8.0GB. [2022-04-08 08:22:33,363 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 194.0MB. Free memory was 158.5MB in the beginning and 158.4MB in the end (delta: 136.4kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-08 08:22:33,363 INFO L158 Benchmark]: CACSL2BoogieTranslator took 248.75ms. Allocated memory was 194.0MB in the beginning and 260.0MB in the end (delta: 66.1MB). Free memory was 142.0MB in the beginning and 236.2MB in the end (delta: -94.1MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2022-04-08 08:22:33,363 INFO L158 Benchmark]: Boogie Preprocessor took 30.68ms. Allocated memory is still 260.0MB. Free memory was 236.2MB in the beginning and 234.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-08 08:22:33,363 INFO L158 Benchmark]: RCFGBuilder took 289.40ms. Allocated memory is still 260.0MB. Free memory was 234.1MB in the beginning and 220.5MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-04-08 08:22:33,363 INFO L158 Benchmark]: TraceAbstraction took 173283.10ms. Allocated memory was 260.0MB in the beginning and 936.4MB in the end (delta: 676.3MB). Free memory was 219.9MB in the beginning and 698.8MB in the end (delta: -478.9MB). Peak memory consumption was 576.0MB. Max. memory is 8.0GB. [2022-04-08 08:22:33,364 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.14ms. Allocated memory is still 194.0MB. Free memory was 158.5MB in the beginning and 158.4MB in the end (delta: 136.4kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 248.75ms. Allocated memory was 194.0MB in the beginning and 260.0MB in the end (delta: 66.1MB). Free memory was 142.0MB in the beginning and 236.2MB in the end (delta: -94.1MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * Boogie Preprocessor took 30.68ms. Allocated memory is still 260.0MB. Free memory was 236.2MB in the beginning and 234.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 289.40ms. Allocated memory is still 260.0MB. Free memory was 234.1MB in the beginning and 220.5MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * TraceAbstraction took 173283.10ms. Allocated memory was 260.0MB in the beginning and 936.4MB in the end (delta: 676.3MB). Free memory was 219.9MB in the beginning and 698.8MB in the end (delta: -478.9MB). Peak memory consumption was 576.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: 135]: 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, 42 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 173.1s, OverallIterations: 22, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 18.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 118.8s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2238 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2238 mSDsluCounter, 1720 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 156 mSDsCounter, 52 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1083 IncrementalHoareTripleChecker+Invalid, 1135 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 52 mSolverCounterUnsat, 1564 mSDtfsCounter, 1083 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 154 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4617occurred in iteration=21, InterpolantAutomatonStates: 88, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 7.8s AutomataMinimizationTime, 22 MinimizatonAttempts, 1044 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 39 LocationsWithAnnotation, 39 PreInvPairs, 5808 NumberOfFragments, 22569 HoareAnnotationTreeSize, 39 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 60.6s HoareSimplificationTime, 39 FomulaSimplificationsInter, 565747 FormulaSimplificationTreeSizeReductionInter, 58.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, 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: 7]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 35]: Loop Invariant Derived loop invariant: 1 - ProcedureContractResult [Line: 6]: Procedure Contract for main Derived contract for procedure main: 1 RESULT: Ultimate proved your program to be correct! [2022-04-08 08:22:33,402 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...