/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_6.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 08:19:47,136 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 08:19:47,137 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 08:19:47,178 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 08:19:47,179 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 08:19:47,180 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 08:19:47,183 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 08:19:47,185 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 08:19:47,186 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 08:19:47,190 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 08:19:47,191 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 08:19:47,192 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 08:19:47,192 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 08:19:47,197 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 08:19:47,197 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 08:19:47,198 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 08:19:47,199 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 08:19:47,199 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 08:19:47,202 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 08:19:47,204 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 08:19:47,204 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 08:19:47,205 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 08:19:47,206 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 08:19:47,207 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 08:19:47,208 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 08:19:47,214 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 08:19:47,214 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 08:19:47,214 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 08:19:47,215 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 08:19:47,215 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 08:19:47,216 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 08:19:47,216 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 08:19:47,216 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 08:19:47,217 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 08:19:47,217 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 08:19:47,218 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 08:19:47,218 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 08:19:47,218 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 08:19:47,218 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 08:19:47,218 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 08:19:47,219 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 08:19:47,219 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 08:19:47,220 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-28 08:19:47,229 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 08:19:47,230 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 08:19:47,231 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 08:19:47,231 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-28 08:19:47,231 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 08:19:47,231 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-28 08:19:47,231 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 08:19:47,231 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 08:19:47,231 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 08:19:47,232 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 08:19:47,232 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-28 08:19:47,232 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 08:19:47,232 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 08:19:47,232 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 08:19:47,232 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 08:19:47,232 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 08:19:47,232 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 08:19:47,232 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 08:19:47,233 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 08:19:47,233 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 08:19:47,233 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 08:19:47,233 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 08:19:47,233 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 08:19:47,233 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 08:19:47,233 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-28 08:19:47,233 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-28 08:19:47,412 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 08:19:47,426 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 08:19:47,428 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 08:19:47,429 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 08:19:47,431 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 08:19:47,432 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_6.c [2022-04-28 08:19:47,479 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d185b8be2/5521e52c2f0548668134a26b461a5d25/FLAGf808ebfb6 [2022-04-28 08:19:47,825 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 08:19:47,826 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_6.c [2022-04-28 08:19:47,830 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d185b8be2/5521e52c2f0548668134a26b461a5d25/FLAGf808ebfb6 [2022-04-28 08:19:47,838 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d185b8be2/5521e52c2f0548668134a26b461a5d25 [2022-04-28 08:19:47,839 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 08:19:47,840 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 08:19:47,841 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 08:19:47,841 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 08:19:47,845 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 08:19:47,846 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 08:19:47" (1/1) ... [2022-04-28 08:19:47,847 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e91abd8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:19:47, skipping insertion in model container [2022-04-28 08:19:47,847 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 08:19:47" (1/1) ... [2022-04-28 08:19:47,851 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 08:19:47,860 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 08:19:47,989 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_6.c[2544,2557] [2022-04-28 08:19:47,991 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 08:19:47,996 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 08:19:48,008 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_6.c[2544,2557] [2022-04-28 08:19:48,009 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 08:19:48,020 INFO L208 MainTranslator]: Completed translation [2022-04-28 08:19:48,021 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:19:48 WrapperNode [2022-04-28 08:19:48,021 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 08:19:48,022 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 08:19:48,022 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 08:19:48,022 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 08:19:48,029 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:19:48" (1/1) ... [2022-04-28 08:19:48,029 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:19:48" (1/1) ... [2022-04-28 08:19:48,035 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:19:48" (1/1) ... [2022-04-28 08:19:48,035 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:19:48" (1/1) ... [2022-04-28 08:19:48,053 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:19:48" (1/1) ... [2022-04-28 08:19:48,057 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:19:48" (1/1) ... [2022-04-28 08:19:48,058 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:19:48" (1/1) ... [2022-04-28 08:19:48,059 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 08:19:48,060 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 08:19:48,060 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 08:19:48,060 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 08:19:48,061 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:19:48" (1/1) ... [2022-04-28 08:19:48,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 08:19:48,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 08:19:48,086 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-28 08:19:48,090 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-28 08:19:48,120 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 08:19:48,120 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 08:19:48,121 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 08:19:48,121 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 08:19:48,121 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 08:19:48,121 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 08:19:48,121 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 08:19:48,121 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 08:19:48,121 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-28 08:19:48,122 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 08:19:48,122 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 08:19:48,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 08:19:48,123 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 08:19:48,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 08:19:48,123 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 08:19:48,123 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 08:19:48,186 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 08:19:48,188 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 08:19:48,322 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 08:19:48,327 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 08:19:48,327 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 08:19:48,328 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 08:19:48 BoogieIcfgContainer [2022-04-28 08:19:48,329 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 08:19:48,330 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 08:19:48,330 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 08:19:48,347 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 08:19:48,347 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 08:19:47" (1/3) ... [2022-04-28 08:19:48,347 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@435d3238 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 08:19:48, skipping insertion in model container [2022-04-28 08:19:48,348 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:19:48" (2/3) ... [2022-04-28 08:19:48,348 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@435d3238 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 08:19:48, skipping insertion in model container [2022-04-28 08:19:48,348 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 08:19:48" (3/3) ... [2022-04-28 08:19:48,349 INFO L111 eAbstractionObserver]: Analyzing ICFG test_locks_6.c [2022-04-28 08:19:48,357 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 08:19:48,358 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 08:19:48,384 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 08:19:48,389 INFO L357 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@1d467b21, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@4054887f [2022-04-28 08:19:48,389 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 08:19:48,397 INFO L276 IsEmpty]: Start isEmpty. Operand has 33 states, 27 states have (on average 1.8148148148148149) internal successors, (49), 28 states have internal predecessors, (49), 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-28 08:19:48,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-28 08:19:48,402 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:19:48,404 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:19:48,404 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:19:48,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:19:48,417 INFO L85 PathProgramCache]: Analyzing trace with hash 1747552289, now seen corresponding path program 1 times [2022-04-28 08:19:48,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:19:48,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [28966858] [2022-04-28 08:19:48,435 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:19:48,436 INFO L85 PathProgramCache]: Analyzing trace with hash 1747552289, now seen corresponding path program 2 times [2022-04-28 08:19:48,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:19:48,438 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690817217] [2022-04-28 08:19:48,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:19:48,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:19:48,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:19:48,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:19:48,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:19:48,595 INFO L290 TraceCheckUtils]: 0: Hoare triple {42#(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); {36#true} is VALID [2022-04-28 08:19:48,595 INFO L290 TraceCheckUtils]: 1: Hoare triple {36#true} assume true; {36#true} is VALID [2022-04-28 08:19:48,595 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {36#true} {36#true} #132#return; {36#true} is VALID [2022-04-28 08:19:48,597 INFO L272 TraceCheckUtils]: 0: Hoare triple {36#true} call ULTIMATE.init(); {42#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:19:48,598 INFO L290 TraceCheckUtils]: 1: Hoare triple {42#(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); {36#true} is VALID [2022-04-28 08:19:48,598 INFO L290 TraceCheckUtils]: 2: Hoare triple {36#true} assume true; {36#true} is VALID [2022-04-28 08:19:48,598 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36#true} {36#true} #132#return; {36#true} is VALID [2022-04-28 08:19:48,599 INFO L272 TraceCheckUtils]: 4: Hoare triple {36#true} call #t~ret11 := main(); {36#true} is VALID [2022-04-28 08:19:48,599 INFO L290 TraceCheckUtils]: 5: Hoare triple {36#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;havoc ~cond~0; {36#true} is VALID [2022-04-28 08:19:48,600 INFO L290 TraceCheckUtils]: 6: Hoare triple {36#true} assume !false;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~cond~0 := #t~nondet10;havoc #t~nondet10; {36#true} is VALID [2022-04-28 08:19:48,600 INFO L290 TraceCheckUtils]: 7: Hoare triple {36#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0; {36#true} is VALID [2022-04-28 08:19:48,601 INFO L290 TraceCheckUtils]: 8: Hoare triple {36#true} assume 0 != ~p1~0;~lk1~0 := 1; {41#(= main_~lk1~0 1)} is VALID [2022-04-28 08:19:48,603 INFO L290 TraceCheckUtils]: 9: Hoare triple {41#(= main_~lk1~0 1)} assume !(0 != ~p2~0); {41#(= main_~lk1~0 1)} is VALID [2022-04-28 08:19:48,604 INFO L290 TraceCheckUtils]: 10: Hoare triple {41#(= main_~lk1~0 1)} assume 0 != ~p3~0;~lk3~0 := 1; {41#(= main_~lk1~0 1)} is VALID [2022-04-28 08:19:48,604 INFO L290 TraceCheckUtils]: 11: Hoare triple {41#(= main_~lk1~0 1)} assume 0 != ~p4~0;~lk4~0 := 1; {41#(= main_~lk1~0 1)} is VALID [2022-04-28 08:19:48,605 INFO L290 TraceCheckUtils]: 12: Hoare triple {41#(= main_~lk1~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {41#(= main_~lk1~0 1)} is VALID [2022-04-28 08:19:48,606 INFO L290 TraceCheckUtils]: 13: Hoare triple {41#(= main_~lk1~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {41#(= main_~lk1~0 1)} is VALID [2022-04-28 08:19:48,606 INFO L290 TraceCheckUtils]: 14: Hoare triple {41#(= main_~lk1~0 1)} assume 0 != ~p1~0; {41#(= main_~lk1~0 1)} is VALID [2022-04-28 08:19:48,607 INFO L290 TraceCheckUtils]: 15: Hoare triple {41#(= main_~lk1~0 1)} assume 1 != ~lk1~0; {37#false} is VALID [2022-04-28 08:19:48,607 INFO L290 TraceCheckUtils]: 16: Hoare triple {37#false} assume !false; {37#false} is VALID [2022-04-28 08:19:48,607 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-28 08:19:48,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:19:48,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690817217] [2022-04-28 08:19:48,608 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690817217] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:19:48,609 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:19:48,609 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:19:48,610 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:19:48,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [28966858] [2022-04-28 08:19:48,611 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [28966858] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:19:48,611 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:19:48,611 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:19:48,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619672197] [2022-04-28 08:19:48,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:19:48,615 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 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 17 [2022-04-28 08:19:48,616 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:19:48,618 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 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-28 08:19:48,660 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:19:48,661 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:19:48,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:19:48,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:19:48,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:19:48,685 INFO L87 Difference]: Start difference. First operand has 33 states, 27 states have (on average 1.8148148148148149) internal successors, (49), 28 states have internal predecessors, (49), 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 3.5) internal successors, (14), 3 states have internal predecessors, (14), 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-28 08:19:48,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:19:48,926 INFO L93 Difference]: Finished difference Result 64 states and 103 transitions. [2022-04-28 08:19:48,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:19:48,927 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 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 17 [2022-04-28 08:19:48,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:19:48,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 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-28 08:19:48,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 103 transitions. [2022-04-28 08:19:48,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 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-28 08:19:48,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 103 transitions. [2022-04-28 08:19:48,940 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 103 transitions. [2022-04-28 08:19:49,026 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:19:49,033 INFO L225 Difference]: With dead ends: 64 [2022-04-28 08:19:49,033 INFO L226 Difference]: Without dead ends: 49 [2022-04-28 08:19:49,035 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:19:49,037 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 106 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 65 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.1s IncrementalHoareTripleChecker+Time [2022-04-28 08:19:49,038 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 65 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 08:19:49,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-04-28 08:19:49,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 35. [2022-04-28 08:19:49,060 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:19:49,061 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand has 35 states, 31 states have (on average 1.7741935483870968) internal successors, (55), 31 states have internal predecessors, (55), 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-28 08:19:49,061 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand has 35 states, 31 states have (on average 1.7741935483870968) internal successors, (55), 31 states have internal predecessors, (55), 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-28 08:19:49,062 INFO L87 Difference]: Start difference. First operand 49 states. Second operand has 35 states, 31 states have (on average 1.7741935483870968) internal successors, (55), 31 states have internal predecessors, (55), 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-28 08:19:49,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:19:49,065 INFO L93 Difference]: Finished difference Result 49 states and 81 transitions. [2022-04-28 08:19:49,065 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 81 transitions. [2022-04-28 08:19:49,066 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:19:49,066 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:19:49,066 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 31 states have (on average 1.7741935483870968) internal successors, (55), 31 states have internal predecessors, (55), 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 49 states. [2022-04-28 08:19:49,066 INFO L87 Difference]: Start difference. First operand has 35 states, 31 states have (on average 1.7741935483870968) internal successors, (55), 31 states have internal predecessors, (55), 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 49 states. [2022-04-28 08:19:49,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:19:49,070 INFO L93 Difference]: Finished difference Result 49 states and 81 transitions. [2022-04-28 08:19:49,070 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 81 transitions. [2022-04-28 08:19:49,071 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:19:49,071 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:19:49,071 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:19:49,071 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:19:49,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 31 states have (on average 1.7741935483870968) internal successors, (55), 31 states have internal predecessors, (55), 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-28 08:19:49,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 58 transitions. [2022-04-28 08:19:49,074 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 58 transitions. Word has length 17 [2022-04-28 08:19:49,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:19:49,074 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 58 transitions. [2022-04-28 08:19:49,074 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 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-28 08:19:49,075 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 58 transitions. [2022-04-28 08:19:49,124 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:19:49,124 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 58 transitions. [2022-04-28 08:19:49,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-28 08:19:49,125 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:19:49,125 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:19:49,125 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 08:19:49,126 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:19:49,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:19:49,126 INFO L85 PathProgramCache]: Analyzing trace with hash -1867356637, now seen corresponding path program 1 times [2022-04-28 08:19:49,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:19:49,127 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1872546249] [2022-04-28 08:19:49,128 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:19:49,128 INFO L85 PathProgramCache]: Analyzing trace with hash -1867356637, now seen corresponding path program 2 times [2022-04-28 08:19:49,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:19:49,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033765677] [2022-04-28 08:19:49,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:19:49,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:19:49,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:19:49,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:19:49,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:19:49,184 INFO L290 TraceCheckUtils]: 0: Hoare triple {350#(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); {344#true} is VALID [2022-04-28 08:19:49,185 INFO L290 TraceCheckUtils]: 1: Hoare triple {344#true} assume true; {344#true} is VALID [2022-04-28 08:19:49,185 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {344#true} {344#true} #132#return; {344#true} is VALID [2022-04-28 08:19:49,185 INFO L272 TraceCheckUtils]: 0: Hoare triple {344#true} call ULTIMATE.init(); {350#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:19:49,186 INFO L290 TraceCheckUtils]: 1: Hoare triple {350#(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); {344#true} is VALID [2022-04-28 08:19:49,186 INFO L290 TraceCheckUtils]: 2: Hoare triple {344#true} assume true; {344#true} is VALID [2022-04-28 08:19:49,186 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {344#true} {344#true} #132#return; {344#true} is VALID [2022-04-28 08:19:49,186 INFO L272 TraceCheckUtils]: 4: Hoare triple {344#true} call #t~ret11 := main(); {344#true} is VALID [2022-04-28 08:19:49,187 INFO L290 TraceCheckUtils]: 5: Hoare triple {344#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;havoc ~cond~0; {344#true} is VALID [2022-04-28 08:19:49,187 INFO L290 TraceCheckUtils]: 6: Hoare triple {344#true} assume !false;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~cond~0 := #t~nondet10;havoc #t~nondet10; {344#true} is VALID [2022-04-28 08:19:49,187 INFO L290 TraceCheckUtils]: 7: Hoare triple {344#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0; {344#true} is VALID [2022-04-28 08:19:49,188 INFO L290 TraceCheckUtils]: 8: Hoare triple {344#true} assume !(0 != ~p1~0); {349#(= main_~p1~0 0)} is VALID [2022-04-28 08:19:49,188 INFO L290 TraceCheckUtils]: 9: Hoare triple {349#(= main_~p1~0 0)} assume !(0 != ~p2~0); {349#(= main_~p1~0 0)} is VALID [2022-04-28 08:19:49,188 INFO L290 TraceCheckUtils]: 10: Hoare triple {349#(= main_~p1~0 0)} assume 0 != ~p3~0;~lk3~0 := 1; {349#(= main_~p1~0 0)} is VALID [2022-04-28 08:19:49,189 INFO L290 TraceCheckUtils]: 11: Hoare triple {349#(= main_~p1~0 0)} assume 0 != ~p4~0;~lk4~0 := 1; {349#(= main_~p1~0 0)} is VALID [2022-04-28 08:19:49,189 INFO L290 TraceCheckUtils]: 12: Hoare triple {349#(= main_~p1~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {349#(= main_~p1~0 0)} is VALID [2022-04-28 08:19:49,190 INFO L290 TraceCheckUtils]: 13: Hoare triple {349#(= main_~p1~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {349#(= main_~p1~0 0)} is VALID [2022-04-28 08:19:49,190 INFO L290 TraceCheckUtils]: 14: Hoare triple {349#(= main_~p1~0 0)} assume 0 != ~p1~0; {345#false} is VALID [2022-04-28 08:19:49,190 INFO L290 TraceCheckUtils]: 15: Hoare triple {345#false} assume 1 != ~lk1~0; {345#false} is VALID [2022-04-28 08:19:49,191 INFO L290 TraceCheckUtils]: 16: Hoare triple {345#false} assume !false; {345#false} is VALID [2022-04-28 08:19:49,191 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-28 08:19:49,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:19:49,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033765677] [2022-04-28 08:19:49,192 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033765677] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:19:49,192 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:19:49,192 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:19:49,192 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:19:49,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1872546249] [2022-04-28 08:19:49,193 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1872546249] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:19:49,193 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:19:49,193 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:19:49,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734858888] [2022-04-28 08:19:49,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:19:49,194 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 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 17 [2022-04-28 08:19:49,194 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:19:49,194 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 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-28 08:19:49,207 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:19:49,207 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:19:49,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:19:49,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:19:49,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:19:49,209 INFO L87 Difference]: Start difference. First operand 35 states and 58 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 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-28 08:19:49,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:19:49,397 INFO L93 Difference]: Finished difference Result 78 states and 133 transitions. [2022-04-28 08:19:49,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:19:49,397 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 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 17 [2022-04-28 08:19:49,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:19:49,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 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-28 08:19:49,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 120 transitions. [2022-04-28 08:19:49,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 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-28 08:19:49,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 120 transitions. [2022-04-28 08:19:49,401 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 120 transitions. [2022-04-28 08:19:49,487 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 120 edges. 120 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:19:49,492 INFO L225 Difference]: With dead ends: 78 [2022-04-28 08:19:49,492 INFO L226 Difference]: Without dead ends: 49 [2022-04-28 08:19:49,493 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:19:49,496 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 88 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 08:19:49,497 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 63 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 08:19:49,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-04-28 08:19:49,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2022-04-28 08:19:49,511 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:19:49,512 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand has 47 states, 43 states have (on average 1.744186046511628) internal successors, (75), 43 states have internal predecessors, (75), 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-28 08:19:49,512 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand has 47 states, 43 states have (on average 1.744186046511628) internal successors, (75), 43 states have internal predecessors, (75), 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-28 08:19:49,514 INFO L87 Difference]: Start difference. First operand 49 states. Second operand has 47 states, 43 states have (on average 1.744186046511628) internal successors, (75), 43 states have internal predecessors, (75), 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-28 08:19:49,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:19:49,520 INFO L93 Difference]: Finished difference Result 49 states and 79 transitions. [2022-04-28 08:19:49,521 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 79 transitions. [2022-04-28 08:19:49,521 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:19:49,521 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:19:49,521 INFO L74 IsIncluded]: Start isIncluded. First operand has 47 states, 43 states have (on average 1.744186046511628) internal successors, (75), 43 states have internal predecessors, (75), 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 49 states. [2022-04-28 08:19:49,522 INFO L87 Difference]: Start difference. First operand has 47 states, 43 states have (on average 1.744186046511628) internal successors, (75), 43 states have internal predecessors, (75), 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 49 states. [2022-04-28 08:19:49,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:19:49,524 INFO L93 Difference]: Finished difference Result 49 states and 79 transitions. [2022-04-28 08:19:49,524 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 79 transitions. [2022-04-28 08:19:49,524 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:19:49,524 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:19:49,525 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:19:49,525 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:19:49,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 43 states have (on average 1.744186046511628) internal successors, (75), 43 states have internal predecessors, (75), 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-28 08:19:49,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 78 transitions. [2022-04-28 08:19:49,527 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 78 transitions. Word has length 17 [2022-04-28 08:19:49,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:19:49,527 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 78 transitions. [2022-04-28 08:19:49,527 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 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-28 08:19:49,527 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 47 states and 78 transitions. [2022-04-28 08:19:49,613 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-28 08:19:49,614 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 78 transitions. [2022-04-28 08:19:49,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-28 08:19:49,614 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:19:49,614 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:19:49,615 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 08:19:49,615 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:19:49,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:19:49,615 INFO L85 PathProgramCache]: Analyzing trace with hash -1660239210, now seen corresponding path program 1 times [2022-04-28 08:19:49,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:19:49,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1866658682] [2022-04-28 08:19:49,616 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:19:49,616 INFO L85 PathProgramCache]: Analyzing trace with hash -1660239210, now seen corresponding path program 2 times [2022-04-28 08:19:49,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:19:49,617 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475638620] [2022-04-28 08:19:49,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:19:49,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:19:49,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:19:49,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:19:49,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:19:49,670 INFO L290 TraceCheckUtils]: 0: Hoare triple {710#(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); {704#true} is VALID [2022-04-28 08:19:49,670 INFO L290 TraceCheckUtils]: 1: Hoare triple {704#true} assume true; {704#true} is VALID [2022-04-28 08:19:49,671 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {704#true} {704#true} #132#return; {704#true} is VALID [2022-04-28 08:19:49,671 INFO L272 TraceCheckUtils]: 0: Hoare triple {704#true} call ULTIMATE.init(); {710#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:19:49,671 INFO L290 TraceCheckUtils]: 1: Hoare triple {710#(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); {704#true} is VALID [2022-04-28 08:19:49,671 INFO L290 TraceCheckUtils]: 2: Hoare triple {704#true} assume true; {704#true} is VALID [2022-04-28 08:19:49,671 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {704#true} {704#true} #132#return; {704#true} is VALID [2022-04-28 08:19:49,672 INFO L272 TraceCheckUtils]: 4: Hoare triple {704#true} call #t~ret11 := main(); {704#true} is VALID [2022-04-28 08:19:49,672 INFO L290 TraceCheckUtils]: 5: Hoare triple {704#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;havoc ~cond~0; {704#true} is VALID [2022-04-28 08:19:49,672 INFO L290 TraceCheckUtils]: 6: Hoare triple {704#true} assume !false;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~cond~0 := #t~nondet10;havoc #t~nondet10; {704#true} is VALID [2022-04-28 08:19:49,672 INFO L290 TraceCheckUtils]: 7: Hoare triple {704#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0; {704#true} is VALID [2022-04-28 08:19:49,672 INFO L290 TraceCheckUtils]: 8: Hoare triple {704#true} assume 0 != ~p1~0;~lk1~0 := 1; {709#(not (= main_~p1~0 0))} is VALID [2022-04-28 08:19:49,673 INFO L290 TraceCheckUtils]: 9: Hoare triple {709#(not (= main_~p1~0 0))} assume !(0 != ~p2~0); {709#(not (= main_~p1~0 0))} is VALID [2022-04-28 08:19:49,673 INFO L290 TraceCheckUtils]: 10: Hoare triple {709#(not (= main_~p1~0 0))} assume 0 != ~p3~0;~lk3~0 := 1; {709#(not (= main_~p1~0 0))} is VALID [2022-04-28 08:19:49,673 INFO L290 TraceCheckUtils]: 11: Hoare triple {709#(not (= main_~p1~0 0))} assume 0 != ~p4~0;~lk4~0 := 1; {709#(not (= main_~p1~0 0))} is VALID [2022-04-28 08:19:49,673 INFO L290 TraceCheckUtils]: 12: Hoare triple {709#(not (= main_~p1~0 0))} assume 0 != ~p5~0;~lk5~0 := 1; {709#(not (= main_~p1~0 0))} is VALID [2022-04-28 08:19:49,674 INFO L290 TraceCheckUtils]: 13: Hoare triple {709#(not (= main_~p1~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {709#(not (= main_~p1~0 0))} is VALID [2022-04-28 08:19:49,674 INFO L290 TraceCheckUtils]: 14: Hoare triple {709#(not (= main_~p1~0 0))} assume !(0 != ~p1~0); {705#false} is VALID [2022-04-28 08:19:49,674 INFO L290 TraceCheckUtils]: 15: Hoare triple {705#false} assume 0 != ~p2~0; {705#false} is VALID [2022-04-28 08:19:49,674 INFO L290 TraceCheckUtils]: 16: Hoare triple {705#false} assume 1 != ~lk2~0; {705#false} is VALID [2022-04-28 08:19:49,674 INFO L290 TraceCheckUtils]: 17: Hoare triple {705#false} assume !false; {705#false} is VALID [2022-04-28 08:19:49,675 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-28 08:19:49,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:19:49,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475638620] [2022-04-28 08:19:49,675 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475638620] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:19:49,675 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:19:49,675 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:19:49,675 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:19:49,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1866658682] [2022-04-28 08:19:49,676 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1866658682] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:19:49,676 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:19:49,676 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:19:49,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063982074] [2022-04-28 08:19:49,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:19:49,676 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 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 18 [2022-04-28 08:19:49,676 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:19:49,677 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 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-28 08:19:49,686 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:19:49,686 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:19:49,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:19:49,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:19:49,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:19:49,687 INFO L87 Difference]: Start difference. First operand 47 states and 78 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 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-28 08:19:49,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:19:49,799 INFO L93 Difference]: Finished difference Result 73 states and 118 transitions. [2022-04-28 08:19:49,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:19:49,799 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 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 18 [2022-04-28 08:19:49,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:19:49,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 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-28 08:19:49,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 115 transitions. [2022-04-28 08:19:49,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 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-28 08:19:49,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 115 transitions. [2022-04-28 08:19:49,804 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 115 transitions. [2022-04-28 08:19:49,900 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 115 edges. 115 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:19:49,902 INFO L225 Difference]: With dead ends: 73 [2022-04-28 08:19:49,902 INFO L226 Difference]: Without dead ends: 52 [2022-04-28 08:19:49,902 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:19:49,905 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 79 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 08:19:49,908 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 73 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 08:19:49,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-04-28 08:19:49,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 50. [2022-04-28 08:19:49,919 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:19:49,919 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand has 50 states, 46 states have (on average 1.673913043478261) internal successors, (77), 46 states have internal predecessors, (77), 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-28 08:19:49,919 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand has 50 states, 46 states have (on average 1.673913043478261) internal successors, (77), 46 states have internal predecessors, (77), 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-28 08:19:49,920 INFO L87 Difference]: Start difference. First operand 52 states. Second operand has 50 states, 46 states have (on average 1.673913043478261) internal successors, (77), 46 states have internal predecessors, (77), 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-28 08:19:49,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:19:49,922 INFO L93 Difference]: Finished difference Result 52 states and 81 transitions. [2022-04-28 08:19:49,922 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 81 transitions. [2022-04-28 08:19:49,923 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:19:49,923 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:19:49,924 INFO L74 IsIncluded]: Start isIncluded. First operand has 50 states, 46 states have (on average 1.673913043478261) internal successors, (77), 46 states have internal predecessors, (77), 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 52 states. [2022-04-28 08:19:49,924 INFO L87 Difference]: Start difference. First operand has 50 states, 46 states have (on average 1.673913043478261) internal successors, (77), 46 states have internal predecessors, (77), 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 52 states. [2022-04-28 08:19:49,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:19:49,926 INFO L93 Difference]: Finished difference Result 52 states and 81 transitions. [2022-04-28 08:19:49,926 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 81 transitions. [2022-04-28 08:19:49,930 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:19:49,930 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:19:49,930 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:19:49,930 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:19:49,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 46 states have (on average 1.673913043478261) internal successors, (77), 46 states have internal predecessors, (77), 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-28 08:19:49,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 80 transitions. [2022-04-28 08:19:49,932 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 80 transitions. Word has length 18 [2022-04-28 08:19:49,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:19:49,932 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 80 transitions. [2022-04-28 08:19:49,932 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 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-28 08:19:49,932 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 50 states and 80 transitions. [2022-04-28 08:19:49,993 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:19:49,993 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 80 transitions. [2022-04-28 08:19:49,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-28 08:19:49,993 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:19:49,994 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:19:49,994 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-28 08:19:49,994 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:19:49,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:19:49,994 INFO L85 PathProgramCache]: Analyzing trace with hash -2053266220, now seen corresponding path program 1 times [2022-04-28 08:19:49,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:19:49,994 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1197813449] [2022-04-28 08:19:49,995 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:19:49,995 INFO L85 PathProgramCache]: Analyzing trace with hash -2053266220, now seen corresponding path program 2 times [2022-04-28 08:19:49,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:19:49,995 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28356520] [2022-04-28 08:19:49,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:19:49,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:19:50,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:19:50,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:19:50,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:19:50,042 INFO L290 TraceCheckUtils]: 0: Hoare triple {1072#(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); {1066#true} is VALID [2022-04-28 08:19:50,042 INFO L290 TraceCheckUtils]: 1: Hoare triple {1066#true} assume true; {1066#true} is VALID [2022-04-28 08:19:50,043 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1066#true} {1066#true} #132#return; {1066#true} is VALID [2022-04-28 08:19:50,043 INFO L272 TraceCheckUtils]: 0: Hoare triple {1066#true} call ULTIMATE.init(); {1072#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:19:50,043 INFO L290 TraceCheckUtils]: 1: Hoare triple {1072#(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); {1066#true} is VALID [2022-04-28 08:19:50,043 INFO L290 TraceCheckUtils]: 2: Hoare triple {1066#true} assume true; {1066#true} is VALID [2022-04-28 08:19:50,044 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1066#true} {1066#true} #132#return; {1066#true} is VALID [2022-04-28 08:19:50,044 INFO L272 TraceCheckUtils]: 4: Hoare triple {1066#true} call #t~ret11 := main(); {1066#true} is VALID [2022-04-28 08:19:50,044 INFO L290 TraceCheckUtils]: 5: Hoare triple {1066#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;havoc ~cond~0; {1066#true} is VALID [2022-04-28 08:19:50,044 INFO L290 TraceCheckUtils]: 6: Hoare triple {1066#true} assume !false;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~cond~0 := #t~nondet10;havoc #t~nondet10; {1066#true} is VALID [2022-04-28 08:19:50,044 INFO L290 TraceCheckUtils]: 7: Hoare triple {1066#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0; {1066#true} is VALID [2022-04-28 08:19:50,044 INFO L290 TraceCheckUtils]: 8: Hoare triple {1066#true} assume !(0 != ~p1~0); {1066#true} is VALID [2022-04-28 08:19:50,045 INFO L290 TraceCheckUtils]: 9: Hoare triple {1066#true} assume !(0 != ~p2~0); {1071#(= main_~p2~0 0)} is VALID [2022-04-28 08:19:50,045 INFO L290 TraceCheckUtils]: 10: Hoare triple {1071#(= main_~p2~0 0)} assume 0 != ~p3~0;~lk3~0 := 1; {1071#(= main_~p2~0 0)} is VALID [2022-04-28 08:19:50,045 INFO L290 TraceCheckUtils]: 11: Hoare triple {1071#(= main_~p2~0 0)} assume 0 != ~p4~0;~lk4~0 := 1; {1071#(= main_~p2~0 0)} is VALID [2022-04-28 08:19:50,046 INFO L290 TraceCheckUtils]: 12: Hoare triple {1071#(= main_~p2~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {1071#(= main_~p2~0 0)} is VALID [2022-04-28 08:19:50,046 INFO L290 TraceCheckUtils]: 13: Hoare triple {1071#(= main_~p2~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {1071#(= main_~p2~0 0)} is VALID [2022-04-28 08:19:50,046 INFO L290 TraceCheckUtils]: 14: Hoare triple {1071#(= main_~p2~0 0)} assume !(0 != ~p1~0); {1071#(= main_~p2~0 0)} is VALID [2022-04-28 08:19:50,046 INFO L290 TraceCheckUtils]: 15: Hoare triple {1071#(= main_~p2~0 0)} assume 0 != ~p2~0; {1067#false} is VALID [2022-04-28 08:19:50,047 INFO L290 TraceCheckUtils]: 16: Hoare triple {1067#false} assume 1 != ~lk2~0; {1067#false} is VALID [2022-04-28 08:19:50,047 INFO L290 TraceCheckUtils]: 17: Hoare triple {1067#false} assume !false; {1067#false} is VALID [2022-04-28 08:19:50,047 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-28 08:19:50,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:19:50,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28356520] [2022-04-28 08:19:50,047 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28356520] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:19:50,047 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:19:50,047 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:19:50,048 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:19:50,048 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1197813449] [2022-04-28 08:19:50,048 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1197813449] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:19:50,048 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:19:50,048 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:19:50,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803454178] [2022-04-28 08:19:50,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:19:50,048 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 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 18 [2022-04-28 08:19:50,048 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:19:50,049 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 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-28 08:19:50,062 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:19:50,062 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:19:50,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:19:50,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:19:50,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:19:50,063 INFO L87 Difference]: Start difference. First operand 50 states and 80 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 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-28 08:19:50,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:19:50,166 INFO L93 Difference]: Finished difference Result 130 states and 216 transitions. [2022-04-28 08:19:50,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:19:50,167 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 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 18 [2022-04-28 08:19:50,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:19:50,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 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-28 08:19:50,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 118 transitions. [2022-04-28 08:19:50,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 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-28 08:19:50,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 118 transitions. [2022-04-28 08:19:50,172 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 118 transitions. [2022-04-28 08:19:50,255 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 118 edges. 118 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:19:50,256 INFO L225 Difference]: With dead ends: 130 [2022-04-28 08:19:50,256 INFO L226 Difference]: Without dead ends: 89 [2022-04-28 08:19:50,257 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:19:50,257 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 95 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 08:19:50,258 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 55 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 08:19:50,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-04-28 08:19:50,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 87. [2022-04-28 08:19:50,265 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:19:50,265 INFO L82 GeneralOperation]: Start isEquivalent. First operand 89 states. Second operand has 87 states, 83 states have (on average 1.6626506024096386) internal successors, (138), 83 states have internal predecessors, (138), 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-28 08:19:50,266 INFO L74 IsIncluded]: Start isIncluded. First operand 89 states. Second operand has 87 states, 83 states have (on average 1.6626506024096386) internal successors, (138), 83 states have internal predecessors, (138), 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-28 08:19:50,266 INFO L87 Difference]: Start difference. First operand 89 states. Second operand has 87 states, 83 states have (on average 1.6626506024096386) internal successors, (138), 83 states have internal predecessors, (138), 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-28 08:19:50,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:19:50,268 INFO L93 Difference]: Finished difference Result 89 states and 142 transitions. [2022-04-28 08:19:50,268 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 142 transitions. [2022-04-28 08:19:50,268 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:19:50,269 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:19:50,269 INFO L74 IsIncluded]: Start isIncluded. First operand has 87 states, 83 states have (on average 1.6626506024096386) internal successors, (138), 83 states have internal predecessors, (138), 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 89 states. [2022-04-28 08:19:50,269 INFO L87 Difference]: Start difference. First operand has 87 states, 83 states have (on average 1.6626506024096386) internal successors, (138), 83 states have internal predecessors, (138), 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 89 states. [2022-04-28 08:19:50,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:19:50,272 INFO L93 Difference]: Finished difference Result 89 states and 142 transitions. [2022-04-28 08:19:50,272 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 142 transitions. [2022-04-28 08:19:50,272 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:19:50,272 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:19:50,272 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:19:50,272 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:19:50,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 83 states have (on average 1.6626506024096386) internal successors, (138), 83 states have internal predecessors, (138), 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-28 08:19:50,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 141 transitions. [2022-04-28 08:19:50,275 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 141 transitions. Word has length 18 [2022-04-28 08:19:50,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:19:50,275 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 141 transitions. [2022-04-28 08:19:50,275 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 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-28 08:19:50,275 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 87 states and 141 transitions. [2022-04-28 08:19:50,376 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-28 08:19:50,376 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 141 transitions. [2022-04-28 08:19:50,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-28 08:19:50,376 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:19:50,376 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:19:50,377 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-28 08:19:50,377 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:19:50,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:19:50,377 INFO L85 PathProgramCache]: Analyzing trace with hash 1561642706, now seen corresponding path program 1 times [2022-04-28 08:19:50,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:19:50,377 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1712321192] [2022-04-28 08:19:50,378 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:19:50,378 INFO L85 PathProgramCache]: Analyzing trace with hash 1561642706, now seen corresponding path program 2 times [2022-04-28 08:19:50,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:19:50,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115234146] [2022-04-28 08:19:50,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:19:50,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:19:50,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:19:50,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:19:50,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:19:50,437 INFO L290 TraceCheckUtils]: 0: Hoare triple {1696#(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); {1690#true} is VALID [2022-04-28 08:19:50,438 INFO L290 TraceCheckUtils]: 1: Hoare triple {1690#true} assume true; {1690#true} is VALID [2022-04-28 08:19:50,438 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1690#true} {1690#true} #132#return; {1690#true} is VALID [2022-04-28 08:19:50,438 INFO L272 TraceCheckUtils]: 0: Hoare triple {1690#true} call ULTIMATE.init(); {1696#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:19:50,438 INFO L290 TraceCheckUtils]: 1: Hoare triple {1696#(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); {1690#true} is VALID [2022-04-28 08:19:50,439 INFO L290 TraceCheckUtils]: 2: Hoare triple {1690#true} assume true; {1690#true} is VALID [2022-04-28 08:19:50,439 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1690#true} {1690#true} #132#return; {1690#true} is VALID [2022-04-28 08:19:50,439 INFO L272 TraceCheckUtils]: 4: Hoare triple {1690#true} call #t~ret11 := main(); {1690#true} is VALID [2022-04-28 08:19:50,439 INFO L290 TraceCheckUtils]: 5: Hoare triple {1690#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;havoc ~cond~0; {1690#true} is VALID [2022-04-28 08:19:50,439 INFO L290 TraceCheckUtils]: 6: Hoare triple {1690#true} assume !false;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~cond~0 := #t~nondet10;havoc #t~nondet10; {1690#true} is VALID [2022-04-28 08:19:50,439 INFO L290 TraceCheckUtils]: 7: Hoare triple {1690#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0; {1690#true} is VALID [2022-04-28 08:19:50,439 INFO L290 TraceCheckUtils]: 8: Hoare triple {1690#true} assume !(0 != ~p1~0); {1690#true} is VALID [2022-04-28 08:19:50,440 INFO L290 TraceCheckUtils]: 9: Hoare triple {1690#true} assume 0 != ~p2~0;~lk2~0 := 1; {1695#(= main_~lk2~0 1)} is VALID [2022-04-28 08:19:50,440 INFO L290 TraceCheckUtils]: 10: Hoare triple {1695#(= main_~lk2~0 1)} assume 0 != ~p3~0;~lk3~0 := 1; {1695#(= main_~lk2~0 1)} is VALID [2022-04-28 08:19:50,440 INFO L290 TraceCheckUtils]: 11: Hoare triple {1695#(= main_~lk2~0 1)} assume 0 != ~p4~0;~lk4~0 := 1; {1695#(= main_~lk2~0 1)} is VALID [2022-04-28 08:19:50,441 INFO L290 TraceCheckUtils]: 12: Hoare triple {1695#(= main_~lk2~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {1695#(= main_~lk2~0 1)} is VALID [2022-04-28 08:19:50,441 INFO L290 TraceCheckUtils]: 13: Hoare triple {1695#(= main_~lk2~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {1695#(= main_~lk2~0 1)} is VALID [2022-04-28 08:19:50,441 INFO L290 TraceCheckUtils]: 14: Hoare triple {1695#(= main_~lk2~0 1)} assume !(0 != ~p1~0); {1695#(= main_~lk2~0 1)} is VALID [2022-04-28 08:19:50,442 INFO L290 TraceCheckUtils]: 15: Hoare triple {1695#(= main_~lk2~0 1)} assume 0 != ~p2~0; {1695#(= main_~lk2~0 1)} is VALID [2022-04-28 08:19:50,442 INFO L290 TraceCheckUtils]: 16: Hoare triple {1695#(= main_~lk2~0 1)} assume 1 != ~lk2~0; {1691#false} is VALID [2022-04-28 08:19:50,442 INFO L290 TraceCheckUtils]: 17: Hoare triple {1691#false} assume !false; {1691#false} is VALID [2022-04-28 08:19:50,442 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-28 08:19:50,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:19:50,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115234146] [2022-04-28 08:19:50,443 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115234146] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:19:50,443 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:19:50,443 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:19:50,443 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:19:50,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1712321192] [2022-04-28 08:19:50,443 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1712321192] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:19:50,443 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:19:50,443 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:19:50,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839434672] [2022-04-28 08:19:50,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:19:50,444 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 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 18 [2022-04-28 08:19:50,444 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:19:50,444 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 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-28 08:19:50,454 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:19:50,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:19:50,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:19:50,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:19:50,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:19:50,455 INFO L87 Difference]: Start difference. First operand 87 states and 141 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 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-28 08:19:50,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:19:50,563 INFO L93 Difference]: Finished difference Result 111 states and 179 transitions. [2022-04-28 08:19:50,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:19:50,566 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 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 18 [2022-04-28 08:19:50,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:19:50,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 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-28 08:19:50,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 76 transitions. [2022-04-28 08:19:50,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 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-28 08:19:50,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 76 transitions. [2022-04-28 08:19:50,572 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 76 transitions. [2022-04-28 08:19:50,637 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:19:50,639 INFO L225 Difference]: With dead ends: 111 [2022-04-28 08:19:50,639 INFO L226 Difference]: Without dead ends: 109 [2022-04-28 08:19:50,640 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:19:50,641 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 62 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 08:19:50,641 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 80 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 08:19:50,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-04-28 08:19:50,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 87. [2022-04-28 08:19:50,656 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:19:50,657 INFO L82 GeneralOperation]: Start isEquivalent. First operand 109 states. Second operand has 87 states, 83 states have (on average 1.6385542168674698) internal successors, (136), 83 states have internal predecessors, (136), 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-28 08:19:50,657 INFO L74 IsIncluded]: Start isIncluded. First operand 109 states. Second operand has 87 states, 83 states have (on average 1.6385542168674698) internal successors, (136), 83 states have internal predecessors, (136), 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-28 08:19:50,657 INFO L87 Difference]: Start difference. First operand 109 states. Second operand has 87 states, 83 states have (on average 1.6385542168674698) internal successors, (136), 83 states have internal predecessors, (136), 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-28 08:19:50,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:19:50,660 INFO L93 Difference]: Finished difference Result 109 states and 176 transitions. [2022-04-28 08:19:50,660 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 176 transitions. [2022-04-28 08:19:50,660 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:19:50,660 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:19:50,661 INFO L74 IsIncluded]: Start isIncluded. First operand has 87 states, 83 states have (on average 1.6385542168674698) internal successors, (136), 83 states have internal predecessors, (136), 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 109 states. [2022-04-28 08:19:50,661 INFO L87 Difference]: Start difference. First operand has 87 states, 83 states have (on average 1.6385542168674698) internal successors, (136), 83 states have internal predecessors, (136), 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 109 states. [2022-04-28 08:19:50,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:19:50,664 INFO L93 Difference]: Finished difference Result 109 states and 176 transitions. [2022-04-28 08:19:50,664 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 176 transitions. [2022-04-28 08:19:50,664 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:19:50,664 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:19:50,664 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:19:50,664 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:19:50,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 83 states have (on average 1.6385542168674698) internal successors, (136), 83 states have internal predecessors, (136), 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-28 08:19:50,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 139 transitions. [2022-04-28 08:19:50,667 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 139 transitions. Word has length 18 [2022-04-28 08:19:50,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:19:50,667 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 139 transitions. [2022-04-28 08:19:50,667 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 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-28 08:19:50,667 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 87 states and 139 transitions. [2022-04-28 08:19:50,784 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-28 08:19:50,784 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 139 transitions. [2022-04-28 08:19:50,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-28 08:19:50,785 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:19:50,785 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:19:50,785 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-28 08:19:50,785 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:19:50,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:19:50,785 INFO L85 PathProgramCache]: Analyzing trace with hash 773471640, now seen corresponding path program 1 times [2022-04-28 08:19:50,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:19:50,785 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [413507286] [2022-04-28 08:19:50,786 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:19:50,786 INFO L85 PathProgramCache]: Analyzing trace with hash 773471640, now seen corresponding path program 2 times [2022-04-28 08:19:50,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:19:50,786 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803367003] [2022-04-28 08:19:50,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:19:50,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:19:50,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:19:50,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:19:50,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:19:50,843 INFO L290 TraceCheckUtils]: 0: Hoare triple {2322#(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); {2316#true} is VALID [2022-04-28 08:19:50,843 INFO L290 TraceCheckUtils]: 1: Hoare triple {2316#true} assume true; {2316#true} is VALID [2022-04-28 08:19:50,843 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2316#true} {2316#true} #132#return; {2316#true} is VALID [2022-04-28 08:19:50,847 INFO L272 TraceCheckUtils]: 0: Hoare triple {2316#true} call ULTIMATE.init(); {2322#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:19:50,847 INFO L290 TraceCheckUtils]: 1: Hoare triple {2322#(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); {2316#true} is VALID [2022-04-28 08:19:50,847 INFO L290 TraceCheckUtils]: 2: Hoare triple {2316#true} assume true; {2316#true} is VALID [2022-04-28 08:19:50,847 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2316#true} {2316#true} #132#return; {2316#true} is VALID [2022-04-28 08:19:50,847 INFO L272 TraceCheckUtils]: 4: Hoare triple {2316#true} call #t~ret11 := main(); {2316#true} is VALID [2022-04-28 08:19:50,847 INFO L290 TraceCheckUtils]: 5: Hoare triple {2316#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;havoc ~cond~0; {2316#true} is VALID [2022-04-28 08:19:50,847 INFO L290 TraceCheckUtils]: 6: Hoare triple {2316#true} assume !false;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~cond~0 := #t~nondet10;havoc #t~nondet10; {2316#true} is VALID [2022-04-28 08:19:50,847 INFO L290 TraceCheckUtils]: 7: Hoare triple {2316#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0; {2316#true} is VALID [2022-04-28 08:19:50,848 INFO L290 TraceCheckUtils]: 8: Hoare triple {2316#true} assume !(0 != ~p1~0); {2316#true} is VALID [2022-04-28 08:19:50,848 INFO L290 TraceCheckUtils]: 9: Hoare triple {2316#true} assume !(0 != ~p2~0); {2316#true} is VALID [2022-04-28 08:19:50,848 INFO L290 TraceCheckUtils]: 10: Hoare triple {2316#true} assume 0 != ~p3~0;~lk3~0 := 1; {2321#(= main_~lk3~0 1)} is VALID [2022-04-28 08:19:50,848 INFO L290 TraceCheckUtils]: 11: Hoare triple {2321#(= main_~lk3~0 1)} assume 0 != ~p4~0;~lk4~0 := 1; {2321#(= main_~lk3~0 1)} is VALID [2022-04-28 08:19:50,849 INFO L290 TraceCheckUtils]: 12: Hoare triple {2321#(= main_~lk3~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {2321#(= main_~lk3~0 1)} is VALID [2022-04-28 08:19:50,849 INFO L290 TraceCheckUtils]: 13: Hoare triple {2321#(= main_~lk3~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {2321#(= main_~lk3~0 1)} is VALID [2022-04-28 08:19:50,849 INFO L290 TraceCheckUtils]: 14: Hoare triple {2321#(= main_~lk3~0 1)} assume !(0 != ~p1~0); {2321#(= main_~lk3~0 1)} is VALID [2022-04-28 08:19:50,850 INFO L290 TraceCheckUtils]: 15: Hoare triple {2321#(= main_~lk3~0 1)} assume !(0 != ~p2~0); {2321#(= main_~lk3~0 1)} is VALID [2022-04-28 08:19:50,850 INFO L290 TraceCheckUtils]: 16: Hoare triple {2321#(= main_~lk3~0 1)} assume 0 != ~p3~0; {2321#(= main_~lk3~0 1)} is VALID [2022-04-28 08:19:50,850 INFO L290 TraceCheckUtils]: 17: Hoare triple {2321#(= main_~lk3~0 1)} assume 1 != ~lk3~0; {2317#false} is VALID [2022-04-28 08:19:50,850 INFO L290 TraceCheckUtils]: 18: Hoare triple {2317#false} assume !false; {2317#false} is VALID [2022-04-28 08:19:50,851 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-28 08:19:50,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:19:50,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803367003] [2022-04-28 08:19:50,851 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803367003] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:19:50,851 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:19:50,851 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:19:50,851 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:19:50,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [413507286] [2022-04-28 08:19:50,851 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [413507286] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:19:50,851 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:19:50,851 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:19:50,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189355831] [2022-04-28 08:19:50,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:19:50,852 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-28 08:19:50,852 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:19:50,852 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-28 08:19:50,864 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-28 08:19:50,864 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:19:50,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:19:50,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:19:50,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:19:50,865 INFO L87 Difference]: Start difference. First operand 87 states and 139 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-28 08:19:50,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:19:50,961 INFO L93 Difference]: Finished difference Result 155 states and 251 transitions. [2022-04-28 08:19:50,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:19:50,961 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-28 08:19:50,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:19:50,962 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-28 08:19:50,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 75 transitions. [2022-04-28 08:19:50,963 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-28 08:19:50,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 75 transitions. [2022-04-28 08:19:50,964 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 75 transitions. [2022-04-28 08:19:51,016 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:19:51,019 INFO L225 Difference]: With dead ends: 155 [2022-04-28 08:19:51,019 INFO L226 Difference]: Without dead ends: 153 [2022-04-28 08:19:51,019 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:19:51,021 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 86 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 08:19:51,022 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 52 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 08:19:51,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2022-04-28 08:19:51,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 119. [2022-04-28 08:19:51,036 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:19:51,036 INFO L82 GeneralOperation]: Start isEquivalent. First operand 153 states. Second operand has 119 states, 115 states have (on average 1.617391304347826) internal successors, (186), 115 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-28 08:19:51,036 INFO L74 IsIncluded]: Start isIncluded. First operand 153 states. Second operand has 119 states, 115 states have (on average 1.617391304347826) internal successors, (186), 115 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-28 08:19:51,037 INFO L87 Difference]: Start difference. First operand 153 states. Second operand has 119 states, 115 states have (on average 1.617391304347826) internal successors, (186), 115 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-28 08:19:51,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:19:51,042 INFO L93 Difference]: Finished difference Result 153 states and 246 transitions. [2022-04-28 08:19:51,043 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 246 transitions. [2022-04-28 08:19:51,043 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:19:51,043 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:19:51,043 INFO L74 IsIncluded]: Start isIncluded. First operand has 119 states, 115 states have (on average 1.617391304347826) internal successors, (186), 115 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 153 states. [2022-04-28 08:19:51,044 INFO L87 Difference]: Start difference. First operand has 119 states, 115 states have (on average 1.617391304347826) internal successors, (186), 115 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 153 states. [2022-04-28 08:19:51,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:19:51,047 INFO L93 Difference]: Finished difference Result 153 states and 246 transitions. [2022-04-28 08:19:51,047 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 246 transitions. [2022-04-28 08:19:51,047 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:19:51,047 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:19:51,047 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:19:51,047 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:19:51,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 115 states have (on average 1.617391304347826) internal successors, (186), 115 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-28 08:19:51,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 189 transitions. [2022-04-28 08:19:51,051 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 189 transitions. Word has length 19 [2022-04-28 08:19:51,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:19:51,051 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 189 transitions. [2022-04-28 08:19:51,052 INFO L496 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-28 08:19:51,052 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 119 states and 189 transitions. [2022-04-28 08:19:51,245 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-28 08:19:51,245 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 189 transitions. [2022-04-28 08:19:51,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-28 08:19:51,246 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:19:51,246 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:19:51,246 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-28 08:19:51,246 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:19:51,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:19:51,247 INFO L85 PathProgramCache]: Analyzing trace with hash 1453530010, now seen corresponding path program 1 times [2022-04-28 08:19:51,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:19:51,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [60351463] [2022-04-28 08:19:51,247 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:19:51,247 INFO L85 PathProgramCache]: Analyzing trace with hash 1453530010, now seen corresponding path program 2 times [2022-04-28 08:19:51,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:19:51,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942637936] [2022-04-28 08:19:51,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:19:51,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:19:51,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:19:51,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:19:51,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:19:51,311 INFO L290 TraceCheckUtils]: 0: Hoare triple {3188#(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); {3182#true} is VALID [2022-04-28 08:19:51,311 INFO L290 TraceCheckUtils]: 1: Hoare triple {3182#true} assume true; {3182#true} is VALID [2022-04-28 08:19:51,311 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3182#true} {3182#true} #132#return; {3182#true} is VALID [2022-04-28 08:19:51,314 INFO L272 TraceCheckUtils]: 0: Hoare triple {3182#true} call ULTIMATE.init(); {3188#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:19:51,314 INFO L290 TraceCheckUtils]: 1: Hoare triple {3188#(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); {3182#true} is VALID [2022-04-28 08:19:51,314 INFO L290 TraceCheckUtils]: 2: Hoare triple {3182#true} assume true; {3182#true} is VALID [2022-04-28 08:19:51,314 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3182#true} {3182#true} #132#return; {3182#true} is VALID [2022-04-28 08:19:51,314 INFO L272 TraceCheckUtils]: 4: Hoare triple {3182#true} call #t~ret11 := main(); {3182#true} is VALID [2022-04-28 08:19:51,314 INFO L290 TraceCheckUtils]: 5: Hoare triple {3182#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;havoc ~cond~0; {3182#true} is VALID [2022-04-28 08:19:51,314 INFO L290 TraceCheckUtils]: 6: Hoare triple {3182#true} assume !false;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~cond~0 := #t~nondet10;havoc #t~nondet10; {3182#true} is VALID [2022-04-28 08:19:51,314 INFO L290 TraceCheckUtils]: 7: Hoare triple {3182#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0; {3182#true} is VALID [2022-04-28 08:19:51,314 INFO L290 TraceCheckUtils]: 8: Hoare triple {3182#true} assume !(0 != ~p1~0); {3182#true} is VALID [2022-04-28 08:19:51,315 INFO L290 TraceCheckUtils]: 9: Hoare triple {3182#true} assume !(0 != ~p2~0); {3182#true} is VALID [2022-04-28 08:19:51,315 INFO L290 TraceCheckUtils]: 10: Hoare triple {3182#true} assume !(0 != ~p3~0); {3187#(= main_~p3~0 0)} is VALID [2022-04-28 08:19:51,315 INFO L290 TraceCheckUtils]: 11: Hoare triple {3187#(= main_~p3~0 0)} assume 0 != ~p4~0;~lk4~0 := 1; {3187#(= main_~p3~0 0)} is VALID [2022-04-28 08:19:51,315 INFO L290 TraceCheckUtils]: 12: Hoare triple {3187#(= main_~p3~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {3187#(= main_~p3~0 0)} is VALID [2022-04-28 08:19:51,316 INFO L290 TraceCheckUtils]: 13: Hoare triple {3187#(= main_~p3~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {3187#(= main_~p3~0 0)} is VALID [2022-04-28 08:19:51,316 INFO L290 TraceCheckUtils]: 14: Hoare triple {3187#(= main_~p3~0 0)} assume !(0 != ~p1~0); {3187#(= main_~p3~0 0)} is VALID [2022-04-28 08:19:51,316 INFO L290 TraceCheckUtils]: 15: Hoare triple {3187#(= main_~p3~0 0)} assume !(0 != ~p2~0); {3187#(= main_~p3~0 0)} is VALID [2022-04-28 08:19:51,316 INFO L290 TraceCheckUtils]: 16: Hoare triple {3187#(= main_~p3~0 0)} assume 0 != ~p3~0; {3183#false} is VALID [2022-04-28 08:19:51,317 INFO L290 TraceCheckUtils]: 17: Hoare triple {3183#false} assume 1 != ~lk3~0; {3183#false} is VALID [2022-04-28 08:19:51,317 INFO L290 TraceCheckUtils]: 18: Hoare triple {3183#false} assume !false; {3183#false} is VALID [2022-04-28 08:19:51,317 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-28 08:19:51,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:19:51,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942637936] [2022-04-28 08:19:51,317 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942637936] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:19:51,317 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:19:51,317 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:19:51,317 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:19:51,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [60351463] [2022-04-28 08:19:51,317 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [60351463] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:19:51,317 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:19:51,317 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:19:51,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795479808] [2022-04-28 08:19:51,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:19:51,318 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-28 08:19:51,318 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:19:51,318 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-28 08:19:51,327 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-28 08:19:51,328 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:19:51,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:19:51,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:19:51,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:19:51,328 INFO L87 Difference]: Start difference. First operand 119 states and 189 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-28 08:19:51,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:19:51,422 INFO L93 Difference]: Finished difference Result 271 states and 435 transitions. [2022-04-28 08:19:51,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:19:51,422 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-28 08:19:51,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:19:51,422 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-28 08:19:51,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 114 transitions. [2022-04-28 08:19:51,423 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-28 08:19:51,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 114 transitions. [2022-04-28 08:19:51,424 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 114 transitions. [2022-04-28 08:19:51,489 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:19:51,491 INFO L225 Difference]: With dead ends: 271 [2022-04-28 08:19:51,491 INFO L226 Difference]: Without dead ends: 161 [2022-04-28 08:19:51,492 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:19:51,492 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 76 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 08:19:51,493 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 67 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 08:19:51,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2022-04-28 08:19:51,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 159. [2022-04-28 08:19:51,501 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:19:51,501 INFO L82 GeneralOperation]: Start isEquivalent. First operand 161 states. Second operand has 159 states, 155 states have (on average 1.5741935483870968) internal successors, (244), 155 states have internal predecessors, (244), 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-28 08:19:51,501 INFO L74 IsIncluded]: Start isIncluded. First operand 161 states. Second operand has 159 states, 155 states have (on average 1.5741935483870968) internal successors, (244), 155 states have internal predecessors, (244), 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-28 08:19:51,502 INFO L87 Difference]: Start difference. First operand 161 states. Second operand has 159 states, 155 states have (on average 1.5741935483870968) internal successors, (244), 155 states have internal predecessors, (244), 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-28 08:19:51,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:19:51,505 INFO L93 Difference]: Finished difference Result 161 states and 248 transitions. [2022-04-28 08:19:51,505 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 248 transitions. [2022-04-28 08:19:51,505 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:19:51,505 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:19:51,506 INFO L74 IsIncluded]: Start isIncluded. First operand has 159 states, 155 states have (on average 1.5741935483870968) internal successors, (244), 155 states have internal predecessors, (244), 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 161 states. [2022-04-28 08:19:51,506 INFO L87 Difference]: Start difference. First operand has 159 states, 155 states have (on average 1.5741935483870968) internal successors, (244), 155 states have internal predecessors, (244), 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 161 states. [2022-04-28 08:19:51,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:19:51,509 INFO L93 Difference]: Finished difference Result 161 states and 248 transitions. [2022-04-28 08:19:51,509 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 248 transitions. [2022-04-28 08:19:51,509 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:19:51,509 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:19:51,509 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:19:51,509 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:19:51,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 155 states have (on average 1.5741935483870968) internal successors, (244), 155 states have internal predecessors, (244), 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-28 08:19:51,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 247 transitions. [2022-04-28 08:19:51,513 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 247 transitions. Word has length 19 [2022-04-28 08:19:51,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:19:51,513 INFO L495 AbstractCegarLoop]: Abstraction has 159 states and 247 transitions. [2022-04-28 08:19:51,513 INFO L496 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-28 08:19:51,513 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 159 states and 247 transitions. [2022-04-28 08:19:51,719 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 247 edges. 247 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:19:51,719 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 247 transitions. [2022-04-28 08:19:51,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-28 08:19:51,720 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:19:51,720 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:19:51,720 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-28 08:19:51,720 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:19:51,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:19:51,720 INFO L85 PathProgramCache]: Analyzing trace with hash -1791967575, now seen corresponding path program 1 times [2022-04-28 08:19:51,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:19:51,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [421406178] [2022-04-28 08:19:51,721 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:19:51,721 INFO L85 PathProgramCache]: Analyzing trace with hash -1791967575, now seen corresponding path program 2 times [2022-04-28 08:19:51,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:19:51,721 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850745578] [2022-04-28 08:19:51,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:19:51,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:19:51,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:19:51,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:19:51,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:19:51,750 INFO L290 TraceCheckUtils]: 0: Hoare triple {4382#(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); {4376#true} is VALID [2022-04-28 08:19:51,750 INFO L290 TraceCheckUtils]: 1: Hoare triple {4376#true} assume true; {4376#true} is VALID [2022-04-28 08:19:51,750 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4376#true} {4376#true} #132#return; {4376#true} is VALID [2022-04-28 08:19:51,751 INFO L272 TraceCheckUtils]: 0: Hoare triple {4376#true} call ULTIMATE.init(); {4382#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:19:51,751 INFO L290 TraceCheckUtils]: 1: Hoare triple {4382#(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); {4376#true} is VALID [2022-04-28 08:19:51,751 INFO L290 TraceCheckUtils]: 2: Hoare triple {4376#true} assume true; {4376#true} is VALID [2022-04-28 08:19:51,751 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4376#true} {4376#true} #132#return; {4376#true} is VALID [2022-04-28 08:19:51,751 INFO L272 TraceCheckUtils]: 4: Hoare triple {4376#true} call #t~ret11 := main(); {4376#true} is VALID [2022-04-28 08:19:51,751 INFO L290 TraceCheckUtils]: 5: Hoare triple {4376#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;havoc ~cond~0; {4376#true} is VALID [2022-04-28 08:19:51,751 INFO L290 TraceCheckUtils]: 6: Hoare triple {4376#true} assume !false;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~cond~0 := #t~nondet10;havoc #t~nondet10; {4376#true} is VALID [2022-04-28 08:19:51,751 INFO L290 TraceCheckUtils]: 7: Hoare triple {4376#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0; {4376#true} is VALID [2022-04-28 08:19:51,751 INFO L290 TraceCheckUtils]: 8: Hoare triple {4376#true} assume !(0 != ~p1~0); {4376#true} is VALID [2022-04-28 08:19:51,752 INFO L290 TraceCheckUtils]: 9: Hoare triple {4376#true} assume !(0 != ~p2~0); {4376#true} is VALID [2022-04-28 08:19:51,755 INFO L290 TraceCheckUtils]: 10: Hoare triple {4376#true} assume 0 != ~p3~0;~lk3~0 := 1; {4381#(not (= main_~p3~0 0))} is VALID [2022-04-28 08:19:51,755 INFO L290 TraceCheckUtils]: 11: Hoare triple {4381#(not (= main_~p3~0 0))} assume 0 != ~p4~0;~lk4~0 := 1; {4381#(not (= main_~p3~0 0))} is VALID [2022-04-28 08:19:51,756 INFO L290 TraceCheckUtils]: 12: Hoare triple {4381#(not (= main_~p3~0 0))} assume 0 != ~p5~0;~lk5~0 := 1; {4381#(not (= main_~p3~0 0))} is VALID [2022-04-28 08:19:51,756 INFO L290 TraceCheckUtils]: 13: Hoare triple {4381#(not (= main_~p3~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {4381#(not (= main_~p3~0 0))} is VALID [2022-04-28 08:19:51,756 INFO L290 TraceCheckUtils]: 14: Hoare triple {4381#(not (= main_~p3~0 0))} assume !(0 != ~p1~0); {4381#(not (= main_~p3~0 0))} is VALID [2022-04-28 08:19:51,756 INFO L290 TraceCheckUtils]: 15: Hoare triple {4381#(not (= main_~p3~0 0))} assume !(0 != ~p2~0); {4381#(not (= main_~p3~0 0))} is VALID [2022-04-28 08:19:51,757 INFO L290 TraceCheckUtils]: 16: Hoare triple {4381#(not (= main_~p3~0 0))} assume !(0 != ~p3~0); {4377#false} is VALID [2022-04-28 08:19:51,757 INFO L290 TraceCheckUtils]: 17: Hoare triple {4377#false} assume 0 != ~p4~0; {4377#false} is VALID [2022-04-28 08:19:51,757 INFO L290 TraceCheckUtils]: 18: Hoare triple {4377#false} assume 1 != ~lk4~0; {4377#false} is VALID [2022-04-28 08:19:51,757 INFO L290 TraceCheckUtils]: 19: Hoare triple {4377#false} assume !false; {4377#false} is VALID [2022-04-28 08:19:51,757 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-28 08:19:51,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:19:51,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850745578] [2022-04-28 08:19:51,757 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850745578] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:19:51,758 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:19:51,758 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:19:51,758 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:19:51,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [421406178] [2022-04-28 08:19:51,758 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [421406178] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:19:51,758 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:19:51,758 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:19:51,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861462675] [2022-04-28 08:19:51,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:19:51,758 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-28 08:19:51,759 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:19:51,759 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-28 08:19:51,769 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-28 08:19:51,769 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:19:51,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:19:51,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:19:51,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:19:51,770 INFO L87 Difference]: Start difference. First operand 159 states and 247 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-28 08:19:51,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:19:51,855 INFO L93 Difference]: Finished difference Result 241 states and 373 transitions. [2022-04-28 08:19:51,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:19:51,855 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-28 08:19:51,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:19:51,856 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-28 08:19:51,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 109 transitions. [2022-04-28 08:19:51,858 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-28 08:19:51,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 109 transitions. [2022-04-28 08:19:51,859 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 109 transitions. [2022-04-28 08:19:51,920 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 109 edges. 109 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:19:51,922 INFO L225 Difference]: With dead ends: 241 [2022-04-28 08:19:51,922 INFO L226 Difference]: Without dead ends: 167 [2022-04-28 08:19:51,922 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:19:51,923 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 77 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 08:19:51,923 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 67 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 08:19:51,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2022-04-28 08:19:51,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 165. [2022-04-28 08:19:51,932 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:19:51,932 INFO L82 GeneralOperation]: Start isEquivalent. First operand 167 states. Second operand has 165 states, 161 states have (on average 1.5403726708074534) internal successors, (248), 161 states have internal predecessors, (248), 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-28 08:19:51,932 INFO L74 IsIncluded]: Start isIncluded. First operand 167 states. Second operand has 165 states, 161 states have (on average 1.5403726708074534) internal successors, (248), 161 states have internal predecessors, (248), 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-28 08:19:51,933 INFO L87 Difference]: Start difference. First operand 167 states. Second operand has 165 states, 161 states have (on average 1.5403726708074534) internal successors, (248), 161 states have internal predecessors, (248), 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-28 08:19:51,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:19:51,945 INFO L93 Difference]: Finished difference Result 167 states and 252 transitions. [2022-04-28 08:19:51,945 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 252 transitions. [2022-04-28 08:19:51,945 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:19:51,945 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:19:51,946 INFO L74 IsIncluded]: Start isIncluded. First operand has 165 states, 161 states have (on average 1.5403726708074534) internal successors, (248), 161 states have internal predecessors, (248), 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 167 states. [2022-04-28 08:19:51,946 INFO L87 Difference]: Start difference. First operand has 165 states, 161 states have (on average 1.5403726708074534) internal successors, (248), 161 states have internal predecessors, (248), 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 167 states. [2022-04-28 08:19:51,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:19:51,949 INFO L93 Difference]: Finished difference Result 167 states and 252 transitions. [2022-04-28 08:19:51,949 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 252 transitions. [2022-04-28 08:19:51,949 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:19:51,949 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:19:51,949 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:19:51,949 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:19:51,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 161 states have (on average 1.5403726708074534) internal successors, (248), 161 states have internal predecessors, (248), 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-28 08:19:51,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 251 transitions. [2022-04-28 08:19:51,953 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 251 transitions. Word has length 20 [2022-04-28 08:19:51,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:19:51,953 INFO L495 AbstractCegarLoop]: Abstraction has 165 states and 251 transitions. [2022-04-28 08:19:51,954 INFO L496 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-28 08:19:51,954 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 165 states and 251 transitions. [2022-04-28 08:19:52,166 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 251 edges. 251 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:19:52,166 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 251 transitions. [2022-04-28 08:19:52,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-28 08:19:52,167 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:19:52,167 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:19:52,167 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-28 08:19:52,167 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:19:52,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:19:52,167 INFO L85 PathProgramCache]: Analyzing trace with hash 2109972711, now seen corresponding path program 1 times [2022-04-28 08:19:52,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:19:52,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1554761539] [2022-04-28 08:19:52,168 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:19:52,168 INFO L85 PathProgramCache]: Analyzing trace with hash 2109972711, now seen corresponding path program 2 times [2022-04-28 08:19:52,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:19:52,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929843373] [2022-04-28 08:19:52,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:19:52,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:19:52,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:19:52,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:19:52,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:19:52,207 INFO L290 TraceCheckUtils]: 0: Hoare triple {5540#(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); {5534#true} is VALID [2022-04-28 08:19:52,207 INFO L290 TraceCheckUtils]: 1: Hoare triple {5534#true} assume true; {5534#true} is VALID [2022-04-28 08:19:52,207 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5534#true} {5534#true} #132#return; {5534#true} is VALID [2022-04-28 08:19:52,208 INFO L272 TraceCheckUtils]: 0: Hoare triple {5534#true} call ULTIMATE.init(); {5540#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:19:52,208 INFO L290 TraceCheckUtils]: 1: Hoare triple {5540#(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); {5534#true} is VALID [2022-04-28 08:19:52,208 INFO L290 TraceCheckUtils]: 2: Hoare triple {5534#true} assume true; {5534#true} is VALID [2022-04-28 08:19:52,208 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5534#true} {5534#true} #132#return; {5534#true} is VALID [2022-04-28 08:19:52,208 INFO L272 TraceCheckUtils]: 4: Hoare triple {5534#true} call #t~ret11 := main(); {5534#true} is VALID [2022-04-28 08:19:52,209 INFO L290 TraceCheckUtils]: 5: Hoare triple {5534#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;havoc ~cond~0; {5534#true} is VALID [2022-04-28 08:19:52,209 INFO L290 TraceCheckUtils]: 6: Hoare triple {5534#true} assume !false;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~cond~0 := #t~nondet10;havoc #t~nondet10; {5534#true} is VALID [2022-04-28 08:19:52,209 INFO L290 TraceCheckUtils]: 7: Hoare triple {5534#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0; {5534#true} is VALID [2022-04-28 08:19:52,210 INFO L290 TraceCheckUtils]: 8: Hoare triple {5534#true} assume !(0 != ~p1~0); {5534#true} is VALID [2022-04-28 08:19:52,211 INFO L290 TraceCheckUtils]: 9: Hoare triple {5534#true} assume !(0 != ~p2~0); {5534#true} is VALID [2022-04-28 08:19:52,211 INFO L290 TraceCheckUtils]: 10: Hoare triple {5534#true} assume !(0 != ~p3~0); {5534#true} is VALID [2022-04-28 08:19:52,213 INFO L290 TraceCheckUtils]: 11: Hoare triple {5534#true} assume 0 != ~p4~0;~lk4~0 := 1; {5539#(= main_~lk4~0 1)} is VALID [2022-04-28 08:19:52,213 INFO L290 TraceCheckUtils]: 12: Hoare triple {5539#(= main_~lk4~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {5539#(= main_~lk4~0 1)} is VALID [2022-04-28 08:19:52,213 INFO L290 TraceCheckUtils]: 13: Hoare triple {5539#(= main_~lk4~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {5539#(= main_~lk4~0 1)} is VALID [2022-04-28 08:19:52,213 INFO L290 TraceCheckUtils]: 14: Hoare triple {5539#(= main_~lk4~0 1)} assume !(0 != ~p1~0); {5539#(= main_~lk4~0 1)} is VALID [2022-04-28 08:19:52,214 INFO L290 TraceCheckUtils]: 15: Hoare triple {5539#(= main_~lk4~0 1)} assume !(0 != ~p2~0); {5539#(= main_~lk4~0 1)} is VALID [2022-04-28 08:19:52,214 INFO L290 TraceCheckUtils]: 16: Hoare triple {5539#(= main_~lk4~0 1)} assume !(0 != ~p3~0); {5539#(= main_~lk4~0 1)} is VALID [2022-04-28 08:19:52,215 INFO L290 TraceCheckUtils]: 17: Hoare triple {5539#(= main_~lk4~0 1)} assume 0 != ~p4~0; {5539#(= main_~lk4~0 1)} is VALID [2022-04-28 08:19:52,215 INFO L290 TraceCheckUtils]: 18: Hoare triple {5539#(= main_~lk4~0 1)} assume 1 != ~lk4~0; {5535#false} is VALID [2022-04-28 08:19:52,215 INFO L290 TraceCheckUtils]: 19: Hoare triple {5535#false} assume !false; {5535#false} is VALID [2022-04-28 08:19:52,215 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-28 08:19:52,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:19:52,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929843373] [2022-04-28 08:19:52,215 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929843373] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:19:52,215 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:19:52,215 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:19:52,216 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:19:52,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1554761539] [2022-04-28 08:19:52,216 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1554761539] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:19:52,216 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:19:52,216 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:19:52,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561185991] [2022-04-28 08:19:52,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:19:52,216 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-28 08:19:52,216 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:19:52,216 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-28 08:19:52,226 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-28 08:19:52,226 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:19:52,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:19:52,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:19:52,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:19:52,226 INFO L87 Difference]: Start difference. First operand 165 states and 251 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-28 08:19:52,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:19:52,321 INFO L93 Difference]: Finished difference Result 285 states and 437 transitions. [2022-04-28 08:19:52,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:19:52,322 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-28 08:19:52,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:19:52,322 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-28 08:19:52,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 71 transitions. [2022-04-28 08:19:52,323 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-28 08:19:52,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 71 transitions. [2022-04-28 08:19:52,324 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 71 transitions. [2022-04-28 08:19:52,365 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:19:52,370 INFO L225 Difference]: With dead ends: 285 [2022-04-28 08:19:52,371 INFO L226 Difference]: Without dead ends: 283 [2022-04-28 08:19:52,371 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:19:52,373 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 79 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 08:19:52,373 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 51 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 08:19:52,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2022-04-28 08:19:52,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 233. [2022-04-28 08:19:52,385 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:19:52,387 INFO L82 GeneralOperation]: Start isEquivalent. First operand 283 states. Second operand has 233 states, 229 states have (on average 1.502183406113537) internal successors, (344), 229 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-28 08:19:52,387 INFO L74 IsIncluded]: Start isIncluded. First operand 283 states. Second operand has 233 states, 229 states have (on average 1.502183406113537) internal successors, (344), 229 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-28 08:19:52,387 INFO L87 Difference]: Start difference. First operand 283 states. Second operand has 233 states, 229 states have (on average 1.502183406113537) internal successors, (344), 229 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-28 08:19:52,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:19:52,392 INFO L93 Difference]: Finished difference Result 283 states and 428 transitions. [2022-04-28 08:19:52,392 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 428 transitions. [2022-04-28 08:19:52,392 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:19:52,392 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:19:52,393 INFO L74 IsIncluded]: Start isIncluded. First operand has 233 states, 229 states have (on average 1.502183406113537) internal successors, (344), 229 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 283 states. [2022-04-28 08:19:52,393 INFO L87 Difference]: Start difference. First operand has 233 states, 229 states have (on average 1.502183406113537) internal successors, (344), 229 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 283 states. [2022-04-28 08:19:52,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:19:52,397 INFO L93 Difference]: Finished difference Result 283 states and 428 transitions. [2022-04-28 08:19:52,397 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 428 transitions. [2022-04-28 08:19:52,398 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:19:52,398 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:19:52,398 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:19:52,398 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:19:52,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 229 states have (on average 1.502183406113537) internal successors, (344), 229 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-28 08:19:52,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 347 transitions. [2022-04-28 08:19:52,402 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 347 transitions. Word has length 20 [2022-04-28 08:19:52,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:19:52,402 INFO L495 AbstractCegarLoop]: Abstraction has 233 states and 347 transitions. [2022-04-28 08:19:52,402 INFO L496 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-28 08:19:52,402 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 233 states and 347 transitions. [2022-04-28 08:19:52,724 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-28 08:19:52,725 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 347 transitions. [2022-04-28 08:19:52,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-28 08:19:52,725 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:19:52,725 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:19:52,725 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-28 08:19:52,726 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:19:52,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:19:52,726 INFO L85 PathProgramCache]: Analyzing trace with hash -1504936215, now seen corresponding path program 1 times [2022-04-28 08:19:52,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:19:52,726 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1266254336] [2022-04-28 08:19:52,726 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:19:52,727 INFO L85 PathProgramCache]: Analyzing trace with hash -1504936215, now seen corresponding path program 2 times [2022-04-28 08:19:52,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:19:52,727 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132158826] [2022-04-28 08:19:52,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:19:52,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:19:52,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:19:52,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:19:52,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:19:52,758 INFO L290 TraceCheckUtils]: 0: Hoare triple {7154#(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); {7148#true} is VALID [2022-04-28 08:19:52,758 INFO L290 TraceCheckUtils]: 1: Hoare triple {7148#true} assume true; {7148#true} is VALID [2022-04-28 08:19:52,758 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7148#true} {7148#true} #132#return; {7148#true} is VALID [2022-04-28 08:19:52,759 INFO L272 TraceCheckUtils]: 0: Hoare triple {7148#true} call ULTIMATE.init(); {7154#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:19:52,759 INFO L290 TraceCheckUtils]: 1: Hoare triple {7154#(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); {7148#true} is VALID [2022-04-28 08:19:52,759 INFO L290 TraceCheckUtils]: 2: Hoare triple {7148#true} assume true; {7148#true} is VALID [2022-04-28 08:19:52,759 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7148#true} {7148#true} #132#return; {7148#true} is VALID [2022-04-28 08:19:52,759 INFO L272 TraceCheckUtils]: 4: Hoare triple {7148#true} call #t~ret11 := main(); {7148#true} is VALID [2022-04-28 08:19:52,759 INFO L290 TraceCheckUtils]: 5: Hoare triple {7148#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;havoc ~cond~0; {7148#true} is VALID [2022-04-28 08:19:52,759 INFO L290 TraceCheckUtils]: 6: Hoare triple {7148#true} assume !false;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~cond~0 := #t~nondet10;havoc #t~nondet10; {7148#true} is VALID [2022-04-28 08:19:52,760 INFO L290 TraceCheckUtils]: 7: Hoare triple {7148#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0; {7148#true} is VALID [2022-04-28 08:19:52,760 INFO L290 TraceCheckUtils]: 8: Hoare triple {7148#true} assume !(0 != ~p1~0); {7148#true} is VALID [2022-04-28 08:19:52,760 INFO L290 TraceCheckUtils]: 9: Hoare triple {7148#true} assume !(0 != ~p2~0); {7148#true} is VALID [2022-04-28 08:19:52,760 INFO L290 TraceCheckUtils]: 10: Hoare triple {7148#true} assume !(0 != ~p3~0); {7148#true} is VALID [2022-04-28 08:19:52,760 INFO L290 TraceCheckUtils]: 11: Hoare triple {7148#true} assume !(0 != ~p4~0); {7153#(= main_~p4~0 0)} is VALID [2022-04-28 08:19:52,761 INFO L290 TraceCheckUtils]: 12: Hoare triple {7153#(= main_~p4~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {7153#(= main_~p4~0 0)} is VALID [2022-04-28 08:19:52,761 INFO L290 TraceCheckUtils]: 13: Hoare triple {7153#(= main_~p4~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {7153#(= main_~p4~0 0)} is VALID [2022-04-28 08:19:52,761 INFO L290 TraceCheckUtils]: 14: Hoare triple {7153#(= main_~p4~0 0)} assume !(0 != ~p1~0); {7153#(= main_~p4~0 0)} is VALID [2022-04-28 08:19:52,762 INFO L290 TraceCheckUtils]: 15: Hoare triple {7153#(= main_~p4~0 0)} assume !(0 != ~p2~0); {7153#(= main_~p4~0 0)} is VALID [2022-04-28 08:19:52,762 INFO L290 TraceCheckUtils]: 16: Hoare triple {7153#(= main_~p4~0 0)} assume !(0 != ~p3~0); {7153#(= main_~p4~0 0)} is VALID [2022-04-28 08:19:52,762 INFO L290 TraceCheckUtils]: 17: Hoare triple {7153#(= main_~p4~0 0)} assume 0 != ~p4~0; {7149#false} is VALID [2022-04-28 08:19:52,762 INFO L290 TraceCheckUtils]: 18: Hoare triple {7149#false} assume 1 != ~lk4~0; {7149#false} is VALID [2022-04-28 08:19:52,763 INFO L290 TraceCheckUtils]: 19: Hoare triple {7149#false} assume !false; {7149#false} is VALID [2022-04-28 08:19:52,763 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-28 08:19:52,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:19:52,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132158826] [2022-04-28 08:19:52,763 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132158826] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:19:52,763 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:19:52,763 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:19:52,764 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:19:52,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1266254336] [2022-04-28 08:19:52,764 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1266254336] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:19:52,764 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:19:52,764 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:19:52,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477756926] [2022-04-28 08:19:52,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:19:52,764 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-28 08:19:52,764 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:19:52,764 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-28 08:19:52,775 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-28 08:19:52,775 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:19:52,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:19:52,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:19:52,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:19:52,776 INFO L87 Difference]: Start difference. First operand 233 states and 347 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-28 08:19:52,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:19:52,892 INFO L93 Difference]: Finished difference Result 525 states and 781 transitions. [2022-04-28 08:19:52,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:19:52,892 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-28 08:19:52,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:19:52,893 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-28 08:19:52,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 111 transitions. [2022-04-28 08:19:52,894 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-28 08:19:52,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 111 transitions. [2022-04-28 08:19:52,894 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 111 transitions. [2022-04-28 08:19:52,957 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:19:52,962 INFO L225 Difference]: With dead ends: 525 [2022-04-28 08:19:52,962 INFO L226 Difference]: Without dead ends: 307 [2022-04-28 08:19:52,962 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:19:52,963 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 70 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 08:19:52,963 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 69 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 08:19:52,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2022-04-28 08:19:52,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 305. [2022-04-28 08:19:52,977 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:19:52,978 INFO L82 GeneralOperation]: Start isEquivalent. First operand 307 states. Second operand has 305 states, 301 states have (on average 1.4485049833887043) internal successors, (436), 301 states have internal predecessors, (436), 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-28 08:19:52,978 INFO L74 IsIncluded]: Start isIncluded. First operand 307 states. Second operand has 305 states, 301 states have (on average 1.4485049833887043) internal successors, (436), 301 states have internal predecessors, (436), 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-28 08:19:52,978 INFO L87 Difference]: Start difference. First operand 307 states. Second operand has 305 states, 301 states have (on average 1.4485049833887043) internal successors, (436), 301 states have internal predecessors, (436), 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-28 08:19:52,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:19:52,983 INFO L93 Difference]: Finished difference Result 307 states and 440 transitions. [2022-04-28 08:19:52,983 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 440 transitions. [2022-04-28 08:19:52,984 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:19:52,984 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:19:52,984 INFO L74 IsIncluded]: Start isIncluded. First operand has 305 states, 301 states have (on average 1.4485049833887043) internal successors, (436), 301 states have internal predecessors, (436), 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 307 states. [2022-04-28 08:19:52,985 INFO L87 Difference]: Start difference. First operand has 305 states, 301 states have (on average 1.4485049833887043) internal successors, (436), 301 states have internal predecessors, (436), 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 307 states. [2022-04-28 08:19:52,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:19:52,989 INFO L93 Difference]: Finished difference Result 307 states and 440 transitions. [2022-04-28 08:19:52,989 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 440 transitions. [2022-04-28 08:19:52,990 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:19:52,990 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:19:52,990 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:19:52,990 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:19:52,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 301 states have (on average 1.4485049833887043) internal successors, (436), 301 states have internal predecessors, (436), 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-28 08:19:52,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 439 transitions. [2022-04-28 08:19:52,996 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 439 transitions. Word has length 20 [2022-04-28 08:19:52,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:19:52,996 INFO L495 AbstractCegarLoop]: Abstraction has 305 states and 439 transitions. [2022-04-28 08:19:52,996 INFO L496 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-28 08:19:52,996 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 305 states and 439 transitions. [2022-04-28 08:19:53,370 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 439 edges. 439 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:19:53,370 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 439 transitions. [2022-04-28 08:19:53,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-28 08:19:53,371 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:19:53,371 INFO L195 NwaCegarLoop]: 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-28 08:19:53,371 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-28 08:19:53,371 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:19:53,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:19:53,371 INFO L85 PathProgramCache]: Analyzing trace with hash 984860303, now seen corresponding path program 1 times [2022-04-28 08:19:53,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:19:53,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [656785392] [2022-04-28 08:19:53,372 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:19:53,372 INFO L85 PathProgramCache]: Analyzing trace with hash 984860303, now seen corresponding path program 2 times [2022-04-28 08:19:53,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:19:53,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852118715] [2022-04-28 08:19:53,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:19:53,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:19:53,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:19:53,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:19:53,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:19:53,415 INFO L290 TraceCheckUtils]: 0: Hoare triple {9440#(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); {9434#true} is VALID [2022-04-28 08:19:53,415 INFO L290 TraceCheckUtils]: 1: Hoare triple {9434#true} assume true; {9434#true} is VALID [2022-04-28 08:19:53,415 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9434#true} {9434#true} #132#return; {9434#true} is VALID [2022-04-28 08:19:53,415 INFO L272 TraceCheckUtils]: 0: Hoare triple {9434#true} call ULTIMATE.init(); {9440#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:19:53,416 INFO L290 TraceCheckUtils]: 1: Hoare triple {9440#(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); {9434#true} is VALID [2022-04-28 08:19:53,416 INFO L290 TraceCheckUtils]: 2: Hoare triple {9434#true} assume true; {9434#true} is VALID [2022-04-28 08:19:53,426 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9434#true} {9434#true} #132#return; {9434#true} is VALID [2022-04-28 08:19:53,427 INFO L272 TraceCheckUtils]: 4: Hoare triple {9434#true} call #t~ret11 := main(); {9434#true} is VALID [2022-04-28 08:19:53,427 INFO L290 TraceCheckUtils]: 5: Hoare triple {9434#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;havoc ~cond~0; {9434#true} is VALID [2022-04-28 08:19:53,427 INFO L290 TraceCheckUtils]: 6: Hoare triple {9434#true} assume !false;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~cond~0 := #t~nondet10;havoc #t~nondet10; {9434#true} is VALID [2022-04-28 08:19:53,427 INFO L290 TraceCheckUtils]: 7: Hoare triple {9434#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0; {9434#true} is VALID [2022-04-28 08:19:53,427 INFO L290 TraceCheckUtils]: 8: Hoare triple {9434#true} assume !(0 != ~p1~0); {9434#true} is VALID [2022-04-28 08:19:53,427 INFO L290 TraceCheckUtils]: 9: Hoare triple {9434#true} assume !(0 != ~p2~0); {9434#true} is VALID [2022-04-28 08:19:53,427 INFO L290 TraceCheckUtils]: 10: Hoare triple {9434#true} assume !(0 != ~p3~0); {9434#true} is VALID [2022-04-28 08:19:53,428 INFO L290 TraceCheckUtils]: 11: Hoare triple {9434#true} assume 0 != ~p4~0;~lk4~0 := 1; {9439#(not (= main_~p4~0 0))} is VALID [2022-04-28 08:19:53,429 INFO L290 TraceCheckUtils]: 12: Hoare triple {9439#(not (= main_~p4~0 0))} assume 0 != ~p5~0;~lk5~0 := 1; {9439#(not (= main_~p4~0 0))} is VALID [2022-04-28 08:19:53,429 INFO L290 TraceCheckUtils]: 13: Hoare triple {9439#(not (= main_~p4~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {9439#(not (= main_~p4~0 0))} is VALID [2022-04-28 08:19:53,430 INFO L290 TraceCheckUtils]: 14: Hoare triple {9439#(not (= main_~p4~0 0))} assume !(0 != ~p1~0); {9439#(not (= main_~p4~0 0))} is VALID [2022-04-28 08:19:53,430 INFO L290 TraceCheckUtils]: 15: Hoare triple {9439#(not (= main_~p4~0 0))} assume !(0 != ~p2~0); {9439#(not (= main_~p4~0 0))} is VALID [2022-04-28 08:19:53,430 INFO L290 TraceCheckUtils]: 16: Hoare triple {9439#(not (= main_~p4~0 0))} assume !(0 != ~p3~0); {9439#(not (= main_~p4~0 0))} is VALID [2022-04-28 08:19:53,430 INFO L290 TraceCheckUtils]: 17: Hoare triple {9439#(not (= main_~p4~0 0))} assume !(0 != ~p4~0); {9435#false} is VALID [2022-04-28 08:19:53,430 INFO L290 TraceCheckUtils]: 18: Hoare triple {9435#false} assume 0 != ~p5~0; {9435#false} is VALID [2022-04-28 08:19:53,431 INFO L290 TraceCheckUtils]: 19: Hoare triple {9435#false} assume 1 != ~lk5~0; {9435#false} is VALID [2022-04-28 08:19:53,431 INFO L290 TraceCheckUtils]: 20: Hoare triple {9435#false} assume !false; {9435#false} is VALID [2022-04-28 08:19:53,431 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-28 08:19:53,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:19:53,431 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852118715] [2022-04-28 08:19:53,431 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852118715] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:19:53,431 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:19:53,431 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:19:53,431 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:19:53,431 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [656785392] [2022-04-28 08:19:53,431 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [656785392] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:19:53,431 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:19:53,431 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:19:53,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964348841] [2022-04-28 08:19:53,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:19:53,432 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-28 08:19:53,432 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:19:53,432 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-28 08:19:53,445 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-28 08:19:53,445 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:19:53,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:19:53,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:19:53,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:19:53,445 INFO L87 Difference]: Start difference. First operand 305 states and 439 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-28 08:19:53,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:19:53,557 INFO L93 Difference]: Finished difference Result 457 states and 653 transitions. [2022-04-28 08:19:53,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:19:53,557 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-28 08:19:53,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:19:53,557 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-28 08:19:53,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 106 transitions. [2022-04-28 08:19:53,558 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-28 08:19:53,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 106 transitions. [2022-04-28 08:19:53,559 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 106 transitions. [2022-04-28 08:19:53,621 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:19:53,627 INFO L225 Difference]: With dead ends: 457 [2022-04-28 08:19:53,627 INFO L226 Difference]: Without dead ends: 315 [2022-04-28 08:19:53,627 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:19:53,628 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 76 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 08:19:53,628 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 64 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 08:19:53,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2022-04-28 08:19:53,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 313. [2022-04-28 08:19:53,643 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:19:53,644 INFO L82 GeneralOperation]: Start isEquivalent. First operand 315 states. Second operand has 313 states, 309 states have (on average 1.4110032362459546) internal successors, (436), 309 states have internal predecessors, (436), 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-28 08:19:53,644 INFO L74 IsIncluded]: Start isIncluded. First operand 315 states. Second operand has 313 states, 309 states have (on average 1.4110032362459546) internal successors, (436), 309 states have internal predecessors, (436), 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-28 08:19:53,645 INFO L87 Difference]: Start difference. First operand 315 states. Second operand has 313 states, 309 states have (on average 1.4110032362459546) internal successors, (436), 309 states have internal predecessors, (436), 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-28 08:19:53,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:19:53,650 INFO L93 Difference]: Finished difference Result 315 states and 440 transitions. [2022-04-28 08:19:53,650 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 440 transitions. [2022-04-28 08:19:53,650 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:19:53,650 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:19:53,651 INFO L74 IsIncluded]: Start isIncluded. First operand has 313 states, 309 states have (on average 1.4110032362459546) internal successors, (436), 309 states have internal predecessors, (436), 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 315 states. [2022-04-28 08:19:53,651 INFO L87 Difference]: Start difference. First operand has 313 states, 309 states have (on average 1.4110032362459546) internal successors, (436), 309 states have internal predecessors, (436), 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 315 states. [2022-04-28 08:19:53,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:19:53,656 INFO L93 Difference]: Finished difference Result 315 states and 440 transitions. [2022-04-28 08:19:53,656 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 440 transitions. [2022-04-28 08:19:53,656 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:19:53,656 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:19:53,656 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:19:53,656 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:19:53,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 309 states have (on average 1.4110032362459546) internal successors, (436), 309 states have internal predecessors, (436), 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-28 08:19:53,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 439 transitions. [2022-04-28 08:19:53,662 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 439 transitions. Word has length 21 [2022-04-28 08:19:53,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:19:53,662 INFO L495 AbstractCegarLoop]: Abstraction has 313 states and 439 transitions. [2022-04-28 08:19:53,663 INFO L496 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-28 08:19:53,663 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 313 states and 439 transitions. [2022-04-28 08:19:54,059 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 439 edges. 439 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:19:54,059 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 439 transitions. [2022-04-28 08:19:54,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-28 08:19:54,060 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:19:54,060 INFO L195 NwaCegarLoop]: 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-28 08:19:54,060 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-28 08:19:54,060 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:19:54,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:19:54,061 INFO L85 PathProgramCache]: Analyzing trace with hash 591833293, now seen corresponding path program 1 times [2022-04-28 08:19:54,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:19:54,061 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [953725719] [2022-04-28 08:19:54,061 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:19:54,061 INFO L85 PathProgramCache]: Analyzing trace with hash 591833293, now seen corresponding path program 2 times [2022-04-28 08:19:54,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:19:54,061 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931034196] [2022-04-28 08:19:54,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:19:54,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:19:54,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:19:54,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:19:54,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:19:54,102 INFO L290 TraceCheckUtils]: 0: Hoare triple {11622#(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); {11616#true} is VALID [2022-04-28 08:19:54,102 INFO L290 TraceCheckUtils]: 1: Hoare triple {11616#true} assume true; {11616#true} is VALID [2022-04-28 08:19:54,102 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11616#true} {11616#true} #132#return; {11616#true} is VALID [2022-04-28 08:19:54,107 INFO L272 TraceCheckUtils]: 0: Hoare triple {11616#true} call ULTIMATE.init(); {11622#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:19:54,107 INFO L290 TraceCheckUtils]: 1: Hoare triple {11622#(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); {11616#true} is VALID [2022-04-28 08:19:54,108 INFO L290 TraceCheckUtils]: 2: Hoare triple {11616#true} assume true; {11616#true} is VALID [2022-04-28 08:19:54,108 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11616#true} {11616#true} #132#return; {11616#true} is VALID [2022-04-28 08:19:54,108 INFO L272 TraceCheckUtils]: 4: Hoare triple {11616#true} call #t~ret11 := main(); {11616#true} is VALID [2022-04-28 08:19:54,108 INFO L290 TraceCheckUtils]: 5: Hoare triple {11616#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;havoc ~cond~0; {11616#true} is VALID [2022-04-28 08:19:54,108 INFO L290 TraceCheckUtils]: 6: Hoare triple {11616#true} assume !false;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~cond~0 := #t~nondet10;havoc #t~nondet10; {11616#true} is VALID [2022-04-28 08:19:54,108 INFO L290 TraceCheckUtils]: 7: Hoare triple {11616#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0; {11616#true} is VALID [2022-04-28 08:19:54,108 INFO L290 TraceCheckUtils]: 8: Hoare triple {11616#true} assume !(0 != ~p1~0); {11616#true} is VALID [2022-04-28 08:19:54,108 INFO L290 TraceCheckUtils]: 9: Hoare triple {11616#true} assume !(0 != ~p2~0); {11616#true} is VALID [2022-04-28 08:19:54,108 INFO L290 TraceCheckUtils]: 10: Hoare triple {11616#true} assume !(0 != ~p3~0); {11616#true} is VALID [2022-04-28 08:19:54,109 INFO L290 TraceCheckUtils]: 11: Hoare triple {11616#true} assume !(0 != ~p4~0); {11616#true} is VALID [2022-04-28 08:19:54,109 INFO L290 TraceCheckUtils]: 12: Hoare triple {11616#true} assume 0 != ~p5~0;~lk5~0 := 1; {11621#(= main_~lk5~0 1)} is VALID [2022-04-28 08:19:54,109 INFO L290 TraceCheckUtils]: 13: Hoare triple {11621#(= main_~lk5~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {11621#(= main_~lk5~0 1)} is VALID [2022-04-28 08:19:54,110 INFO L290 TraceCheckUtils]: 14: Hoare triple {11621#(= main_~lk5~0 1)} assume !(0 != ~p1~0); {11621#(= main_~lk5~0 1)} is VALID [2022-04-28 08:19:54,110 INFO L290 TraceCheckUtils]: 15: Hoare triple {11621#(= main_~lk5~0 1)} assume !(0 != ~p2~0); {11621#(= main_~lk5~0 1)} is VALID [2022-04-28 08:19:54,110 INFO L290 TraceCheckUtils]: 16: Hoare triple {11621#(= main_~lk5~0 1)} assume !(0 != ~p3~0); {11621#(= main_~lk5~0 1)} is VALID [2022-04-28 08:19:54,110 INFO L290 TraceCheckUtils]: 17: Hoare triple {11621#(= main_~lk5~0 1)} assume !(0 != ~p4~0); {11621#(= main_~lk5~0 1)} is VALID [2022-04-28 08:19:54,111 INFO L290 TraceCheckUtils]: 18: Hoare triple {11621#(= main_~lk5~0 1)} assume 0 != ~p5~0; {11621#(= main_~lk5~0 1)} is VALID [2022-04-28 08:19:54,111 INFO L290 TraceCheckUtils]: 19: Hoare triple {11621#(= main_~lk5~0 1)} assume 1 != ~lk5~0; {11617#false} is VALID [2022-04-28 08:19:54,111 INFO L290 TraceCheckUtils]: 20: Hoare triple {11617#false} assume !false; {11617#false} is VALID [2022-04-28 08:19:54,111 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-28 08:19:54,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:19:54,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931034196] [2022-04-28 08:19:54,112 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931034196] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:19:54,112 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:19:54,112 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:19:54,112 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:19:54,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [953725719] [2022-04-28 08:19:54,112 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [953725719] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:19:54,112 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:19:54,112 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:19:54,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45359368] [2022-04-28 08:19:54,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:19:54,113 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-28 08:19:54,113 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:19:54,113 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-28 08:19:54,125 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-28 08:19:54,125 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:19:54,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:19:54,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:19:54,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:19:54,126 INFO L87 Difference]: Start difference. First operand 313 states and 439 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-28 08:19:54,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:19:54,277 INFO L93 Difference]: Finished difference Result 525 states and 737 transitions. [2022-04-28 08:19:54,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:19:54,277 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-28 08:19:54,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:19:54,277 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-28 08:19:54,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 67 transitions. [2022-04-28 08:19:54,278 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-28 08:19:54,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 67 transitions. [2022-04-28 08:19:54,279 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 67 transitions. [2022-04-28 08:19:54,324 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:19:54,337 INFO L225 Difference]: With dead ends: 525 [2022-04-28 08:19:54,337 INFO L226 Difference]: Without dead ends: 523 [2022-04-28 08:19:54,337 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:19:54,338 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 72 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 08:19:54,338 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 50 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 08:19:54,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2022-04-28 08:19:54,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 457. [2022-04-28 08:19:54,361 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:19:54,362 INFO L82 GeneralOperation]: Start isEquivalent. First operand 523 states. Second operand has 457 states, 453 states have (on average 1.3686534216335542) internal successors, (620), 453 states have internal predecessors, (620), 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-28 08:19:54,363 INFO L74 IsIncluded]: Start isIncluded. First operand 523 states. Second operand has 457 states, 453 states have (on average 1.3686534216335542) internal successors, (620), 453 states have internal predecessors, (620), 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-28 08:19:54,363 INFO L87 Difference]: Start difference. First operand 523 states. Second operand has 457 states, 453 states have (on average 1.3686534216335542) internal successors, (620), 453 states have internal predecessors, (620), 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-28 08:19:54,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:19:54,373 INFO L93 Difference]: Finished difference Result 523 states and 720 transitions. [2022-04-28 08:19:54,373 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 720 transitions. [2022-04-28 08:19:54,374 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:19:54,374 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:19:54,374 INFO L74 IsIncluded]: Start isIncluded. First operand has 457 states, 453 states have (on average 1.3686534216335542) internal successors, (620), 453 states have internal predecessors, (620), 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 523 states. [2022-04-28 08:19:54,375 INFO L87 Difference]: Start difference. First operand has 457 states, 453 states have (on average 1.3686534216335542) internal successors, (620), 453 states have internal predecessors, (620), 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 523 states. [2022-04-28 08:19:54,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:19:54,385 INFO L93 Difference]: Finished difference Result 523 states and 720 transitions. [2022-04-28 08:19:54,385 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 720 transitions. [2022-04-28 08:19:54,386 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:19:54,386 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:19:54,386 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:19:54,386 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:19:54,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 457 states, 453 states have (on average 1.3686534216335542) internal successors, (620), 453 states have internal predecessors, (620), 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-28 08:19:54,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 623 transitions. [2022-04-28 08:19:54,397 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 623 transitions. Word has length 21 [2022-04-28 08:19:54,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:19:54,397 INFO L495 AbstractCegarLoop]: Abstraction has 457 states and 623 transitions. [2022-04-28 08:19:54,397 INFO L496 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-28 08:19:54,397 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 457 states and 623 transitions. [2022-04-28 08:19:54,954 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 623 edges. 623 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:19:54,954 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 623 transitions. [2022-04-28 08:19:54,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-28 08:19:54,955 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:19:54,955 INFO L195 NwaCegarLoop]: 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-28 08:19:54,955 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-28 08:19:54,955 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:19:54,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:19:54,956 INFO L85 PathProgramCache]: Analyzing trace with hash 1271891663, now seen corresponding path program 1 times [2022-04-28 08:19:54,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:19:54,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1649415866] [2022-04-28 08:19:54,956 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:19:54,956 INFO L85 PathProgramCache]: Analyzing trace with hash 1271891663, now seen corresponding path program 2 times [2022-04-28 08:19:54,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:19:54,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284372651] [2022-04-28 08:19:54,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:19:54,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:19:54,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:19:54,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:19:54,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:19:54,987 INFO L290 TraceCheckUtils]: 0: Hoare triple {14644#(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); {14638#true} is VALID [2022-04-28 08:19:54,987 INFO L290 TraceCheckUtils]: 1: Hoare triple {14638#true} assume true; {14638#true} is VALID [2022-04-28 08:19:54,987 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14638#true} {14638#true} #132#return; {14638#true} is VALID [2022-04-28 08:19:54,988 INFO L272 TraceCheckUtils]: 0: Hoare triple {14638#true} call ULTIMATE.init(); {14644#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:19:54,988 INFO L290 TraceCheckUtils]: 1: Hoare triple {14644#(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); {14638#true} is VALID [2022-04-28 08:19:54,988 INFO L290 TraceCheckUtils]: 2: Hoare triple {14638#true} assume true; {14638#true} is VALID [2022-04-28 08:19:54,988 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14638#true} {14638#true} #132#return; {14638#true} is VALID [2022-04-28 08:19:54,988 INFO L272 TraceCheckUtils]: 4: Hoare triple {14638#true} call #t~ret11 := main(); {14638#true} is VALID [2022-04-28 08:19:54,988 INFO L290 TraceCheckUtils]: 5: Hoare triple {14638#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;havoc ~cond~0; {14638#true} is VALID [2022-04-28 08:19:54,988 INFO L290 TraceCheckUtils]: 6: Hoare triple {14638#true} assume !false;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~cond~0 := #t~nondet10;havoc #t~nondet10; {14638#true} is VALID [2022-04-28 08:19:54,988 INFO L290 TraceCheckUtils]: 7: Hoare triple {14638#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0; {14638#true} is VALID [2022-04-28 08:19:54,988 INFO L290 TraceCheckUtils]: 8: Hoare triple {14638#true} assume !(0 != ~p1~0); {14638#true} is VALID [2022-04-28 08:19:54,988 INFO L290 TraceCheckUtils]: 9: Hoare triple {14638#true} assume !(0 != ~p2~0); {14638#true} is VALID [2022-04-28 08:19:54,989 INFO L290 TraceCheckUtils]: 10: Hoare triple {14638#true} assume !(0 != ~p3~0); {14638#true} is VALID [2022-04-28 08:19:54,989 INFO L290 TraceCheckUtils]: 11: Hoare triple {14638#true} assume !(0 != ~p4~0); {14638#true} is VALID [2022-04-28 08:19:54,989 INFO L290 TraceCheckUtils]: 12: Hoare triple {14638#true} assume !(0 != ~p5~0); {14643#(= main_~p5~0 0)} is VALID [2022-04-28 08:19:54,989 INFO L290 TraceCheckUtils]: 13: Hoare triple {14643#(= main_~p5~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {14643#(= main_~p5~0 0)} is VALID [2022-04-28 08:19:54,989 INFO L290 TraceCheckUtils]: 14: Hoare triple {14643#(= main_~p5~0 0)} assume !(0 != ~p1~0); {14643#(= main_~p5~0 0)} is VALID [2022-04-28 08:19:54,990 INFO L290 TraceCheckUtils]: 15: Hoare triple {14643#(= main_~p5~0 0)} assume !(0 != ~p2~0); {14643#(= main_~p5~0 0)} is VALID [2022-04-28 08:19:54,990 INFO L290 TraceCheckUtils]: 16: Hoare triple {14643#(= main_~p5~0 0)} assume !(0 != ~p3~0); {14643#(= main_~p5~0 0)} is VALID [2022-04-28 08:19:54,990 INFO L290 TraceCheckUtils]: 17: Hoare triple {14643#(= main_~p5~0 0)} assume !(0 != ~p4~0); {14643#(= main_~p5~0 0)} is VALID [2022-04-28 08:19:54,990 INFO L290 TraceCheckUtils]: 18: Hoare triple {14643#(= main_~p5~0 0)} assume 0 != ~p5~0; {14639#false} is VALID [2022-04-28 08:19:54,990 INFO L290 TraceCheckUtils]: 19: Hoare triple {14639#false} assume 1 != ~lk5~0; {14639#false} is VALID [2022-04-28 08:19:54,991 INFO L290 TraceCheckUtils]: 20: Hoare triple {14639#false} assume !false; {14639#false} is VALID [2022-04-28 08:19:54,991 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-28 08:19:54,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:19:54,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284372651] [2022-04-28 08:19:54,991 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284372651] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:19:54,991 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:19:54,991 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:19:54,991 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:19:54,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1649415866] [2022-04-28 08:19:54,991 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1649415866] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:19:54,991 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:19:54,991 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:19:54,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616849078] [2022-04-28 08:19:54,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:19:54,992 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-28 08:19:54,992 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:19:54,992 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-28 08:19:55,002 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-28 08:19:55,003 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:19:55,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:19:55,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:19:55,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:19:55,003 INFO L87 Difference]: Start difference. First operand 457 states and 623 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-28 08:19:55,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:19:55,155 INFO L93 Difference]: Finished difference Result 1021 states and 1377 transitions. [2022-04-28 08:19:55,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:19:55,156 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-28 08:19:55,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:19:55,156 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-28 08:19:55,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 108 transitions. [2022-04-28 08:19:55,157 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-28 08:19:55,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 108 transitions. [2022-04-28 08:19:55,158 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 108 transitions. [2022-04-28 08:19:55,218 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:19:55,233 INFO L225 Difference]: With dead ends: 1021 [2022-04-28 08:19:55,233 INFO L226 Difference]: Without dead ends: 587 [2022-04-28 08:19:55,234 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:19:55,234 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 64 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 08:19:55,234 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 71 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 08:19:55,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2022-04-28 08:19:55,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 585. [2022-04-28 08:19:55,266 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:19:55,267 INFO L82 GeneralOperation]: Start isEquivalent. First operand 587 states. Second operand has 585 states, 581 states have (on average 1.3012048192771084) internal successors, (756), 581 states have internal predecessors, (756), 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-28 08:19:55,288 INFO L74 IsIncluded]: Start isIncluded. First operand 587 states. Second operand has 585 states, 581 states have (on average 1.3012048192771084) internal successors, (756), 581 states have internal predecessors, (756), 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-28 08:19:55,289 INFO L87 Difference]: Start difference. First operand 587 states. Second operand has 585 states, 581 states have (on average 1.3012048192771084) internal successors, (756), 581 states have internal predecessors, (756), 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-28 08:19:55,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:19:55,300 INFO L93 Difference]: Finished difference Result 587 states and 760 transitions. [2022-04-28 08:19:55,300 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 760 transitions. [2022-04-28 08:19:55,301 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:19:55,301 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:19:55,303 INFO L74 IsIncluded]: Start isIncluded. First operand has 585 states, 581 states have (on average 1.3012048192771084) internal successors, (756), 581 states have internal predecessors, (756), 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 587 states. [2022-04-28 08:19:55,303 INFO L87 Difference]: Start difference. First operand has 585 states, 581 states have (on average 1.3012048192771084) internal successors, (756), 581 states have internal predecessors, (756), 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 587 states. [2022-04-28 08:19:55,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:19:55,315 INFO L93 Difference]: Finished difference Result 587 states and 760 transitions. [2022-04-28 08:19:55,315 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 760 transitions. [2022-04-28 08:19:55,315 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:19:55,316 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:19:55,316 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:19:55,316 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:19:55,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 585 states, 581 states have (on average 1.3012048192771084) internal successors, (756), 581 states have internal predecessors, (756), 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-28 08:19:55,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 759 transitions. [2022-04-28 08:19:55,331 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 759 transitions. Word has length 21 [2022-04-28 08:19:55,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:19:55,331 INFO L495 AbstractCegarLoop]: Abstraction has 585 states and 759 transitions. [2022-04-28 08:19:55,331 INFO L496 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-28 08:19:55,331 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 585 states and 759 transitions. [2022-04-28 08:19:55,991 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 759 edges. 759 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:19:55,991 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 759 transitions. [2022-04-28 08:19:55,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-28 08:19:55,992 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:19:55,992 INFO L195 NwaCegarLoop]: 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-28 08:19:55,992 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-28 08:19:55,992 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:19:55,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:19:55,992 INFO L85 PathProgramCache]: Analyzing trace with hash 1167178942, now seen corresponding path program 1 times [2022-04-28 08:19:55,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:19:55,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [33830321] [2022-04-28 08:19:55,993 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:19:55,993 INFO L85 PathProgramCache]: Analyzing trace with hash 1167178942, now seen corresponding path program 2 times [2022-04-28 08:19:55,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:19:55,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753379321] [2022-04-28 08:19:55,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:19:55,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:19:56,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:19:56,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:19:56,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:19:56,030 INFO L290 TraceCheckUtils]: 0: Hoare triple {19042#(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); {19036#true} is VALID [2022-04-28 08:19:56,030 INFO L290 TraceCheckUtils]: 1: Hoare triple {19036#true} assume true; {19036#true} is VALID [2022-04-28 08:19:56,030 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {19036#true} {19036#true} #132#return; {19036#true} is VALID [2022-04-28 08:19:56,031 INFO L272 TraceCheckUtils]: 0: Hoare triple {19036#true} call ULTIMATE.init(); {19042#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:19:56,031 INFO L290 TraceCheckUtils]: 1: Hoare triple {19042#(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); {19036#true} is VALID [2022-04-28 08:19:56,031 INFO L290 TraceCheckUtils]: 2: Hoare triple {19036#true} assume true; {19036#true} is VALID [2022-04-28 08:19:56,031 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19036#true} {19036#true} #132#return; {19036#true} is VALID [2022-04-28 08:19:56,031 INFO L272 TraceCheckUtils]: 4: Hoare triple {19036#true} call #t~ret11 := main(); {19036#true} is VALID [2022-04-28 08:19:56,031 INFO L290 TraceCheckUtils]: 5: Hoare triple {19036#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;havoc ~cond~0; {19036#true} is VALID [2022-04-28 08:19:56,031 INFO L290 TraceCheckUtils]: 6: Hoare triple {19036#true} assume !false;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~cond~0 := #t~nondet10;havoc #t~nondet10; {19036#true} is VALID [2022-04-28 08:19:56,031 INFO L290 TraceCheckUtils]: 7: Hoare triple {19036#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0; {19036#true} is VALID [2022-04-28 08:19:56,031 INFO L290 TraceCheckUtils]: 8: Hoare triple {19036#true} assume !(0 != ~p1~0); {19036#true} is VALID [2022-04-28 08:19:56,031 INFO L290 TraceCheckUtils]: 9: Hoare triple {19036#true} assume !(0 != ~p2~0); {19036#true} is VALID [2022-04-28 08:19:56,031 INFO L290 TraceCheckUtils]: 10: Hoare triple {19036#true} assume !(0 != ~p3~0); {19036#true} is VALID [2022-04-28 08:19:56,031 INFO L290 TraceCheckUtils]: 11: Hoare triple {19036#true} assume !(0 != ~p4~0); {19036#true} is VALID [2022-04-28 08:19:56,032 INFO L290 TraceCheckUtils]: 12: Hoare triple {19036#true} assume 0 != ~p5~0;~lk5~0 := 1; {19041#(not (= main_~p5~0 0))} is VALID [2022-04-28 08:19:56,032 INFO L290 TraceCheckUtils]: 13: Hoare triple {19041#(not (= main_~p5~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {19041#(not (= main_~p5~0 0))} is VALID [2022-04-28 08:19:56,032 INFO L290 TraceCheckUtils]: 14: Hoare triple {19041#(not (= main_~p5~0 0))} assume !(0 != ~p1~0); {19041#(not (= main_~p5~0 0))} is VALID [2022-04-28 08:19:56,032 INFO L290 TraceCheckUtils]: 15: Hoare triple {19041#(not (= main_~p5~0 0))} assume !(0 != ~p2~0); {19041#(not (= main_~p5~0 0))} is VALID [2022-04-28 08:19:56,033 INFO L290 TraceCheckUtils]: 16: Hoare triple {19041#(not (= main_~p5~0 0))} assume !(0 != ~p3~0); {19041#(not (= main_~p5~0 0))} is VALID [2022-04-28 08:19:56,033 INFO L290 TraceCheckUtils]: 17: Hoare triple {19041#(not (= main_~p5~0 0))} assume !(0 != ~p4~0); {19041#(not (= main_~p5~0 0))} is VALID [2022-04-28 08:19:56,033 INFO L290 TraceCheckUtils]: 18: Hoare triple {19041#(not (= main_~p5~0 0))} assume !(0 != ~p5~0); {19037#false} is VALID [2022-04-28 08:19:56,033 INFO L290 TraceCheckUtils]: 19: Hoare triple {19037#false} assume 0 != ~p6~0; {19037#false} is VALID [2022-04-28 08:19:56,033 INFO L290 TraceCheckUtils]: 20: Hoare triple {19037#false} assume 1 != ~lk6~0; {19037#false} is VALID [2022-04-28 08:19:56,033 INFO L290 TraceCheckUtils]: 21: Hoare triple {19037#false} assume !false; {19037#false} is VALID [2022-04-28 08:19:56,034 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-28 08:19:56,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:19:56,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753379321] [2022-04-28 08:19:56,034 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753379321] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:19:56,034 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:19:56,034 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:19:56,034 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:19:56,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [33830321] [2022-04-28 08:19:56,034 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [33830321] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:19:56,034 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:19:56,034 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:19:56,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529584755] [2022-04-28 08:19:56,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:19:56,035 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-28 08:19:56,035 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:19:56,035 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-28 08:19:56,045 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-28 08:19:56,045 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:19:56,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:19:56,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:19:56,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:19:56,046 INFO L87 Difference]: Start difference. First operand 585 states and 759 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-28 08:19:56,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:19:56,207 INFO L93 Difference]: Finished difference Result 877 states and 1129 transitions. [2022-04-28 08:19:56,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:19:56,208 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-28 08:19:56,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:19:56,208 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-28 08:19:56,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 103 transitions. [2022-04-28 08:19:56,209 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-28 08:19:56,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 103 transitions. [2022-04-28 08:19:56,209 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 103 transitions. [2022-04-28 08:19:56,267 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:19:56,282 INFO L225 Difference]: With dead ends: 877 [2022-04-28 08:19:56,282 INFO L226 Difference]: Without dead ends: 603 [2022-04-28 08:19:56,282 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:19:56,283 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 75 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 08:19:56,283 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 61 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 08:19:56,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2022-04-28 08:19:56,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 601. [2022-04-28 08:19:56,313 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:19:56,314 INFO L82 GeneralOperation]: Start isEquivalent. First operand 603 states. Second operand has 601 states, 597 states have (on average 1.2663316582914572) internal successors, (756), 597 states have internal predecessors, (756), 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-28 08:19:56,314 INFO L74 IsIncluded]: Start isIncluded. First operand 603 states. Second operand has 601 states, 597 states have (on average 1.2663316582914572) internal successors, (756), 597 states have internal predecessors, (756), 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-28 08:19:56,315 INFO L87 Difference]: Start difference. First operand 603 states. Second operand has 601 states, 597 states have (on average 1.2663316582914572) internal successors, (756), 597 states have internal predecessors, (756), 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-28 08:19:56,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:19:56,326 INFO L93 Difference]: Finished difference Result 603 states and 760 transitions. [2022-04-28 08:19:56,326 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 760 transitions. [2022-04-28 08:19:56,327 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:19:56,327 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:19:56,327 INFO L74 IsIncluded]: Start isIncluded. First operand has 601 states, 597 states have (on average 1.2663316582914572) internal successors, (756), 597 states have internal predecessors, (756), 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 603 states. [2022-04-28 08:19:56,328 INFO L87 Difference]: Start difference. First operand has 601 states, 597 states have (on average 1.2663316582914572) internal successors, (756), 597 states have internal predecessors, (756), 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 603 states. [2022-04-28 08:19:56,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:19:56,339 INFO L93 Difference]: Finished difference Result 603 states and 760 transitions. [2022-04-28 08:19:56,339 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 760 transitions. [2022-04-28 08:19:56,340 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:19:56,340 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:19:56,340 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:19:56,340 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:19:56,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 601 states, 597 states have (on average 1.2663316582914572) internal successors, (756), 597 states have internal predecessors, (756), 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-28 08:19:56,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 759 transitions. [2022-04-28 08:19:56,355 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 759 transitions. Word has length 22 [2022-04-28 08:19:56,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:19:56,355 INFO L495 AbstractCegarLoop]: Abstraction has 601 states and 759 transitions. [2022-04-28 08:19:56,356 INFO L496 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-28 08:19:56,356 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 601 states and 759 transitions. [2022-04-28 08:19:57,025 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 759 edges. 759 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:19:57,025 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 759 transitions. [2022-04-28 08:19:57,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-28 08:19:57,026 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:19:57,026 INFO L195 NwaCegarLoop]: 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-28 08:19:57,026 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-28 08:19:57,026 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:19:57,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:19:57,026 INFO L85 PathProgramCache]: Analyzing trace with hash 774151932, now seen corresponding path program 1 times [2022-04-28 08:19:57,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:19:57,026 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [767714850] [2022-04-28 08:19:57,027 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:19:57,027 INFO L85 PathProgramCache]: Analyzing trace with hash 774151932, now seen corresponding path program 2 times [2022-04-28 08:19:57,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:19:57,027 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304847520] [2022-04-28 08:19:57,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:19:57,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:19:57,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:19:57,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:19:57,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:19:57,067 INFO L290 TraceCheckUtils]: 0: Hoare triple {23216#(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); {23210#true} is VALID [2022-04-28 08:19:57,067 INFO L290 TraceCheckUtils]: 1: Hoare triple {23210#true} assume true; {23210#true} is VALID [2022-04-28 08:19:57,067 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23210#true} {23210#true} #132#return; {23210#true} is VALID [2022-04-28 08:19:57,068 INFO L272 TraceCheckUtils]: 0: Hoare triple {23210#true} call ULTIMATE.init(); {23216#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:19:57,068 INFO L290 TraceCheckUtils]: 1: Hoare triple {23216#(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); {23210#true} is VALID [2022-04-28 08:19:57,068 INFO L290 TraceCheckUtils]: 2: Hoare triple {23210#true} assume true; {23210#true} is VALID [2022-04-28 08:19:57,068 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23210#true} {23210#true} #132#return; {23210#true} is VALID [2022-04-28 08:19:57,068 INFO L272 TraceCheckUtils]: 4: Hoare triple {23210#true} call #t~ret11 := main(); {23210#true} is VALID [2022-04-28 08:19:57,068 INFO L290 TraceCheckUtils]: 5: Hoare triple {23210#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;havoc ~cond~0; {23210#true} is VALID [2022-04-28 08:19:57,068 INFO L290 TraceCheckUtils]: 6: Hoare triple {23210#true} assume !false;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~cond~0 := #t~nondet10;havoc #t~nondet10; {23210#true} is VALID [2022-04-28 08:19:57,068 INFO L290 TraceCheckUtils]: 7: Hoare triple {23210#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0; {23210#true} is VALID [2022-04-28 08:19:57,069 INFO L290 TraceCheckUtils]: 8: Hoare triple {23210#true} assume !(0 != ~p1~0); {23210#true} is VALID [2022-04-28 08:19:57,069 INFO L290 TraceCheckUtils]: 9: Hoare triple {23210#true} assume !(0 != ~p2~0); {23210#true} is VALID [2022-04-28 08:19:57,069 INFO L290 TraceCheckUtils]: 10: Hoare triple {23210#true} assume !(0 != ~p3~0); {23210#true} is VALID [2022-04-28 08:19:57,069 INFO L290 TraceCheckUtils]: 11: Hoare triple {23210#true} assume !(0 != ~p4~0); {23210#true} is VALID [2022-04-28 08:19:57,069 INFO L290 TraceCheckUtils]: 12: Hoare triple {23210#true} assume !(0 != ~p5~0); {23210#true} is VALID [2022-04-28 08:19:57,069 INFO L290 TraceCheckUtils]: 13: Hoare triple {23210#true} assume 0 != ~p6~0;~lk6~0 := 1; {23215#(= main_~lk6~0 1)} is VALID [2022-04-28 08:19:57,069 INFO L290 TraceCheckUtils]: 14: Hoare triple {23215#(= main_~lk6~0 1)} assume !(0 != ~p1~0); {23215#(= main_~lk6~0 1)} is VALID [2022-04-28 08:19:57,070 INFO L290 TraceCheckUtils]: 15: Hoare triple {23215#(= main_~lk6~0 1)} assume !(0 != ~p2~0); {23215#(= main_~lk6~0 1)} is VALID [2022-04-28 08:19:57,070 INFO L290 TraceCheckUtils]: 16: Hoare triple {23215#(= main_~lk6~0 1)} assume !(0 != ~p3~0); {23215#(= main_~lk6~0 1)} is VALID [2022-04-28 08:19:57,070 INFO L290 TraceCheckUtils]: 17: Hoare triple {23215#(= main_~lk6~0 1)} assume !(0 != ~p4~0); {23215#(= main_~lk6~0 1)} is VALID [2022-04-28 08:19:57,070 INFO L290 TraceCheckUtils]: 18: Hoare triple {23215#(= main_~lk6~0 1)} assume !(0 != ~p5~0); {23215#(= main_~lk6~0 1)} is VALID [2022-04-28 08:19:57,071 INFO L290 TraceCheckUtils]: 19: Hoare triple {23215#(= main_~lk6~0 1)} assume 0 != ~p6~0; {23215#(= main_~lk6~0 1)} is VALID [2022-04-28 08:19:57,071 INFO L290 TraceCheckUtils]: 20: Hoare triple {23215#(= main_~lk6~0 1)} assume 1 != ~lk6~0; {23211#false} is VALID [2022-04-28 08:19:57,071 INFO L290 TraceCheckUtils]: 21: Hoare triple {23211#false} assume !false; {23211#false} is VALID [2022-04-28 08:19:57,071 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-28 08:19:57,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:19:57,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304847520] [2022-04-28 08:19:57,072 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304847520] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:19:57,072 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:19:57,072 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:19:57,072 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:19:57,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [767714850] [2022-04-28 08:19:57,072 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [767714850] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:19:57,072 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:19:57,072 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:19:57,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164919647] [2022-04-28 08:19:57,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:19:57,072 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-28 08:19:57,072 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:19:57,073 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-28 08:19:57,084 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-28 08:19:57,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:19:57,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:19:57,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:19:57,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:19:57,085 INFO L87 Difference]: Start difference. First operand 601 states and 759 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-28 08:19:57,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:19:57,266 INFO L93 Difference]: Finished difference Result 971 states and 1208 transitions. [2022-04-28 08:19:57,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:19:57,266 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-28 08:19:57,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:19:57,266 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-28 08:19:57,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 62 transitions. [2022-04-28 08:19:57,268 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-28 08:19:57,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 62 transitions. [2022-04-28 08:19:57,269 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 62 transitions. [2022-04-28 08:19:57,302 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:19:57,350 INFO L225 Difference]: With dead ends: 971 [2022-04-28 08:19:57,350 INFO L226 Difference]: Without dead ends: 969 [2022-04-28 08:19:57,355 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:19:57,356 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 64 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 08:19:57,356 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 48 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 08:19:57,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 969 states. [2022-04-28 08:19:57,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 969 to 905. [2022-04-28 08:19:57,408 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:19:57,409 INFO L82 GeneralOperation]: Start isEquivalent. First operand 969 states. Second operand has 905 states, 901 states have (on average 1.2297447280799112) internal successors, (1108), 901 states have internal predecessors, (1108), 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-28 08:19:57,411 INFO L74 IsIncluded]: Start isIncluded. First operand 969 states. Second operand has 905 states, 901 states have (on average 1.2297447280799112) internal successors, (1108), 901 states have internal predecessors, (1108), 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-28 08:19:57,412 INFO L87 Difference]: Start difference. First operand 969 states. Second operand has 905 states, 901 states have (on average 1.2297447280799112) internal successors, (1108), 901 states have internal predecessors, (1108), 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-28 08:19:57,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:19:57,439 INFO L93 Difference]: Finished difference Result 969 states and 1175 transitions. [2022-04-28 08:19:57,440 INFO L276 IsEmpty]: Start isEmpty. Operand 969 states and 1175 transitions. [2022-04-28 08:19:57,441 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:19:57,441 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:19:57,442 INFO L74 IsIncluded]: Start isIncluded. First operand has 905 states, 901 states have (on average 1.2297447280799112) internal successors, (1108), 901 states have internal predecessors, (1108), 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 969 states. [2022-04-28 08:19:57,443 INFO L87 Difference]: Start difference. First operand has 905 states, 901 states have (on average 1.2297447280799112) internal successors, (1108), 901 states have internal predecessors, (1108), 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 969 states. [2022-04-28 08:19:57,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:19:57,472 INFO L93 Difference]: Finished difference Result 969 states and 1175 transitions. [2022-04-28 08:19:57,472 INFO L276 IsEmpty]: Start isEmpty. Operand 969 states and 1175 transitions. [2022-04-28 08:19:57,473 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:19:57,473 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:19:57,473 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:19:57,473 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:19:57,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 905 states, 901 states have (on average 1.2297447280799112) internal successors, (1108), 901 states have internal predecessors, (1108), 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-28 08:19:57,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1111 transitions. [2022-04-28 08:19:57,519 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 1111 transitions. Word has length 22 [2022-04-28 08:19:57,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:19:57,519 INFO L495 AbstractCegarLoop]: Abstraction has 905 states and 1111 transitions. [2022-04-28 08:19:57,519 INFO L496 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-28 08:19:57,519 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 905 states and 1111 transitions. [2022-04-28 08:19:58,553 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1111 edges. 1111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:19:58,553 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1111 transitions. [2022-04-28 08:19:58,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-28 08:19:58,556 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:19:58,557 INFO L195 NwaCegarLoop]: 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-28 08:19:58,557 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-28 08:19:58,557 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:19:58,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:19:58,557 INFO L85 PathProgramCache]: Analyzing trace with hash 1454210302, now seen corresponding path program 1 times [2022-04-28 08:19:58,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:19:58,557 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [833285314] [2022-04-28 08:19:58,558 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:19:58,558 INFO L85 PathProgramCache]: Analyzing trace with hash 1454210302, now seen corresponding path program 2 times [2022-04-28 08:19:58,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:19:58,558 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979498520] [2022-04-28 08:19:58,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:19:58,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:19:58,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:19:58,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:19:58,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:19:58,585 INFO L290 TraceCheckUtils]: 0: Hoare triple {28918#(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); {28912#true} is VALID [2022-04-28 08:19:58,586 INFO L290 TraceCheckUtils]: 1: Hoare triple {28912#true} assume true; {28912#true} is VALID [2022-04-28 08:19:58,586 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {28912#true} {28912#true} #132#return; {28912#true} is VALID [2022-04-28 08:19:58,586 INFO L272 TraceCheckUtils]: 0: Hoare triple {28912#true} call ULTIMATE.init(); {28918#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:19:58,586 INFO L290 TraceCheckUtils]: 1: Hoare triple {28918#(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); {28912#true} is VALID [2022-04-28 08:19:58,586 INFO L290 TraceCheckUtils]: 2: Hoare triple {28912#true} assume true; {28912#true} is VALID [2022-04-28 08:19:58,587 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28912#true} {28912#true} #132#return; {28912#true} is VALID [2022-04-28 08:19:58,587 INFO L272 TraceCheckUtils]: 4: Hoare triple {28912#true} call #t~ret11 := main(); {28912#true} is VALID [2022-04-28 08:19:58,587 INFO L290 TraceCheckUtils]: 5: Hoare triple {28912#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;havoc ~cond~0; {28912#true} is VALID [2022-04-28 08:19:58,587 INFO L290 TraceCheckUtils]: 6: Hoare triple {28912#true} assume !false;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~cond~0 := #t~nondet10;havoc #t~nondet10; {28912#true} is VALID [2022-04-28 08:19:58,587 INFO L290 TraceCheckUtils]: 7: Hoare triple {28912#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0; {28912#true} is VALID [2022-04-28 08:19:58,587 INFO L290 TraceCheckUtils]: 8: Hoare triple {28912#true} assume !(0 != ~p1~0); {28912#true} is VALID [2022-04-28 08:19:58,587 INFO L290 TraceCheckUtils]: 9: Hoare triple {28912#true} assume !(0 != ~p2~0); {28912#true} is VALID [2022-04-28 08:19:58,587 INFO L290 TraceCheckUtils]: 10: Hoare triple {28912#true} assume !(0 != ~p3~0); {28912#true} is VALID [2022-04-28 08:19:58,587 INFO L290 TraceCheckUtils]: 11: Hoare triple {28912#true} assume !(0 != ~p4~0); {28912#true} is VALID [2022-04-28 08:19:58,587 INFO L290 TraceCheckUtils]: 12: Hoare triple {28912#true} assume !(0 != ~p5~0); {28912#true} is VALID [2022-04-28 08:19:58,588 INFO L290 TraceCheckUtils]: 13: Hoare triple {28912#true} assume !(0 != ~p6~0); {28917#(= main_~p6~0 0)} is VALID [2022-04-28 08:19:58,588 INFO L290 TraceCheckUtils]: 14: Hoare triple {28917#(= main_~p6~0 0)} assume !(0 != ~p1~0); {28917#(= main_~p6~0 0)} is VALID [2022-04-28 08:19:58,588 INFO L290 TraceCheckUtils]: 15: Hoare triple {28917#(= main_~p6~0 0)} assume !(0 != ~p2~0); {28917#(= main_~p6~0 0)} is VALID [2022-04-28 08:19:58,589 INFO L290 TraceCheckUtils]: 16: Hoare triple {28917#(= main_~p6~0 0)} assume !(0 != ~p3~0); {28917#(= main_~p6~0 0)} is VALID [2022-04-28 08:19:58,589 INFO L290 TraceCheckUtils]: 17: Hoare triple {28917#(= main_~p6~0 0)} assume !(0 != ~p4~0); {28917#(= main_~p6~0 0)} is VALID [2022-04-28 08:19:58,589 INFO L290 TraceCheckUtils]: 18: Hoare triple {28917#(= main_~p6~0 0)} assume !(0 != ~p5~0); {28917#(= main_~p6~0 0)} is VALID [2022-04-28 08:19:58,590 INFO L290 TraceCheckUtils]: 19: Hoare triple {28917#(= main_~p6~0 0)} assume 0 != ~p6~0; {28913#false} is VALID [2022-04-28 08:19:58,590 INFO L290 TraceCheckUtils]: 20: Hoare triple {28913#false} assume 1 != ~lk6~0; {28913#false} is VALID [2022-04-28 08:19:58,590 INFO L290 TraceCheckUtils]: 21: Hoare triple {28913#false} assume !false; {28913#false} is VALID [2022-04-28 08:19:58,590 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-28 08:19:58,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:19:58,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979498520] [2022-04-28 08:19:58,590 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979498520] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:19:58,590 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:19:58,590 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:19:58,591 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:19:58,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [833285314] [2022-04-28 08:19:58,591 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [833285314] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:19:58,591 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:19:58,591 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:19:58,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223453393] [2022-04-28 08:19:58,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:19:58,591 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-28 08:19:58,591 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:19:58,592 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-28 08:19:58,603 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-28 08:19:58,603 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:19:58,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:19:58,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:19:58,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:19:58,604 INFO L87 Difference]: Start difference. First operand 905 states and 1111 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-28 08:19:58,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:19:58,972 INFO L93 Difference]: Finished difference Result 1993 states and 2391 transitions. [2022-04-28 08:19:58,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:19:58,972 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-28 08:19:58,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:19:58,972 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-28 08:19:58,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 103 transitions. [2022-04-28 08:19:58,973 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-28 08:19:58,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 103 transitions. [2022-04-28 08:19:58,974 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 103 transitions. [2022-04-28 08:19:59,040 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:19:59,040 INFO L225 Difference]: With dead ends: 1993 [2022-04-28 08:19:59,040 INFO L226 Difference]: Without dead ends: 0 [2022-04-28 08:19:59,043 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:19:59,043 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 55 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 08:19:59,043 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 72 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 08:19:59,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-28 08:19:59,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-28 08:19:59,044 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:19:59,044 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-28 08:19:59,044 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-28 08:19:59,044 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-28 08:19:59,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:19:59,044 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 08:19:59,044 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 08:19:59,045 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:19:59,045 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:19:59,045 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-28 08:19:59,045 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-28 08:19:59,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:19:59,045 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 08:19:59,045 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 08:19:59,045 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:19:59,045 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:19:59,045 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:19:59,045 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:19:59,045 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-28 08:19:59,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-28 08:19:59,045 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 22 [2022-04-28 08:19:59,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:19:59,045 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-28 08:19:59,045 INFO L496 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-28 08:19:59,046 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-28 08:19:59,046 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-28 08:19:59,046 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 08:19:59,046 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:19:59,048 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-28 08:19:59,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-28 08:19:59,050 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-28 08:20:07,351 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 3) no Hoare annotation was computed. [2022-04-28 08:20:07,351 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 3) no Hoare annotation was computed. [2022-04-28 08:20:07,352 INFO L899 garLoopResultBuilder]: For program point reach_errorFINAL(line 3) no Hoare annotation was computed. [2022-04-28 08:20:07,352 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-28 08:20:07,352 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-28 08:20:07,352 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-28 08:20:07,352 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-28 08:20:07,352 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-28 08:20:07,352 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-28 08:20:07,352 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-28 08:20:07,352 INFO L895 garLoopResultBuilder]: At program point L60-1(lines 29 104) 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-28 08:20:07,352 INFO L902 garLoopResultBuilder]: At program point mainEXIT(lines 6 109) the Hoare annotation is: true [2022-04-28 08:20:07,353 INFO L895 garLoopResultBuilder]: At program point L85(line 85) the Hoare annotation is: (let ((.cse1 (= main_~p4~0 0)) (.cse2 (= main_~lk5~0 1)) (.cse5 (= main_~lk6~0 1)) (.cse0 (not (= main_~p3~0 0))) (.cse7 (= main_~lk4~0 1)) (.cse3 (= main_~lk3~0 1)) (.cse6 (= main_~p5~0 0)) (.cse4 (= main_~p6~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse1 .cse2 .cse3 .cse5) (and .cse0 .cse1 .cse3 .cse6 .cse5) (and .cse0 .cse2 .cse7 .cse3 .cse5) (and .cse0 .cse1 .cse3 .cse6 .cse4) (and .cse0 .cse2 .cse7 .cse3 .cse4) (and .cse0 .cse7 .cse3 .cse6 .cse5) (and .cse0 .cse7 .cse3 .cse6 .cse4))) [2022-04-28 08:20:07,353 INFO L895 garLoopResultBuilder]: At program point L52-1(lines 29 104) 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-28 08:20:07,353 INFO L895 garLoopResultBuilder]: At program point L94-1(lines 29 104) the Hoare annotation is: (or (= main_~p6~0 0) (= main_~lk6~0 1)) [2022-04-28 08:20:07,353 INFO L895 garLoopResultBuilder]: At program point L95(line 95) the Hoare annotation is: (let ((.cse0 (not (= main_~p5~0 0))) (.cse1 (= main_~lk5~0 1))) (or (and .cse0 .cse1 (= main_~p6~0 0)) (and .cse0 .cse1 (= main_~lk6~0 1)))) [2022-04-28 08:20:07,353 INFO L895 garLoopResultBuilder]: At program point L79-1(lines 29 104) the Hoare annotation is: (let ((.cse1 (= main_~p5~0 0)) (.cse2 (= main_~lk6~0 1)) (.cse0 (= main_~p4~0 0)) (.cse6 (= main_~lk3~0 1)) (.cse4 (= main_~lk5~0 1)) (.cse5 (= main_~lk4~0 1)) (.cse7 (= main_~p6~0 0)) (.cse3 (= main_~p3~0 0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse6 .cse1 .cse7) (and .cse5 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse7 .cse3) (and .cse0 .cse4 .cse2 .cse3) (and .cse0 .cse6 .cse1 .cse2) (and .cse5 .cse6 .cse1 .cse2) (and .cse4 .cse5 .cse2 .cse3) (and .cse5 .cse6 .cse1 .cse7) (and .cse0 .cse4 .cse6 .cse2) (and .cse5 .cse1 .cse7 .cse3) (and .cse0 .cse4 .cse7 .cse3) (and .cse4 .cse5 .cse6 .cse2) (and .cse0 .cse4 .cse6 .cse7) (and .cse4 .cse5 .cse7 .cse3))) [2022-04-28 08:20:07,353 INFO L902 garLoopResultBuilder]: At program point mainFINAL(lines 6 109) the Hoare annotation is: true [2022-04-28 08:20:07,353 INFO L895 garLoopResultBuilder]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 107) the Hoare annotation is: false [2022-04-28 08:20:07,353 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 6 109) the Hoare annotation is: true [2022-04-28 08:20:07,354 INFO L895 garLoopResultBuilder]: At program point L80(line 80) the Hoare annotation is: (let ((.cse0 (= main_~p4~0 0)) (.cse1 (= main_~p5~0 0)) (.cse2 (= main_~lk6~0 1)) (.cse3 (= main_~p3~0 0)) (.cse6 (= main_~lk5~0 1)) (.cse7 (= main_~lk4~0 1)) (.cse8 (= main_~lk3~0 1)) (.cse5 (= main_~p6~0 0)) (.cse4 (= main_~lk2~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse1 .cse5 .cse3 .cse4) (and .cse0 .cse6 .cse5 .cse3 .cse4) (and .cse6 .cse7 .cse8 .cse2 .cse4) (and .cse6 .cse7 .cse5 .cse3 .cse4) (and .cse7 .cse8 .cse1 .cse2 .cse4) (and .cse0 .cse8 .cse1 .cse2 .cse4) (and .cse7 .cse1 .cse5 .cse3 .cse4) (and .cse6 .cse7 .cse2 .cse3 .cse4) (and .cse0 .cse6 .cse8 .cse2 .cse4) (and .cse7 .cse8 .cse1 .cse5 .cse4) (and .cse0 .cse6 .cse2 .cse3 .cse4) (and .cse0 .cse6 .cse8 .cse5 .cse4) (and .cse0 .cse8 .cse1 .cse5 .cse4) (and .cse7 .cse1 .cse2 .cse3 .cse4) (and .cse6 .cse7 .cse8 .cse5 .cse4))) [2022-04-28 08:20:07,354 INFO L902 garLoopResultBuilder]: At program point L105(lines 7 109) the Hoare annotation is: true [2022-04-28 08:20:07,354 INFO L902 garLoopResultBuilder]: At program point L31(lines 31 33) the Hoare annotation is: true [2022-04-28 08:20:07,354 INFO L895 garLoopResultBuilder]: At program point L64-1(lines 29 104) 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-28 08:20:07,354 INFO L895 garLoopResultBuilder]: At program point L89-1(lines 29 104) the Hoare annotation is: (let ((.cse0 (= main_~lk5~0 1)) (.cse3 (= main_~lk6~0 1)) (.cse2 (= main_~p5~0 0)) (.cse1 (= main_~p6~0 0))) (or (and .cse0 .cse1) (and .cse2 .cse3) (and .cse0 .cse3) (and .cse2 .cse1))) [2022-04-28 08:20:07,354 INFO L895 garLoopResultBuilder]: At program point L56-1(lines 29 104) 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-28 08:20:07,354 INFO L902 garLoopResultBuilder]: At program point L48(lines 48 50) the Hoare annotation is: true [2022-04-28 08:20:07,354 INFO L895 garLoopResultBuilder]: At program point L48-2(lines 29 104) the Hoare annotation is: (or (= main_~lk1~0 1) (= main_~p1~0 0)) [2022-04-28 08:20:07,354 INFO L895 garLoopResultBuilder]: At program point L90(line 90) the Hoare annotation is: (let ((.cse3 (= main_~p6~0 0)) (.cse4 (= main_~p5~0 0)) (.cse0 (= main_~lk5~0 1)) (.cse1 (not (= main_~p4~0 0))) (.cse2 (= main_~lk4~0 1)) (.cse5 (= main_~lk6~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse1 .cse2 .cse4 .cse3) (and .cse1 .cse2 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse5))) [2022-04-28 08:20:07,355 INFO L895 garLoopResultBuilder]: At program point L74-1(lines 29 104) the Hoare annotation is: (let ((.cse8 (= main_~p4~0 0)) (.cse2 (= main_~p2~0 0)) (.cse6 (= main_~p5~0 0)) (.cse3 (= main_~lk6~0 1)) (.cse4 (= main_~p3~0 0)) (.cse0 (= main_~lk5~0 1)) (.cse1 (= main_~lk4~0 1)) (.cse5 (= main_~lk3~0 1)) (.cse7 (= main_~p6~0 0)) (.cse9 (= main_~lk2~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse5 .cse6 .cse2 .cse7) (and .cse0 .cse1 .cse5 .cse2 .cse7) (and .cse8 .cse5 .cse6 .cse2 .cse7) (and .cse8 .cse6 .cse3 .cse4 .cse9) (and .cse8 .cse5 .cse6 .cse2 .cse3) (and .cse0 .cse1 .cse2 .cse7 .cse4) (and .cse8 .cse6 .cse7 .cse4 .cse9) (and .cse8 .cse0 .cse7 .cse4 .cse9) (and .cse0 .cse1 .cse5 .cse3 .cse9) (and .cse8 .cse6 .cse2 .cse7 .cse4) (and .cse0 .cse1 .cse7 .cse4 .cse9) (and .cse1 .cse5 .cse6 .cse3 .cse9) (and .cse8 .cse5 .cse6 .cse3 .cse9) (and .cse1 .cse6 .cse2 .cse7 .cse4) (and .cse1 .cse6 .cse7 .cse4 .cse9) (and .cse8 .cse6 .cse2 .cse3 .cse4) (and .cse1 .cse5 .cse6 .cse2 .cse3) (and .cse0 .cse1 .cse3 .cse4 .cse9) (and .cse8 .cse0 .cse5 .cse3 .cse9) (and .cse1 .cse5 .cse6 .cse7 .cse9) (and .cse8 .cse0 .cse5 .cse2 .cse7) (and .cse8 .cse0 .cse3 .cse4 .cse9) (and .cse1 .cse6 .cse2 .cse3 .cse4) (and .cse8 .cse0 .cse2 .cse7 .cse4) (and .cse0 .cse1 .cse5 .cse2 .cse3) (and .cse8 .cse0 .cse5 .cse7 .cse9) (and .cse8 .cse0 .cse2 .cse3 .cse4) (and .cse8 .cse5 .cse6 .cse7 .cse9) (and .cse8 .cse0 .cse5 .cse2 .cse3) (and .cse1 .cse6 .cse3 .cse4 .cse9) (and .cse0 .cse1 .cse5 .cse7 .cse9))) [2022-04-28 08:20:07,355 INFO L902 garLoopResultBuilder]: At program point L99-1(lines 29 104) the Hoare annotation is: true [2022-04-28 08:20:07,355 INFO L895 garLoopResultBuilder]: At program point L75(line 75) the Hoare annotation is: (let ((.cse8 (= main_~p5~0 0)) (.cse7 (= main_~lk4~0 1)) (.cse10 (= main_~p2~0 0)) (.cse4 (= main_~p6~0 0)) (.cse5 (= main_~p3~0 0)) (.cse0 (= main_~p4~0 0)) (.cse1 (= main_~lk5~0 1)) (.cse2 (not (= main_~p1~0 0))) (.cse3 (= main_~lk1~0 1)) (.cse11 (= main_~lk3~0 1)) (.cse9 (= main_~lk6~0 1)) (.cse6 (= main_~lk2~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse2 .cse3 .cse7 .cse8 .cse9 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse10 .cse9 .cse5) (and .cse2 .cse3 .cse7 .cse8 .cse4 .cse5 .cse6) (and .cse2 .cse3 .cse7 .cse11 .cse8 .cse4 .cse6) (and .cse2 .cse3 .cse7 .cse8 .cse10 .cse4 .cse5) (and .cse0 .cse2 .cse3 .cse8 .cse10 .cse4 .cse5) (and .cse2 .cse3 .cse7 .cse8 .cse10 .cse9 .cse5) (and .cse0 .cse2 .cse3 .cse11 .cse8 .cse9 .cse6) (and .cse2 .cse3 .cse7 .cse11 .cse8 .cse10 .cse4) (and .cse0 .cse2 .cse3 .cse11 .cse8 .cse4 .cse6) (and .cse1 .cse2 .cse3 .cse7 .cse11 .cse10 .cse4) (and .cse0 .cse1 .cse2 .cse3 .cse11 .cse4 .cse6) (and .cse0 .cse2 .cse3 .cse11 .cse8 .cse10 .cse4) (and .cse0 .cse1 .cse2 .cse3 .cse9 .cse5 .cse6) (and .cse1 .cse2 .cse3 .cse7 .cse10 .cse9 .cse5) (and .cse1 .cse2 .cse3 .cse7 .cse9 .cse5 .cse6) (and .cse1 .cse2 .cse3 .cse7 .cse11 .cse10 .cse9) (and .cse2 .cse3 .cse7 .cse11 .cse8 .cse9 .cse6) (and .cse0 .cse2 .cse3 .cse8 .cse10 .cse9 .cse5) (and .cse0 .cse2 .cse3 .cse8 .cse4 .cse5 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse11 .cse10 .cse4) (and .cse1 .cse2 .cse3 .cse7 .cse11 .cse4 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse11 .cse10 .cse9) (and .cse0 .cse2 .cse3 .cse8 .cse9 .cse5 .cse6) (and .cse1 .cse2 .cse3 .cse7 .cse11 .cse9 .cse6) (and .cse0 .cse2 .cse3 .cse11 .cse8 .cse10 .cse9) (and .cse2 .cse3 .cse7 .cse11 .cse8 .cse10 .cse9) (and .cse1 .cse2 .cse3 .cse7 .cse4 .cse5 .cse6) (and .cse1 .cse2 .cse3 .cse7 .cse10 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse3 .cse10 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse3 .cse11 .cse9 .cse6))) [2022-04-28 08:20:07,355 INFO L895 garLoopResultBuilder]: At program point L100(line 100) the Hoare annotation is: (= main_~lk6~0 1) [2022-04-28 08:20:07,355 INFO L895 garLoopResultBuilder]: At program point L100-1(lines 7 109) the Hoare annotation is: false [2022-04-28 08:20:07,355 INFO L895 garLoopResultBuilder]: At program point L84-1(lines 29 104) the Hoare annotation is: (let ((.cse0 (= main_~p4~0 0)) (.cse4 (= main_~p5~0 0)) (.cse2 (= main_~p6~0 0)) (.cse1 (= main_~lk5~0 1)) (.cse5 (= main_~lk4~0 1)) (.cse3 (= main_~lk6~0 1))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse1 .cse3) (and .cse0 .cse4 .cse2) (and .cse5 .cse4 .cse3) (and .cse0 .cse4 .cse3) (and .cse1 .cse5 .cse2) (and .cse5 .cse4 .cse2) (and .cse1 .cse5 .cse3))) [2022-04-28 08:20:07,356 INFO L895 garLoopResultBuilder]: At program point L68-1(lines 29 104) 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-28 08:20:07,358 INFO L356 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2] [2022-04-28 08:20:07,360 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-28 08:20:07,362 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-28 08:20:07,363 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-28 08:20:07,389 INFO L163 areAnnotationChecker]: CFG has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-28 08:20:07,395 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 08:20:07 BoogieIcfgContainer [2022-04-28 08:20:07,395 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-28 08:20:07,395 INFO L158 Benchmark]: Toolchain (without parser) took 19555.32ms. Allocated memory was 190.8MB in the beginning and 478.2MB in the end (delta: 287.3MB). Free memory was 143.0MB in the beginning and 423.3MB in the end (delta: -280.4MB). Peak memory consumption was 270.4MB. Max. memory is 8.0GB. [2022-04-28 08:20:07,396 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 190.8MB. Free memory is still 159.6MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 08:20:07,397 INFO L158 Benchmark]: CACSL2BoogieTranslator took 180.43ms. Allocated memory is still 190.8MB. Free memory was 142.8MB in the beginning and 166.8MB in the end (delta: -24.0MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-28 08:20:07,398 INFO L158 Benchmark]: Boogie Preprocessor took 36.98ms. Allocated memory is still 190.8MB. Free memory was 166.8MB in the beginning and 165.3MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-28 08:20:07,398 INFO L158 Benchmark]: RCFGBuilder took 268.70ms. Allocated memory is still 190.8MB. Free memory was 165.3MB in the beginning and 153.3MB in the end (delta: 11.9MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-28 08:20:07,398 INFO L158 Benchmark]: TraceAbstraction took 19064.89ms. Allocated memory was 190.8MB in the beginning and 478.2MB in the end (delta: 287.3MB). Free memory was 152.7MB in the beginning and 423.3MB in the end (delta: -270.6MB). Peak memory consumption was 280.3MB. Max. memory is 8.0GB. [2022-04-28 08:20:07,399 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 190.8MB. Free memory is still 159.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 180.43ms. Allocated memory is still 190.8MB. Free memory was 142.8MB in the beginning and 166.8MB in the end (delta: -24.0MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 36.98ms. Allocated memory is still 190.8MB. Free memory was 166.8MB in the beginning and 165.3MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 268.70ms. Allocated memory is still 190.8MB. Free memory was 165.3MB in the beginning and 153.3MB in the end (delta: 11.9MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 19064.89ms. Allocated memory was 190.8MB in the beginning and 478.2MB in the end (delta: 287.3MB). Free memory was 152.7MB in the beginning and 423.3MB in the end (delta: -270.6MB). Peak memory consumption was 280.3MB. 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: 107]: 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, 36 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 19.0s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 3.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 8.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1224 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1224 mSDsluCounter, 1008 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 114 mSDsCounter, 38 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 614 IncrementalHoareTripleChecker+Invalid, 652 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 38 mSolverCounterUnsat, 894 mSDtfsCounter, 614 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 112 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=905occurred in iteration=15, InterpolantAutomatonStates: 64, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 16 MinimizatonAttempts, 268 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 33 LocationsWithAnnotation, 33 PreInvPairs, 1162 NumberOfFragments, 4131 HoareAnnotationTreeSize, 33 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 2.7s HoareSimplificationTime, 33 FomulaSimplificationsInter, 38507 FormulaSimplificationTreeSizeReductionInter, 5.5s 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: 29]: 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-28 08:20:07,446 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...