/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_7.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 08:19:21,290 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 08:19:21,291 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 08:19:21,310 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 08:19:21,311 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 08:19:21,315 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 08:19:21,319 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 08:19:21,323 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 08:19:21,324 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 08:19:21,327 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 08:19:21,327 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 08:19:21,328 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 08:19:21,328 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 08:19:21,330 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 08:19:21,331 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 08:19:21,331 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 08:19:21,332 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 08:19:21,332 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 08:19:21,335 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 08:19:21,336 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 08:19:21,337 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 08:19:21,337 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 08:19:21,338 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 08:19:21,338 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 08:19:21,339 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 08:19:21,342 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 08:19:21,342 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 08:19:21,342 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 08:19:21,343 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 08:19:21,343 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 08:19:21,344 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 08:19:21,344 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 08:19:21,344 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 08:19:21,344 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 08:19:21,345 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 08:19:21,345 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 08:19:21,345 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 08:19:21,346 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 08:19:21,346 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 08:19:21,346 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 08:19:21,346 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 08:19:21,351 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 08:19:21,351 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-08 08:19:21,359 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 08:19:21,359 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 08:19:21,360 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 08:19:21,360 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-08 08:19:21,360 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 08:19:21,360 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-08 08:19:21,360 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 08:19:21,360 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 08:19:21,360 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 08:19:21,361 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 08:19:21,361 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-08 08:19:21,361 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 08:19:21,361 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 08:19:21,361 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 08:19:21,361 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 08:19:21,362 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 08:19:21,362 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 08:19:21,362 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 08:19:21,362 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 08:19:21,362 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 08:19:21,362 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 08:19:21,362 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 08:19:21,362 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 08:19:21,362 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 08:19:21,362 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-08 08:19:21,362 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-08 08:19:21,522 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 08:19:21,537 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 08:19:21,539 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 08:19:21,539 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 08:19:21,540 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 08:19:21,541 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_7.c [2022-04-08 08:19:21,600 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1942ddc7f/849f3b12b35e442e8993e759b37c8829/FLAGf07b2f888 [2022-04-08 08:19:21,941 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 08:19:21,942 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_7.c [2022-04-08 08:19:21,946 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1942ddc7f/849f3b12b35e442e8993e759b37c8829/FLAGf07b2f888 [2022-04-08 08:19:21,956 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1942ddc7f/849f3b12b35e442e8993e759b37c8829 [2022-04-08 08:19:21,958 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 08:19:21,959 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 08:19:21,960 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 08:19:21,960 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 08:19:21,972 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 08:19:21,973 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 08:19:21" (1/1) ... [2022-04-08 08:19:21,974 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74b2bd59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:19:21, skipping insertion in model container [2022-04-08 08:19:21,974 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 08:19:21" (1/1) ... [2022-04-08 08:19:21,979 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 08:19:21,994 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 08:19:22,132 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_7.c[2881,2894] [2022-04-08 08:19:22,135 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 08:19:22,147 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 08:19:22,164 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_7.c[2881,2894] [2022-04-08 08:19:22,165 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 08:19:22,172 INFO L208 MainTranslator]: Completed translation [2022-04-08 08:19:22,173 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:19:22 WrapperNode [2022-04-08 08:19:22,173 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 08:19:22,174 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 08:19:22,174 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 08:19:22,174 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 08:19:22,183 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:19:22" (1/1) ... [2022-04-08 08:19:22,183 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:19:22" (1/1) ... [2022-04-08 08:19:22,188 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:19:22" (1/1) ... [2022-04-08 08:19:22,188 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:19:22" (1/1) ... [2022-04-08 08:19:22,193 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:19:22" (1/1) ... [2022-04-08 08:19:22,198 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:19:22" (1/1) ... [2022-04-08 08:19:22,199 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:19:22" (1/1) ... [2022-04-08 08:19:22,201 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 08:19:22,201 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 08:19:22,201 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 08:19:22,201 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 08:19:22,202 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:19:22" (1/1) ... [2022-04-08 08:19:22,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 08:19:22,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 08:19:22,230 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-08 08:19:22,231 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-08 08:19:22,257 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 08:19:22,257 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 08:19:22,258 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 08:19:22,258 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 08:19:22,258 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 08:19:22,258 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 08:19:22,258 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 08:19:22,258 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 08:19:22,258 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-08 08:19:22,258 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 08:19:22,258 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 08:19:22,258 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 08:19:22,258 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 08:19:22,258 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 08:19:22,259 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 08:19:22,259 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 08:19:22,297 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 08:19:22,298 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 08:19:22,477 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 08:19:22,482 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 08:19:22,482 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-08 08:19:22,483 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 08:19:22 BoogieIcfgContainer [2022-04-08 08:19:22,483 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 08:19:22,484 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 08:19:22,484 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 08:19:22,491 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 08:19:22,491 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 08:19:21" (1/3) ... [2022-04-08 08:19:22,492 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@561c164f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 08:19:22, skipping insertion in model container [2022-04-08 08:19:22,492 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 08:19:22" (2/3) ... [2022-04-08 08:19:22,492 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@561c164f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 08:19:22, skipping insertion in model container [2022-04-08 08:19:22,492 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 08:19:22" (3/3) ... [2022-04-08 08:19:22,493 INFO L111 eAbstractionObserver]: Analyzing ICFG test_locks_7.c [2022-04-08 08:19:22,496 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 08:19:22,496 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 08:19:22,521 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 08:19:22,525 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-08 08:19:22,525 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 08:19:22,536 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 30 states have (on average 1.8333333333333333) internal successors, (55), 31 states have internal predecessors, (55), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 08:19:22,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-08 08:19:22,541 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:19:22,541 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:19:22,542 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:19:22,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:19:22,545 INFO L85 PathProgramCache]: Analyzing trace with hash -1576798563, now seen corresponding path program 1 times [2022-04-08 08:19:22,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:19:22,551 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1915646725] [2022-04-08 08:19:22,559 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:19:22,559 INFO L85 PathProgramCache]: Analyzing trace with hash -1576798563, now seen corresponding path program 2 times [2022-04-08 08:19:22,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:19:22,562 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252249322] [2022-04-08 08:19:22,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:19:22,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:19:22,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:19:22,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:19:22,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:19:22,774 INFO L290 TraceCheckUtils]: 0: Hoare triple {45#(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); {39#true} is VALID [2022-04-08 08:19:22,775 INFO L290 TraceCheckUtils]: 1: Hoare triple {39#true} assume true; {39#true} is VALID [2022-04-08 08:19:22,775 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {39#true} {39#true} #149#return; {39#true} is VALID [2022-04-08 08:19:22,777 INFO L272 TraceCheckUtils]: 0: Hoare triple {39#true} call ULTIMATE.init(); {45#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:19:22,777 INFO L290 TraceCheckUtils]: 1: Hoare triple {45#(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); {39#true} is VALID [2022-04-08 08:19:22,777 INFO L290 TraceCheckUtils]: 2: Hoare triple {39#true} assume true; {39#true} is VALID [2022-04-08 08:19:22,778 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {39#true} {39#true} #149#return; {39#true} is VALID [2022-04-08 08:19:22,778 INFO L272 TraceCheckUtils]: 4: Hoare triple {39#true} call #t~ret12 := main(); {39#true} is VALID [2022-04-08 08:19:22,778 INFO L290 TraceCheckUtils]: 5: Hoare triple {39#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;havoc ~cond~0; {39#true} is VALID [2022-04-08 08:19:22,779 INFO L290 TraceCheckUtils]: 6: Hoare triple {39#true} assume !false;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~cond~0 := #t~nondet11;havoc #t~nondet11; {39#true} is VALID [2022-04-08 08:19:22,779 INFO L290 TraceCheckUtils]: 7: Hoare triple {39#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0; {39#true} is VALID [2022-04-08 08:19:22,780 INFO L290 TraceCheckUtils]: 8: Hoare triple {39#true} assume 0 != ~p1~0;~lk1~0 := 1; {44#(= main_~lk1~0 1)} is VALID [2022-04-08 08:19:22,780 INFO L290 TraceCheckUtils]: 9: Hoare triple {44#(= main_~lk1~0 1)} assume !(0 != ~p2~0); {44#(= main_~lk1~0 1)} is VALID [2022-04-08 08:19:22,781 INFO L290 TraceCheckUtils]: 10: Hoare triple {44#(= main_~lk1~0 1)} assume 0 != ~p3~0;~lk3~0 := 1; {44#(= main_~lk1~0 1)} is VALID [2022-04-08 08:19:22,781 INFO L290 TraceCheckUtils]: 11: Hoare triple {44#(= main_~lk1~0 1)} assume 0 != ~p4~0;~lk4~0 := 1; {44#(= main_~lk1~0 1)} is VALID [2022-04-08 08:19:22,783 INFO L290 TraceCheckUtils]: 12: Hoare triple {44#(= main_~lk1~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {44#(= main_~lk1~0 1)} is VALID [2022-04-08 08:19:22,783 INFO L290 TraceCheckUtils]: 13: Hoare triple {44#(= main_~lk1~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {44#(= main_~lk1~0 1)} is VALID [2022-04-08 08:19:22,784 INFO L290 TraceCheckUtils]: 14: Hoare triple {44#(= main_~lk1~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {44#(= main_~lk1~0 1)} is VALID [2022-04-08 08:19:22,785 INFO L290 TraceCheckUtils]: 15: Hoare triple {44#(= main_~lk1~0 1)} assume 0 != ~p1~0; {44#(= main_~lk1~0 1)} is VALID [2022-04-08 08:19:22,786 INFO L290 TraceCheckUtils]: 16: Hoare triple {44#(= main_~lk1~0 1)} assume 1 != ~lk1~0; {40#false} is VALID [2022-04-08 08:19:22,786 INFO L290 TraceCheckUtils]: 17: Hoare triple {40#false} assume !false; {40#false} is VALID [2022-04-08 08:19:22,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:19:22,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:19:22,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252249322] [2022-04-08 08:19:22,788 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252249322] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:19:22,788 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:19:22,788 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:19:22,790 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:19:22,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1915646725] [2022-04-08 08:19:22,790 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1915646725] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:19:22,791 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:19:22,791 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:19:22,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613774438] [2022-04-08 08:19:22,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:19:22,794 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-08 08:19:22,795 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:19:22,797 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-08 08:19:22,822 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-08 08:19:22,822 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:19:22,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:19:22,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:19:22,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:19:22,843 INFO L87 Difference]: Start difference. First operand has 36 states, 30 states have (on average 1.8333333333333333) internal successors, (55), 31 states have internal predecessors, (55), 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.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-08 08:19:23,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:19:23,086 INFO L93 Difference]: Finished difference Result 70 states and 115 transitions. [2022-04-08 08:19:23,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:19:23,086 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-08 08:19:23,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:19:23,087 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-08 08:19:23,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 115 transitions. [2022-04-08 08:19:23,094 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-08 08:19:23,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 115 transitions. [2022-04-08 08:19:23,107 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 115 transitions. [2022-04-08 08:19:23,203 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-08 08:19:23,212 INFO L225 Difference]: With dead ends: 70 [2022-04-08 08:19:23,212 INFO L226 Difference]: Without dead ends: 55 [2022-04-08 08:19:23,214 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:19:23,217 INFO L913 BasicCegarLoop]: 62 mSDtfsCounter, 123 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 08:19:23,218 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [123 Valid, 71 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 08:19:23,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-04-08 08:19:23,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 39. [2022-04-08 08:19:23,250 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:19:23,252 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand has 39 states, 35 states have (on average 1.8) internal successors, (63), 35 states have internal predecessors, (63), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:23,252 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand has 39 states, 35 states have (on average 1.8) internal successors, (63), 35 states have internal predecessors, (63), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:23,253 INFO L87 Difference]: Start difference. First operand 55 states. Second operand has 39 states, 35 states have (on average 1.8) internal successors, (63), 35 states have internal predecessors, (63), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:23,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:19:23,260 INFO L93 Difference]: Finished difference Result 55 states and 93 transitions. [2022-04-08 08:19:23,260 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 93 transitions. [2022-04-08 08:19:23,260 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:19:23,260 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:19:23,261 INFO L74 IsIncluded]: Start isIncluded. First operand has 39 states, 35 states have (on average 1.8) internal successors, (63), 35 states have internal predecessors, (63), 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 55 states. [2022-04-08 08:19:23,262 INFO L87 Difference]: Start difference. First operand has 39 states, 35 states have (on average 1.8) internal successors, (63), 35 states have internal predecessors, (63), 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 55 states. [2022-04-08 08:19:23,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:19:23,268 INFO L93 Difference]: Finished difference Result 55 states and 93 transitions. [2022-04-08 08:19:23,268 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 93 transitions. [2022-04-08 08:19:23,269 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:19:23,269 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:19:23,269 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:19:23,269 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:19:23,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 35 states have (on average 1.8) internal successors, (63), 35 states have internal predecessors, (63), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:23,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 66 transitions. [2022-04-08 08:19:23,274 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 66 transitions. Word has length 18 [2022-04-08 08:19:23,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:19:23,276 INFO L478 AbstractCegarLoop]: Abstraction has 39 states and 66 transitions. [2022-04-08 08:19:23,276 INFO L479 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-08 08:19:23,279 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 39 states and 66 transitions. [2022-04-08 08:19:23,338 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:19:23,339 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 66 transitions. [2022-04-08 08:19:23,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-08 08:19:23,340 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:19:23,340 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:19:23,341 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 08:19:23,341 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:19:23,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:19:23,342 INFO L85 PathProgramCache]: Analyzing trace with hash -1969825573, now seen corresponding path program 1 times [2022-04-08 08:19:23,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:19:23,342 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1426242104] [2022-04-08 08:19:23,345 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:19:23,345 INFO L85 PathProgramCache]: Analyzing trace with hash -1969825573, now seen corresponding path program 2 times [2022-04-08 08:19:23,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:19:23,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602479744] [2022-04-08 08:19:23,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:19:23,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:19:23,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:19:23,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:19:23,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:19:23,424 INFO L290 TraceCheckUtils]: 0: Hoare triple {385#(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); {379#true} is VALID [2022-04-08 08:19:23,424 INFO L290 TraceCheckUtils]: 1: Hoare triple {379#true} assume true; {379#true} is VALID [2022-04-08 08:19:23,424 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {379#true} {379#true} #149#return; {379#true} is VALID [2022-04-08 08:19:23,425 INFO L272 TraceCheckUtils]: 0: Hoare triple {379#true} call ULTIMATE.init(); {385#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:19:23,425 INFO L290 TraceCheckUtils]: 1: Hoare triple {385#(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); {379#true} is VALID [2022-04-08 08:19:23,425 INFO L290 TraceCheckUtils]: 2: Hoare triple {379#true} assume true; {379#true} is VALID [2022-04-08 08:19:23,425 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {379#true} {379#true} #149#return; {379#true} is VALID [2022-04-08 08:19:23,425 INFO L272 TraceCheckUtils]: 4: Hoare triple {379#true} call #t~ret12 := main(); {379#true} is VALID [2022-04-08 08:19:23,426 INFO L290 TraceCheckUtils]: 5: Hoare triple {379#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;havoc ~cond~0; {379#true} is VALID [2022-04-08 08:19:23,426 INFO L290 TraceCheckUtils]: 6: Hoare triple {379#true} assume !false;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~cond~0 := #t~nondet11;havoc #t~nondet11; {379#true} is VALID [2022-04-08 08:19:23,426 INFO L290 TraceCheckUtils]: 7: Hoare triple {379#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0; {379#true} is VALID [2022-04-08 08:19:23,427 INFO L290 TraceCheckUtils]: 8: Hoare triple {379#true} assume !(0 != ~p1~0); {384#(= main_~p1~0 0)} is VALID [2022-04-08 08:19:23,427 INFO L290 TraceCheckUtils]: 9: Hoare triple {384#(= main_~p1~0 0)} assume !(0 != ~p2~0); {384#(= main_~p1~0 0)} is VALID [2022-04-08 08:19:23,427 INFO L290 TraceCheckUtils]: 10: Hoare triple {384#(= main_~p1~0 0)} assume 0 != ~p3~0;~lk3~0 := 1; {384#(= main_~p1~0 0)} is VALID [2022-04-08 08:19:23,428 INFO L290 TraceCheckUtils]: 11: Hoare triple {384#(= main_~p1~0 0)} assume 0 != ~p4~0;~lk4~0 := 1; {384#(= main_~p1~0 0)} is VALID [2022-04-08 08:19:23,428 INFO L290 TraceCheckUtils]: 12: Hoare triple {384#(= main_~p1~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {384#(= main_~p1~0 0)} is VALID [2022-04-08 08:19:23,429 INFO L290 TraceCheckUtils]: 13: Hoare triple {384#(= main_~p1~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {384#(= main_~p1~0 0)} is VALID [2022-04-08 08:19:23,429 INFO L290 TraceCheckUtils]: 14: Hoare triple {384#(= main_~p1~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {384#(= main_~p1~0 0)} is VALID [2022-04-08 08:19:23,429 INFO L290 TraceCheckUtils]: 15: Hoare triple {384#(= main_~p1~0 0)} assume 0 != ~p1~0; {380#false} is VALID [2022-04-08 08:19:23,430 INFO L290 TraceCheckUtils]: 16: Hoare triple {380#false} assume 1 != ~lk1~0; {380#false} is VALID [2022-04-08 08:19:23,430 INFO L290 TraceCheckUtils]: 17: Hoare triple {380#false} assume !false; {380#false} is VALID [2022-04-08 08:19:23,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:19:23,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:19:23,431 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602479744] [2022-04-08 08:19:23,431 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602479744] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:19:23,431 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:19:23,431 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:19:23,431 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:19:23,431 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1426242104] [2022-04-08 08:19:23,432 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1426242104] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:19:23,432 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:19:23,432 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:19:23,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273630740] [2022-04-08 08:19:23,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:19:23,433 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-08 08:19:23,433 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:19:23,433 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-08 08:19:23,446 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-08 08:19:23,446 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:19:23,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:19:23,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:19:23,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:19:23,448 INFO L87 Difference]: Start difference. First operand 39 states and 66 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-08 08:19:23,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:19:23,594 INFO L93 Difference]: Finished difference Result 88 states and 153 transitions. [2022-04-08 08:19:23,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:19:23,594 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-08 08:19:23,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:19:23,595 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-08 08:19:23,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 138 transitions. [2022-04-08 08:19:23,597 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-08 08:19:23,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 138 transitions. [2022-04-08 08:19:23,598 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 138 transitions. [2022-04-08 08:19:23,699 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 138 edges. 138 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:19:23,700 INFO L225 Difference]: With dead ends: 88 [2022-04-08 08:19:23,700 INFO L226 Difference]: Without dead ends: 55 [2022-04-08 08:19:23,700 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:19:23,701 INFO L913 BasicCegarLoop]: 64 mSDtfsCounter, 103 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 08:19:23,702 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [103 Valid, 71 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 08:19:23,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-04-08 08:19:23,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 53. [2022-04-08 08:19:23,709 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:19:23,709 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand has 53 states, 49 states have (on average 1.7755102040816326) internal successors, (87), 49 states have internal predecessors, (87), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:23,709 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand has 53 states, 49 states have (on average 1.7755102040816326) internal successors, (87), 49 states have internal predecessors, (87), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:23,709 INFO L87 Difference]: Start difference. First operand 55 states. Second operand has 53 states, 49 states have (on average 1.7755102040816326) internal successors, (87), 49 states have internal predecessors, (87), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:23,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:19:23,711 INFO L93 Difference]: Finished difference Result 55 states and 91 transitions. [2022-04-08 08:19:23,711 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 91 transitions. [2022-04-08 08:19:23,712 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:19:23,712 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:19:23,712 INFO L74 IsIncluded]: Start isIncluded. First operand has 53 states, 49 states have (on average 1.7755102040816326) internal successors, (87), 49 states have internal predecessors, (87), 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 55 states. [2022-04-08 08:19:23,712 INFO L87 Difference]: Start difference. First operand has 53 states, 49 states have (on average 1.7755102040816326) internal successors, (87), 49 states have internal predecessors, (87), 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 55 states. [2022-04-08 08:19:23,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:19:23,714 INFO L93 Difference]: Finished difference Result 55 states and 91 transitions. [2022-04-08 08:19:23,714 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 91 transitions. [2022-04-08 08:19:23,715 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:19:23,715 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:19:23,715 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:19:23,715 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:19:23,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 49 states have (on average 1.7755102040816326) internal successors, (87), 49 states have internal predecessors, (87), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:23,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 90 transitions. [2022-04-08 08:19:23,717 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 90 transitions. Word has length 18 [2022-04-08 08:19:23,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:19:23,717 INFO L478 AbstractCegarLoop]: Abstraction has 53 states and 90 transitions. [2022-04-08 08:19:23,717 INFO L479 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-08 08:19:23,717 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 53 states and 90 transitions. [2022-04-08 08:19:23,778 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:19:23,778 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 90 transitions. [2022-04-08 08:19:23,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-08 08:19:23,778 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:19:23,778 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:19:23,779 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-08 08:19:23,779 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:19:23,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:19:23,779 INFO L85 PathProgramCache]: Analyzing trace with hash -1635900842, now seen corresponding path program 1 times [2022-04-08 08:19:23,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:19:23,779 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1273154487] [2022-04-08 08:19:23,780 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:19:23,780 INFO L85 PathProgramCache]: Analyzing trace with hash -1635900842, now seen corresponding path program 2 times [2022-04-08 08:19:23,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:19:23,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892903494] [2022-04-08 08:19:23,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:19:23,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:19:23,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:19:23,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:19:23,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:19:23,816 INFO L290 TraceCheckUtils]: 0: Hoare triple {789#(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); {783#true} is VALID [2022-04-08 08:19:23,817 INFO L290 TraceCheckUtils]: 1: Hoare triple {783#true} assume true; {783#true} is VALID [2022-04-08 08:19:23,817 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {783#true} {783#true} #149#return; {783#true} is VALID [2022-04-08 08:19:23,818 INFO L272 TraceCheckUtils]: 0: Hoare triple {783#true} call ULTIMATE.init(); {789#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:19:23,818 INFO L290 TraceCheckUtils]: 1: Hoare triple {789#(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); {783#true} is VALID [2022-04-08 08:19:23,818 INFO L290 TraceCheckUtils]: 2: Hoare triple {783#true} assume true; {783#true} is VALID [2022-04-08 08:19:23,818 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {783#true} {783#true} #149#return; {783#true} is VALID [2022-04-08 08:19:23,819 INFO L272 TraceCheckUtils]: 4: Hoare triple {783#true} call #t~ret12 := main(); {783#true} is VALID [2022-04-08 08:19:23,819 INFO L290 TraceCheckUtils]: 5: Hoare triple {783#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;havoc ~cond~0; {783#true} is VALID [2022-04-08 08:19:23,819 INFO L290 TraceCheckUtils]: 6: Hoare triple {783#true} assume !false;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~cond~0 := #t~nondet11;havoc #t~nondet11; {783#true} is VALID [2022-04-08 08:19:23,819 INFO L290 TraceCheckUtils]: 7: Hoare triple {783#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0; {783#true} is VALID [2022-04-08 08:19:23,820 INFO L290 TraceCheckUtils]: 8: Hoare triple {783#true} assume 0 != ~p1~0;~lk1~0 := 1; {788#(not (= main_~p1~0 0))} is VALID [2022-04-08 08:19:23,833 INFO L290 TraceCheckUtils]: 9: Hoare triple {788#(not (= main_~p1~0 0))} assume !(0 != ~p2~0); {788#(not (= main_~p1~0 0))} is VALID [2022-04-08 08:19:23,835 INFO L290 TraceCheckUtils]: 10: Hoare triple {788#(not (= main_~p1~0 0))} assume 0 != ~p3~0;~lk3~0 := 1; {788#(not (= main_~p1~0 0))} is VALID [2022-04-08 08:19:23,836 INFO L290 TraceCheckUtils]: 11: Hoare triple {788#(not (= main_~p1~0 0))} assume 0 != ~p4~0;~lk4~0 := 1; {788#(not (= main_~p1~0 0))} is VALID [2022-04-08 08:19:23,837 INFO L290 TraceCheckUtils]: 12: Hoare triple {788#(not (= main_~p1~0 0))} assume 0 != ~p5~0;~lk5~0 := 1; {788#(not (= main_~p1~0 0))} is VALID [2022-04-08 08:19:23,837 INFO L290 TraceCheckUtils]: 13: Hoare triple {788#(not (= main_~p1~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {788#(not (= main_~p1~0 0))} is VALID [2022-04-08 08:19:23,837 INFO L290 TraceCheckUtils]: 14: Hoare triple {788#(not (= main_~p1~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {788#(not (= main_~p1~0 0))} is VALID [2022-04-08 08:19:23,838 INFO L290 TraceCheckUtils]: 15: Hoare triple {788#(not (= main_~p1~0 0))} assume !(0 != ~p1~0); {784#false} is VALID [2022-04-08 08:19:23,838 INFO L290 TraceCheckUtils]: 16: Hoare triple {784#false} assume 0 != ~p2~0; {784#false} is VALID [2022-04-08 08:19:23,838 INFO L290 TraceCheckUtils]: 17: Hoare triple {784#false} assume 1 != ~lk2~0; {784#false} is VALID [2022-04-08 08:19:23,838 INFO L290 TraceCheckUtils]: 18: Hoare triple {784#false} assume !false; {784#false} is VALID [2022-04-08 08:19:23,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:19:23,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:19:23,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892903494] [2022-04-08 08:19:23,840 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892903494] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:19:23,840 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:19:23,840 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:19:23,841 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:19:23,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1273154487] [2022-04-08 08:19:23,841 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1273154487] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:19:23,841 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:19:23,841 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:19:23,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985511525] [2022-04-08 08:19:23,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:19:23,842 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-08 08:19:23,842 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:19:23,842 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:23,851 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:19:23,852 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:19:23,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:19:23,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:19:23,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:19:23,853 INFO L87 Difference]: Start difference. First operand 53 states and 90 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:23,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:19:23,955 INFO L93 Difference]: Finished difference Result 82 states and 136 transitions. [2022-04-08 08:19:23,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:19:23,955 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-08 08:19:23,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:19:23,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:23,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 133 transitions. [2022-04-08 08:19:23,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:23,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 133 transitions. [2022-04-08 08:19:23,960 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 133 transitions. [2022-04-08 08:19:24,030 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 133 edges. 133 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:19:24,034 INFO L225 Difference]: With dead ends: 82 [2022-04-08 08:19:24,034 INFO L226 Difference]: Without dead ends: 58 [2022-04-08 08:19:24,035 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:19:24,037 INFO L913 BasicCegarLoop]: 76 mSDtfsCounter, 92 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 08:19:24,040 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [92 Valid, 83 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 08:19:24,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-04-08 08:19:24,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 56. [2022-04-08 08:19:24,049 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:19:24,049 INFO L82 GeneralOperation]: Start isEquivalent. First operand 58 states. Second operand has 56 states, 52 states have (on average 1.7115384615384615) internal successors, (89), 52 states have internal predecessors, (89), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:24,049 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand has 56 states, 52 states have (on average 1.7115384615384615) internal successors, (89), 52 states have internal predecessors, (89), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:24,049 INFO L87 Difference]: Start difference. First operand 58 states. Second operand has 56 states, 52 states have (on average 1.7115384615384615) internal successors, (89), 52 states have internal predecessors, (89), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:24,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:19:24,051 INFO L93 Difference]: Finished difference Result 58 states and 93 transitions. [2022-04-08 08:19:24,051 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 93 transitions. [2022-04-08 08:19:24,051 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:19:24,051 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:19:24,051 INFO L74 IsIncluded]: Start isIncluded. First operand has 56 states, 52 states have (on average 1.7115384615384615) internal successors, (89), 52 states have internal predecessors, (89), 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 58 states. [2022-04-08 08:19:24,051 INFO L87 Difference]: Start difference. First operand has 56 states, 52 states have (on average 1.7115384615384615) internal successors, (89), 52 states have internal predecessors, (89), 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 58 states. [2022-04-08 08:19:24,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:19:24,053 INFO L93 Difference]: Finished difference Result 58 states and 93 transitions. [2022-04-08 08:19:24,053 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 93 transitions. [2022-04-08 08:19:24,053 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:19:24,053 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:19:24,053 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:19:24,053 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:19:24,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 52 states have (on average 1.7115384615384615) internal successors, (89), 52 states have internal predecessors, (89), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:24,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 92 transitions. [2022-04-08 08:19:24,055 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 92 transitions. Word has length 19 [2022-04-08 08:19:24,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:19:24,055 INFO L478 AbstractCegarLoop]: Abstraction has 56 states and 92 transitions. [2022-04-08 08:19:24,055 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:24,055 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 56 states and 92 transitions. [2022-04-08 08:19:24,131 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:19:24,132 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 92 transitions. [2022-04-08 08:19:24,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-08 08:19:24,132 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:19:24,132 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:19:24,132 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-08 08:19:24,133 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:19:24,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:19:24,133 INFO L85 PathProgramCache]: Analyzing trace with hash -934836264, now seen corresponding path program 1 times [2022-04-08 08:19:24,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:19:24,133 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [453542311] [2022-04-08 08:19:24,133 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:19:24,133 INFO L85 PathProgramCache]: Analyzing trace with hash -934836264, now seen corresponding path program 2 times [2022-04-08 08:19:24,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:19:24,134 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971101338] [2022-04-08 08:19:24,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:19:24,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:19:24,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:19:24,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:19:24,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:19:24,175 INFO L290 TraceCheckUtils]: 0: Hoare triple {1193#(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); {1187#true} is VALID [2022-04-08 08:19:24,176 INFO L290 TraceCheckUtils]: 1: Hoare triple {1187#true} assume true; {1187#true} is VALID [2022-04-08 08:19:24,176 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1187#true} {1187#true} #149#return; {1187#true} is VALID [2022-04-08 08:19:24,176 INFO L272 TraceCheckUtils]: 0: Hoare triple {1187#true} call ULTIMATE.init(); {1193#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:19:24,176 INFO L290 TraceCheckUtils]: 1: Hoare triple {1193#(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); {1187#true} is VALID [2022-04-08 08:19:24,176 INFO L290 TraceCheckUtils]: 2: Hoare triple {1187#true} assume true; {1187#true} is VALID [2022-04-08 08:19:24,177 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1187#true} {1187#true} #149#return; {1187#true} is VALID [2022-04-08 08:19:24,177 INFO L272 TraceCheckUtils]: 4: Hoare triple {1187#true} call #t~ret12 := main(); {1187#true} is VALID [2022-04-08 08:19:24,177 INFO L290 TraceCheckUtils]: 5: Hoare triple {1187#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;havoc ~cond~0; {1187#true} is VALID [2022-04-08 08:19:24,177 INFO L290 TraceCheckUtils]: 6: Hoare triple {1187#true} assume !false;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~cond~0 := #t~nondet11;havoc #t~nondet11; {1187#true} is VALID [2022-04-08 08:19:24,177 INFO L290 TraceCheckUtils]: 7: Hoare triple {1187#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0; {1187#true} is VALID [2022-04-08 08:19:24,177 INFO L290 TraceCheckUtils]: 8: Hoare triple {1187#true} assume !(0 != ~p1~0); {1187#true} is VALID [2022-04-08 08:19:24,178 INFO L290 TraceCheckUtils]: 9: Hoare triple {1187#true} assume !(0 != ~p2~0); {1192#(= main_~p2~0 0)} is VALID [2022-04-08 08:19:24,178 INFO L290 TraceCheckUtils]: 10: Hoare triple {1192#(= main_~p2~0 0)} assume 0 != ~p3~0;~lk3~0 := 1; {1192#(= main_~p2~0 0)} is VALID [2022-04-08 08:19:24,178 INFO L290 TraceCheckUtils]: 11: Hoare triple {1192#(= main_~p2~0 0)} assume 0 != ~p4~0;~lk4~0 := 1; {1192#(= main_~p2~0 0)} is VALID [2022-04-08 08:19:24,178 INFO L290 TraceCheckUtils]: 12: Hoare triple {1192#(= main_~p2~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {1192#(= main_~p2~0 0)} is VALID [2022-04-08 08:19:24,179 INFO L290 TraceCheckUtils]: 13: Hoare triple {1192#(= main_~p2~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {1192#(= main_~p2~0 0)} is VALID [2022-04-08 08:19:24,179 INFO L290 TraceCheckUtils]: 14: Hoare triple {1192#(= main_~p2~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {1192#(= main_~p2~0 0)} is VALID [2022-04-08 08:19:24,180 INFO L290 TraceCheckUtils]: 15: Hoare triple {1192#(= main_~p2~0 0)} assume !(0 != ~p1~0); {1192#(= main_~p2~0 0)} is VALID [2022-04-08 08:19:24,183 INFO L290 TraceCheckUtils]: 16: Hoare triple {1192#(= main_~p2~0 0)} assume 0 != ~p2~0; {1188#false} is VALID [2022-04-08 08:19:24,183 INFO L290 TraceCheckUtils]: 17: Hoare triple {1188#false} assume 1 != ~lk2~0; {1188#false} is VALID [2022-04-08 08:19:24,183 INFO L290 TraceCheckUtils]: 18: Hoare triple {1188#false} assume !false; {1188#false} is VALID [2022-04-08 08:19:24,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:19:24,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:19:24,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971101338] [2022-04-08 08:19:24,184 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971101338] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:19:24,184 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:19:24,184 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:19:24,184 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:19:24,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [453542311] [2022-04-08 08:19:24,184 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [453542311] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:19:24,184 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:19:24,184 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:19:24,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411751718] [2022-04-08 08:19:24,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:19:24,185 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-08 08:19:24,185 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:19:24,185 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:24,195 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:19:24,195 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:19:24,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:19:24,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:19:24,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:19:24,196 INFO L87 Difference]: Start difference. First operand 56 states and 92 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:24,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:19:24,299 INFO L93 Difference]: Finished difference Result 148 states and 252 transitions. [2022-04-08 08:19:24,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:19:24,299 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-08 08:19:24,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:19:24,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:24,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 136 transitions. [2022-04-08 08:19:24,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:24,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 136 transitions. [2022-04-08 08:19:24,303 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 136 transitions. [2022-04-08 08:19:24,378 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 136 edges. 136 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:19:24,379 INFO L225 Difference]: With dead ends: 148 [2022-04-08 08:19:24,379 INFO L226 Difference]: Without dead ends: 101 [2022-04-08 08:19:24,380 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:19:24,380 INFO L913 BasicCegarLoop]: 54 mSDtfsCounter, 112 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 08:19:24,380 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [112 Valid, 61 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 08:19:24,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-04-08 08:19:24,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 99. [2022-04-08 08:19:24,388 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:19:24,388 INFO L82 GeneralOperation]: Start isEquivalent. First operand 101 states. Second operand has 99 states, 95 states have (on average 1.7052631578947368) internal successors, (162), 95 states have internal predecessors, (162), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:24,388 INFO L74 IsIncluded]: Start isIncluded. First operand 101 states. Second operand has 99 states, 95 states have (on average 1.7052631578947368) internal successors, (162), 95 states have internal predecessors, (162), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:24,389 INFO L87 Difference]: Start difference. First operand 101 states. Second operand has 99 states, 95 states have (on average 1.7052631578947368) internal successors, (162), 95 states have internal predecessors, (162), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:24,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:19:24,391 INFO L93 Difference]: Finished difference Result 101 states and 166 transitions. [2022-04-08 08:19:24,407 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 166 transitions. [2022-04-08 08:19:24,407 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:19:24,408 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:19:24,408 INFO L74 IsIncluded]: Start isIncluded. First operand has 99 states, 95 states have (on average 1.7052631578947368) internal successors, (162), 95 states have internal predecessors, (162), 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 101 states. [2022-04-08 08:19:24,408 INFO L87 Difference]: Start difference. First operand has 99 states, 95 states have (on average 1.7052631578947368) internal successors, (162), 95 states have internal predecessors, (162), 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 101 states. [2022-04-08 08:19:24,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:19:24,410 INFO L93 Difference]: Finished difference Result 101 states and 166 transitions. [2022-04-08 08:19:24,411 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 166 transitions. [2022-04-08 08:19:24,411 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:19:24,411 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:19:24,411 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:19:24,411 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:19:24,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 95 states have (on average 1.7052631578947368) internal successors, (162), 95 states have internal predecessors, (162), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:24,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 165 transitions. [2022-04-08 08:19:24,427 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 165 transitions. Word has length 19 [2022-04-08 08:19:24,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:19:24,427 INFO L478 AbstractCegarLoop]: Abstraction has 99 states and 165 transitions. [2022-04-08 08:19:24,427 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:24,427 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 99 states and 165 transitions. [2022-04-08 08:19:24,542 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 165 edges. 165 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:19:24,542 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 165 transitions. [2022-04-08 08:19:24,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-08 08:19:24,543 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:19:24,543 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:19:24,543 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-08 08:19:24,543 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:19:24,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:19:24,544 INFO L85 PathProgramCache]: Analyzing trace with hash -541809254, now seen corresponding path program 1 times [2022-04-08 08:19:24,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:19:24,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1418594312] [2022-04-08 08:19:24,544 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:19:24,544 INFO L85 PathProgramCache]: Analyzing trace with hash -541809254, now seen corresponding path program 2 times [2022-04-08 08:19:24,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:19:24,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783813651] [2022-04-08 08:19:24,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:19:24,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:19:24,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:19:24,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:19:24,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:19:24,593 INFO L290 TraceCheckUtils]: 0: Hoare triple {1901#(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); {1895#true} is VALID [2022-04-08 08:19:24,594 INFO L290 TraceCheckUtils]: 1: Hoare triple {1895#true} assume true; {1895#true} is VALID [2022-04-08 08:19:24,594 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1895#true} {1895#true} #149#return; {1895#true} is VALID [2022-04-08 08:19:24,594 INFO L272 TraceCheckUtils]: 0: Hoare triple {1895#true} call ULTIMATE.init(); {1901#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:19:24,594 INFO L290 TraceCheckUtils]: 1: Hoare triple {1901#(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); {1895#true} is VALID [2022-04-08 08:19:24,594 INFO L290 TraceCheckUtils]: 2: Hoare triple {1895#true} assume true; {1895#true} is VALID [2022-04-08 08:19:24,595 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1895#true} {1895#true} #149#return; {1895#true} is VALID [2022-04-08 08:19:24,595 INFO L272 TraceCheckUtils]: 4: Hoare triple {1895#true} call #t~ret12 := main(); {1895#true} is VALID [2022-04-08 08:19:24,595 INFO L290 TraceCheckUtils]: 5: Hoare triple {1895#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;havoc ~cond~0; {1895#true} is VALID [2022-04-08 08:19:24,595 INFO L290 TraceCheckUtils]: 6: Hoare triple {1895#true} assume !false;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~cond~0 := #t~nondet11;havoc #t~nondet11; {1895#true} is VALID [2022-04-08 08:19:24,595 INFO L290 TraceCheckUtils]: 7: Hoare triple {1895#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0; {1895#true} is VALID [2022-04-08 08:19:24,595 INFO L290 TraceCheckUtils]: 8: Hoare triple {1895#true} assume !(0 != ~p1~0); {1895#true} is VALID [2022-04-08 08:19:24,596 INFO L290 TraceCheckUtils]: 9: Hoare triple {1895#true} assume 0 != ~p2~0;~lk2~0 := 1; {1900#(= main_~lk2~0 1)} is VALID [2022-04-08 08:19:24,596 INFO L290 TraceCheckUtils]: 10: Hoare triple {1900#(= main_~lk2~0 1)} assume 0 != ~p3~0;~lk3~0 := 1; {1900#(= main_~lk2~0 1)} is VALID [2022-04-08 08:19:24,596 INFO L290 TraceCheckUtils]: 11: Hoare triple {1900#(= main_~lk2~0 1)} assume 0 != ~p4~0;~lk4~0 := 1; {1900#(= main_~lk2~0 1)} is VALID [2022-04-08 08:19:24,596 INFO L290 TraceCheckUtils]: 12: Hoare triple {1900#(= main_~lk2~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {1900#(= main_~lk2~0 1)} is VALID [2022-04-08 08:19:24,597 INFO L290 TraceCheckUtils]: 13: Hoare triple {1900#(= main_~lk2~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {1900#(= main_~lk2~0 1)} is VALID [2022-04-08 08:19:24,597 INFO L290 TraceCheckUtils]: 14: Hoare triple {1900#(= main_~lk2~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {1900#(= main_~lk2~0 1)} is VALID [2022-04-08 08:19:24,598 INFO L290 TraceCheckUtils]: 15: Hoare triple {1900#(= main_~lk2~0 1)} assume !(0 != ~p1~0); {1900#(= main_~lk2~0 1)} is VALID [2022-04-08 08:19:24,598 INFO L290 TraceCheckUtils]: 16: Hoare triple {1900#(= main_~lk2~0 1)} assume 0 != ~p2~0; {1900#(= main_~lk2~0 1)} is VALID [2022-04-08 08:19:24,598 INFO L290 TraceCheckUtils]: 17: Hoare triple {1900#(= main_~lk2~0 1)} assume 1 != ~lk2~0; {1896#false} is VALID [2022-04-08 08:19:24,598 INFO L290 TraceCheckUtils]: 18: Hoare triple {1896#false} assume !false; {1896#false} is VALID [2022-04-08 08:19:24,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:19:24,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:19:24,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783813651] [2022-04-08 08:19:24,599 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783813651] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:19:24,599 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:19:24,599 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:19:24,600 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:19:24,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1418594312] [2022-04-08 08:19:24,600 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1418594312] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:19:24,600 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:19:24,600 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:19:24,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212172096] [2022-04-08 08:19:24,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:19:24,601 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-08 08:19:24,601 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:19:24,601 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:24,613 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:19:24,613 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:19:24,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:19:24,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:19:24,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:19:24,614 INFO L87 Difference]: Start difference. First operand 99 states and 165 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:24,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:19:24,725 INFO L93 Difference]: Finished difference Result 127 states and 211 transitions. [2022-04-08 08:19:24,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:19:24,725 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-08 08:19:24,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:19:24,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:24,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 88 transitions. [2022-04-08 08:19:24,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:24,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 88 transitions. [2022-04-08 08:19:24,728 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 88 transitions. [2022-04-08 08:19:24,781 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:19:24,783 INFO L225 Difference]: With dead ends: 127 [2022-04-08 08:19:24,783 INFO L226 Difference]: Without dead ends: 125 [2022-04-08 08:19:24,783 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:19:24,783 INFO L913 BasicCegarLoop]: 85 mSDtfsCounter, 73 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 08:19:24,784 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [73 Valid, 92 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 08:19:24,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2022-04-08 08:19:24,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 99. [2022-04-08 08:19:24,791 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:19:24,792 INFO L82 GeneralOperation]: Start isEquivalent. First operand 125 states. Second operand has 99 states, 95 states have (on average 1.6842105263157894) internal successors, (160), 95 states have internal predecessors, (160), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:24,792 INFO L74 IsIncluded]: Start isIncluded. First operand 125 states. Second operand has 99 states, 95 states have (on average 1.6842105263157894) internal successors, (160), 95 states have internal predecessors, (160), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:24,792 INFO L87 Difference]: Start difference. First operand 125 states. Second operand has 99 states, 95 states have (on average 1.6842105263157894) internal successors, (160), 95 states have internal predecessors, (160), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:24,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:19:24,795 INFO L93 Difference]: Finished difference Result 125 states and 208 transitions. [2022-04-08 08:19:24,795 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 208 transitions. [2022-04-08 08:19:24,795 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:19:24,795 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:19:24,796 INFO L74 IsIncluded]: Start isIncluded. First operand has 99 states, 95 states have (on average 1.6842105263157894) internal successors, (160), 95 states have internal predecessors, (160), 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 125 states. [2022-04-08 08:19:24,796 INFO L87 Difference]: Start difference. First operand has 99 states, 95 states have (on average 1.6842105263157894) internal successors, (160), 95 states have internal predecessors, (160), 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 125 states. [2022-04-08 08:19:24,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:19:24,799 INFO L93 Difference]: Finished difference Result 125 states and 208 transitions. [2022-04-08 08:19:24,799 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 208 transitions. [2022-04-08 08:19:24,799 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:19:24,799 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:19:24,799 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:19:24,799 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:19:24,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 95 states have (on average 1.6842105263157894) internal successors, (160), 95 states have internal predecessors, (160), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:24,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 163 transitions. [2022-04-08 08:19:24,801 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 163 transitions. Word has length 19 [2022-04-08 08:19:24,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:19:24,802 INFO L478 AbstractCegarLoop]: Abstraction has 99 states and 163 transitions. [2022-04-08 08:19:24,802 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:24,802 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 99 states and 163 transitions. [2022-04-08 08:19:24,927 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 163 edges. 163 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:19:24,927 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 163 transitions. [2022-04-08 08:19:24,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-08 08:19:24,928 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:19:24,928 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:19:24,928 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-08 08:19:24,928 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:19:24,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:19:24,929 INFO L85 PathProgramCache]: Analyzing trace with hash 1085061584, now seen corresponding path program 1 times [2022-04-08 08:19:24,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:19:24,929 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [226481620] [2022-04-08 08:19:24,929 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:19:24,929 INFO L85 PathProgramCache]: Analyzing trace with hash 1085061584, now seen corresponding path program 2 times [2022-04-08 08:19:24,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:19:24,929 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998348410] [2022-04-08 08:19:24,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:19:24,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:19:24,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:19:24,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:19:24,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:19:24,976 INFO L290 TraceCheckUtils]: 0: Hoare triple {2615#(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); {2609#true} is VALID [2022-04-08 08:19:24,976 INFO L290 TraceCheckUtils]: 1: Hoare triple {2609#true} assume true; {2609#true} is VALID [2022-04-08 08:19:24,976 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2609#true} {2609#true} #149#return; {2609#true} is VALID [2022-04-08 08:19:24,977 INFO L272 TraceCheckUtils]: 0: Hoare triple {2609#true} call ULTIMATE.init(); {2615#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:19:24,977 INFO L290 TraceCheckUtils]: 1: Hoare triple {2615#(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); {2609#true} is VALID [2022-04-08 08:19:24,977 INFO L290 TraceCheckUtils]: 2: Hoare triple {2609#true} assume true; {2609#true} is VALID [2022-04-08 08:19:24,977 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2609#true} {2609#true} #149#return; {2609#true} is VALID [2022-04-08 08:19:24,978 INFO L272 TraceCheckUtils]: 4: Hoare triple {2609#true} call #t~ret12 := main(); {2609#true} is VALID [2022-04-08 08:19:24,978 INFO L290 TraceCheckUtils]: 5: Hoare triple {2609#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;havoc ~cond~0; {2609#true} is VALID [2022-04-08 08:19:24,978 INFO L290 TraceCheckUtils]: 6: Hoare triple {2609#true} assume !false;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~cond~0 := #t~nondet11;havoc #t~nondet11; {2609#true} is VALID [2022-04-08 08:19:24,978 INFO L290 TraceCheckUtils]: 7: Hoare triple {2609#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0; {2609#true} is VALID [2022-04-08 08:19:24,978 INFO L290 TraceCheckUtils]: 8: Hoare triple {2609#true} assume !(0 != ~p1~0); {2609#true} is VALID [2022-04-08 08:19:24,978 INFO L290 TraceCheckUtils]: 9: Hoare triple {2609#true} assume !(0 != ~p2~0); {2609#true} is VALID [2022-04-08 08:19:24,979 INFO L290 TraceCheckUtils]: 10: Hoare triple {2609#true} assume 0 != ~p3~0;~lk3~0 := 1; {2614#(= main_~lk3~0 1)} is VALID [2022-04-08 08:19:24,979 INFO L290 TraceCheckUtils]: 11: Hoare triple {2614#(= main_~lk3~0 1)} assume 0 != ~p4~0;~lk4~0 := 1; {2614#(= main_~lk3~0 1)} is VALID [2022-04-08 08:19:24,979 INFO L290 TraceCheckUtils]: 12: Hoare triple {2614#(= main_~lk3~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {2614#(= main_~lk3~0 1)} is VALID [2022-04-08 08:19:24,979 INFO L290 TraceCheckUtils]: 13: Hoare triple {2614#(= main_~lk3~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {2614#(= main_~lk3~0 1)} is VALID [2022-04-08 08:19:24,980 INFO L290 TraceCheckUtils]: 14: Hoare triple {2614#(= main_~lk3~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {2614#(= main_~lk3~0 1)} is VALID [2022-04-08 08:19:24,980 INFO L290 TraceCheckUtils]: 15: Hoare triple {2614#(= main_~lk3~0 1)} assume !(0 != ~p1~0); {2614#(= main_~lk3~0 1)} is VALID [2022-04-08 08:19:24,980 INFO L290 TraceCheckUtils]: 16: Hoare triple {2614#(= main_~lk3~0 1)} assume !(0 != ~p2~0); {2614#(= main_~lk3~0 1)} is VALID [2022-04-08 08:19:24,981 INFO L290 TraceCheckUtils]: 17: Hoare triple {2614#(= main_~lk3~0 1)} assume 0 != ~p3~0; {2614#(= main_~lk3~0 1)} is VALID [2022-04-08 08:19:24,981 INFO L290 TraceCheckUtils]: 18: Hoare triple {2614#(= main_~lk3~0 1)} assume 1 != ~lk3~0; {2610#false} is VALID [2022-04-08 08:19:24,981 INFO L290 TraceCheckUtils]: 19: Hoare triple {2610#false} assume !false; {2610#false} is VALID [2022-04-08 08:19:24,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:19:24,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:19:24,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998348410] [2022-04-08 08:19:24,982 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998348410] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:19:24,982 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:19:24,982 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:19:24,982 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:19:24,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [226481620] [2022-04-08 08:19:24,982 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [226481620] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:19:24,982 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:19:24,982 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:19:24,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077747610] [2022-04-08 08:19:24,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:19:24,983 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-08 08:19:24,983 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:19:24,983 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:24,995 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:19:24,996 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:19:24,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:19:24,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:19:24,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:19:24,996 INFO L87 Difference]: Start difference. First operand 99 states and 163 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:25,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:19:25,152 INFO L93 Difference]: Finished difference Result 179 states and 299 transitions. [2022-04-08 08:19:25,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:19:25,152 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-08 08:19:25,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:19:25,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:25,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 87 transitions. [2022-04-08 08:19:25,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:25,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 87 transitions. [2022-04-08 08:19:25,155 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 87 transitions. [2022-04-08 08:19:25,221 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:19:25,225 INFO L225 Difference]: With dead ends: 179 [2022-04-08 08:19:25,225 INFO L226 Difference]: Without dead ends: 177 [2022-04-08 08:19:25,226 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:19:25,228 INFO L913 BasicCegarLoop]: 51 mSDtfsCounter, 103 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 08:19:25,228 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [103 Valid, 58 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 08:19:25,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2022-04-08 08:19:25,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 135. [2022-04-08 08:19:25,248 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:19:25,249 INFO L82 GeneralOperation]: Start isEquivalent. First operand 177 states. Second operand has 135 states, 131 states have (on average 1.6641221374045803) internal successors, (218), 131 states have internal predecessors, (218), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:25,249 INFO L74 IsIncluded]: Start isIncluded. First operand 177 states. Second operand has 135 states, 131 states have (on average 1.6641221374045803) internal successors, (218), 131 states have internal predecessors, (218), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:25,249 INFO L87 Difference]: Start difference. First operand 177 states. Second operand has 135 states, 131 states have (on average 1.6641221374045803) internal successors, (218), 131 states have internal predecessors, (218), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:25,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:19:25,256 INFO L93 Difference]: Finished difference Result 177 states and 294 transitions. [2022-04-08 08:19:25,256 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 294 transitions. [2022-04-08 08:19:25,256 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:19:25,256 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:19:25,257 INFO L74 IsIncluded]: Start isIncluded. First operand has 135 states, 131 states have (on average 1.6641221374045803) internal successors, (218), 131 states have internal predecessors, (218), 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 177 states. [2022-04-08 08:19:25,257 INFO L87 Difference]: Start difference. First operand has 135 states, 131 states have (on average 1.6641221374045803) internal successors, (218), 131 states have internal predecessors, (218), 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 177 states. [2022-04-08 08:19:25,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:19:25,265 INFO L93 Difference]: Finished difference Result 177 states and 294 transitions. [2022-04-08 08:19:25,265 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 294 transitions. [2022-04-08 08:19:25,265 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:19:25,265 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:19:25,266 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:19:25,266 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:19:25,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 131 states have (on average 1.6641221374045803) internal successors, (218), 131 states have internal predecessors, (218), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:25,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 221 transitions. [2022-04-08 08:19:25,271 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 221 transitions. Word has length 20 [2022-04-08 08:19:25,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:19:25,271 INFO L478 AbstractCegarLoop]: Abstraction has 135 states and 221 transitions. [2022-04-08 08:19:25,272 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:25,272 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 135 states and 221 transitions. [2022-04-08 08:19:25,483 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 221 edges. 221 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:19:25,483 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 221 transitions. [2022-04-08 08:19:25,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-08 08:19:25,484 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:19:25,484 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:19:25,484 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-08 08:19:25,484 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:19:25,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:19:25,485 INFO L85 PathProgramCache]: Analyzing trace with hash 692034574, now seen corresponding path program 1 times [2022-04-08 08:19:25,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:19:25,485 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [556708228] [2022-04-08 08:19:25,485 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:19:25,485 INFO L85 PathProgramCache]: Analyzing trace with hash 692034574, now seen corresponding path program 2 times [2022-04-08 08:19:25,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:19:25,486 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853540976] [2022-04-08 08:19:25,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:19:25,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:19:25,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:19:25,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:19:25,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:19:25,523 INFO L290 TraceCheckUtils]: 0: Hoare triple {3609#(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); {3603#true} is VALID [2022-04-08 08:19:25,523 INFO L290 TraceCheckUtils]: 1: Hoare triple {3603#true} assume true; {3603#true} is VALID [2022-04-08 08:19:25,523 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3603#true} {3603#true} #149#return; {3603#true} is VALID [2022-04-08 08:19:25,524 INFO L272 TraceCheckUtils]: 0: Hoare triple {3603#true} call ULTIMATE.init(); {3609#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:19:25,524 INFO L290 TraceCheckUtils]: 1: Hoare triple {3609#(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); {3603#true} is VALID [2022-04-08 08:19:25,524 INFO L290 TraceCheckUtils]: 2: Hoare triple {3603#true} assume true; {3603#true} is VALID [2022-04-08 08:19:25,524 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3603#true} {3603#true} #149#return; {3603#true} is VALID [2022-04-08 08:19:25,525 INFO L272 TraceCheckUtils]: 4: Hoare triple {3603#true} call #t~ret12 := main(); {3603#true} is VALID [2022-04-08 08:19:25,525 INFO L290 TraceCheckUtils]: 5: Hoare triple {3603#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;havoc ~cond~0; {3603#true} is VALID [2022-04-08 08:19:25,525 INFO L290 TraceCheckUtils]: 6: Hoare triple {3603#true} assume !false;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~cond~0 := #t~nondet11;havoc #t~nondet11; {3603#true} is VALID [2022-04-08 08:19:25,525 INFO L290 TraceCheckUtils]: 7: Hoare triple {3603#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0; {3603#true} is VALID [2022-04-08 08:19:25,525 INFO L290 TraceCheckUtils]: 8: Hoare triple {3603#true} assume !(0 != ~p1~0); {3603#true} is VALID [2022-04-08 08:19:25,525 INFO L290 TraceCheckUtils]: 9: Hoare triple {3603#true} assume !(0 != ~p2~0); {3603#true} is VALID [2022-04-08 08:19:25,526 INFO L290 TraceCheckUtils]: 10: Hoare triple {3603#true} assume !(0 != ~p3~0); {3608#(= main_~p3~0 0)} is VALID [2022-04-08 08:19:25,526 INFO L290 TraceCheckUtils]: 11: Hoare triple {3608#(= main_~p3~0 0)} assume 0 != ~p4~0;~lk4~0 := 1; {3608#(= main_~p3~0 0)} is VALID [2022-04-08 08:19:25,527 INFO L290 TraceCheckUtils]: 12: Hoare triple {3608#(= main_~p3~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {3608#(= main_~p3~0 0)} is VALID [2022-04-08 08:19:25,527 INFO L290 TraceCheckUtils]: 13: Hoare triple {3608#(= main_~p3~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {3608#(= main_~p3~0 0)} is VALID [2022-04-08 08:19:25,527 INFO L290 TraceCheckUtils]: 14: Hoare triple {3608#(= main_~p3~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {3608#(= main_~p3~0 0)} is VALID [2022-04-08 08:19:25,528 INFO L290 TraceCheckUtils]: 15: Hoare triple {3608#(= main_~p3~0 0)} assume !(0 != ~p1~0); {3608#(= main_~p3~0 0)} is VALID [2022-04-08 08:19:25,528 INFO L290 TraceCheckUtils]: 16: Hoare triple {3608#(= main_~p3~0 0)} assume !(0 != ~p2~0); {3608#(= main_~p3~0 0)} is VALID [2022-04-08 08:19:25,528 INFO L290 TraceCheckUtils]: 17: Hoare triple {3608#(= main_~p3~0 0)} assume 0 != ~p3~0; {3604#false} is VALID [2022-04-08 08:19:25,528 INFO L290 TraceCheckUtils]: 18: Hoare triple {3604#false} assume 1 != ~lk3~0; {3604#false} is VALID [2022-04-08 08:19:25,529 INFO L290 TraceCheckUtils]: 19: Hoare triple {3604#false} assume !false; {3604#false} is VALID [2022-04-08 08:19:25,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:19:25,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:19:25,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853540976] [2022-04-08 08:19:25,529 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853540976] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:19:25,529 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:19:25,529 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:19:25,530 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:19:25,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [556708228] [2022-04-08 08:19:25,530 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [556708228] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:19:25,530 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:19:25,530 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:19:25,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387250349] [2022-04-08 08:19:25,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:19:25,531 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-08 08:19:25,531 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:19:25,531 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:25,559 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:19:25,559 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:19:25,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:19:25,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:19:25,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:19:25,560 INFO L87 Difference]: Start difference. First operand 135 states and 221 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:25,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:19:25,677 INFO L93 Difference]: Finished difference Result 311 states and 515 transitions. [2022-04-08 08:19:25,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:19:25,677 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-08 08:19:25,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:19:25,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:25,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 132 transitions. [2022-04-08 08:19:25,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:25,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 132 transitions. [2022-04-08 08:19:25,680 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 132 transitions. [2022-04-08 08:19:25,754 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 132 edges. 132 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:19:25,756 INFO L225 Difference]: With dead ends: 311 [2022-04-08 08:19:25,757 INFO L226 Difference]: Without dead ends: 185 [2022-04-08 08:19:25,757 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:19:25,758 INFO L913 BasicCegarLoop]: 68 mSDtfsCounter, 91 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 08:19:25,758 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [91 Valid, 75 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 08:19:25,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2022-04-08 08:19:25,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 183. [2022-04-08 08:19:25,769 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:19:25,769 INFO L82 GeneralOperation]: Start isEquivalent. First operand 185 states. Second operand has 183 states, 179 states have (on average 1.6312849162011174) internal successors, (292), 179 states have internal predecessors, (292), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:25,769 INFO L74 IsIncluded]: Start isIncluded. First operand 185 states. Second operand has 183 states, 179 states have (on average 1.6312849162011174) internal successors, (292), 179 states have internal predecessors, (292), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:25,770 INFO L87 Difference]: Start difference. First operand 185 states. Second operand has 183 states, 179 states have (on average 1.6312849162011174) internal successors, (292), 179 states have internal predecessors, (292), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:25,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:19:25,773 INFO L93 Difference]: Finished difference Result 185 states and 296 transitions. [2022-04-08 08:19:25,773 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 296 transitions. [2022-04-08 08:19:25,773 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:19:25,773 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:19:25,774 INFO L74 IsIncluded]: Start isIncluded. First operand has 183 states, 179 states have (on average 1.6312849162011174) internal successors, (292), 179 states have internal predecessors, (292), 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 185 states. [2022-04-08 08:19:25,774 INFO L87 Difference]: Start difference. First operand has 183 states, 179 states have (on average 1.6312849162011174) internal successors, (292), 179 states have internal predecessors, (292), 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 185 states. [2022-04-08 08:19:25,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:19:25,778 INFO L93 Difference]: Finished difference Result 185 states and 296 transitions. [2022-04-08 08:19:25,778 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 296 transitions. [2022-04-08 08:19:25,778 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:19:25,778 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:19:25,778 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:19:25,778 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:19:25,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 179 states have (on average 1.6312849162011174) internal successors, (292), 179 states have internal predecessors, (292), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:25,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 295 transitions. [2022-04-08 08:19:25,782 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 295 transitions. Word has length 20 [2022-04-08 08:19:25,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:19:25,782 INFO L478 AbstractCegarLoop]: Abstraction has 183 states and 295 transitions. [2022-04-08 08:19:25,782 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:25,782 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 183 states and 295 transitions. [2022-04-08 08:19:26,050 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 295 edges. 295 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:19:26,050 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 295 transitions. [2022-04-08 08:19:26,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-08 08:19:26,051 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:19:26,051 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:19:26,051 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-08 08:19:26,051 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:19:26,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:19:26,052 INFO L85 PathProgramCache]: Analyzing trace with hash -722614227, now seen corresponding path program 1 times [2022-04-08 08:19:26,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:19:26,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [491669828] [2022-04-08 08:19:26,052 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:19:26,052 INFO L85 PathProgramCache]: Analyzing trace with hash -722614227, now seen corresponding path program 2 times [2022-04-08 08:19:26,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:19:26,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364233712] [2022-04-08 08:19:26,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:19:26,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:19:26,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:19:26,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:19:26,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:19:26,089 INFO L290 TraceCheckUtils]: 0: Hoare triple {4979#(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); {4973#true} is VALID [2022-04-08 08:19:26,089 INFO L290 TraceCheckUtils]: 1: Hoare triple {4973#true} assume true; {4973#true} is VALID [2022-04-08 08:19:26,089 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4973#true} {4973#true} #149#return; {4973#true} is VALID [2022-04-08 08:19:26,090 INFO L272 TraceCheckUtils]: 0: Hoare triple {4973#true} call ULTIMATE.init(); {4979#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:19:26,090 INFO L290 TraceCheckUtils]: 1: Hoare triple {4979#(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); {4973#true} is VALID [2022-04-08 08:19:26,090 INFO L290 TraceCheckUtils]: 2: Hoare triple {4973#true} assume true; {4973#true} is VALID [2022-04-08 08:19:26,090 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4973#true} {4973#true} #149#return; {4973#true} is VALID [2022-04-08 08:19:26,090 INFO L272 TraceCheckUtils]: 4: Hoare triple {4973#true} call #t~ret12 := main(); {4973#true} is VALID [2022-04-08 08:19:26,090 INFO L290 TraceCheckUtils]: 5: Hoare triple {4973#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;havoc ~cond~0; {4973#true} is VALID [2022-04-08 08:19:26,090 INFO L290 TraceCheckUtils]: 6: Hoare triple {4973#true} assume !false;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~cond~0 := #t~nondet11;havoc #t~nondet11; {4973#true} is VALID [2022-04-08 08:19:26,090 INFO L290 TraceCheckUtils]: 7: Hoare triple {4973#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0; {4973#true} is VALID [2022-04-08 08:19:26,091 INFO L290 TraceCheckUtils]: 8: Hoare triple {4973#true} assume !(0 != ~p1~0); {4973#true} is VALID [2022-04-08 08:19:26,091 INFO L290 TraceCheckUtils]: 9: Hoare triple {4973#true} assume !(0 != ~p2~0); {4973#true} is VALID [2022-04-08 08:19:26,091 INFO L290 TraceCheckUtils]: 10: Hoare triple {4973#true} assume 0 != ~p3~0;~lk3~0 := 1; {4978#(not (= main_~p3~0 0))} is VALID [2022-04-08 08:19:26,091 INFO L290 TraceCheckUtils]: 11: Hoare triple {4978#(not (= main_~p3~0 0))} assume 0 != ~p4~0;~lk4~0 := 1; {4978#(not (= main_~p3~0 0))} is VALID [2022-04-08 08:19:26,092 INFO L290 TraceCheckUtils]: 12: Hoare triple {4978#(not (= main_~p3~0 0))} assume 0 != ~p5~0;~lk5~0 := 1; {4978#(not (= main_~p3~0 0))} is VALID [2022-04-08 08:19:26,092 INFO L290 TraceCheckUtils]: 13: Hoare triple {4978#(not (= main_~p3~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {4978#(not (= main_~p3~0 0))} is VALID [2022-04-08 08:19:26,098 INFO L290 TraceCheckUtils]: 14: Hoare triple {4978#(not (= main_~p3~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {4978#(not (= main_~p3~0 0))} is VALID [2022-04-08 08:19:26,099 INFO L290 TraceCheckUtils]: 15: Hoare triple {4978#(not (= main_~p3~0 0))} assume !(0 != ~p1~0); {4978#(not (= main_~p3~0 0))} is VALID [2022-04-08 08:19:26,100 INFO L290 TraceCheckUtils]: 16: Hoare triple {4978#(not (= main_~p3~0 0))} assume !(0 != ~p2~0); {4978#(not (= main_~p3~0 0))} is VALID [2022-04-08 08:19:26,100 INFO L290 TraceCheckUtils]: 17: Hoare triple {4978#(not (= main_~p3~0 0))} assume !(0 != ~p3~0); {4974#false} is VALID [2022-04-08 08:19:26,100 INFO L290 TraceCheckUtils]: 18: Hoare triple {4974#false} assume 0 != ~p4~0; {4974#false} is VALID [2022-04-08 08:19:26,100 INFO L290 TraceCheckUtils]: 19: Hoare triple {4974#false} assume 1 != ~lk4~0; {4974#false} is VALID [2022-04-08 08:19:26,100 INFO L290 TraceCheckUtils]: 20: Hoare triple {4974#false} assume !false; {4974#false} is VALID [2022-04-08 08:19:26,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:19:26,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:19:26,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364233712] [2022-04-08 08:19:26,101 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364233712] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:19:26,101 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:19:26,101 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:19:26,101 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:19:26,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [491669828] [2022-04-08 08:19:26,101 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [491669828] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:19:26,101 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:19:26,101 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:19:26,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457856764] [2022-04-08 08:19:26,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:19:26,102 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-08 08:19:26,102 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:19:26,102 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:26,114 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:19:26,114 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:19:26,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:19:26,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:19:26,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:19:26,115 INFO L87 Difference]: Start difference. First operand 183 states and 295 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:26,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:19:26,225 INFO L93 Difference]: Finished difference Result 277 states and 445 transitions. [2022-04-08 08:19:26,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:19:26,225 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-08 08:19:26,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:19:26,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:26,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 127 transitions. [2022-04-08 08:19:26,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:26,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 127 transitions. [2022-04-08 08:19:26,228 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 127 transitions. [2022-04-08 08:19:26,301 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 127 edges. 127 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:19:26,304 INFO L225 Difference]: With dead ends: 277 [2022-04-08 08:19:26,304 INFO L226 Difference]: Without dead ends: 191 [2022-04-08 08:19:26,304 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:19:26,304 INFO L913 BasicCegarLoop]: 70 mSDtfsCounter, 90 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 08:19:26,305 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [90 Valid, 77 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 08:19:26,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2022-04-08 08:19:26,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 189. [2022-04-08 08:19:26,314 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:19:26,314 INFO L82 GeneralOperation]: Start isEquivalent. First operand 191 states. Second operand has 189 states, 185 states have (on average 1.6) internal successors, (296), 185 states have internal predecessors, (296), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:26,314 INFO L74 IsIncluded]: Start isIncluded. First operand 191 states. Second operand has 189 states, 185 states have (on average 1.6) internal successors, (296), 185 states have internal predecessors, (296), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:26,315 INFO L87 Difference]: Start difference. First operand 191 states. Second operand has 189 states, 185 states have (on average 1.6) internal successors, (296), 185 states have internal predecessors, (296), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:26,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:19:26,319 INFO L93 Difference]: Finished difference Result 191 states and 300 transitions. [2022-04-08 08:19:26,319 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 300 transitions. [2022-04-08 08:19:26,319 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:19:26,319 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:19:26,319 INFO L74 IsIncluded]: Start isIncluded. First operand has 189 states, 185 states have (on average 1.6) internal successors, (296), 185 states have internal predecessors, (296), 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 191 states. [2022-04-08 08:19:26,320 INFO L87 Difference]: Start difference. First operand has 189 states, 185 states have (on average 1.6) internal successors, (296), 185 states have internal predecessors, (296), 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 191 states. [2022-04-08 08:19:26,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:19:26,329 INFO L93 Difference]: Finished difference Result 191 states and 300 transitions. [2022-04-08 08:19:26,329 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 300 transitions. [2022-04-08 08:19:26,329 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:19:26,329 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:19:26,329 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:19:26,329 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:19:26,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 185 states have (on average 1.6) internal successors, (296), 185 states have internal predecessors, (296), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:26,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 299 transitions. [2022-04-08 08:19:26,333 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 299 transitions. Word has length 21 [2022-04-08 08:19:26,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:19:26,333 INFO L478 AbstractCegarLoop]: Abstraction has 189 states and 299 transitions. [2022-04-08 08:19:26,333 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:26,333 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 189 states and 299 transitions. [2022-04-08 08:19:26,612 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 299 edges. 299 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:19:26,613 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 299 transitions. [2022-04-08 08:19:26,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-08 08:19:26,613 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:19:26,613 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:19:26,613 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-08 08:19:26,613 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:19:26,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:19:26,614 INFO L85 PathProgramCache]: Analyzing trace with hash -21549649, now seen corresponding path program 1 times [2022-04-08 08:19:26,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:19:26,614 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1859952451] [2022-04-08 08:19:26,614 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:19:26,614 INFO L85 PathProgramCache]: Analyzing trace with hash -21549649, now seen corresponding path program 2 times [2022-04-08 08:19:26,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:19:26,614 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268017420] [2022-04-08 08:19:26,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:19:26,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:19:26,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:19:26,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:19:26,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:19:26,642 INFO L290 TraceCheckUtils]: 0: Hoare triple {6305#(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); {6299#true} is VALID [2022-04-08 08:19:26,642 INFO L290 TraceCheckUtils]: 1: Hoare triple {6299#true} assume true; {6299#true} is VALID [2022-04-08 08:19:26,642 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6299#true} {6299#true} #149#return; {6299#true} is VALID [2022-04-08 08:19:26,643 INFO L272 TraceCheckUtils]: 0: Hoare triple {6299#true} call ULTIMATE.init(); {6305#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:19:26,643 INFO L290 TraceCheckUtils]: 1: Hoare triple {6305#(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); {6299#true} is VALID [2022-04-08 08:19:26,643 INFO L290 TraceCheckUtils]: 2: Hoare triple {6299#true} assume true; {6299#true} is VALID [2022-04-08 08:19:26,643 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6299#true} {6299#true} #149#return; {6299#true} is VALID [2022-04-08 08:19:26,643 INFO L272 TraceCheckUtils]: 4: Hoare triple {6299#true} call #t~ret12 := main(); {6299#true} is VALID [2022-04-08 08:19:26,643 INFO L290 TraceCheckUtils]: 5: Hoare triple {6299#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;havoc ~cond~0; {6299#true} is VALID [2022-04-08 08:19:26,643 INFO L290 TraceCheckUtils]: 6: Hoare triple {6299#true} assume !false;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~cond~0 := #t~nondet11;havoc #t~nondet11; {6299#true} is VALID [2022-04-08 08:19:26,643 INFO L290 TraceCheckUtils]: 7: Hoare triple {6299#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0; {6299#true} is VALID [2022-04-08 08:19:26,644 INFO L290 TraceCheckUtils]: 8: Hoare triple {6299#true} assume !(0 != ~p1~0); {6299#true} is VALID [2022-04-08 08:19:26,644 INFO L290 TraceCheckUtils]: 9: Hoare triple {6299#true} assume !(0 != ~p2~0); {6299#true} is VALID [2022-04-08 08:19:26,644 INFO L290 TraceCheckUtils]: 10: Hoare triple {6299#true} assume !(0 != ~p3~0); {6299#true} is VALID [2022-04-08 08:19:26,644 INFO L290 TraceCheckUtils]: 11: Hoare triple {6299#true} assume 0 != ~p4~0;~lk4~0 := 1; {6304#(= main_~lk4~0 1)} is VALID [2022-04-08 08:19:26,644 INFO L290 TraceCheckUtils]: 12: Hoare triple {6304#(= main_~lk4~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {6304#(= main_~lk4~0 1)} is VALID [2022-04-08 08:19:26,645 INFO L290 TraceCheckUtils]: 13: Hoare triple {6304#(= main_~lk4~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {6304#(= main_~lk4~0 1)} is VALID [2022-04-08 08:19:26,645 INFO L290 TraceCheckUtils]: 14: Hoare triple {6304#(= main_~lk4~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {6304#(= main_~lk4~0 1)} is VALID [2022-04-08 08:19:26,645 INFO L290 TraceCheckUtils]: 15: Hoare triple {6304#(= main_~lk4~0 1)} assume !(0 != ~p1~0); {6304#(= main_~lk4~0 1)} is VALID [2022-04-08 08:19:26,645 INFO L290 TraceCheckUtils]: 16: Hoare triple {6304#(= main_~lk4~0 1)} assume !(0 != ~p2~0); {6304#(= main_~lk4~0 1)} is VALID [2022-04-08 08:19:26,646 INFO L290 TraceCheckUtils]: 17: Hoare triple {6304#(= main_~lk4~0 1)} assume !(0 != ~p3~0); {6304#(= main_~lk4~0 1)} is VALID [2022-04-08 08:19:26,646 INFO L290 TraceCheckUtils]: 18: Hoare triple {6304#(= main_~lk4~0 1)} assume 0 != ~p4~0; {6304#(= main_~lk4~0 1)} is VALID [2022-04-08 08:19:26,646 INFO L290 TraceCheckUtils]: 19: Hoare triple {6304#(= main_~lk4~0 1)} assume 1 != ~lk4~0; {6300#false} is VALID [2022-04-08 08:19:26,646 INFO L290 TraceCheckUtils]: 20: Hoare triple {6300#false} assume !false; {6300#false} is VALID [2022-04-08 08:19:26,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:19:26,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:19:26,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268017420] [2022-04-08 08:19:26,647 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268017420] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:19:26,647 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:19:26,647 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:19:26,647 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:19:26,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1859952451] [2022-04-08 08:19:26,647 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1859952451] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:19:26,647 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:19:26,647 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:19:26,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876756746] [2022-04-08 08:19:26,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:19:26,648 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-08 08:19:26,648 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:19:26,648 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:26,658 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:19:26,658 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:19:26,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:19:26,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:19:26,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:19:26,659 INFO L87 Difference]: Start difference. First operand 189 states and 299 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:26,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:19:26,760 INFO L93 Difference]: Finished difference Result 333 states and 533 transitions. [2022-04-08 08:19:26,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:19:26,761 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-08 08:19:26,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:19:26,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:26,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 83 transitions. [2022-04-08 08:19:26,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:26,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 83 transitions. [2022-04-08 08:19:26,762 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 83 transitions. [2022-04-08 08:19:26,810 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:19:26,815 INFO L225 Difference]: With dead ends: 333 [2022-04-08 08:19:26,815 INFO L226 Difference]: Without dead ends: 331 [2022-04-08 08:19:26,815 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:19:26,816 INFO L913 BasicCegarLoop]: 50 mSDtfsCounter, 96 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 08:19:26,816 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [96 Valid, 57 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 08:19:26,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2022-04-08 08:19:26,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 265. [2022-04-08 08:19:26,829 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:19:26,829 INFO L82 GeneralOperation]: Start isEquivalent. First operand 331 states. Second operand has 265 states, 261 states have (on average 1.5632183908045978) internal successors, (408), 261 states have internal predecessors, (408), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:26,830 INFO L74 IsIncluded]: Start isIncluded. First operand 331 states. Second operand has 265 states, 261 states have (on average 1.5632183908045978) internal successors, (408), 261 states have internal predecessors, (408), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:26,830 INFO L87 Difference]: Start difference. First operand 331 states. Second operand has 265 states, 261 states have (on average 1.5632183908045978) internal successors, (408), 261 states have internal predecessors, (408), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:26,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:19:26,841 INFO L93 Difference]: Finished difference Result 331 states and 524 transitions. [2022-04-08 08:19:26,841 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 524 transitions. [2022-04-08 08:19:26,842 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:19:26,842 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:19:26,842 INFO L74 IsIncluded]: Start isIncluded. First operand has 265 states, 261 states have (on average 1.5632183908045978) internal successors, (408), 261 states have internal predecessors, (408), 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 331 states. [2022-04-08 08:19:26,843 INFO L87 Difference]: Start difference. First operand has 265 states, 261 states have (on average 1.5632183908045978) internal successors, (408), 261 states have internal predecessors, (408), 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 331 states. [2022-04-08 08:19:26,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:19:26,848 INFO L93 Difference]: Finished difference Result 331 states and 524 transitions. [2022-04-08 08:19:26,848 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 524 transitions. [2022-04-08 08:19:26,849 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:19:26,849 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:19:26,849 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:19:26,849 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:19:26,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 261 states have (on average 1.5632183908045978) internal successors, (408), 261 states have internal predecessors, (408), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:26,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 411 transitions. [2022-04-08 08:19:26,854 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 411 transitions. Word has length 21 [2022-04-08 08:19:26,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:19:26,854 INFO L478 AbstractCegarLoop]: Abstraction has 265 states and 411 transitions. [2022-04-08 08:19:26,854 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:26,854 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 265 states and 411 transitions. [2022-04-08 08:19:27,216 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 411 edges. 411 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:19:27,216 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 411 transitions. [2022-04-08 08:19:27,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-08 08:19:27,217 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:19:27,217 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:19:27,217 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-08 08:19:27,218 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:19:27,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:19:27,219 INFO L85 PathProgramCache]: Analyzing trace with hash -414576659, now seen corresponding path program 1 times [2022-04-08 08:19:27,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:19:27,219 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [233690556] [2022-04-08 08:19:27,219 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:19:27,219 INFO L85 PathProgramCache]: Analyzing trace with hash -414576659, now seen corresponding path program 2 times [2022-04-08 08:19:27,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:19:27,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909542980] [2022-04-08 08:19:27,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:19:27,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:19:27,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:19:27,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:19:27,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:19:27,273 INFO L290 TraceCheckUtils]: 0: Hoare triple {8175#(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); {8169#true} is VALID [2022-04-08 08:19:27,274 INFO L290 TraceCheckUtils]: 1: Hoare triple {8169#true} assume true; {8169#true} is VALID [2022-04-08 08:19:27,274 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8169#true} {8169#true} #149#return; {8169#true} is VALID [2022-04-08 08:19:27,275 INFO L272 TraceCheckUtils]: 0: Hoare triple {8169#true} call ULTIMATE.init(); {8175#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:19:27,275 INFO L290 TraceCheckUtils]: 1: Hoare triple {8175#(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); {8169#true} is VALID [2022-04-08 08:19:27,275 INFO L290 TraceCheckUtils]: 2: Hoare triple {8169#true} assume true; {8169#true} is VALID [2022-04-08 08:19:27,276 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8169#true} {8169#true} #149#return; {8169#true} is VALID [2022-04-08 08:19:27,276 INFO L272 TraceCheckUtils]: 4: Hoare triple {8169#true} call #t~ret12 := main(); {8169#true} is VALID [2022-04-08 08:19:27,276 INFO L290 TraceCheckUtils]: 5: Hoare triple {8169#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;havoc ~cond~0; {8169#true} is VALID [2022-04-08 08:19:27,276 INFO L290 TraceCheckUtils]: 6: Hoare triple {8169#true} assume !false;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~cond~0 := #t~nondet11;havoc #t~nondet11; {8169#true} is VALID [2022-04-08 08:19:27,276 INFO L290 TraceCheckUtils]: 7: Hoare triple {8169#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0; {8169#true} is VALID [2022-04-08 08:19:27,276 INFO L290 TraceCheckUtils]: 8: Hoare triple {8169#true} assume !(0 != ~p1~0); {8169#true} is VALID [2022-04-08 08:19:27,276 INFO L290 TraceCheckUtils]: 9: Hoare triple {8169#true} assume !(0 != ~p2~0); {8169#true} is VALID [2022-04-08 08:19:27,277 INFO L290 TraceCheckUtils]: 10: Hoare triple {8169#true} assume !(0 != ~p3~0); {8169#true} is VALID [2022-04-08 08:19:27,286 INFO L290 TraceCheckUtils]: 11: Hoare triple {8169#true} assume !(0 != ~p4~0); {8174#(= main_~p4~0 0)} is VALID [2022-04-08 08:19:27,287 INFO L290 TraceCheckUtils]: 12: Hoare triple {8174#(= main_~p4~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {8174#(= main_~p4~0 0)} is VALID [2022-04-08 08:19:27,287 INFO L290 TraceCheckUtils]: 13: Hoare triple {8174#(= main_~p4~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {8174#(= main_~p4~0 0)} is VALID [2022-04-08 08:19:27,287 INFO L290 TraceCheckUtils]: 14: Hoare triple {8174#(= main_~p4~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {8174#(= main_~p4~0 0)} is VALID [2022-04-08 08:19:27,288 INFO L290 TraceCheckUtils]: 15: Hoare triple {8174#(= main_~p4~0 0)} assume !(0 != ~p1~0); {8174#(= main_~p4~0 0)} is VALID [2022-04-08 08:19:27,288 INFO L290 TraceCheckUtils]: 16: Hoare triple {8174#(= main_~p4~0 0)} assume !(0 != ~p2~0); {8174#(= main_~p4~0 0)} is VALID [2022-04-08 08:19:27,288 INFO L290 TraceCheckUtils]: 17: Hoare triple {8174#(= main_~p4~0 0)} assume !(0 != ~p3~0); {8174#(= main_~p4~0 0)} is VALID [2022-04-08 08:19:27,289 INFO L290 TraceCheckUtils]: 18: Hoare triple {8174#(= main_~p4~0 0)} assume 0 != ~p4~0; {8170#false} is VALID [2022-04-08 08:19:27,289 INFO L290 TraceCheckUtils]: 19: Hoare triple {8170#false} assume 1 != ~lk4~0; {8170#false} is VALID [2022-04-08 08:19:27,289 INFO L290 TraceCheckUtils]: 20: Hoare triple {8170#false} assume !false; {8170#false} is VALID [2022-04-08 08:19:27,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:19:27,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:19:27,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909542980] [2022-04-08 08:19:27,290 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909542980] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:19:27,290 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:19:27,290 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:19:27,290 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:19:27,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [233690556] [2022-04-08 08:19:27,291 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [233690556] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:19:27,291 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:19:27,291 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:19:27,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495074636] [2022-04-08 08:19:27,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:19:27,291 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-08 08:19:27,292 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:19:27,292 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:27,304 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:19:27,304 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:19:27,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:19:27,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:19:27,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:19:27,305 INFO L87 Difference]: Start difference. First operand 265 states and 411 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:27,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:19:27,439 INFO L93 Difference]: Finished difference Result 605 states and 941 transitions. [2022-04-08 08:19:27,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:19:27,440 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-08 08:19:27,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:19:27,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:27,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 129 transitions. [2022-04-08 08:19:27,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:27,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 129 transitions. [2022-04-08 08:19:27,442 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 129 transitions. [2022-04-08 08:19:27,514 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 129 edges. 129 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:19:27,520 INFO L225 Difference]: With dead ends: 605 [2022-04-08 08:19:27,520 INFO L226 Difference]: Without dead ends: 355 [2022-04-08 08:19:27,521 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:19:27,521 INFO L913 BasicCegarLoop]: 70 mSDtfsCounter, 85 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 08:19:27,522 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [85 Valid, 77 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 08:19:27,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2022-04-08 08:19:27,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 353. [2022-04-08 08:19:27,560 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:19:27,560 INFO L82 GeneralOperation]: Start isEquivalent. First operand 355 states. Second operand has 353 states, 349 states have (on average 1.524355300859599) internal successors, (532), 349 states have internal predecessors, (532), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:27,561 INFO L74 IsIncluded]: Start isIncluded. First operand 355 states. Second operand has 353 states, 349 states have (on average 1.524355300859599) internal successors, (532), 349 states have internal predecessors, (532), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:27,561 INFO L87 Difference]: Start difference. First operand 355 states. Second operand has 353 states, 349 states have (on average 1.524355300859599) internal successors, (532), 349 states have internal predecessors, (532), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:27,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:19:27,567 INFO L93 Difference]: Finished difference Result 355 states and 536 transitions. [2022-04-08 08:19:27,567 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 536 transitions. [2022-04-08 08:19:27,568 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:19:27,568 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:19:27,568 INFO L74 IsIncluded]: Start isIncluded. First operand has 353 states, 349 states have (on average 1.524355300859599) internal successors, (532), 349 states have internal predecessors, (532), 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 355 states. [2022-04-08 08:19:27,569 INFO L87 Difference]: Start difference. First operand has 353 states, 349 states have (on average 1.524355300859599) internal successors, (532), 349 states have internal predecessors, (532), 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 355 states. [2022-04-08 08:19:27,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:19:27,574 INFO L93 Difference]: Finished difference Result 355 states and 536 transitions. [2022-04-08 08:19:27,575 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 536 transitions. [2022-04-08 08:19:27,591 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:19:27,591 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:19:27,591 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:19:27,591 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:19:27,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 349 states have (on average 1.524355300859599) internal successors, (532), 349 states have internal predecessors, (532), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:27,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 535 transitions. [2022-04-08 08:19:27,598 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 535 transitions. Word has length 21 [2022-04-08 08:19:27,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:19:27,599 INFO L478 AbstractCegarLoop]: Abstraction has 353 states and 535 transitions. [2022-04-08 08:19:27,599 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:27,599 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 353 states and 535 transitions. [2022-04-08 08:19:28,106 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 535 edges. 535 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:19:28,107 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 535 transitions. [2022-04-08 08:19:28,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-08 08:19:28,107 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:19:28,107 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:19:28,108 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-08 08:19:28,108 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:19:28,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:19:28,108 INFO L85 PathProgramCache]: Analyzing trace with hash -667823741, now seen corresponding path program 1 times [2022-04-08 08:19:28,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:19:28,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1691417703] [2022-04-08 08:19:28,109 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:19:28,109 INFO L85 PathProgramCache]: Analyzing trace with hash -667823741, now seen corresponding path program 2 times [2022-04-08 08:19:28,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:19:28,109 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352379116] [2022-04-08 08:19:28,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:19:28,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:19:28,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:19:28,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:19:28,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:19:28,186 INFO L290 TraceCheckUtils]: 0: Hoare triple {10813#(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); {10807#true} is VALID [2022-04-08 08:19:28,186 INFO L290 TraceCheckUtils]: 1: Hoare triple {10807#true} assume true; {10807#true} is VALID [2022-04-08 08:19:28,187 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10807#true} {10807#true} #149#return; {10807#true} is VALID [2022-04-08 08:19:28,187 INFO L272 TraceCheckUtils]: 0: Hoare triple {10807#true} call ULTIMATE.init(); {10813#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:19:28,187 INFO L290 TraceCheckUtils]: 1: Hoare triple {10813#(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); {10807#true} is VALID [2022-04-08 08:19:28,188 INFO L290 TraceCheckUtils]: 2: Hoare triple {10807#true} assume true; {10807#true} is VALID [2022-04-08 08:19:28,188 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10807#true} {10807#true} #149#return; {10807#true} is VALID [2022-04-08 08:19:28,188 INFO L272 TraceCheckUtils]: 4: Hoare triple {10807#true} call #t~ret12 := main(); {10807#true} is VALID [2022-04-08 08:19:28,189 INFO L290 TraceCheckUtils]: 5: Hoare triple {10807#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;havoc ~cond~0; {10807#true} is VALID [2022-04-08 08:19:28,189 INFO L290 TraceCheckUtils]: 6: Hoare triple {10807#true} assume !false;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~cond~0 := #t~nondet11;havoc #t~nondet11; {10807#true} is VALID [2022-04-08 08:19:28,189 INFO L290 TraceCheckUtils]: 7: Hoare triple {10807#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0; {10807#true} is VALID [2022-04-08 08:19:28,189 INFO L290 TraceCheckUtils]: 8: Hoare triple {10807#true} assume !(0 != ~p1~0); {10807#true} is VALID [2022-04-08 08:19:28,189 INFO L290 TraceCheckUtils]: 9: Hoare triple {10807#true} assume !(0 != ~p2~0); {10807#true} is VALID [2022-04-08 08:19:28,189 INFO L290 TraceCheckUtils]: 10: Hoare triple {10807#true} assume !(0 != ~p3~0); {10807#true} is VALID [2022-04-08 08:19:28,190 INFO L290 TraceCheckUtils]: 11: Hoare triple {10807#true} assume 0 != ~p4~0;~lk4~0 := 1; {10812#(not (= main_~p4~0 0))} is VALID [2022-04-08 08:19:28,190 INFO L290 TraceCheckUtils]: 12: Hoare triple {10812#(not (= main_~p4~0 0))} assume 0 != ~p5~0;~lk5~0 := 1; {10812#(not (= main_~p4~0 0))} is VALID [2022-04-08 08:19:28,191 INFO L290 TraceCheckUtils]: 13: Hoare triple {10812#(not (= main_~p4~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {10812#(not (= main_~p4~0 0))} is VALID [2022-04-08 08:19:28,207 INFO L290 TraceCheckUtils]: 14: Hoare triple {10812#(not (= main_~p4~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {10812#(not (= main_~p4~0 0))} is VALID [2022-04-08 08:19:28,208 INFO L290 TraceCheckUtils]: 15: Hoare triple {10812#(not (= main_~p4~0 0))} assume !(0 != ~p1~0); {10812#(not (= main_~p4~0 0))} is VALID [2022-04-08 08:19:28,208 INFO L290 TraceCheckUtils]: 16: Hoare triple {10812#(not (= main_~p4~0 0))} assume !(0 != ~p2~0); {10812#(not (= main_~p4~0 0))} is VALID [2022-04-08 08:19:28,208 INFO L290 TraceCheckUtils]: 17: Hoare triple {10812#(not (= main_~p4~0 0))} assume !(0 != ~p3~0); {10812#(not (= main_~p4~0 0))} is VALID [2022-04-08 08:19:28,209 INFO L290 TraceCheckUtils]: 18: Hoare triple {10812#(not (= main_~p4~0 0))} assume !(0 != ~p4~0); {10808#false} is VALID [2022-04-08 08:19:28,209 INFO L290 TraceCheckUtils]: 19: Hoare triple {10808#false} assume 0 != ~p5~0; {10808#false} is VALID [2022-04-08 08:19:28,209 INFO L290 TraceCheckUtils]: 20: Hoare triple {10808#false} assume 1 != ~lk5~0; {10808#false} is VALID [2022-04-08 08:19:28,209 INFO L290 TraceCheckUtils]: 21: Hoare triple {10808#false} assume !false; {10808#false} is VALID [2022-04-08 08:19:28,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:19:28,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:19:28,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352379116] [2022-04-08 08:19:28,210 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352379116] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:19:28,210 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:19:28,210 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:19:28,210 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:19:28,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1691417703] [2022-04-08 08:19:28,210 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1691417703] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:19:28,210 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:19:28,210 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:19:28,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683428379] [2022-04-08 08:19:28,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:19:28,211 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-08 08:19:28,211 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:19:28,211 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:28,223 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:19:28,224 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:19:28,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:19:28,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:19:28,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:19:28,224 INFO L87 Difference]: Start difference. First operand 353 states and 535 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:28,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:19:28,368 INFO L93 Difference]: Finished difference Result 529 states and 797 transitions. [2022-04-08 08:19:28,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:19:28,369 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-08 08:19:28,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:19:28,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:28,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 124 transitions. [2022-04-08 08:19:28,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:28,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 124 transitions. [2022-04-08 08:19:28,377 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 124 transitions. [2022-04-08 08:19:28,445 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 124 edges. 124 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:19:28,452 INFO L225 Difference]: With dead ends: 529 [2022-04-08 08:19:28,452 INFO L226 Difference]: Without dead ends: 363 [2022-04-08 08:19:28,452 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:19:28,453 INFO L913 BasicCegarLoop]: 67 mSDtfsCounter, 89 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 08:19:28,454 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [89 Valid, 74 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 08:19:28,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2022-04-08 08:19:28,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 361. [2022-04-08 08:19:28,472 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:19:28,472 INFO L82 GeneralOperation]: Start isEquivalent. First operand 363 states. Second operand has 361 states, 357 states have (on average 1.4901960784313726) internal successors, (532), 357 states have internal predecessors, (532), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:28,474 INFO L74 IsIncluded]: Start isIncluded. First operand 363 states. Second operand has 361 states, 357 states have (on average 1.4901960784313726) internal successors, (532), 357 states have internal predecessors, (532), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:28,474 INFO L87 Difference]: Start difference. First operand 363 states. Second operand has 361 states, 357 states have (on average 1.4901960784313726) internal successors, (532), 357 states have internal predecessors, (532), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:28,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:19:28,482 INFO L93 Difference]: Finished difference Result 363 states and 536 transitions. [2022-04-08 08:19:28,482 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 536 transitions. [2022-04-08 08:19:28,482 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:19:28,482 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:19:28,483 INFO L74 IsIncluded]: Start isIncluded. First operand has 361 states, 357 states have (on average 1.4901960784313726) internal successors, (532), 357 states have internal predecessors, (532), 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 363 states. [2022-04-08 08:19:28,484 INFO L87 Difference]: Start difference. First operand has 361 states, 357 states have (on average 1.4901960784313726) internal successors, (532), 357 states have internal predecessors, (532), 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 363 states. [2022-04-08 08:19:28,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:19:28,490 INFO L93 Difference]: Finished difference Result 363 states and 536 transitions. [2022-04-08 08:19:28,490 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 536 transitions. [2022-04-08 08:19:28,490 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:19:28,490 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:19:28,490 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:19:28,490 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:19:28,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 357 states have (on average 1.4901960784313726) internal successors, (532), 357 states have internal predecessors, (532), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:28,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 535 transitions. [2022-04-08 08:19:28,498 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 535 transitions. Word has length 22 [2022-04-08 08:19:28,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:19:28,498 INFO L478 AbstractCegarLoop]: Abstraction has 361 states and 535 transitions. [2022-04-08 08:19:28,498 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:28,499 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 361 states and 535 transitions. [2022-04-08 08:19:28,940 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 535 edges. 535 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:19:28,940 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 535 transitions. [2022-04-08 08:19:28,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-08 08:19:28,941 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:19:28,941 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:19:28,941 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-08 08:19:28,941 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:19:28,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:19:28,942 INFO L85 PathProgramCache]: Analyzing trace with hash 33240837, now seen corresponding path program 1 times [2022-04-08 08:19:28,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:19:28,942 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1049099543] [2022-04-08 08:19:28,942 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:19:28,942 INFO L85 PathProgramCache]: Analyzing trace with hash 33240837, now seen corresponding path program 2 times [2022-04-08 08:19:28,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:19:28,942 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004117464] [2022-04-08 08:19:28,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:19:28,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:19:28,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:19:28,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:19:28,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:19:28,992 INFO L290 TraceCheckUtils]: 0: Hoare triple {13331#(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); {13325#true} is VALID [2022-04-08 08:19:28,993 INFO L290 TraceCheckUtils]: 1: Hoare triple {13325#true} assume true; {13325#true} is VALID [2022-04-08 08:19:28,993 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13325#true} {13325#true} #149#return; {13325#true} is VALID [2022-04-08 08:19:28,994 INFO L272 TraceCheckUtils]: 0: Hoare triple {13325#true} call ULTIMATE.init(); {13331#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:19:28,996 INFO L290 TraceCheckUtils]: 1: Hoare triple {13331#(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); {13325#true} is VALID [2022-04-08 08:19:28,996 INFO L290 TraceCheckUtils]: 2: Hoare triple {13325#true} assume true; {13325#true} is VALID [2022-04-08 08:19:28,996 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13325#true} {13325#true} #149#return; {13325#true} is VALID [2022-04-08 08:19:28,996 INFO L272 TraceCheckUtils]: 4: Hoare triple {13325#true} call #t~ret12 := main(); {13325#true} is VALID [2022-04-08 08:19:28,996 INFO L290 TraceCheckUtils]: 5: Hoare triple {13325#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;havoc ~cond~0; {13325#true} is VALID [2022-04-08 08:19:28,997 INFO L290 TraceCheckUtils]: 6: Hoare triple {13325#true} assume !false;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~cond~0 := #t~nondet11;havoc #t~nondet11; {13325#true} is VALID [2022-04-08 08:19:28,997 INFO L290 TraceCheckUtils]: 7: Hoare triple {13325#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0; {13325#true} is VALID [2022-04-08 08:19:28,997 INFO L290 TraceCheckUtils]: 8: Hoare triple {13325#true} assume !(0 != ~p1~0); {13325#true} is VALID [2022-04-08 08:19:28,997 INFO L290 TraceCheckUtils]: 9: Hoare triple {13325#true} assume !(0 != ~p2~0); {13325#true} is VALID [2022-04-08 08:19:28,997 INFO L290 TraceCheckUtils]: 10: Hoare triple {13325#true} assume !(0 != ~p3~0); {13325#true} is VALID [2022-04-08 08:19:28,997 INFO L290 TraceCheckUtils]: 11: Hoare triple {13325#true} assume !(0 != ~p4~0); {13325#true} is VALID [2022-04-08 08:19:28,997 INFO L290 TraceCheckUtils]: 12: Hoare triple {13325#true} assume 0 != ~p5~0;~lk5~0 := 1; {13330#(= main_~lk5~0 1)} is VALID [2022-04-08 08:19:28,998 INFO L290 TraceCheckUtils]: 13: Hoare triple {13330#(= main_~lk5~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {13330#(= main_~lk5~0 1)} is VALID [2022-04-08 08:19:28,998 INFO L290 TraceCheckUtils]: 14: Hoare triple {13330#(= main_~lk5~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {13330#(= main_~lk5~0 1)} is VALID [2022-04-08 08:19:28,998 INFO L290 TraceCheckUtils]: 15: Hoare triple {13330#(= main_~lk5~0 1)} assume !(0 != ~p1~0); {13330#(= main_~lk5~0 1)} is VALID [2022-04-08 08:19:28,998 INFO L290 TraceCheckUtils]: 16: Hoare triple {13330#(= main_~lk5~0 1)} assume !(0 != ~p2~0); {13330#(= main_~lk5~0 1)} is VALID [2022-04-08 08:19:28,999 INFO L290 TraceCheckUtils]: 17: Hoare triple {13330#(= main_~lk5~0 1)} assume !(0 != ~p3~0); {13330#(= main_~lk5~0 1)} is VALID [2022-04-08 08:19:28,999 INFO L290 TraceCheckUtils]: 18: Hoare triple {13330#(= main_~lk5~0 1)} assume !(0 != ~p4~0); {13330#(= main_~lk5~0 1)} is VALID [2022-04-08 08:19:28,999 INFO L290 TraceCheckUtils]: 19: Hoare triple {13330#(= main_~lk5~0 1)} assume 0 != ~p5~0; {13330#(= main_~lk5~0 1)} is VALID [2022-04-08 08:19:28,999 INFO L290 TraceCheckUtils]: 20: Hoare triple {13330#(= main_~lk5~0 1)} assume 1 != ~lk5~0; {13326#false} is VALID [2022-04-08 08:19:29,000 INFO L290 TraceCheckUtils]: 21: Hoare triple {13326#false} assume !false; {13326#false} is VALID [2022-04-08 08:19:29,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:19:29,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:19:29,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004117464] [2022-04-08 08:19:29,000 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004117464] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:19:29,000 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:19:29,000 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:19:29,000 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:19:29,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1049099543] [2022-04-08 08:19:29,000 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1049099543] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:19:29,000 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:19:29,000 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:19:29,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064453670] [2022-04-08 08:19:29,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:19:29,001 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-08 08:19:29,001 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:19:29,001 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:29,018 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:19:29,018 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:19:29,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:19:29,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:19:29,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:19:29,019 INFO L87 Difference]: Start difference. First operand 361 states and 535 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:29,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:19:29,142 INFO L93 Difference]: Finished difference Result 621 states and 929 transitions. [2022-04-08 08:19:29,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:19:29,143 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-08 08:19:29,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:19:29,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:29,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 79 transitions. [2022-04-08 08:19:29,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:29,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 79 transitions. [2022-04-08 08:19:29,144 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 79 transitions. [2022-04-08 08:19:29,190 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:19:29,206 INFO L225 Difference]: With dead ends: 621 [2022-04-08 08:19:29,206 INFO L226 Difference]: Without dead ends: 619 [2022-04-08 08:19:29,206 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:19:29,207 INFO L913 BasicCegarLoop]: 49 mSDtfsCounter, 89 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 08:19:29,207 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [89 Valid, 56 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 08:19:29,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2022-04-08 08:19:29,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 521. [2022-04-08 08:19:29,233 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:19:29,234 INFO L82 GeneralOperation]: Start isEquivalent. First operand 619 states. Second operand has 521 states, 517 states have (on average 1.446808510638298) internal successors, (748), 517 states have internal predecessors, (748), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:29,235 INFO L74 IsIncluded]: Start isIncluded. First operand 619 states. Second operand has 521 states, 517 states have (on average 1.446808510638298) internal successors, (748), 517 states have internal predecessors, (748), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:29,235 INFO L87 Difference]: Start difference. First operand 619 states. Second operand has 521 states, 517 states have (on average 1.446808510638298) internal successors, (748), 517 states have internal predecessors, (748), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:29,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:19:29,249 INFO L93 Difference]: Finished difference Result 619 states and 912 transitions. [2022-04-08 08:19:29,249 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 912 transitions. [2022-04-08 08:19:29,250 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:19:29,250 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:19:29,251 INFO L74 IsIncluded]: Start isIncluded. First operand has 521 states, 517 states have (on average 1.446808510638298) internal successors, (748), 517 states have internal predecessors, (748), 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 619 states. [2022-04-08 08:19:29,251 INFO L87 Difference]: Start difference. First operand has 521 states, 517 states have (on average 1.446808510638298) internal successors, (748), 517 states have internal predecessors, (748), 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 619 states. [2022-04-08 08:19:29,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:19:29,266 INFO L93 Difference]: Finished difference Result 619 states and 912 transitions. [2022-04-08 08:19:29,266 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 912 transitions. [2022-04-08 08:19:29,266 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:19:29,266 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:19:29,266 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:19:29,266 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:19:29,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 521 states, 517 states have (on average 1.446808510638298) internal successors, (748), 517 states have internal predecessors, (748), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:29,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 751 transitions. [2022-04-08 08:19:29,280 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 751 transitions. Word has length 22 [2022-04-08 08:19:29,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:19:29,280 INFO L478 AbstractCegarLoop]: Abstraction has 521 states and 751 transitions. [2022-04-08 08:19:29,280 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:29,280 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 521 states and 751 transitions. [2022-04-08 08:19:29,983 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 751 edges. 751 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:19:29,983 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 751 transitions. [2022-04-08 08:19:29,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-08 08:19:29,984 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:19:29,984 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:19:29,984 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-08 08:19:29,984 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:19:29,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:19:29,985 INFO L85 PathProgramCache]: Analyzing trace with hash -359786173, now seen corresponding path program 1 times [2022-04-08 08:19:29,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:19:29,985 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1430443936] [2022-04-08 08:19:29,985 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:19:29,985 INFO L85 PathProgramCache]: Analyzing trace with hash -359786173, now seen corresponding path program 2 times [2022-04-08 08:19:29,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:19:29,985 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293003262] [2022-04-08 08:19:29,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:19:29,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:19:30,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:19:30,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:19:30,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:19:30,019 INFO L290 TraceCheckUtils]: 0: Hoare triple {16865#(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); {16859#true} is VALID [2022-04-08 08:19:30,019 INFO L290 TraceCheckUtils]: 1: Hoare triple {16859#true} assume true; {16859#true} is VALID [2022-04-08 08:19:30,019 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16859#true} {16859#true} #149#return; {16859#true} is VALID [2022-04-08 08:19:30,019 INFO L272 TraceCheckUtils]: 0: Hoare triple {16859#true} call ULTIMATE.init(); {16865#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:19:30,019 INFO L290 TraceCheckUtils]: 1: Hoare triple {16865#(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); {16859#true} is VALID [2022-04-08 08:19:30,019 INFO L290 TraceCheckUtils]: 2: Hoare triple {16859#true} assume true; {16859#true} is VALID [2022-04-08 08:19:30,019 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16859#true} {16859#true} #149#return; {16859#true} is VALID [2022-04-08 08:19:30,020 INFO L272 TraceCheckUtils]: 4: Hoare triple {16859#true} call #t~ret12 := main(); {16859#true} is VALID [2022-04-08 08:19:30,020 INFO L290 TraceCheckUtils]: 5: Hoare triple {16859#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;havoc ~cond~0; {16859#true} is VALID [2022-04-08 08:19:30,020 INFO L290 TraceCheckUtils]: 6: Hoare triple {16859#true} assume !false;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~cond~0 := #t~nondet11;havoc #t~nondet11; {16859#true} is VALID [2022-04-08 08:19:30,020 INFO L290 TraceCheckUtils]: 7: Hoare triple {16859#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0; {16859#true} is VALID [2022-04-08 08:19:30,020 INFO L290 TraceCheckUtils]: 8: Hoare triple {16859#true} assume !(0 != ~p1~0); {16859#true} is VALID [2022-04-08 08:19:30,020 INFO L290 TraceCheckUtils]: 9: Hoare triple {16859#true} assume !(0 != ~p2~0); {16859#true} is VALID [2022-04-08 08:19:30,020 INFO L290 TraceCheckUtils]: 10: Hoare triple {16859#true} assume !(0 != ~p3~0); {16859#true} is VALID [2022-04-08 08:19:30,020 INFO L290 TraceCheckUtils]: 11: Hoare triple {16859#true} assume !(0 != ~p4~0); {16859#true} is VALID [2022-04-08 08:19:30,020 INFO L290 TraceCheckUtils]: 12: Hoare triple {16859#true} assume !(0 != ~p5~0); {16864#(= main_~p5~0 0)} is VALID [2022-04-08 08:19:30,021 INFO L290 TraceCheckUtils]: 13: Hoare triple {16864#(= main_~p5~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {16864#(= main_~p5~0 0)} is VALID [2022-04-08 08:19:30,021 INFO L290 TraceCheckUtils]: 14: Hoare triple {16864#(= main_~p5~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {16864#(= main_~p5~0 0)} is VALID [2022-04-08 08:19:30,021 INFO L290 TraceCheckUtils]: 15: Hoare triple {16864#(= main_~p5~0 0)} assume !(0 != ~p1~0); {16864#(= main_~p5~0 0)} is VALID [2022-04-08 08:19:30,021 INFO L290 TraceCheckUtils]: 16: Hoare triple {16864#(= main_~p5~0 0)} assume !(0 != ~p2~0); {16864#(= main_~p5~0 0)} is VALID [2022-04-08 08:19:30,022 INFO L290 TraceCheckUtils]: 17: Hoare triple {16864#(= main_~p5~0 0)} assume !(0 != ~p3~0); {16864#(= main_~p5~0 0)} is VALID [2022-04-08 08:19:30,022 INFO L290 TraceCheckUtils]: 18: Hoare triple {16864#(= main_~p5~0 0)} assume !(0 != ~p4~0); {16864#(= main_~p5~0 0)} is VALID [2022-04-08 08:19:30,022 INFO L290 TraceCheckUtils]: 19: Hoare triple {16864#(= main_~p5~0 0)} assume 0 != ~p5~0; {16860#false} is VALID [2022-04-08 08:19:30,022 INFO L290 TraceCheckUtils]: 20: Hoare triple {16860#false} assume 1 != ~lk5~0; {16860#false} is VALID [2022-04-08 08:19:30,022 INFO L290 TraceCheckUtils]: 21: Hoare triple {16860#false} assume !false; {16860#false} is VALID [2022-04-08 08:19:30,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:19:30,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:19:30,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293003262] [2022-04-08 08:19:30,023 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293003262] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:19:30,023 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:19:30,023 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:19:30,023 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:19:30,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1430443936] [2022-04-08 08:19:30,023 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1430443936] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:19:30,023 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:19:30,023 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:19:30,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357575557] [2022-04-08 08:19:30,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:19:30,024 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-08 08:19:30,024 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:19:30,024 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:30,034 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:19:30,034 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:19:30,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:19:30,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:19:30,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:19:30,035 INFO L87 Difference]: Start difference. First operand 521 states and 751 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:30,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:19:30,228 INFO L93 Difference]: Finished difference Result 1181 states and 1697 transitions. [2022-04-08 08:19:30,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:19:30,228 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-08 08:19:30,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:19:30,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:30,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 126 transitions. [2022-04-08 08:19:30,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:30,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 126 transitions. [2022-04-08 08:19:30,230 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 126 transitions. [2022-04-08 08:19:30,308 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 126 edges. 126 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:19:30,327 INFO L225 Difference]: With dead ends: 1181 [2022-04-08 08:19:30,327 INFO L226 Difference]: Without dead ends: 683 [2022-04-08 08:19:30,328 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:19:30,328 INFO L913 BasicCegarLoop]: 72 mSDtfsCounter, 79 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 08:19:30,328 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [79 Valid, 79 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 08:19:30,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 683 states. [2022-04-08 08:19:30,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 683 to 681. [2022-04-08 08:19:30,370 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:19:30,371 INFO L82 GeneralOperation]: Start isEquivalent. First operand 683 states. Second operand has 681 states, 677 states have (on average 1.4002954209748892) internal successors, (948), 677 states have internal predecessors, (948), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:30,372 INFO L74 IsIncluded]: Start isIncluded. First operand 683 states. Second operand has 681 states, 677 states have (on average 1.4002954209748892) internal successors, (948), 677 states have internal predecessors, (948), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:30,372 INFO L87 Difference]: Start difference. First operand 683 states. Second operand has 681 states, 677 states have (on average 1.4002954209748892) internal successors, (948), 677 states have internal predecessors, (948), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:30,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:19:30,388 INFO L93 Difference]: Finished difference Result 683 states and 952 transitions. [2022-04-08 08:19:30,388 INFO L276 IsEmpty]: Start isEmpty. Operand 683 states and 952 transitions. [2022-04-08 08:19:30,388 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:19:30,389 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:19:30,390 INFO L74 IsIncluded]: Start isIncluded. First operand has 681 states, 677 states have (on average 1.4002954209748892) internal successors, (948), 677 states have internal predecessors, (948), 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 683 states. [2022-04-08 08:19:30,390 INFO L87 Difference]: Start difference. First operand has 681 states, 677 states have (on average 1.4002954209748892) internal successors, (948), 677 states have internal predecessors, (948), 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 683 states. [2022-04-08 08:19:30,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:19:30,407 INFO L93 Difference]: Finished difference Result 683 states and 952 transitions. [2022-04-08 08:19:30,407 INFO L276 IsEmpty]: Start isEmpty. Operand 683 states and 952 transitions. [2022-04-08 08:19:30,408 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:19:30,408 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:19:30,408 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:19:30,408 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:19:30,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 681 states, 677 states have (on average 1.4002954209748892) internal successors, (948), 677 states have internal predecessors, (948), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:30,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 681 states to 681 states and 951 transitions. [2022-04-08 08:19:30,428 INFO L78 Accepts]: Start accepts. Automaton has 681 states and 951 transitions. Word has length 22 [2022-04-08 08:19:30,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:19:30,429 INFO L478 AbstractCegarLoop]: Abstraction has 681 states and 951 transitions. [2022-04-08 08:19:30,431 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:30,432 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 681 states and 951 transitions. [2022-04-08 08:19:31,290 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 951 edges. 951 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:19:31,291 INFO L276 IsEmpty]: Start isEmpty. Operand 681 states and 951 transitions. [2022-04-08 08:19:31,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-08 08:19:31,292 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:19:31,292 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:19:31,292 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-08 08:19:31,292 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:19:31,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:19:31,293 INFO L85 PathProgramCache]: Analyzing trace with hash 1030681666, now seen corresponding path program 1 times [2022-04-08 08:19:31,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:19:31,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1620310942] [2022-04-08 08:19:31,293 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:19:31,294 INFO L85 PathProgramCache]: Analyzing trace with hash 1030681666, now seen corresponding path program 2 times [2022-04-08 08:19:31,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:19:31,294 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728940992] [2022-04-08 08:19:31,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:19:31,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:19:31,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:19:31,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:19:31,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:19:31,330 INFO L290 TraceCheckUtils]: 0: Hoare triple {21967#(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); {21961#true} is VALID [2022-04-08 08:19:31,330 INFO L290 TraceCheckUtils]: 1: Hoare triple {21961#true} assume true; {21961#true} is VALID [2022-04-08 08:19:31,330 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {21961#true} {21961#true} #149#return; {21961#true} is VALID [2022-04-08 08:19:31,331 INFO L272 TraceCheckUtils]: 0: Hoare triple {21961#true} call ULTIMATE.init(); {21967#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:19:31,331 INFO L290 TraceCheckUtils]: 1: Hoare triple {21967#(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); {21961#true} is VALID [2022-04-08 08:19:31,331 INFO L290 TraceCheckUtils]: 2: Hoare triple {21961#true} assume true; {21961#true} is VALID [2022-04-08 08:19:31,331 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21961#true} {21961#true} #149#return; {21961#true} is VALID [2022-04-08 08:19:31,331 INFO L272 TraceCheckUtils]: 4: Hoare triple {21961#true} call #t~ret12 := main(); {21961#true} is VALID [2022-04-08 08:19:31,331 INFO L290 TraceCheckUtils]: 5: Hoare triple {21961#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;havoc ~cond~0; {21961#true} is VALID [2022-04-08 08:19:31,331 INFO L290 TraceCheckUtils]: 6: Hoare triple {21961#true} assume !false;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~cond~0 := #t~nondet11;havoc #t~nondet11; {21961#true} is VALID [2022-04-08 08:19:31,331 INFO L290 TraceCheckUtils]: 7: Hoare triple {21961#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0; {21961#true} is VALID [2022-04-08 08:19:31,331 INFO L290 TraceCheckUtils]: 8: Hoare triple {21961#true} assume !(0 != ~p1~0); {21961#true} is VALID [2022-04-08 08:19:31,331 INFO L290 TraceCheckUtils]: 9: Hoare triple {21961#true} assume !(0 != ~p2~0); {21961#true} is VALID [2022-04-08 08:19:31,332 INFO L290 TraceCheckUtils]: 10: Hoare triple {21961#true} assume !(0 != ~p3~0); {21961#true} is VALID [2022-04-08 08:19:31,332 INFO L290 TraceCheckUtils]: 11: Hoare triple {21961#true} assume !(0 != ~p4~0); {21961#true} is VALID [2022-04-08 08:19:31,332 INFO L290 TraceCheckUtils]: 12: Hoare triple {21961#true} assume 0 != ~p5~0;~lk5~0 := 1; {21966#(not (= main_~p5~0 0))} is VALID [2022-04-08 08:19:31,332 INFO L290 TraceCheckUtils]: 13: Hoare triple {21966#(not (= main_~p5~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {21966#(not (= main_~p5~0 0))} is VALID [2022-04-08 08:19:31,332 INFO L290 TraceCheckUtils]: 14: Hoare triple {21966#(not (= main_~p5~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {21966#(not (= main_~p5~0 0))} is VALID [2022-04-08 08:19:31,333 INFO L290 TraceCheckUtils]: 15: Hoare triple {21966#(not (= main_~p5~0 0))} assume !(0 != ~p1~0); {21966#(not (= main_~p5~0 0))} is VALID [2022-04-08 08:19:31,333 INFO L290 TraceCheckUtils]: 16: Hoare triple {21966#(not (= main_~p5~0 0))} assume !(0 != ~p2~0); {21966#(not (= main_~p5~0 0))} is VALID [2022-04-08 08:19:31,333 INFO L290 TraceCheckUtils]: 17: Hoare triple {21966#(not (= main_~p5~0 0))} assume !(0 != ~p3~0); {21966#(not (= main_~p5~0 0))} is VALID [2022-04-08 08:19:31,333 INFO L290 TraceCheckUtils]: 18: Hoare triple {21966#(not (= main_~p5~0 0))} assume !(0 != ~p4~0); {21966#(not (= main_~p5~0 0))} is VALID [2022-04-08 08:19:31,334 INFO L290 TraceCheckUtils]: 19: Hoare triple {21966#(not (= main_~p5~0 0))} assume !(0 != ~p5~0); {21962#false} is VALID [2022-04-08 08:19:31,334 INFO L290 TraceCheckUtils]: 20: Hoare triple {21962#false} assume 0 != ~p6~0; {21962#false} is VALID [2022-04-08 08:19:31,334 INFO L290 TraceCheckUtils]: 21: Hoare triple {21962#false} assume 1 != ~lk6~0; {21962#false} is VALID [2022-04-08 08:19:31,334 INFO L290 TraceCheckUtils]: 22: Hoare triple {21962#false} assume !false; {21962#false} is VALID [2022-04-08 08:19:31,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:19:31,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:19:31,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728940992] [2022-04-08 08:19:31,334 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728940992] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:19:31,334 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:19:31,334 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:19:31,335 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:19:31,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1620310942] [2022-04-08 08:19:31,335 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1620310942] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:19:31,335 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:19:31,335 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:19:31,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980331210] [2022-04-08 08:19:31,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:19:31,335 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-08 08:19:31,335 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:19:31,336 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:31,347 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:19:31,347 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:19:31,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:19:31,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:19:31,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:19:31,347 INFO L87 Difference]: Start difference. First operand 681 states and 951 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:31,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:19:31,525 INFO L93 Difference]: Finished difference Result 1021 states and 1417 transitions. [2022-04-08 08:19:31,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:19:31,526 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-08 08:19:31,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:19:31,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:31,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 121 transitions. [2022-04-08 08:19:31,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:31,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 121 transitions. [2022-04-08 08:19:31,528 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 121 transitions. [2022-04-08 08:19:31,603 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 121 edges. 121 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:19:31,622 INFO L225 Difference]: With dead ends: 1021 [2022-04-08 08:19:31,623 INFO L226 Difference]: Without dead ends: 699 [2022-04-08 08:19:31,623 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:19:31,624 INFO L913 BasicCegarLoop]: 64 mSDtfsCounter, 88 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 08:19:31,624 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [88 Valid, 71 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 08:19:31,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2022-04-08 08:19:31,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 697. [2022-04-08 08:19:31,662 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:19:31,663 INFO L82 GeneralOperation]: Start isEquivalent. First operand 699 states. Second operand has 697 states, 693 states have (on average 1.367965367965368) internal successors, (948), 693 states have internal predecessors, (948), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:31,663 INFO L74 IsIncluded]: Start isIncluded. First operand 699 states. Second operand has 697 states, 693 states have (on average 1.367965367965368) internal successors, (948), 693 states have internal predecessors, (948), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:31,664 INFO L87 Difference]: Start difference. First operand 699 states. Second operand has 697 states, 693 states have (on average 1.367965367965368) internal successors, (948), 693 states have internal predecessors, (948), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:31,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:19:31,680 INFO L93 Difference]: Finished difference Result 699 states and 952 transitions. [2022-04-08 08:19:31,680 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 952 transitions. [2022-04-08 08:19:31,680 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:19:31,680 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:19:31,698 INFO L74 IsIncluded]: Start isIncluded. First operand has 697 states, 693 states have (on average 1.367965367965368) internal successors, (948), 693 states have internal predecessors, (948), 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 699 states. [2022-04-08 08:19:31,699 INFO L87 Difference]: Start difference. First operand has 697 states, 693 states have (on average 1.367965367965368) internal successors, (948), 693 states have internal predecessors, (948), 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 699 states. [2022-04-08 08:19:31,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:19:31,715 INFO L93 Difference]: Finished difference Result 699 states and 952 transitions. [2022-04-08 08:19:31,715 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 952 transitions. [2022-04-08 08:19:31,715 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:19:31,715 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:19:31,715 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:19:31,715 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:19:31,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 697 states, 693 states have (on average 1.367965367965368) internal successors, (948), 693 states have internal predecessors, (948), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:31,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 697 states and 951 transitions. [2022-04-08 08:19:31,736 INFO L78 Accepts]: Start accepts. Automaton has 697 states and 951 transitions. Word has length 23 [2022-04-08 08:19:31,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:19:31,736 INFO L478 AbstractCegarLoop]: Abstraction has 697 states and 951 transitions. [2022-04-08 08:19:31,736 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:31,736 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 697 states and 951 transitions. [2022-04-08 08:19:32,556 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 951 edges. 951 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:19:32,556 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 951 transitions. [2022-04-08 08:19:32,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-08 08:19:32,557 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:19:32,557 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:19:32,557 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-08 08:19:32,557 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:19:32,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:19:32,557 INFO L85 PathProgramCache]: Analyzing trace with hash 1731746244, now seen corresponding path program 1 times [2022-04-08 08:19:32,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:19:32,557 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [880541942] [2022-04-08 08:19:32,558 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:19:32,558 INFO L85 PathProgramCache]: Analyzing trace with hash 1731746244, now seen corresponding path program 2 times [2022-04-08 08:19:32,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:19:32,558 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244752829] [2022-04-08 08:19:32,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:19:32,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:19:32,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:19:32,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:19:32,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:19:32,581 INFO L290 TraceCheckUtils]: 0: Hoare triple {26813#(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); {26807#true} is VALID [2022-04-08 08:19:32,581 INFO L290 TraceCheckUtils]: 1: Hoare triple {26807#true} assume true; {26807#true} is VALID [2022-04-08 08:19:32,581 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {26807#true} {26807#true} #149#return; {26807#true} is VALID [2022-04-08 08:19:32,582 INFO L272 TraceCheckUtils]: 0: Hoare triple {26807#true} call ULTIMATE.init(); {26813#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:19:32,582 INFO L290 TraceCheckUtils]: 1: Hoare triple {26813#(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); {26807#true} is VALID [2022-04-08 08:19:32,582 INFO L290 TraceCheckUtils]: 2: Hoare triple {26807#true} assume true; {26807#true} is VALID [2022-04-08 08:19:32,582 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26807#true} {26807#true} #149#return; {26807#true} is VALID [2022-04-08 08:19:32,582 INFO L272 TraceCheckUtils]: 4: Hoare triple {26807#true} call #t~ret12 := main(); {26807#true} is VALID [2022-04-08 08:19:32,582 INFO L290 TraceCheckUtils]: 5: Hoare triple {26807#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;havoc ~cond~0; {26807#true} is VALID [2022-04-08 08:19:32,582 INFO L290 TraceCheckUtils]: 6: Hoare triple {26807#true} assume !false;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~cond~0 := #t~nondet11;havoc #t~nondet11; {26807#true} is VALID [2022-04-08 08:19:32,582 INFO L290 TraceCheckUtils]: 7: Hoare triple {26807#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0; {26807#true} is VALID [2022-04-08 08:19:32,583 INFO L290 TraceCheckUtils]: 8: Hoare triple {26807#true} assume !(0 != ~p1~0); {26807#true} is VALID [2022-04-08 08:19:32,583 INFO L290 TraceCheckUtils]: 9: Hoare triple {26807#true} assume !(0 != ~p2~0); {26807#true} is VALID [2022-04-08 08:19:32,583 INFO L290 TraceCheckUtils]: 10: Hoare triple {26807#true} assume !(0 != ~p3~0); {26807#true} is VALID [2022-04-08 08:19:32,583 INFO L290 TraceCheckUtils]: 11: Hoare triple {26807#true} assume !(0 != ~p4~0); {26807#true} is VALID [2022-04-08 08:19:32,583 INFO L290 TraceCheckUtils]: 12: Hoare triple {26807#true} assume !(0 != ~p5~0); {26807#true} is VALID [2022-04-08 08:19:32,583 INFO L290 TraceCheckUtils]: 13: Hoare triple {26807#true} assume 0 != ~p6~0;~lk6~0 := 1; {26812#(= main_~lk6~0 1)} is VALID [2022-04-08 08:19:32,583 INFO L290 TraceCheckUtils]: 14: Hoare triple {26812#(= main_~lk6~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {26812#(= main_~lk6~0 1)} is VALID [2022-04-08 08:19:32,584 INFO L290 TraceCheckUtils]: 15: Hoare triple {26812#(= main_~lk6~0 1)} assume !(0 != ~p1~0); {26812#(= main_~lk6~0 1)} is VALID [2022-04-08 08:19:32,584 INFO L290 TraceCheckUtils]: 16: Hoare triple {26812#(= main_~lk6~0 1)} assume !(0 != ~p2~0); {26812#(= main_~lk6~0 1)} is VALID [2022-04-08 08:19:32,584 INFO L290 TraceCheckUtils]: 17: Hoare triple {26812#(= main_~lk6~0 1)} assume !(0 != ~p3~0); {26812#(= main_~lk6~0 1)} is VALID [2022-04-08 08:19:32,584 INFO L290 TraceCheckUtils]: 18: Hoare triple {26812#(= main_~lk6~0 1)} assume !(0 != ~p4~0); {26812#(= main_~lk6~0 1)} is VALID [2022-04-08 08:19:32,585 INFO L290 TraceCheckUtils]: 19: Hoare triple {26812#(= main_~lk6~0 1)} assume !(0 != ~p5~0); {26812#(= main_~lk6~0 1)} is VALID [2022-04-08 08:19:32,585 INFO L290 TraceCheckUtils]: 20: Hoare triple {26812#(= main_~lk6~0 1)} assume 0 != ~p6~0; {26812#(= main_~lk6~0 1)} is VALID [2022-04-08 08:19:32,585 INFO L290 TraceCheckUtils]: 21: Hoare triple {26812#(= main_~lk6~0 1)} assume 1 != ~lk6~0; {26808#false} is VALID [2022-04-08 08:19:32,585 INFO L290 TraceCheckUtils]: 22: Hoare triple {26808#false} assume !false; {26808#false} is VALID [2022-04-08 08:19:32,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:19:32,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:19:32,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244752829] [2022-04-08 08:19:32,586 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244752829] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:19:32,586 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:19:32,586 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:19:32,586 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:19:32,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [880541942] [2022-04-08 08:19:32,586 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [880541942] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:19:32,586 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:19:32,586 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:19:32,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397222477] [2022-04-08 08:19:32,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:19:32,587 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-08 08:19:32,587 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:19:32,587 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:32,615 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:19:32,615 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:19:32,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:19:32,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:19:32,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:19:32,616 INFO L87 Difference]: Start difference. First operand 697 states and 951 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:32,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:19:32,802 INFO L93 Difference]: Finished difference Result 1165 states and 1593 transitions. [2022-04-08 08:19:32,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:19:32,802 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-08 08:19:32,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:19:32,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:32,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 75 transitions. [2022-04-08 08:19:32,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:32,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 75 transitions. [2022-04-08 08:19:32,804 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 75 transitions. [2022-04-08 08:19:32,846 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-08 08:19:32,901 INFO L225 Difference]: With dead ends: 1165 [2022-04-08 08:19:32,901 INFO L226 Difference]: Without dead ends: 1163 [2022-04-08 08:19:32,901 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:19:32,902 INFO L913 BasicCegarLoop]: 48 mSDtfsCounter, 82 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 08:19:32,902 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [82 Valid, 55 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 08:19:32,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1163 states. [2022-04-08 08:19:32,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1163 to 1033. [2022-04-08 08:19:32,987 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:19:32,988 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1163 states. Second operand has 1033 states, 1029 states have (on average 1.3255587949465502) internal successors, (1364), 1029 states have internal predecessors, (1364), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:32,991 INFO L74 IsIncluded]: Start isIncluded. First operand 1163 states. Second operand has 1033 states, 1029 states have (on average 1.3255587949465502) internal successors, (1364), 1029 states have internal predecessors, (1364), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:32,992 INFO L87 Difference]: Start difference. First operand 1163 states. Second operand has 1033 states, 1029 states have (on average 1.3255587949465502) internal successors, (1364), 1029 states have internal predecessors, (1364), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:33,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:19:33,030 INFO L93 Difference]: Finished difference Result 1163 states and 1560 transitions. [2022-04-08 08:19:33,030 INFO L276 IsEmpty]: Start isEmpty. Operand 1163 states and 1560 transitions. [2022-04-08 08:19:33,031 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:19:33,031 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:19:33,033 INFO L74 IsIncluded]: Start isIncluded. First operand has 1033 states, 1029 states have (on average 1.3255587949465502) internal successors, (1364), 1029 states have internal predecessors, (1364), 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 1163 states. [2022-04-08 08:19:33,034 INFO L87 Difference]: Start difference. First operand has 1033 states, 1029 states have (on average 1.3255587949465502) internal successors, (1364), 1029 states have internal predecessors, (1364), 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 1163 states. [2022-04-08 08:19:33,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:19:33,072 INFO L93 Difference]: Finished difference Result 1163 states and 1560 transitions. [2022-04-08 08:19:33,072 INFO L276 IsEmpty]: Start isEmpty. Operand 1163 states and 1560 transitions. [2022-04-08 08:19:33,073 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:19:33,074 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:19:33,074 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:19:33,074 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:19:33,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1033 states, 1029 states have (on average 1.3255587949465502) internal successors, (1364), 1029 states have internal predecessors, (1364), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:33,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1033 states to 1033 states and 1367 transitions. [2022-04-08 08:19:33,118 INFO L78 Accepts]: Start accepts. Automaton has 1033 states and 1367 transitions. Word has length 23 [2022-04-08 08:19:33,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:19:33,118 INFO L478 AbstractCegarLoop]: Abstraction has 1033 states and 1367 transitions. [2022-04-08 08:19:33,118 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:33,119 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1033 states and 1367 transitions. [2022-04-08 08:19:34,337 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1367 edges. 1367 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:19:34,338 INFO L276 IsEmpty]: Start isEmpty. Operand 1033 states and 1367 transitions. [2022-04-08 08:19:34,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-08 08:19:34,339 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:19:34,339 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:19:34,339 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-08 08:19:34,339 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:19:34,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:19:34,346 INFO L85 PathProgramCache]: Analyzing trace with hash 1338719234, now seen corresponding path program 1 times [2022-04-08 08:19:34,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:19:34,346 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [271330151] [2022-04-08 08:19:34,347 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:19:34,347 INFO L85 PathProgramCache]: Analyzing trace with hash 1338719234, now seen corresponding path program 2 times [2022-04-08 08:19:34,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:19:34,347 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117429162] [2022-04-08 08:19:34,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:19:34,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:19:34,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:19:34,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:19:34,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:19:34,389 INFO L290 TraceCheckUtils]: 0: Hoare triple {33547#(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); {33541#true} is VALID [2022-04-08 08:19:34,389 INFO L290 TraceCheckUtils]: 1: Hoare triple {33541#true} assume true; {33541#true} is VALID [2022-04-08 08:19:34,389 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {33541#true} {33541#true} #149#return; {33541#true} is VALID [2022-04-08 08:19:34,389 INFO L272 TraceCheckUtils]: 0: Hoare triple {33541#true} call ULTIMATE.init(); {33547#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:19:34,390 INFO L290 TraceCheckUtils]: 1: Hoare triple {33547#(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); {33541#true} is VALID [2022-04-08 08:19:34,390 INFO L290 TraceCheckUtils]: 2: Hoare triple {33541#true} assume true; {33541#true} is VALID [2022-04-08 08:19:34,390 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33541#true} {33541#true} #149#return; {33541#true} is VALID [2022-04-08 08:19:34,390 INFO L272 TraceCheckUtils]: 4: Hoare triple {33541#true} call #t~ret12 := main(); {33541#true} is VALID [2022-04-08 08:19:34,390 INFO L290 TraceCheckUtils]: 5: Hoare triple {33541#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;havoc ~cond~0; {33541#true} is VALID [2022-04-08 08:19:34,390 INFO L290 TraceCheckUtils]: 6: Hoare triple {33541#true} assume !false;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~cond~0 := #t~nondet11;havoc #t~nondet11; {33541#true} is VALID [2022-04-08 08:19:34,390 INFO L290 TraceCheckUtils]: 7: Hoare triple {33541#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0; {33541#true} is VALID [2022-04-08 08:19:34,390 INFO L290 TraceCheckUtils]: 8: Hoare triple {33541#true} assume !(0 != ~p1~0); {33541#true} is VALID [2022-04-08 08:19:34,390 INFO L290 TraceCheckUtils]: 9: Hoare triple {33541#true} assume !(0 != ~p2~0); {33541#true} is VALID [2022-04-08 08:19:34,390 INFO L290 TraceCheckUtils]: 10: Hoare triple {33541#true} assume !(0 != ~p3~0); {33541#true} is VALID [2022-04-08 08:19:34,390 INFO L290 TraceCheckUtils]: 11: Hoare triple {33541#true} assume !(0 != ~p4~0); {33541#true} is VALID [2022-04-08 08:19:34,390 INFO L290 TraceCheckUtils]: 12: Hoare triple {33541#true} assume !(0 != ~p5~0); {33541#true} is VALID [2022-04-08 08:19:34,391 INFO L290 TraceCheckUtils]: 13: Hoare triple {33541#true} assume !(0 != ~p6~0); {33546#(= main_~p6~0 0)} is VALID [2022-04-08 08:19:34,399 INFO L290 TraceCheckUtils]: 14: Hoare triple {33546#(= main_~p6~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {33546#(= main_~p6~0 0)} is VALID [2022-04-08 08:19:34,399 INFO L290 TraceCheckUtils]: 15: Hoare triple {33546#(= main_~p6~0 0)} assume !(0 != ~p1~0); {33546#(= main_~p6~0 0)} is VALID [2022-04-08 08:19:34,399 INFO L290 TraceCheckUtils]: 16: Hoare triple {33546#(= main_~p6~0 0)} assume !(0 != ~p2~0); {33546#(= main_~p6~0 0)} is VALID [2022-04-08 08:19:34,400 INFO L290 TraceCheckUtils]: 17: Hoare triple {33546#(= main_~p6~0 0)} assume !(0 != ~p3~0); {33546#(= main_~p6~0 0)} is VALID [2022-04-08 08:19:34,400 INFO L290 TraceCheckUtils]: 18: Hoare triple {33546#(= main_~p6~0 0)} assume !(0 != ~p4~0); {33546#(= main_~p6~0 0)} is VALID [2022-04-08 08:19:34,400 INFO L290 TraceCheckUtils]: 19: Hoare triple {33546#(= main_~p6~0 0)} assume !(0 != ~p5~0); {33546#(= main_~p6~0 0)} is VALID [2022-04-08 08:19:34,401 INFO L290 TraceCheckUtils]: 20: Hoare triple {33546#(= main_~p6~0 0)} assume 0 != ~p6~0; {33542#false} is VALID [2022-04-08 08:19:34,401 INFO L290 TraceCheckUtils]: 21: Hoare triple {33542#false} assume 1 != ~lk6~0; {33542#false} is VALID [2022-04-08 08:19:34,401 INFO L290 TraceCheckUtils]: 22: Hoare triple {33542#false} assume !false; {33542#false} is VALID [2022-04-08 08:19:34,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:19:34,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:19:34,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117429162] [2022-04-08 08:19:34,401 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117429162] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:19:34,401 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:19:34,401 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:19:34,401 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:19:34,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [271330151] [2022-04-08 08:19:34,402 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [271330151] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:19:34,402 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:19:34,402 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:19:34,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105251879] [2022-04-08 08:19:34,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:19:34,402 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-08 08:19:34,402 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:19:34,402 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:34,415 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:19:34,415 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:19:34,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:19:34,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:19:34,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:19:34,415 INFO L87 Difference]: Start difference. First operand 1033 states and 1367 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:34,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:19:34,872 INFO L93 Difference]: Finished difference Result 2317 states and 3033 transitions. [2022-04-08 08:19:34,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:19:34,873 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-08 08:19:34,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:19:34,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:34,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 123 transitions. [2022-04-08 08:19:34,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:34,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 123 transitions. [2022-04-08 08:19:34,874 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 123 transitions. [2022-04-08 08:19:34,944 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 123 edges. 123 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:19:35,016 INFO L225 Difference]: With dead ends: 2317 [2022-04-08 08:19:35,016 INFO L226 Difference]: Without dead ends: 1323 [2022-04-08 08:19:35,017 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:19:35,018 INFO L913 BasicCegarLoop]: 74 mSDtfsCounter, 73 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 08:19:35,018 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [73 Valid, 81 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 08:19:35,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1323 states. [2022-04-08 08:19:35,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1323 to 1321. [2022-04-08 08:19:35,090 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:19:35,091 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1323 states. Second operand has 1321 states, 1317 states have (on average 1.2665148063781322) internal successors, (1668), 1317 states have internal predecessors, (1668), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:35,092 INFO L74 IsIncluded]: Start isIncluded. First operand 1323 states. Second operand has 1321 states, 1317 states have (on average 1.2665148063781322) internal successors, (1668), 1317 states have internal predecessors, (1668), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:35,093 INFO L87 Difference]: Start difference. First operand 1323 states. Second operand has 1321 states, 1317 states have (on average 1.2665148063781322) internal successors, (1668), 1317 states have internal predecessors, (1668), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:35,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:19:35,139 INFO L93 Difference]: Finished difference Result 1323 states and 1672 transitions. [2022-04-08 08:19:35,139 INFO L276 IsEmpty]: Start isEmpty. Operand 1323 states and 1672 transitions. [2022-04-08 08:19:35,140 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:19:35,141 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:19:35,142 INFO L74 IsIncluded]: Start isIncluded. First operand has 1321 states, 1317 states have (on average 1.2665148063781322) internal successors, (1668), 1317 states have internal predecessors, (1668), 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 1323 states. [2022-04-08 08:19:35,143 INFO L87 Difference]: Start difference. First operand has 1321 states, 1317 states have (on average 1.2665148063781322) internal successors, (1668), 1317 states have internal predecessors, (1668), 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 1323 states. [2022-04-08 08:19:35,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:19:35,190 INFO L93 Difference]: Finished difference Result 1323 states and 1672 transitions. [2022-04-08 08:19:35,190 INFO L276 IsEmpty]: Start isEmpty. Operand 1323 states and 1672 transitions. [2022-04-08 08:19:35,191 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:19:35,191 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:19:35,191 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:19:35,191 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:19:35,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1321 states, 1317 states have (on average 1.2665148063781322) internal successors, (1668), 1317 states have internal predecessors, (1668), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:35,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1321 states to 1321 states and 1671 transitions. [2022-04-08 08:19:35,261 INFO L78 Accepts]: Start accepts. Automaton has 1321 states and 1671 transitions. Word has length 23 [2022-04-08 08:19:35,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:19:35,261 INFO L478 AbstractCegarLoop]: Abstraction has 1321 states and 1671 transitions. [2022-04-08 08:19:35,261 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:35,261 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1321 states and 1671 transitions. [2022-04-08 08:19:36,829 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1671 edges. 1671 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:19:36,829 INFO L276 IsEmpty]: Start isEmpty. Operand 1321 states and 1671 transitions. [2022-04-08 08:19:36,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-08 08:19:36,830 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:19:36,830 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:19:36,831 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-08 08:19:36,831 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:19:36,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:19:36,831 INFO L85 PathProgramCache]: Analyzing trace with hash 2144742072, now seen corresponding path program 1 times [2022-04-08 08:19:36,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:19:36,831 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [767100078] [2022-04-08 08:19:36,831 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:19:36,831 INFO L85 PathProgramCache]: Analyzing trace with hash 2144742072, now seen corresponding path program 2 times [2022-04-08 08:19:36,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:19:36,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563312881] [2022-04-08 08:19:36,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:19:36,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:19:36,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:19:36,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:19:36,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:19:36,857 INFO L290 TraceCheckUtils]: 0: Hoare triple {43481#(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); {43475#true} is VALID [2022-04-08 08:19:36,857 INFO L290 TraceCheckUtils]: 1: Hoare triple {43475#true} assume true; {43475#true} is VALID [2022-04-08 08:19:36,857 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {43475#true} {43475#true} #149#return; {43475#true} is VALID [2022-04-08 08:19:36,857 INFO L272 TraceCheckUtils]: 0: Hoare triple {43475#true} call ULTIMATE.init(); {43481#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:19:36,857 INFO L290 TraceCheckUtils]: 1: Hoare triple {43481#(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); {43475#true} is VALID [2022-04-08 08:19:36,858 INFO L290 TraceCheckUtils]: 2: Hoare triple {43475#true} assume true; {43475#true} is VALID [2022-04-08 08:19:36,858 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43475#true} {43475#true} #149#return; {43475#true} is VALID [2022-04-08 08:19:36,858 INFO L272 TraceCheckUtils]: 4: Hoare triple {43475#true} call #t~ret12 := main(); {43475#true} is VALID [2022-04-08 08:19:36,858 INFO L290 TraceCheckUtils]: 5: Hoare triple {43475#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;havoc ~cond~0; {43475#true} is VALID [2022-04-08 08:19:36,858 INFO L290 TraceCheckUtils]: 6: Hoare triple {43475#true} assume !false;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~cond~0 := #t~nondet11;havoc #t~nondet11; {43475#true} is VALID [2022-04-08 08:19:36,858 INFO L290 TraceCheckUtils]: 7: Hoare triple {43475#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0; {43475#true} is VALID [2022-04-08 08:19:36,858 INFO L290 TraceCheckUtils]: 8: Hoare triple {43475#true} assume !(0 != ~p1~0); {43475#true} is VALID [2022-04-08 08:19:36,858 INFO L290 TraceCheckUtils]: 9: Hoare triple {43475#true} assume !(0 != ~p2~0); {43475#true} is VALID [2022-04-08 08:19:36,858 INFO L290 TraceCheckUtils]: 10: Hoare triple {43475#true} assume !(0 != ~p3~0); {43475#true} is VALID [2022-04-08 08:19:36,858 INFO L290 TraceCheckUtils]: 11: Hoare triple {43475#true} assume !(0 != ~p4~0); {43475#true} is VALID [2022-04-08 08:19:36,858 INFO L290 TraceCheckUtils]: 12: Hoare triple {43475#true} assume !(0 != ~p5~0); {43475#true} is VALID [2022-04-08 08:19:36,859 INFO L290 TraceCheckUtils]: 13: Hoare triple {43475#true} assume 0 != ~p6~0;~lk6~0 := 1; {43480#(not (= main_~p6~0 0))} is VALID [2022-04-08 08:19:36,859 INFO L290 TraceCheckUtils]: 14: Hoare triple {43480#(not (= main_~p6~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {43480#(not (= main_~p6~0 0))} is VALID [2022-04-08 08:19:36,859 INFO L290 TraceCheckUtils]: 15: Hoare triple {43480#(not (= main_~p6~0 0))} assume !(0 != ~p1~0); {43480#(not (= main_~p6~0 0))} is VALID [2022-04-08 08:19:36,859 INFO L290 TraceCheckUtils]: 16: Hoare triple {43480#(not (= main_~p6~0 0))} assume !(0 != ~p2~0); {43480#(not (= main_~p6~0 0))} is VALID [2022-04-08 08:19:36,860 INFO L290 TraceCheckUtils]: 17: Hoare triple {43480#(not (= main_~p6~0 0))} assume !(0 != ~p3~0); {43480#(not (= main_~p6~0 0))} is VALID [2022-04-08 08:19:36,860 INFO L290 TraceCheckUtils]: 18: Hoare triple {43480#(not (= main_~p6~0 0))} assume !(0 != ~p4~0); {43480#(not (= main_~p6~0 0))} is VALID [2022-04-08 08:19:36,860 INFO L290 TraceCheckUtils]: 19: Hoare triple {43480#(not (= main_~p6~0 0))} assume !(0 != ~p5~0); {43480#(not (= main_~p6~0 0))} is VALID [2022-04-08 08:19:36,861 INFO L290 TraceCheckUtils]: 20: Hoare triple {43480#(not (= main_~p6~0 0))} assume !(0 != ~p6~0); {43476#false} is VALID [2022-04-08 08:19:36,861 INFO L290 TraceCheckUtils]: 21: Hoare triple {43476#false} assume 0 != ~p7~0; {43476#false} is VALID [2022-04-08 08:19:36,861 INFO L290 TraceCheckUtils]: 22: Hoare triple {43476#false} assume 1 != ~lk7~0; {43476#false} is VALID [2022-04-08 08:19:36,861 INFO L290 TraceCheckUtils]: 23: Hoare triple {43476#false} assume !false; {43476#false} is VALID [2022-04-08 08:19:36,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:19:36,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:19:36,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563312881] [2022-04-08 08:19:36,861 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563312881] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:19:36,861 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:19:36,862 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:19:36,862 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:19:36,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [767100078] [2022-04-08 08:19:36,862 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [767100078] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:19:36,862 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:19:36,862 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:19:36,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761605212] [2022-04-08 08:19:36,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:19:36,862 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-08 08:19:36,862 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:19:36,862 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:36,877 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:19:36,877 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:19:36,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:19:36,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:19:36,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:19:36,878 INFO L87 Difference]: Start difference. First operand 1321 states and 1671 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:37,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:19:37,206 INFO L93 Difference]: Finished difference Result 1981 states and 2489 transitions. [2022-04-08 08:19:37,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:19:37,207 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-08 08:19:37,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:19:37,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:37,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 118 transitions. [2022-04-08 08:19:37,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:37,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 118 transitions. [2022-04-08 08:19:37,208 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 118 transitions. [2022-04-08 08:19:37,275 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-08 08:19:37,345 INFO L225 Difference]: With dead ends: 1981 [2022-04-08 08:19:37,345 INFO L226 Difference]: Without dead ends: 1355 [2022-04-08 08:19:37,346 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:19:37,347 INFO L913 BasicCegarLoop]: 61 mSDtfsCounter, 87 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 68 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-08 08:19:37,347 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [87 Valid, 68 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 08:19:37,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1355 states. [2022-04-08 08:19:37,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1355 to 1353. [2022-04-08 08:19:37,441 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:19:37,442 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1355 states. Second operand has 1353 states, 1349 states have (on average 1.2364714603409934) internal successors, (1668), 1349 states have internal predecessors, (1668), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:37,443 INFO L74 IsIncluded]: Start isIncluded. First operand 1355 states. Second operand has 1353 states, 1349 states have (on average 1.2364714603409934) internal successors, (1668), 1349 states have internal predecessors, (1668), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:37,444 INFO L87 Difference]: Start difference. First operand 1355 states. Second operand has 1353 states, 1349 states have (on average 1.2364714603409934) internal successors, (1668), 1349 states have internal predecessors, (1668), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:37,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:19:37,494 INFO L93 Difference]: Finished difference Result 1355 states and 1672 transitions. [2022-04-08 08:19:37,494 INFO L276 IsEmpty]: Start isEmpty. Operand 1355 states and 1672 transitions. [2022-04-08 08:19:37,495 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:19:37,496 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:19:37,497 INFO L74 IsIncluded]: Start isIncluded. First operand has 1353 states, 1349 states have (on average 1.2364714603409934) internal successors, (1668), 1349 states have internal predecessors, (1668), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1355 states. [2022-04-08 08:19:37,498 INFO L87 Difference]: Start difference. First operand has 1353 states, 1349 states have (on average 1.2364714603409934) internal successors, (1668), 1349 states have internal predecessors, (1668), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1355 states. [2022-04-08 08:19:37,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:19:37,546 INFO L93 Difference]: Finished difference Result 1355 states and 1672 transitions. [2022-04-08 08:19:37,546 INFO L276 IsEmpty]: Start isEmpty. Operand 1355 states and 1672 transitions. [2022-04-08 08:19:37,547 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:19:37,547 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:19:37,547 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:19:37,547 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:19:37,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1353 states, 1349 states have (on average 1.2364714603409934) internal successors, (1668), 1349 states have internal predecessors, (1668), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:37,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1353 states to 1353 states and 1671 transitions. [2022-04-08 08:19:37,617 INFO L78 Accepts]: Start accepts. Automaton has 1353 states and 1671 transitions. Word has length 24 [2022-04-08 08:19:37,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:19:37,617 INFO L478 AbstractCegarLoop]: Abstraction has 1353 states and 1671 transitions. [2022-04-08 08:19:37,617 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:37,617 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1353 states and 1671 transitions. [2022-04-08 08:19:39,115 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1671 edges. 1671 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:19:39,115 INFO L276 IsEmpty]: Start isEmpty. Operand 1353 states and 1671 transitions. [2022-04-08 08:19:39,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-08 08:19:39,116 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:19:39,116 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:19:39,117 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-04-08 08:19:39,117 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:19:39,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:19:39,117 INFO L85 PathProgramCache]: Analyzing trace with hash -1449160646, now seen corresponding path program 1 times [2022-04-08 08:19:39,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:19:39,117 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [432745443] [2022-04-08 08:19:39,117 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:19:39,117 INFO L85 PathProgramCache]: Analyzing trace with hash -1449160646, now seen corresponding path program 2 times [2022-04-08 08:19:39,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:19:39,118 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254505581] [2022-04-08 08:19:39,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:19:39,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:19:39,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:19:39,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:19:39,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:19:39,151 INFO L290 TraceCheckUtils]: 0: Hoare triple {52871#(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); {52865#true} is VALID [2022-04-08 08:19:39,151 INFO L290 TraceCheckUtils]: 1: Hoare triple {52865#true} assume true; {52865#true} is VALID [2022-04-08 08:19:39,151 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {52865#true} {52865#true} #149#return; {52865#true} is VALID [2022-04-08 08:19:39,152 INFO L272 TraceCheckUtils]: 0: Hoare triple {52865#true} call ULTIMATE.init(); {52871#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:19:39,152 INFO L290 TraceCheckUtils]: 1: Hoare triple {52871#(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); {52865#true} is VALID [2022-04-08 08:19:39,152 INFO L290 TraceCheckUtils]: 2: Hoare triple {52865#true} assume true; {52865#true} is VALID [2022-04-08 08:19:39,152 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {52865#true} {52865#true} #149#return; {52865#true} is VALID [2022-04-08 08:19:39,152 INFO L272 TraceCheckUtils]: 4: Hoare triple {52865#true} call #t~ret12 := main(); {52865#true} is VALID [2022-04-08 08:19:39,152 INFO L290 TraceCheckUtils]: 5: Hoare triple {52865#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;havoc ~cond~0; {52865#true} is VALID [2022-04-08 08:19:39,152 INFO L290 TraceCheckUtils]: 6: Hoare triple {52865#true} assume !false;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~cond~0 := #t~nondet11;havoc #t~nondet11; {52865#true} is VALID [2022-04-08 08:19:39,152 INFO L290 TraceCheckUtils]: 7: Hoare triple {52865#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0; {52865#true} is VALID [2022-04-08 08:19:39,152 INFO L290 TraceCheckUtils]: 8: Hoare triple {52865#true} assume !(0 != ~p1~0); {52865#true} is VALID [2022-04-08 08:19:39,152 INFO L290 TraceCheckUtils]: 9: Hoare triple {52865#true} assume !(0 != ~p2~0); {52865#true} is VALID [2022-04-08 08:19:39,152 INFO L290 TraceCheckUtils]: 10: Hoare triple {52865#true} assume !(0 != ~p3~0); {52865#true} is VALID [2022-04-08 08:19:39,153 INFO L290 TraceCheckUtils]: 11: Hoare triple {52865#true} assume !(0 != ~p4~0); {52865#true} is VALID [2022-04-08 08:19:39,153 INFO L290 TraceCheckUtils]: 12: Hoare triple {52865#true} assume !(0 != ~p5~0); {52865#true} is VALID [2022-04-08 08:19:39,153 INFO L290 TraceCheckUtils]: 13: Hoare triple {52865#true} assume !(0 != ~p6~0); {52865#true} is VALID [2022-04-08 08:19:39,153 INFO L290 TraceCheckUtils]: 14: Hoare triple {52865#true} assume 0 != ~p7~0;~lk7~0 := 1; {52870#(= main_~lk7~0 1)} is VALID [2022-04-08 08:19:39,153 INFO L290 TraceCheckUtils]: 15: Hoare triple {52870#(= main_~lk7~0 1)} assume !(0 != ~p1~0); {52870#(= main_~lk7~0 1)} is VALID [2022-04-08 08:19:39,153 INFO L290 TraceCheckUtils]: 16: Hoare triple {52870#(= main_~lk7~0 1)} assume !(0 != ~p2~0); {52870#(= main_~lk7~0 1)} is VALID [2022-04-08 08:19:39,154 INFO L290 TraceCheckUtils]: 17: Hoare triple {52870#(= main_~lk7~0 1)} assume !(0 != ~p3~0); {52870#(= main_~lk7~0 1)} is VALID [2022-04-08 08:19:39,154 INFO L290 TraceCheckUtils]: 18: Hoare triple {52870#(= main_~lk7~0 1)} assume !(0 != ~p4~0); {52870#(= main_~lk7~0 1)} is VALID [2022-04-08 08:19:39,155 INFO L290 TraceCheckUtils]: 19: Hoare triple {52870#(= main_~lk7~0 1)} assume !(0 != ~p5~0); {52870#(= main_~lk7~0 1)} is VALID [2022-04-08 08:19:39,155 INFO L290 TraceCheckUtils]: 20: Hoare triple {52870#(= main_~lk7~0 1)} assume !(0 != ~p6~0); {52870#(= main_~lk7~0 1)} is VALID [2022-04-08 08:19:39,155 INFO L290 TraceCheckUtils]: 21: Hoare triple {52870#(= main_~lk7~0 1)} assume 0 != ~p7~0; {52870#(= main_~lk7~0 1)} is VALID [2022-04-08 08:19:39,156 INFO L290 TraceCheckUtils]: 22: Hoare triple {52870#(= main_~lk7~0 1)} assume 1 != ~lk7~0; {52866#false} is VALID [2022-04-08 08:19:39,156 INFO L290 TraceCheckUtils]: 23: Hoare triple {52866#false} assume !false; {52866#false} is VALID [2022-04-08 08:19:39,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:19:39,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:19:39,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254505581] [2022-04-08 08:19:39,156 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254505581] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:19:39,156 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:19:39,156 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:19:39,157 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:19:39,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [432745443] [2022-04-08 08:19:39,157 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [432745443] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:19:39,157 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:19:39,157 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:19:39,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557470241] [2022-04-08 08:19:39,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:19:39,157 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-08 08:19:39,157 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:19:39,157 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:39,171 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:19:39,171 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:19:39,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:19:39,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:19:39,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:19:39,172 INFO L87 Difference]: Start difference. First operand 1353 states and 1671 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:39,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:19:39,572 INFO L93 Difference]: Finished difference Result 2187 states and 2664 transitions. [2022-04-08 08:19:39,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:19:39,572 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-08 08:19:39,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:19:39,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:39,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 70 transitions. [2022-04-08 08:19:39,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:39,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 70 transitions. [2022-04-08 08:19:39,573 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 70 transitions. [2022-04-08 08:19:39,614 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:19:39,813 INFO L225 Difference]: With dead ends: 2187 [2022-04-08 08:19:39,813 INFO L226 Difference]: Without dead ends: 2185 [2022-04-08 08:19:39,814 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:19:39,814 INFO L913 BasicCegarLoop]: 46 mSDtfsCounter, 74 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 08:19:39,814 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [74 Valid, 53 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 08:19:39,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2185 states. [2022-04-08 08:19:39,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2185 to 2057. [2022-04-08 08:19:39,935 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:19:39,937 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2185 states. Second operand has 2057 states, 2053 states have (on average 1.2021432050657574) internal successors, (2468), 2053 states have internal predecessors, (2468), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:39,939 INFO L74 IsIncluded]: Start isIncluded. First operand 2185 states. Second operand has 2057 states, 2053 states have (on average 1.2021432050657574) internal successors, (2468), 2053 states have internal predecessors, (2468), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:39,940 INFO L87 Difference]: Start difference. First operand 2185 states. Second operand has 2057 states, 2053 states have (on average 1.2021432050657574) internal successors, (2468), 2053 states have internal predecessors, (2468), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:40,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:19:40,066 INFO L93 Difference]: Finished difference Result 2185 states and 2599 transitions. [2022-04-08 08:19:40,066 INFO L276 IsEmpty]: Start isEmpty. Operand 2185 states and 2599 transitions. [2022-04-08 08:19:40,068 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:19:40,068 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:19:40,070 INFO L74 IsIncluded]: Start isIncluded. First operand has 2057 states, 2053 states have (on average 1.2021432050657574) internal successors, (2468), 2053 states have internal predecessors, (2468), 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 2185 states. [2022-04-08 08:19:40,072 INFO L87 Difference]: Start difference. First operand has 2057 states, 2053 states have (on average 1.2021432050657574) internal successors, (2468), 2053 states have internal predecessors, (2468), 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 2185 states. [2022-04-08 08:19:40,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:19:40,221 INFO L93 Difference]: Finished difference Result 2185 states and 2599 transitions. [2022-04-08 08:19:40,221 INFO L276 IsEmpty]: Start isEmpty. Operand 2185 states and 2599 transitions. [2022-04-08 08:19:40,223 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:19:40,223 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:19:40,224 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:19:40,224 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:19:40,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2057 states, 2053 states have (on average 1.2021432050657574) internal successors, (2468), 2053 states have internal predecessors, (2468), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:40,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2057 states to 2057 states and 2471 transitions. [2022-04-08 08:19:40,442 INFO L78 Accepts]: Start accepts. Automaton has 2057 states and 2471 transitions. Word has length 24 [2022-04-08 08:19:40,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:19:40,443 INFO L478 AbstractCegarLoop]: Abstraction has 2057 states and 2471 transitions. [2022-04-08 08:19:40,443 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:40,443 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 2057 states and 2471 transitions. [2022-04-08 08:19:42,796 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2471 edges. 2471 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:19:42,796 INFO L276 IsEmpty]: Start isEmpty. Operand 2057 states and 2471 transitions. [2022-04-08 08:19:42,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-08 08:19:42,798 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 08:19:42,798 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 08:19:42,798 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-04-08 08:19:42,798 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 08:19:42,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 08:19:42,798 INFO L85 PathProgramCache]: Analyzing trace with hash -1842187656, now seen corresponding path program 1 times [2022-04-08 08:19:42,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 08:19:42,799 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [672880085] [2022-04-08 08:19:42,799 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 08:19:42,799 INFO L85 PathProgramCache]: Analyzing trace with hash -1842187656, now seen corresponding path program 2 times [2022-04-08 08:19:42,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 08:19:42,799 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299340893] [2022-04-08 08:19:42,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 08:19:42,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 08:19:42,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:19:42,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 08:19:42,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 08:19:42,846 INFO L290 TraceCheckUtils]: 0: Hoare triple {65741#(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); {65735#true} is VALID [2022-04-08 08:19:42,846 INFO L290 TraceCheckUtils]: 1: Hoare triple {65735#true} assume true; {65735#true} is VALID [2022-04-08 08:19:42,846 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {65735#true} {65735#true} #149#return; {65735#true} is VALID [2022-04-08 08:19:42,847 INFO L272 TraceCheckUtils]: 0: Hoare triple {65735#true} call ULTIMATE.init(); {65741#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 08:19:42,847 INFO L290 TraceCheckUtils]: 1: Hoare triple {65741#(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); {65735#true} is VALID [2022-04-08 08:19:42,847 INFO L290 TraceCheckUtils]: 2: Hoare triple {65735#true} assume true; {65735#true} is VALID [2022-04-08 08:19:42,847 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {65735#true} {65735#true} #149#return; {65735#true} is VALID [2022-04-08 08:19:42,847 INFO L272 TraceCheckUtils]: 4: Hoare triple {65735#true} call #t~ret12 := main(); {65735#true} is VALID [2022-04-08 08:19:42,847 INFO L290 TraceCheckUtils]: 5: Hoare triple {65735#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;havoc ~cond~0; {65735#true} is VALID [2022-04-08 08:19:42,847 INFO L290 TraceCheckUtils]: 6: Hoare triple {65735#true} assume !false;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~cond~0 := #t~nondet11;havoc #t~nondet11; {65735#true} is VALID [2022-04-08 08:19:42,848 INFO L290 TraceCheckUtils]: 7: Hoare triple {65735#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0; {65735#true} is VALID [2022-04-08 08:19:42,848 INFO L290 TraceCheckUtils]: 8: Hoare triple {65735#true} assume !(0 != ~p1~0); {65735#true} is VALID [2022-04-08 08:19:42,848 INFO L290 TraceCheckUtils]: 9: Hoare triple {65735#true} assume !(0 != ~p2~0); {65735#true} is VALID [2022-04-08 08:19:42,848 INFO L290 TraceCheckUtils]: 10: Hoare triple {65735#true} assume !(0 != ~p3~0); {65735#true} is VALID [2022-04-08 08:19:42,848 INFO L290 TraceCheckUtils]: 11: Hoare triple {65735#true} assume !(0 != ~p4~0); {65735#true} is VALID [2022-04-08 08:19:42,848 INFO L290 TraceCheckUtils]: 12: Hoare triple {65735#true} assume !(0 != ~p5~0); {65735#true} is VALID [2022-04-08 08:19:42,848 INFO L290 TraceCheckUtils]: 13: Hoare triple {65735#true} assume !(0 != ~p6~0); {65735#true} is VALID [2022-04-08 08:19:42,848 INFO L290 TraceCheckUtils]: 14: Hoare triple {65735#true} assume !(0 != ~p7~0); {65740#(= main_~p7~0 0)} is VALID [2022-04-08 08:19:42,849 INFO L290 TraceCheckUtils]: 15: Hoare triple {65740#(= main_~p7~0 0)} assume !(0 != ~p1~0); {65740#(= main_~p7~0 0)} is VALID [2022-04-08 08:19:42,849 INFO L290 TraceCheckUtils]: 16: Hoare triple {65740#(= main_~p7~0 0)} assume !(0 != ~p2~0); {65740#(= main_~p7~0 0)} is VALID [2022-04-08 08:19:42,849 INFO L290 TraceCheckUtils]: 17: Hoare triple {65740#(= main_~p7~0 0)} assume !(0 != ~p3~0); {65740#(= main_~p7~0 0)} is VALID [2022-04-08 08:19:42,849 INFO L290 TraceCheckUtils]: 18: Hoare triple {65740#(= main_~p7~0 0)} assume !(0 != ~p4~0); {65740#(= main_~p7~0 0)} is VALID [2022-04-08 08:19:42,850 INFO L290 TraceCheckUtils]: 19: Hoare triple {65740#(= main_~p7~0 0)} assume !(0 != ~p5~0); {65740#(= main_~p7~0 0)} is VALID [2022-04-08 08:19:42,850 INFO L290 TraceCheckUtils]: 20: Hoare triple {65740#(= main_~p7~0 0)} assume !(0 != ~p6~0); {65740#(= main_~p7~0 0)} is VALID [2022-04-08 08:19:42,850 INFO L290 TraceCheckUtils]: 21: Hoare triple {65740#(= main_~p7~0 0)} assume 0 != ~p7~0; {65736#false} is VALID [2022-04-08 08:19:42,850 INFO L290 TraceCheckUtils]: 22: Hoare triple {65736#false} assume 1 != ~lk7~0; {65736#false} is VALID [2022-04-08 08:19:42,850 INFO L290 TraceCheckUtils]: 23: Hoare triple {65736#false} assume !false; {65736#false} is VALID [2022-04-08 08:19:42,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 08:19:42,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 08:19:42,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299340893] [2022-04-08 08:19:42,851 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299340893] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:19:42,851 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:19:42,851 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:19:42,851 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 08:19:42,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [672880085] [2022-04-08 08:19:42,851 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [672880085] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 08:19:42,851 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 08:19:42,851 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 08:19:42,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044540814] [2022-04-08 08:19:42,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 08:19:42,852 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-08 08:19:42,852 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 08:19:42,852 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:42,864 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:19:42,864 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 08:19:42,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 08:19:42,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 08:19:42,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 08:19:42,864 INFO L87 Difference]: Start difference. First operand 2057 states and 2471 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:44,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:19:44,018 INFO L93 Difference]: Finished difference Result 4553 states and 5351 transitions. [2022-04-08 08:19:44,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 08:19:44,019 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-08 08:19:44,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 08:19:44,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:44,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 118 transitions. [2022-04-08 08:19:44,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:44,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 118 transitions. [2022-04-08 08:19:44,020 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 118 transitions. [2022-04-08 08:19:44,087 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-08 08:19:44,087 INFO L225 Difference]: With dead ends: 4553 [2022-04-08 08:19:44,087 INFO L226 Difference]: Without dead ends: 0 [2022-04-08 08:19:44,092 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 08:19:44,092 INFO L913 BasicCegarLoop]: 75 mSDtfsCounter, 64 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 08:19:44,092 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [64 Valid, 82 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 08:19:44,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-08 08:19:44,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-08 08:19:44,093 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 08:19:44,093 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-08 08:19:44,093 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-08 08:19:44,093 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-08 08:19:44,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:19:44,093 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-08 08:19:44,093 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 08:19:44,093 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:19:44,094 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:19:44,094 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-08 08:19:44,094 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-08 08:19:44,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 08:19:44,094 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-08 08:19:44,094 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 08:19:44,094 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:19:44,094 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 08:19:44,094 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 08:19:44,094 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 08:19:44,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-08 08:19:44,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-08 08:19:44,095 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 24 [2022-04-08 08:19:44,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 08:19:44,095 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-08 08:19:44,095 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 08:19:44,095 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-08 08:19:44,095 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 08:19:44,095 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-08 08:19:44,096 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 08:19:44,098 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-08 08:19:44,098 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-04-08 08:19:44,100 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-08 08:20:13,322 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 3) no Hoare annotation was computed. [2022-04-08 08:20:13,322 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 3) no Hoare annotation was computed. [2022-04-08 08:20:13,322 INFO L882 garLoopResultBuilder]: For program point reach_errorFINAL(line 3) no Hoare annotation was computed. [2022-04-08 08:20:13,322 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-08 08:20:13,322 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-08 08:20:13,323 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-08 08:20:13,323 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-08 08:20:13,323 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-08 08:20:13,323 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-08 08:20:13,323 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-08 08:20:13,323 INFO L878 garLoopResultBuilder]: At program point L93-1(lines 32 118) the Hoare annotation is: (let ((.cse0 (= main_~lk5~0 1)) (.cse2 (= main_~p7~0 0)) (.cse1 (= main_~lk4~0 1)) (.cse3 (= main_~p6~0 0)) (.cse4 (= main_~lk7~0 1)) (.cse5 (= main_~p4~0 0)) (.cse7 (= main_~p5~0 0)) (.cse6 (= main_~lk6~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse0 .cse3) (and .cse0 .cse1 .cse2 .cse6) (and .cse4 .cse0 .cse1 .cse3) (and .cse5 .cse2 .cse7 .cse6) (and .cse4 .cse0 .cse1 .cse6) (and .cse5 .cse0 .cse2 .cse3) (and .cse5 .cse2 .cse7 .cse3) (and .cse1 .cse2 .cse7 .cse6) (and .cse4 .cse5 .cse7 .cse3) (and .cse4 .cse5 .cse0 .cse6) (and .cse1 .cse2 .cse7 .cse3) (and .cse4 .cse1 .cse7 .cse6) (and .cse5 .cse0 .cse2 .cse6) (and .cse4 .cse1 .cse7 .cse3) (and .cse4 .cse5 .cse7 .cse6))) [2022-04-08 08:20:13,323 INFO L885 garLoopResultBuilder]: At program point mainEXIT(lines 6 123) the Hoare annotation is: true [2022-04-08 08:20:13,324 INFO L878 garLoopResultBuilder]: At program point L77-1(lines 32 118) the Hoare annotation is: (let ((.cse9 (= main_~lk3~0 1)) (.cse7 (= main_~lk5~0 1)) (.cse8 (= main_~lk1~0 1)) (.cse11 (= main_~lk4~0 1)) (.cse2 (= main_~p7~0 0)) (.cse13 (= main_~p2~0 0)) (.cse4 (= main_~lk6~0 1)) (.cse12 (= main_~lk7~0 1)) (.cse0 (= main_~p4~0 0)) (.cse1 (= main_~p1~0 0)) (.cse3 (= main_~p5~0 0)) (.cse10 (= main_~p6~0 0)) (.cse5 (= main_~p3~0 0)) (.cse6 (= main_~lk2~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse7 .cse8 .cse9 .cse2 .cse10 .cse6) (and .cse7 .cse11 .cse1 .cse2 .cse4 .cse5 .cse6) (and .cse7 .cse8 .cse11 .cse2 .cse4 .cse5 .cse6) (and .cse12 .cse11 .cse1 .cse3 .cse13 .cse4 .cse5) (and .cse12 .cse8 .cse11 .cse3 .cse13 .cse4 .cse5) (and .cse8 .cse11 .cse9 .cse2 .cse3 .cse13 .cse4) (and .cse0 .cse8 .cse2 .cse3 .cse13 .cse10 .cse5) (and .cse12 .cse7 .cse11 .cse9 .cse1 .cse13 .cse10) (and .cse12 .cse0 .cse8 .cse9 .cse3 .cse10 .cse6) (and .cse0 .cse8 .cse9 .cse2 .cse3 .cse4 .cse6) (and .cse7 .cse8 .cse11 .cse9 .cse2 .cse13 .cse4) (and .cse7 .cse11 .cse9 .cse1 .cse2 .cse13 .cse4) (and .cse12 .cse8 .cse11 .cse9 .cse3 .cse10 .cse6) (and .cse7 .cse8 .cse11 .cse2 .cse13 .cse4 .cse5) (and .cse8 .cse11 .cse9 .cse2 .cse3 .cse13 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse13 .cse10 .cse5) (and .cse12 .cse0 .cse7 .cse1 .cse13 .cse4 .cse5) (and .cse8 .cse11 .cse9 .cse2 .cse3 .cse4 .cse6) (and .cse0 .cse7 .cse8 .cse2 .cse4 .cse5 .cse6) (and .cse0 .cse9 .cse1 .cse2 .cse3 .cse13 .cse10) (and .cse12 .cse0 .cse7 .cse9 .cse1 .cse13 .cse4) (and .cse0 .cse7 .cse1 .cse2 .cse13 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse3 .cse13 .cse4 .cse5) (and .cse12 .cse0 .cse8 .cse3 .cse4 .cse5 .cse6) (and .cse12 .cse0 .cse7 .cse1 .cse4 .cse5 .cse6) (and .cse11 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse8 .cse9 .cse2 .cse3 .cse13 .cse4) (and .cse12 .cse7 .cse11 .cse1 .cse13 .cse10 .cse5) (and .cse12 .cse7 .cse11 .cse1 .cse13 .cse4 .cse5) (and .cse12 .cse0 .cse7 .cse9 .cse1 .cse4 .cse6) (and .cse0 .cse9 .cse1 .cse2 .cse3 .cse10 .cse6) (and .cse12 .cse7 .cse11 .cse9 .cse1 .cse4 .cse6) (and .cse12 .cse0 .cse7 .cse8 .cse9 .cse4 .cse6) (and .cse7 .cse11 .cse9 .cse1 .cse2 .cse4 .cse6) (and .cse12 .cse7 .cse8 .cse11 .cse13 .cse10 .cse5) (and .cse12 .cse0 .cse8 .cse3 .cse13 .cse10 .cse5) (and .cse12 .cse0 .cse9 .cse1 .cse3 .cse13 .cse4) (and .cse0 .cse8 .cse2 .cse3 .cse13 .cse4 .cse5) (and .cse12 .cse0 .cse8 .cse3 .cse13 .cse4 .cse5) (and .cse12 .cse11 .cse1 .cse3 .cse13 .cse10 .cse5) (and .cse12 .cse11 .cse9 .cse1 .cse3 .cse4 .cse6) (and .cse0 .cse7 .cse1 .cse2 .cse10 .cse5 .cse6) (and .cse0 .cse7 .cse9 .cse1 .cse2 .cse10 .cse6) (and .cse11 .cse1 .cse2 .cse3 .cse10 .cse5 .cse6) (and .cse12 .cse7 .cse8 .cse11 .cse9 .cse10 .cse6) (and .cse11 .cse1 .cse2 .cse3 .cse13 .cse4 .cse5) (and .cse12 .cse8 .cse11 .cse9 .cse3 .cse4 .cse6) (and .cse0 .cse1 .cse2 .cse3 .cse10 .cse5 .cse6) (and .cse12 .cse0 .cse9 .cse1 .cse3 .cse4 .cse6) (and .cse12 .cse7 .cse8 .cse11 .cse9 .cse13 .cse4) (and .cse12 .cse0 .cse7 .cse8 .cse13 .cse4 .cse5) (and .cse0 .cse7 .cse9 .cse1 .cse2 .cse13 .cse10) (and .cse12 .cse0 .cse8 .cse9 .cse3 .cse13 .cse4) (and .cse0 .cse7 .cse8 .cse9 .cse2 .cse4 .cse6) (and .cse11 .cse9 .cse1 .cse2 .cse3 .cse4 .cse6) (and .cse0 .cse7 .cse1 .cse2 .cse13 .cse10 .cse5) (and .cse12 .cse0 .cse7 .cse9 .cse1 .cse13 .cse10) (and .cse0 .cse7 .cse9 .cse1 .cse2 .cse4 .cse6) (and .cse8 .cse11 .cse2 .cse3 .cse13 .cse10 .cse5) (and .cse12 .cse0 .cse7 .cse8 .cse9 .cse10 .cse6) (and .cse0 .cse9 .cse1 .cse2 .cse3 .cse13 .cse4) (and .cse12 .cse0 .cse7 .cse8 .cse10 .cse5 .cse6) (and .cse7 .cse11 .cse1 .cse2 .cse13 .cse10 .cse5) (and .cse11 .cse9 .cse1 .cse2 .cse3 .cse13 .cse4) (and .cse12 .cse8 .cse11 .cse3 .cse10 .cse5 .cse6) (and .cse7 .cse11 .cse9 .cse1 .cse2 .cse13 .cse10) (and .cse11 .cse1 .cse2 .cse3 .cse13 .cse10 .cse5) (and .cse12 .cse0 .cse7 .cse8 .cse9 .cse13 .cse4) (and .cse0 .cse8 .cse9 .cse2 .cse3 .cse13 .cse10) (and .cse0 .cse8 .cse9 .cse2 .cse3 .cse10 .cse6) (and .cse12 .cse7 .cse8 .cse11 .cse4 .cse5 .cse6) (and .cse7 .cse8 .cse11 .cse9 .cse2 .cse10 .cse6) (and .cse0 .cse8 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse12 .cse7 .cse11 .cse9 .cse1 .cse10 .cse6) (and .cse12 .cse0 .cse1 .cse3 .cse13 .cse4 .cse5) (and .cse0 .cse9 .cse1 .cse2 .cse3 .cse4 .cse6) (and .cse12 .cse7 .cse11 .cse9 .cse1 .cse13 .cse4) (and .cse12 .cse8 .cse11 .cse3 .cse13 .cse10 .cse5) (and .cse12 .cse11 .cse9 .cse1 .cse3 .cse10 .cse6) (and .cse12 .cse0 .cse7 .cse9 .cse1 .cse10 .cse6) (and .cse7 .cse11 .cse9 .cse1 .cse2 .cse10 .cse6) (and .cse12 .cse7 .cse8 .cse11 .cse13 .cse4 .cse5) (and .cse12 .cse11 .cse1 .cse3 .cse10 .cse5 .cse6) (and .cse7 .cse8 .cse11 .cse9 .cse2 .cse4 .cse6) (and .cse12 .cse0 .cse8 .cse9 .cse3 .cse4 .cse6) (and .cse7 .cse11 .cse1 .cse2 .cse13 .cse4 .cse5) (and .cse0 .cse7 .cse8 .cse2 .cse10 .cse5 .cse6) (and .cse12 .cse0 .cse9 .cse1 .cse3 .cse10 .cse6) (and .cse12 .cse0 .cse8 .cse3 .cse10 .cse5 .cse6) (and .cse12 .cse0 .cse1 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse7 .cse9 .cse1 .cse2 .cse13 .cse4) (and .cse8 .cse11 .cse9 .cse2 .cse3 .cse10 .cse6) (and .cse12 .cse11 .cse9 .cse1 .cse3 .cse13 .cse10) (and .cse7 .cse8 .cse11 .cse2 .cse13 .cse10 .cse5) (and .cse12 .cse8 .cse11 .cse3 .cse4 .cse5 .cse6) (and .cse12 .cse0 .cse1 .cse3 .cse13 .cse10 .cse5) (and .cse0 .cse7 .cse8 .cse9 .cse2 .cse13 .cse4) (and .cse12 .cse8 .cse11 .cse9 .cse3 .cse13 .cse4) (and .cse12 .cse0 .cse7 .cse8 .cse9 .cse13 .cse10) (and .cse0 .cse7 .cse1 .cse2 .cse4 .cse5 .cse6) (and .cse12 .cse7 .cse11 .cse1 .cse4 .cse5 .cse6) (and .cse12 .cse11 .cse1 .cse3 .cse4 .cse5 .cse6) (and .cse12 .cse0 .cse9 .cse1 .cse3 .cse13 .cse10) (and .cse12 .cse7 .cse8 .cse11 .cse10 .cse5 .cse6) (and .cse12 .cse7 .cse8 .cse11 .cse9 .cse13 .cse10) (and .cse12 .cse0 .cse7 .cse8 .cse4 .cse5 .cse6) (and .cse7 .cse11 .cse1 .cse2 .cse10 .cse5 .cse6) (and .cse12 .cse0 .cse7 .cse1 .cse13 .cse10 .cse5) (and .cse8 .cse11 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse0 .cse7 .cse8 .cse2 .cse13 .cse4 .cse5) (and .cse7 .cse8 .cse11 .cse9 .cse2 .cse13 .cse10) (and .cse12 .cse7 .cse8 .cse11 .cse9 .cse4 .cse6) (and .cse11 .cse9 .cse1 .cse2 .cse3 .cse10 .cse6) (and .cse11 .cse9 .cse1 .cse2 .cse3 .cse13 .cse10) (and .cse12 .cse0 .cse7 .cse1 .cse10 .cse5 .cse6) (and .cse0 .cse7 .cse8 .cse9 .cse2 .cse13 .cse10) (and .cse0 .cse8 .cse2 .cse3 .cse10 .cse5 .cse6) (and .cse12 .cse0 .cse8 .cse9 .cse3 .cse13 .cse10) (and .cse12 .cse11 .cse9 .cse1 .cse3 .cse13 .cse4) (and .cse12 .cse7 .cse11 .cse1 .cse10 .cse5 .cse6) (and .cse12 .cse0 .cse7 .cse8 .cse13 .cse10 .cse5) (and .cse0 .cse7 .cse8 .cse2 .cse13 .cse10 .cse5) (and .cse12 .cse8 .cse11 .cse9 .cse3 .cse13 .cse10) (and .cse7 .cse8 .cse11 .cse2 .cse10 .cse5 .cse6) (and .cse8 .cse11 .cse2 .cse3 .cse10 .cse5 .cse6) (and .cse8 .cse11 .cse2 .cse3 .cse13 .cse4 .cse5) (and .cse12 .cse0 .cse1 .cse3 .cse10 .cse5 .cse6))) [2022-04-08 08:20:13,324 INFO L878 garLoopResultBuilder]: At program point L69-1(lines 32 118) the Hoare annotation is: (let ((.cse9 (= main_~lk2~0 1)) (.cse4 (= main_~p3~0 0)) (.cse5 (= main_~p4~0 0)) (.cse0 (= main_~lk5~0 1)) (.cse1 (= main_~lk1~0 1)) (.cse2 (= main_~lk4~0 1)) (.cse6 (= main_~lk3~0 1)) (.cse8 (= main_~p1~0 0)) (.cse7 (= main_~p5~0 0)) (.cse3 (= main_~p2~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse1 .cse6 .cse7 .cse3) (and .cse1 .cse2 .cse7 .cse3 .cse4) (and .cse2 .cse8 .cse7 .cse4 .cse9) (and .cse0 .cse2 .cse8 .cse3 .cse4) (and .cse5 .cse0 .cse8 .cse4 .cse9) (and .cse0 .cse2 .cse6 .cse8 .cse9) (and .cse5 .cse1 .cse7 .cse3 .cse4) (and .cse5 .cse6 .cse8 .cse7 .cse9) (and .cse0 .cse1 .cse2 .cse6 .cse3) (and .cse5 .cse0 .cse6 .cse8 .cse3) (and .cse0 .cse1 .cse2 .cse4 .cse9) (and .cse0 .cse1 .cse2 .cse6 .cse9) (and .cse5 .cse0 .cse1 .cse6 .cse9) (and .cse1 .cse2 .cse6 .cse7 .cse9) (and .cse1 .cse2 .cse7 .cse4 .cse9) (and .cse5 .cse0 .cse6 .cse8 .cse9) (and .cse0 .cse2 .cse6 .cse8 .cse3) (and .cse5 .cse0 .cse8 .cse3 .cse4) (and .cse5 .cse1 .cse7 .cse4 .cse9) (and .cse5 .cse8 .cse7 .cse3 .cse4) (and .cse2 .cse6 .cse8 .cse7 .cse9) (and .cse5 .cse0 .cse1 .cse4 .cse9) (and .cse2 .cse8 .cse7 .cse3 .cse4) (and .cse5 .cse1 .cse6 .cse7 .cse9) (and .cse1 .cse2 .cse6 .cse7 .cse3) (and .cse0 .cse2 .cse8 .cse4 .cse9) (and .cse5 .cse8 .cse7 .cse4 .cse9) (and .cse5 .cse6 .cse8 .cse7 .cse3) (and .cse5 .cse0 .cse1 .cse3 .cse4) (and .cse5 .cse0 .cse1 .cse6 .cse3) (and .cse2 .cse6 .cse8 .cse7 .cse3))) [2022-04-08 08:20:13,324 INFO L878 garLoopResultBuilder]: At program point L94(line 94) the Hoare annotation is: (let ((.cse6 (= main_~p7~0 0)) (.cse2 (= main_~p4~0 0)) (.cse7 (= main_~p5~0 0)) (.cse8 (= main_~lk6~0 1)) (.cse0 (not (= main_~p3~0 0))) (.cse1 (= main_~lk7~0 1)) (.cse3 (= main_~lk5~0 1)) (.cse9 (= main_~lk4~0 1)) (.cse4 (= main_~lk3~0 1)) (.cse5 (= main_~p6~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse2 .cse4 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse8) (and .cse0 .cse1 .cse3 .cse9 .cse4 .cse8) (and .cse0 .cse2 .cse4 .cse6 .cse7 .cse5) (and .cse0 .cse9 .cse4 .cse6 .cse7 .cse8) (and .cse0 .cse2 .cse3 .cse4 .cse6 .cse5) (and .cse0 .cse1 .cse9 .cse4 .cse7 .cse5) (and .cse0 .cse3 .cse9 .cse4 .cse6 .cse8) (and .cse0 .cse1 .cse9 .cse4 .cse7 .cse8) (and .cse0 .cse1 .cse2 .cse4 .cse7 .cse5) (and .cse0 .cse2 .cse3 .cse4 .cse6 .cse8) (and .cse0 .cse3 .cse9 .cse4 .cse6 .cse5) (and .cse0 .cse9 .cse4 .cse6 .cse7 .cse5) (and .cse0 .cse1 .cse2 .cse4 .cse7 .cse8) (and .cse0 .cse1 .cse3 .cse9 .cse4 .cse5))) [2022-04-08 08:20:13,325 INFO L878 garLoopResultBuilder]: At program point L61-1(lines 32 118) the Hoare annotation is: (let ((.cse4 (= main_~p1~0 0)) (.cse2 (= main_~p3~0 0)) (.cse5 (= main_~lk2~0 1)) (.cse0 (= main_~lk1~0 1)) (.cse3 (= main_~lk3~0 1)) (.cse1 (= main_~p2~0 0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse5) (and .cse4 .cse1 .cse2) (and .cse0 .cse3 .cse5) (and .cse3 .cse4 .cse1) (and .cse0 .cse2 .cse5) (and .cse4 .cse2 .cse5) (and .cse0 .cse3 .cse1))) [2022-04-08 08:20:13,325 INFO L885 garLoopResultBuilder]: At program point L119(lines 7 123) the Hoare annotation is: true [2022-04-08 08:20:13,325 INFO L885 garLoopResultBuilder]: At program point L53(lines 53 55) the Hoare annotation is: true [2022-04-08 08:20:13,325 INFO L878 garLoopResultBuilder]: At program point L53-2(lines 32 118) the Hoare annotation is: (or (= main_~lk1~0 1) (= main_~p1~0 0)) [2022-04-08 08:20:13,325 INFO L878 garLoopResultBuilder]: At program point L103-1(lines 32 118) the Hoare annotation is: (let ((.cse1 (= main_~lk6~0 1)) (.cse0 (= main_~lk7~0 1)) (.cse2 (= main_~p7~0 0)) (.cse3 (= main_~p6~0 0))) (or (and .cse0 .cse1) (and .cse2 .cse1) (and .cse0 .cse3) (and .cse2 .cse3))) [2022-04-08 08:20:13,325 INFO L885 garLoopResultBuilder]: At program point mainFINAL(lines 6 123) the Hoare annotation is: true [2022-04-08 08:20:13,325 INFO L878 garLoopResultBuilder]: At program point L104(line 104) the Hoare annotation is: (let ((.cse3 (= main_~p6~0 0)) (.cse1 (= main_~lk7~0 1)) (.cse0 (not (= main_~p5~0 0))) (.cse2 (= main_~lk5~0 1)) (.cse4 (= main_~p7~0 0)) (.cse5 (= main_~lk6~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse2 .cse4 .cse3) (and .cse0 .cse1 .cse2 .cse5) (and .cse0 .cse2 .cse4 .cse5))) [2022-04-08 08:20:13,325 INFO L878 garLoopResultBuilder]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 121) the Hoare annotation is: false [2022-04-08 08:20:13,325 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 6 123) the Hoare annotation is: true [2022-04-08 08:20:13,326 INFO L878 garLoopResultBuilder]: At program point L88-1(lines 32 118) the Hoare annotation is: (let ((.cse8 (= main_~p7~0 0)) (.cse6 (= main_~p5~0 0)) (.cse7 (= main_~p6~0 0)) (.cse1 (= main_~p4~0 0)) (.cse9 (= main_~lk3~0 1)) (.cse0 (= main_~lk7~0 1)) (.cse2 (= main_~lk5~0 1)) (.cse5 (= main_~lk4~0 1)) (.cse3 (= main_~lk6~0 1)) (.cse4 (= main_~p3~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse5 .cse6 .cse7 .cse4) (and .cse5 .cse8 .cse6 .cse3 .cse4) (and .cse2 .cse5 .cse9 .cse8 .cse7) (and .cse0 .cse2 .cse5 .cse7 .cse4) (and .cse0 .cse1 .cse9 .cse6 .cse3) (and .cse1 .cse2 .cse9 .cse8 .cse3) (and .cse2 .cse5 .cse8 .cse3 .cse4) (and .cse1 .cse8 .cse6 .cse3 .cse4) (and .cse1 .cse8 .cse6 .cse7 .cse4) (and .cse2 .cse5 .cse9 .cse8 .cse3) (and .cse0 .cse1 .cse2 .cse7 .cse4) (and .cse0 .cse1 .cse6 .cse7 .cse4) (and .cse1 .cse2 .cse8 .cse3 .cse4) (and .cse5 .cse8 .cse6 .cse7 .cse4) (and .cse0 .cse5 .cse9 .cse6 .cse7) (and .cse0 .cse5 .cse6 .cse3 .cse4) (and .cse0 .cse5 .cse9 .cse6 .cse3) (and .cse5 .cse9 .cse8 .cse6 .cse7) (and .cse0 .cse2 .cse5 .cse9 .cse3) (and .cse1 .cse9 .cse8 .cse6 .cse3) (and .cse1 .cse2 .cse8 .cse7 .cse4) (and .cse0 .cse2 .cse5 .cse9 .cse7) (and .cse5 .cse9 .cse8 .cse6 .cse3) (and .cse1 .cse2 .cse9 .cse8 .cse7) (and .cse0 .cse1 .cse2 .cse9 .cse7) (and .cse0 .cse1 .cse9 .cse6 .cse7) (and .cse2 .cse5 .cse8 .cse7 .cse4) (and .cse0 .cse1 .cse6 .cse3 .cse4) (and .cse1 .cse9 .cse8 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse9 .cse3) (and .cse0 .cse2 .cse5 .cse3 .cse4))) [2022-04-08 08:20:13,326 INFO L885 garLoopResultBuilder]: At program point L113-1(lines 32 118) the Hoare annotation is: true [2022-04-08 08:20:13,326 INFO L878 garLoopResultBuilder]: At program point L89(line 89) the Hoare annotation is: (let ((.cse4 (= main_~lk6~0 1)) (.cse6 (= main_~p4~0 0)) (.cse2 (= main_~lk3~0 1)) (.cse7 (= main_~lk5~0 1)) (.cse8 (= main_~p7~0 0)) (.cse0 (= main_~lk7~0 1)) (.cse1 (= main_~lk4~0 1)) (.cse3 (= main_~p5~0 0)) (.cse10 (= main_~p6~0 0)) (.cse9 (= main_~p3~0 0)) (.cse5 (= main_~lk2~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse6 .cse7 .cse2 .cse8 .cse4 .cse5) (and .cse0 .cse1 .cse3 .cse4 .cse9 .cse5) (and .cse0 .cse6 .cse3 .cse4 .cse9 .cse5) (and .cse6 .cse2 .cse8 .cse3 .cse10 .cse5) (and .cse7 .cse1 .cse2 .cse8 .cse10 .cse5) (and .cse1 .cse2 .cse8 .cse3 .cse10 .cse5) (and .cse1 .cse8 .cse3 .cse4 .cse9 .cse5) (and .cse7 .cse1 .cse2 .cse8 .cse4 .cse5) (and .cse6 .cse7 .cse2 .cse8 .cse10 .cse5) (and .cse0 .cse7 .cse1 .cse2 .cse10 .cse5) (and .cse6 .cse7 .cse8 .cse10 .cse9 .cse5) (and .cse1 .cse8 .cse3 .cse10 .cse9 .cse5) (and .cse1 .cse2 .cse8 .cse3 .cse4 .cse5) (and .cse6 .cse8 .cse3 .cse4 .cse9 .cse5) (and .cse0 .cse6 .cse7 .cse2 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse3 .cse10 .cse5) (and .cse6 .cse8 .cse3 .cse10 .cse9 .cse5) (and .cse0 .cse6 .cse7 .cse10 .cse9 .cse5) (and .cse6 .cse2 .cse8 .cse3 .cse4 .cse5) (and .cse0 .cse7 .cse1 .cse2 .cse4 .cse5) (and .cse0 .cse6 .cse7 .cse4 .cse9 .cse5) (and .cse0 .cse7 .cse1 .cse4 .cse9 .cse5) (and .cse0 .cse6 .cse3 .cse10 .cse9 .cse5) (and .cse0 .cse6 .cse2 .cse3 .cse10 .cse5) (and .cse0 .cse6 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse7 .cse1 .cse10 .cse9 .cse5) (and .cse6 .cse7 .cse8 .cse4 .cse9 .cse5) (and .cse7 .cse1 .cse8 .cse4 .cse9 .cse5) (and .cse0 .cse6 .cse7 .cse2 .cse10 .cse5) (and .cse7 .cse1 .cse8 .cse10 .cse9 .cse5) (and .cse0 .cse1 .cse3 .cse10 .cse9 .cse5))) [2022-04-08 08:20:13,326 INFO L878 garLoopResultBuilder]: At program point L114(line 114) the Hoare annotation is: (= main_~lk7~0 1) [2022-04-08 08:20:13,326 INFO L878 garLoopResultBuilder]: At program point L114-1(lines 7 123) the Hoare annotation is: false [2022-04-08 08:20:13,327 INFO L878 garLoopResultBuilder]: At program point L73-1(lines 32 118) the Hoare annotation is: (let ((.cse3 (= main_~p2~0 0)) (.cse7 (= main_~p4~0 0)) (.cse0 (= main_~lk5~0 1)) (.cse9 (= main_~p1~0 0)) (.cse4 (= main_~lk6~0 1)) (.cse8 (= main_~lk3~0 1)) (.cse1 (= main_~lk1~0 1)) (.cse2 (= main_~lk4~0 1)) (.cse11 (= main_~p5~0 0)) (.cse6 (= main_~p6~0 0)) (.cse5 (= main_~p3~0 0)) (.cse10 (= main_~lk2~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse3 .cse6 .cse5) (and .cse7 .cse0 .cse8 .cse9 .cse6 .cse10) (and .cse7 .cse8 .cse9 .cse11 .cse3 .cse4) (and .cse7 .cse1 .cse8 .cse11 .cse6 .cse10) (and .cse0 .cse2 .cse9 .cse4 .cse5 .cse10) (and .cse7 .cse1 .cse11 .cse4 .cse5 .cse10) (and .cse7 .cse0 .cse1 .cse3 .cse6 .cse5) (and .cse7 .cse0 .cse9 .cse3 .cse6 .cse5) (and .cse7 .cse0 .cse9 .cse6 .cse5 .cse10) (and .cse2 .cse8 .cse9 .cse11 .cse6 .cse10) (and .cse7 .cse1 .cse11 .cse3 .cse4 .cse5) (and .cse7 .cse0 .cse1 .cse4 .cse5 .cse10) (and .cse1 .cse2 .cse8 .cse11 .cse3 .cse6) (and .cse0 .cse1 .cse2 .cse8 .cse4 .cse10) (and .cse7 .cse0 .cse8 .cse9 .cse3 .cse6) (and .cse0 .cse2 .cse8 .cse9 .cse4 .cse10) (and .cse7 .cse9 .cse11 .cse3 .cse6 .cse5) (and .cse7 .cse0 .cse8 .cse9 .cse3 .cse4) (and .cse7 .cse8 .cse9 .cse11 .cse6 .cse10) (and .cse2 .cse9 .cse11 .cse4 .cse5 .cse10) (and .cse7 .cse0 .cse1 .cse8 .cse4 .cse10) (and .cse7 .cse1 .cse11 .cse3 .cse6 .cse5) (and .cse7 .cse0 .cse8 .cse9 .cse4 .cse10) (and .cse1 .cse2 .cse11 .cse4 .cse5 .cse10) (and .cse7 .cse9 .cse11 .cse4 .cse5 .cse10) (and .cse7 .cse8 .cse9 .cse11 .cse4 .cse10) (and .cse7 .cse1 .cse8 .cse11 .cse3 .cse6) (and .cse0 .cse2 .cse9 .cse6 .cse5 .cse10) (and .cse1 .cse2 .cse11 .cse3 .cse4 .cse5) (and .cse0 .cse2 .cse9 .cse3 .cse6 .cse5) (and .cse0 .cse2 .cse9 .cse3 .cse4 .cse5) (and .cse1 .cse2 .cse8 .cse11 .cse3 .cse4) (and .cse0 .cse2 .cse8 .cse9 .cse3 .cse6) (and .cse0 .cse1 .cse2 .cse8 .cse6 .cse10) (and .cse7 .cse0 .cse1 .cse8 .cse3 .cse4) (and .cse7 .cse9 .cse11 .cse6 .cse5 .cse10) (and .cse7 .cse0 .cse1 .cse6 .cse5 .cse10) (and .cse7 .cse0 .cse1 .cse8 .cse3 .cse6) (and .cse7 .cse0 .cse9 .cse3 .cse4 .cse5) (and .cse7 .cse0 .cse1 .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse8 .cse3 .cse6) (and .cse0 .cse2 .cse8 .cse9 .cse6 .cse10) (and .cse2 .cse8 .cse9 .cse11 .cse3 .cse6) (and .cse7 .cse0 .cse1 .cse8 .cse6 .cse10) (and .cse2 .cse9 .cse11 .cse6 .cse5 .cse10) (and .cse7 .cse1 .cse11 .cse6 .cse5 .cse10) (and .cse2 .cse9 .cse11 .cse3 .cse6 .cse5) (and .cse7 .cse9 .cse11 .cse3 .cse4 .cse5) (and .cse7 .cse8 .cse9 .cse11 .cse3 .cse6) (and .cse2 .cse8 .cse9 .cse11 .cse3 .cse4) (and .cse7 .cse1 .cse8 .cse11 .cse4 .cse10) (and .cse0 .cse1 .cse2 .cse6 .cse5 .cse10) (and .cse2 .cse8 .cse9 .cse11 .cse4 .cse10) (and .cse1 .cse2 .cse8 .cse11 .cse4 .cse10) (and .cse1 .cse2 .cse11 .cse3 .cse6 .cse5) (and .cse0 .cse1 .cse2 .cse8 .cse3 .cse4) (and .cse2 .cse9 .cse11 .cse3 .cse4 .cse5) (and .cse7 .cse1 .cse8 .cse11 .cse3 .cse4) (and .cse0 .cse1 .cse2 .cse4 .cse5 .cse10) (and .cse0 .cse2 .cse8 .cse9 .cse3 .cse4) (and .cse7 .cse0 .cse9 .cse4 .cse5 .cse10) (and .cse1 .cse2 .cse8 .cse11 .cse6 .cse10) (and .cse1 .cse2 .cse11 .cse6 .cse5 .cse10))) [2022-04-08 08:20:13,327 INFO L878 garLoopResultBuilder]: At program point L98-1(lines 32 118) the Hoare annotation is: (let ((.cse5 (= main_~p5~0 0)) (.cse3 (= main_~lk7~0 1)) (.cse2 (= main_~lk6~0 1)) (.cse0 (= main_~lk5~0 1)) (.cse1 (= main_~p7~0 0)) (.cse4 (= main_~p6~0 0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse0 .cse4) (and .cse1 .cse5 .cse4) (and .cse1 .cse5 .cse2) (and .cse3 .cse5 .cse4) (and .cse3 .cse5 .cse2) (and .cse3 .cse0 .cse2) (and .cse0 .cse1 .cse4))) [2022-04-08 08:20:13,327 INFO L878 garLoopResultBuilder]: At program point L65-1(lines 32 118) the Hoare annotation is: (let ((.cse5 (= main_~lk1~0 1)) (.cse0 (= main_~lk4~0 1)) (.cse1 (= main_~lk3~0 1)) (.cse3 (= main_~p2~0 0)) (.cse4 (= main_~p4~0 0)) (.cse2 (= main_~p1~0 0)) (.cse6 (= main_~p3~0 0)) (.cse7 (= main_~lk2~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse1 .cse3) (and .cse5 .cse0 .cse6 .cse7) (and .cse4 .cse2 .cse3 .cse6) (and .cse4 .cse1 .cse2 .cse3) (and .cse0 .cse2 .cse3 .cse6) (and .cse5 .cse0 .cse3 .cse6) (and .cse4 .cse5 .cse6 .cse7) (and .cse5 .cse0 .cse1 .cse7) (and .cse4 .cse1 .cse2 .cse7) (and .cse0 .cse1 .cse2 .cse7) (and .cse4 .cse5 .cse3 .cse6) (and .cse0 .cse2 .cse6 .cse7) (and .cse4 .cse5 .cse1 .cse7) (and .cse5 .cse0 .cse1 .cse3) (and .cse4 .cse2 .cse6 .cse7))) [2022-04-08 08:20:13,327 INFO L878 garLoopResultBuilder]: At program point L57-1(lines 32 118) the Hoare annotation is: (let ((.cse0 (= main_~lk1~0 1)) (.cse3 (= main_~p2~0 0)) (.cse2 (= main_~p1~0 0)) (.cse1 (= main_~lk2~0 1))) (or (and .cse0 .cse1) (and .cse2 .cse3) (and .cse0 .cse3) (and .cse2 .cse1))) [2022-04-08 08:20:13,327 INFO L878 garLoopResultBuilder]: At program point L99(line 99) the Hoare annotation is: (let ((.cse4 (= main_~p6~0 0)) (.cse0 (= main_~lk5~0 1)) (.cse3 (= main_~p7~0 0)) (.cse6 (= main_~lk7~0 1)) (.cse1 (not (= main_~p4~0 0))) (.cse2 (= main_~lk4~0 1)) (.cse5 (= main_~p5~0 0)) (.cse7 (= main_~lk6~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse5 .cse4) (and .cse6 .cse0 .cse1 .cse2 .cse7) (and .cse6 .cse0 .cse1 .cse2 .cse4) (and .cse6 .cse1 .cse2 .cse5 .cse4) (and .cse0 .cse1 .cse2 .cse3 .cse7) (and .cse1 .cse2 .cse3 .cse5 .cse7) (and .cse6 .cse1 .cse2 .cse5 .cse7))) [2022-04-08 08:20:13,327 INFO L878 garLoopResultBuilder]: At program point L83-1(lines 32 118) the Hoare annotation is: (let ((.cse6 (= main_~p4~0 0)) (.cse10 (= main_~p7~0 0)) (.cse3 (= main_~p5~0 0)) (.cse11 (= main_~p6~0 0)) (.cse8 (= main_~p3~0 0)) (.cse5 (= main_~lk2~0 1)) (.cse0 (= main_~lk7~0 1)) (.cse9 (= main_~lk5~0 1)) (.cse1 (= main_~lk4~0 1)) (.cse2 (= main_~lk3~0 1)) (.cse7 (= main_~p2~0 0)) (.cse4 (= main_~lk6~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse6 .cse3 .cse7 .cse4 .cse8) (and .cse6 .cse9 .cse2 .cse10 .cse4 .cse5) (and .cse0 .cse1 .cse3 .cse4 .cse8 .cse5) (and .cse0 .cse6 .cse3 .cse4 .cse8 .cse5) (and .cse6 .cse2 .cse10 .cse3 .cse11 .cse5) (and .cse0 .cse6 .cse2 .cse3 .cse7 .cse11) (and .cse0 .cse9 .cse1 .cse2 .cse7 .cse11) (and .cse9 .cse1 .cse2 .cse10 .cse11 .cse5) (and .cse0 .cse6 .cse9 .cse7 .cse11 .cse8) (and .cse6 .cse2 .cse10 .cse3 .cse7 .cse11) (and .cse1 .cse2 .cse10 .cse3 .cse11 .cse5) (and .cse1 .cse10 .cse3 .cse4 .cse8 .cse5) (and .cse9 .cse1 .cse2 .cse10 .cse4 .cse5) (and .cse0 .cse6 .cse2 .cse3 .cse7 .cse4) (and .cse6 .cse2 .cse10 .cse3 .cse7 .cse4) (and .cse9 .cse1 .cse10 .cse7 .cse11 .cse8) (and .cse6 .cse9 .cse2 .cse10 .cse11 .cse5) (and .cse0 .cse9 .cse1 .cse2 .cse11 .cse5) (and .cse6 .cse9 .cse10 .cse11 .cse8 .cse5) (and .cse1 .cse10 .cse3 .cse11 .cse8 .cse5) (and .cse0 .cse1 .cse3 .cse7 .cse11 .cse8) (and .cse0 .cse9 .cse1 .cse7 .cse11 .cse8) (and .cse1 .cse2 .cse10 .cse3 .cse4 .cse5) (and .cse1 .cse10 .cse3 .cse7 .cse4 .cse8) (and .cse0 .cse6 .cse9 .cse7 .cse4 .cse8) (and .cse6 .cse10 .cse3 .cse4 .cse8 .cse5) (and .cse6 .cse9 .cse2 .cse10 .cse7 .cse4) (and .cse0 .cse6 .cse9 .cse2 .cse4 .cse5) (and .cse9 .cse1 .cse2 .cse10 .cse7 .cse4) (and .cse0 .cse1 .cse2 .cse3 .cse11 .cse5) (and .cse6 .cse10 .cse3 .cse11 .cse8 .cse5) (and .cse0 .cse6 .cse9 .cse2 .cse7 .cse11) (and .cse6 .cse10 .cse3 .cse7 .cse11 .cse8) (and .cse6 .cse10 .cse3 .cse7 .cse4 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse7 .cse4) (and .cse0 .cse6 .cse9 .cse11 .cse8 .cse5) (and .cse9 .cse1 .cse2 .cse10 .cse7 .cse11) (and .cse0 .cse9 .cse1 .cse7 .cse4 .cse8) (and .cse1 .cse2 .cse10 .cse3 .cse7 .cse4) (and .cse9 .cse1 .cse10 .cse7 .cse4 .cse8) (and .cse6 .cse2 .cse10 .cse3 .cse4 .cse5) (and .cse0 .cse6 .cse9 .cse2 .cse7 .cse4) (and .cse0 .cse9 .cse1 .cse2 .cse4 .cse5) (and .cse0 .cse6 .cse9 .cse4 .cse8 .cse5) (and .cse0 .cse9 .cse1 .cse4 .cse8 .cse5) (and .cse0 .cse6 .cse3 .cse11 .cse8 .cse5) (and .cse0 .cse6 .cse2 .cse3 .cse11 .cse5) (and .cse6 .cse9 .cse10 .cse7 .cse4 .cse8) (and .cse0 .cse1 .cse2 .cse3 .cse7 .cse11) (and .cse6 .cse9 .cse2 .cse10 .cse7 .cse11) (and .cse1 .cse10 .cse3 .cse7 .cse11 .cse8) (and .cse0 .cse6 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse9 .cse1 .cse11 .cse8 .cse5) (and .cse6 .cse9 .cse10 .cse7 .cse11 .cse8) (and .cse0 .cse6 .cse3 .cse7 .cse11 .cse8) (and .cse6 .cse9 .cse10 .cse4 .cse8 .cse5) (and .cse0 .cse1 .cse3 .cse7 .cse4 .cse8) (and .cse9 .cse1 .cse10 .cse4 .cse8 .cse5) (and .cse0 .cse6 .cse9 .cse2 .cse11 .cse5) (and .cse9 .cse1 .cse10 .cse11 .cse8 .cse5) (and .cse1 .cse2 .cse10 .cse3 .cse7 .cse11) (and .cse0 .cse1 .cse3 .cse11 .cse8 .cse5) (and .cse0 .cse9 .cse1 .cse2 .cse7 .cse4))) [2022-04-08 08:20:13,328 INFO L878 garLoopResultBuilder]: At program point L108-1(lines 32 118) the Hoare annotation is: (or (= main_~lk7~0 1) (= main_~p7~0 0)) [2022-04-08 08:20:13,328 INFO L885 garLoopResultBuilder]: At program point L34(lines 34 36) the Hoare annotation is: true [2022-04-08 08:20:13,328 INFO L878 garLoopResultBuilder]: At program point L84(line 84) the Hoare annotation is: (let ((.cse9 (= main_~p7~0 0)) (.cse10 (= main_~lk2~0 1)) (.cse8 (= main_~lk5~0 1)) (.cse13 (= main_~lk4~0 1)) (.cse4 (= main_~lk3~0 1)) (.cse11 (= main_~lk6~0 1)) (.cse0 (= main_~lk7~0 1)) (.cse1 (= main_~p4~0 0)) (.cse2 (not (= main_~p1~0 0))) (.cse3 (= main_~lk1~0 1)) (.cse5 (= main_~p5~0 0)) (.cse6 (= main_~p2~0 0)) (.cse7 (= main_~p6~0 0)) (.cse12 (= main_~p3~0 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse1 .cse8 .cse2 .cse3 .cse4 .cse9 .cse7 .cse10) (and .cse1 .cse2 .cse3 .cse4 .cse9 .cse5 .cse11 .cse10) (and .cse1 .cse2 .cse3 .cse9 .cse5 .cse11 .cse12 .cse10) (and .cse8 .cse2 .cse3 .cse13 .cse9 .cse6 .cse11 .cse12) (and .cse8 .cse2 .cse3 .cse13 .cse9 .cse7 .cse12 .cse10) (and .cse1 .cse2 .cse3 .cse4 .cse9 .cse5 .cse7 .cse10) (and .cse8 .cse2 .cse3 .cse13 .cse4 .cse9 .cse11 .cse10) (and .cse8 .cse2 .cse3 .cse13 .cse4 .cse9 .cse6 .cse7) (and .cse2 .cse3 .cse13 .cse9 .cse5 .cse6 .cse11 .cse12) (and .cse2 .cse3 .cse13 .cse4 .cse9 .cse5 .cse6 .cse11) (and .cse1 .cse2 .cse3 .cse4 .cse9 .cse5 .cse6 .cse7) (and .cse1 .cse2 .cse3 .cse9 .cse5 .cse6 .cse7 .cse12) (and .cse0 .cse8 .cse2 .cse3 .cse13 .cse4 .cse7 .cse10) (and .cse1 .cse8 .cse2 .cse3 .cse9 .cse7 .cse12 .cse10) (and .cse2 .cse3 .cse13 .cse4 .cse9 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse8 .cse2 .cse3 .cse4 .cse6 .cse11) (and .cse1 .cse2 .cse3 .cse4 .cse9 .cse5 .cse6 .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse11 .cse12) (and .cse8 .cse2 .cse3 .cse13 .cse4 .cse9 .cse7 .cse10) (and .cse0 .cse8 .cse2 .cse3 .cse13 .cse4 .cse11 .cse10) (and .cse0 .cse1 .cse8 .cse2 .cse3 .cse6 .cse7 .cse12) (and .cse0 .cse1 .cse8 .cse2 .cse3 .cse4 .cse11 .cse10) (and .cse0 .cse2 .cse3 .cse13 .cse4 .cse5 .cse11 .cse10) (and .cse8 .cse2 .cse3 .cse13 .cse9 .cse6 .cse7 .cse12) (and .cse0 .cse1 .cse8 .cse2 .cse3 .cse4 .cse7 .cse10) (and .cse8 .cse2 .cse3 .cse13 .cse4 .cse9 .cse6 .cse11) (and .cse0 .cse2 .cse3 .cse13 .cse4 .cse5 .cse7 .cse10) (and .cse0 .cse8 .cse2 .cse3 .cse13 .cse4 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse11 .cse10) (and .cse0 .cse2 .cse3 .cse13 .cse5 .cse6 .cse11 .cse12) (and .cse1 .cse8 .cse2 .cse3 .cse9 .cse11 .cse12 .cse10) (and .cse0 .cse8 .cse2 .cse3 .cse13 .cse6 .cse7 .cse12) (and .cse0 .cse1 .cse8 .cse2 .cse3 .cse11 .cse12 .cse10) (and .cse2 .cse3 .cse13 .cse4 .cse9 .cse5 .cse11 .cse10) (and .cse1 .cse8 .cse2 .cse3 .cse4 .cse9 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse7 .cse12 .cse10) (and .cse2 .cse3 .cse13 .cse9 .cse5 .cse7 .cse12 .cse10) (and .cse2 .cse3 .cse13 .cse4 .cse9 .cse5 .cse7 .cse10) (and .cse0 .cse2 .cse3 .cse13 .cse5 .cse7 .cse12 .cse10) (and .cse0 .cse1 .cse8 .cse2 .cse3 .cse7 .cse12 .cse10) (and .cse0 .cse2 .cse3 .cse13 .cse5 .cse6 .cse7 .cse12) (and .cse0 .cse2 .cse3 .cse13 .cse5 .cse11 .cse12 .cse10) (and .cse1 .cse8 .cse2 .cse3 .cse4 .cse9 .cse11 .cse10) (and .cse0 .cse1 .cse8 .cse2 .cse3 .cse4 .cse6 .cse7) (and .cse1 .cse8 .cse2 .cse3 .cse4 .cse9 .cse6 .cse11) (and .cse2 .cse3 .cse13 .cse9 .cse5 .cse6 .cse7 .cse12) (and .cse1 .cse2 .cse3 .cse9 .cse5 .cse6 .cse11 .cse12) (and .cse0 .cse8 .cse2 .cse3 .cse13 .cse11 .cse12 .cse10) (and .cse1 .cse2 .cse3 .cse9 .cse5 .cse7 .cse12 .cse10) (and .cse0 .cse8 .cse2 .cse3 .cse13 .cse4 .cse6 .cse11) (and .cse0 .cse2 .cse3 .cse13 .cse4 .cse5 .cse6 .cse7) (and .cse1 .cse8 .cse2 .cse3 .cse9 .cse6 .cse11 .cse12) (and .cse2 .cse3 .cse13 .cse9 .cse5 .cse11 .cse12 .cse10) (and .cse0 .cse8 .cse2 .cse3 .cse13 .cse7 .cse12 .cse10) (and .cse1 .cse8 .cse2 .cse3 .cse9 .cse6 .cse7 .cse12) (and .cse8 .cse2 .cse3 .cse13 .cse9 .cse11 .cse12 .cse10) (and .cse0 .cse1 .cse8 .cse2 .cse3 .cse6 .cse11 .cse12) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse11 .cse12 .cse10) (and .cse0 .cse8 .cse2 .cse3 .cse13 .cse6 .cse11 .cse12) (and .cse0 .cse2 .cse3 .cse13 .cse4 .cse5 .cse6 .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse5 .cse6 .cse7 .cse12))) [2022-04-08 08:20:13,328 INFO L878 garLoopResultBuilder]: At program point L109(line 109) the Hoare annotation is: (let ((.cse0 (= main_~lk6~0 1)) (.cse1 (not (= main_~p6~0 0)))) (or (and (= main_~lk7~0 1) .cse0 .cse1) (and (= main_~p7~0 0) .cse0 .cse1))) [2022-04-08 08:20:13,330 INFO L719 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2] [2022-04-08 08:20:13,335 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-08 08:20:13,337 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-08 08:20:13,338 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-08 08:20:13,398 INFO L163 areAnnotationChecker]: CFG has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-08 08:20:13,404 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.04 08:20:13 BoogieIcfgContainer [2022-04-08 08:20:13,404 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-08 08:20:13,405 INFO L158 Benchmark]: Toolchain (without parser) took 51445.79ms. Allocated memory was 204.5MB in the beginning and 675.3MB in the end (delta: 470.8MB). Free memory was 154.4MB in the beginning and 340.4MB in the end (delta: -185.9MB). Peak memory consumption was 390.3MB. Max. memory is 8.0GB. [2022-04-08 08:20:13,405 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 204.5MB. Free memory was 170.8MB in the beginning and 170.6MB in the end (delta: 146.9kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-08 08:20:13,406 INFO L158 Benchmark]: CACSL2BoogieTranslator took 213.05ms. Allocated memory is still 204.5MB. Free memory was 154.1MB in the beginning and 180.4MB in the end (delta: -26.2MB). Peak memory consumption was 12.4MB. Max. memory is 8.0GB. [2022-04-08 08:20:13,406 INFO L158 Benchmark]: Boogie Preprocessor took 27.15ms. Allocated memory is still 204.5MB. Free memory was 180.4MB in the beginning and 178.7MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-08 08:20:13,406 INFO L158 Benchmark]: RCFGBuilder took 282.12ms. Allocated memory is still 204.5MB. Free memory was 178.7MB in the beginning and 166.2MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-08 08:20:13,406 INFO L158 Benchmark]: TraceAbstraction took 50919.93ms. Allocated memory was 204.5MB in the beginning and 675.3MB in the end (delta: 470.8MB). Free memory was 165.8MB in the beginning and 340.4MB in the end (delta: -174.6MB). Peak memory consumption was 399.9MB. Max. memory is 8.0GB. [2022-04-08 08:20:13,407 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 204.5MB. Free memory was 170.8MB in the beginning and 170.6MB in the end (delta: 146.9kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 213.05ms. Allocated memory is still 204.5MB. Free memory was 154.1MB in the beginning and 180.4MB in the end (delta: -26.2MB). Peak memory consumption was 12.4MB. Max. memory is 8.0GB. * Boogie Preprocessor took 27.15ms. Allocated memory is still 204.5MB. Free memory was 180.4MB in the beginning and 178.7MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 282.12ms. Allocated memory is still 204.5MB. Free memory was 178.7MB in the beginning and 166.2MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 50919.93ms. Allocated memory was 204.5MB in the beginning and 675.3MB in the end (delta: 470.8MB). Free memory was 165.8MB in the beginning and 340.4MB in the end (delta: -174.6MB). Peak memory consumption was 399.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 121]: 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, 39 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 50.8s, OverallIterations: 19, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 6.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 29.2s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1693 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1693 mSDsluCounter, 1341 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 135 mSDsCounter, 45 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 832 IncrementalHoareTripleChecker+Invalid, 877 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 45 mSolverCounterUnsat, 1206 mSDtfsCounter, 832 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 133 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2057occurred in iteration=18, InterpolantAutomatonStates: 76, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.0s AutomataMinimizationTime, 19 MinimizatonAttempts, 528 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 36 LocationsWithAnnotation, 36 PreInvPairs, 2605 NumberOfFragments, 9766 HoareAnnotationTreeSize, 36 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 12.0s HoareSimplificationTime, 36 FomulaSimplificationsInter, 148195 FormulaSimplificationTreeSizeReductionInter, 17.2s 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: 32]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7]: Loop Invariant Derived loop invariant: 0 - ProcedureContractResult [Line: 6]: Procedure Contract for main Derived contract for procedure main: 1 RESULT: Ultimate proved your program to be correct! [2022-04-08 08:20:13,436 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...