/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_11.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 08:16:03,459 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 08:16:03,460 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 08:16:03,506 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 08:16:03,507 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 08:16:03,524 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 08:16:03,528 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 08:16:03,532 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 08:16:03,533 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 08:16:03,536 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 08:16:03,536 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 08:16:03,537 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 08:16:03,537 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 08:16:03,537 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 08:16:03,538 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 08:16:03,539 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 08:16:03,539 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 08:16:03,539 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 08:16:03,540 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 08:16:03,541 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 08:16:03,542 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 08:16:03,557 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 08:16:03,559 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 08:16:03,559 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 08:16:03,560 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 08:16:03,565 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 08:16:03,565 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 08:16:03,566 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 08:16:03,566 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 08:16:03,566 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 08:16:03,567 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 08:16:03,567 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 08:16:03,567 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 08:16:03,568 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 08:16:03,568 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 08:16:03,569 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 08:16:03,569 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 08:16:03,569 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 08:16:03,569 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 08:16:03,570 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 08:16:03,570 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 08:16:03,582 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 08:16:03,582 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-28 08:16:03,588 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 08:16:03,588 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 08:16:03,588 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 08:16:03,589 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-28 08:16:03,589 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 08:16:03,589 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-28 08:16:03,589 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 08:16:03,589 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 08:16:03,589 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 08:16:03,589 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 08:16:03,590 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-28 08:16:03,590 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 08:16:03,590 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 08:16:03,590 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 08:16:03,590 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 08:16:03,590 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 08:16:03,590 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 08:16:03,591 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 08:16:03,591 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 08:16:03,592 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 08:16:03,592 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 08:16:03,594 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 08:16:03,594 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 08:16:03,594 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 08:16:03,595 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-28 08:16:03,595 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-28 08:16:03,785 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 08:16:03,807 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 08:16:03,808 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 08:16:03,809 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 08:16:03,809 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 08:16:03,810 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_11.c [2022-04-28 08:16:03,866 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/06658864c/02e9fd900eeb4d11b28e1dedcaeed69e/FLAGbf64f8d63 [2022-04-28 08:16:04,217 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 08:16:04,217 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_11.c [2022-04-28 08:16:04,221 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/06658864c/02e9fd900eeb4d11b28e1dedcaeed69e/FLAGbf64f8d63 [2022-04-28 08:16:04,229 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/06658864c/02e9fd900eeb4d11b28e1dedcaeed69e [2022-04-28 08:16:04,231 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 08:16:04,231 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 08:16:04,232 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 08:16:04,233 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 08:16:04,234 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 08:16:04,235 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 08:16:04" (1/1) ... [2022-04-28 08:16:04,236 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6bc73d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:16:04, skipping insertion in model container [2022-04-28 08:16:04,236 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 08:16:04" (1/1) ... [2022-04-28 08:16:04,240 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 08:16:04,251 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 08:16:04,398 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_11.c[4246,4259] [2022-04-28 08:16:04,409 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 08:16:04,416 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 08:16:04,446 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_11.c[4246,4259] [2022-04-28 08:16:04,447 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 08:16:04,463 INFO L208 MainTranslator]: Completed translation [2022-04-28 08:16:04,463 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:16:04 WrapperNode [2022-04-28 08:16:04,463 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 08:16:04,464 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 08:16:04,464 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 08:16:04,464 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 08:16:04,471 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:16:04" (1/1) ... [2022-04-28 08:16:04,471 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:16:04" (1/1) ... [2022-04-28 08:16:04,483 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:16:04" (1/1) ... [2022-04-28 08:16:04,483 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:16:04" (1/1) ... [2022-04-28 08:16:04,496 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:16:04" (1/1) ... [2022-04-28 08:16:04,500 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:16:04" (1/1) ... [2022-04-28 08:16:04,501 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:16:04" (1/1) ... [2022-04-28 08:16:04,502 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 08:16:04,505 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 08:16:04,505 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 08:16:04,505 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 08:16:04,506 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:16:04" (1/1) ... [2022-04-28 08:16:04,511 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 08:16:04,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 08:16:04,556 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-28 08:16:04,614 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-28 08:16:04,641 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 08:16:04,641 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 08:16:04,641 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 08:16:04,641 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 08:16:04,642 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 08:16:04,642 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 08:16:04,642 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 08:16:04,642 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 08:16:04,642 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-28 08:16:04,642 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 08:16:04,643 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 08:16:04,643 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 08:16:04,644 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 08:16:04,644 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 08:16:04,644 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 08:16:04,644 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 08:16:04,712 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 08:16:04,713 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 08:16:04,900 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 08:16:04,905 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 08:16:04,905 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 08:16:04,906 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 08:16:04 BoogieIcfgContainer [2022-04-28 08:16:04,906 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 08:16:04,907 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 08:16:04,907 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 08:16:04,910 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 08:16:04,910 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 08:16:04" (1/3) ... [2022-04-28 08:16:04,910 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@285451da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 08:16:04, skipping insertion in model container [2022-04-28 08:16:04,910 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:16:04" (2/3) ... [2022-04-28 08:16:04,910 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@285451da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 08:16:04, skipping insertion in model container [2022-04-28 08:16:04,911 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 08:16:04" (3/3) ... [2022-04-28 08:16:04,911 INFO L111 eAbstractionObserver]: Analyzing ICFG test_locks_11.c [2022-04-28 08:16:04,920 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 08:16:04,920 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 08:16:04,947 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 08:16:04,951 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@79b16ad8, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@36172811 [2022-04-28 08:16:04,951 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 08:16:04,961 INFO L276 IsEmpty]: Start isEmpty. Operand has 48 states, 42 states have (on average 1.880952380952381) internal successors, (79), 43 states have internal predecessors, (79), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 08:16:04,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-28 08:16:04,967 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:16:04,967 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:16:04,968 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:16:04,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:16:04,972 INFO L85 PathProgramCache]: Analyzing trace with hash 284629267, now seen corresponding path program 1 times [2022-04-28 08:16:04,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:16:04,977 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2003781904] [2022-04-28 08:16:04,984 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:16:04,985 INFO L85 PathProgramCache]: Analyzing trace with hash 284629267, now seen corresponding path program 2 times [2022-04-28 08:16:04,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:16:04,987 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194709369] [2022-04-28 08:16:04,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:16:04,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:16:05,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:16:05,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:16:05,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:16:05,136 INFO L290 TraceCheckUtils]: 0: Hoare triple {57#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {51#true} is VALID [2022-04-28 08:16:05,136 INFO L290 TraceCheckUtils]: 1: Hoare triple {51#true} assume true; {51#true} is VALID [2022-04-28 08:16:05,136 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {51#true} {51#true} #217#return; {51#true} is VALID [2022-04-28 08:16:05,138 INFO L272 TraceCheckUtils]: 0: Hoare triple {51#true} call ULTIMATE.init(); {57#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:16:05,138 INFO L290 TraceCheckUtils]: 1: Hoare triple {57#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {51#true} is VALID [2022-04-28 08:16:05,138 INFO L290 TraceCheckUtils]: 2: Hoare triple {51#true} assume true; {51#true} is VALID [2022-04-28 08:16:05,138 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {51#true} {51#true} #217#return; {51#true} is VALID [2022-04-28 08:16:05,138 INFO L272 TraceCheckUtils]: 4: Hoare triple {51#true} call #t~ret16 := main(); {51#true} is VALID [2022-04-28 08:16:05,139 INFO L290 TraceCheckUtils]: 5: Hoare triple {51#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;havoc ~cond~0; {51#true} is VALID [2022-04-28 08:16:05,139 INFO L290 TraceCheckUtils]: 6: Hoare triple {51#true} assume !false;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~cond~0 := #t~nondet15;havoc #t~nondet15; {51#true} is VALID [2022-04-28 08:16:05,139 INFO L290 TraceCheckUtils]: 7: Hoare triple {51#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0; {51#true} is VALID [2022-04-28 08:16:05,140 INFO L290 TraceCheckUtils]: 8: Hoare triple {51#true} assume 0 != ~p1~0;~lk1~0 := 1; {56#(= main_~lk1~0 1)} is VALID [2022-04-28 08:16:05,140 INFO L290 TraceCheckUtils]: 9: Hoare triple {56#(= main_~lk1~0 1)} assume !(0 != ~p2~0); {56#(= main_~lk1~0 1)} is VALID [2022-04-28 08:16:05,141 INFO L290 TraceCheckUtils]: 10: Hoare triple {56#(= main_~lk1~0 1)} assume 0 != ~p3~0;~lk3~0 := 1; {56#(= main_~lk1~0 1)} is VALID [2022-04-28 08:16:05,141 INFO L290 TraceCheckUtils]: 11: Hoare triple {56#(= main_~lk1~0 1)} assume 0 != ~p4~0;~lk4~0 := 1; {56#(= main_~lk1~0 1)} is VALID [2022-04-28 08:16:05,142 INFO L290 TraceCheckUtils]: 12: Hoare triple {56#(= main_~lk1~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {56#(= main_~lk1~0 1)} is VALID [2022-04-28 08:16:05,142 INFO L290 TraceCheckUtils]: 13: Hoare triple {56#(= main_~lk1~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {56#(= main_~lk1~0 1)} is VALID [2022-04-28 08:16:05,142 INFO L290 TraceCheckUtils]: 14: Hoare triple {56#(= main_~lk1~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {56#(= main_~lk1~0 1)} is VALID [2022-04-28 08:16:05,143 INFO L290 TraceCheckUtils]: 15: Hoare triple {56#(= main_~lk1~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {56#(= main_~lk1~0 1)} is VALID [2022-04-28 08:16:05,143 INFO L290 TraceCheckUtils]: 16: Hoare triple {56#(= main_~lk1~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {56#(= main_~lk1~0 1)} is VALID [2022-04-28 08:16:05,144 INFO L290 TraceCheckUtils]: 17: Hoare triple {56#(= main_~lk1~0 1)} assume !(0 != ~p10~0); {56#(= main_~lk1~0 1)} is VALID [2022-04-28 08:16:05,144 INFO L290 TraceCheckUtils]: 18: Hoare triple {56#(= main_~lk1~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {56#(= main_~lk1~0 1)} is VALID [2022-04-28 08:16:05,145 INFO L290 TraceCheckUtils]: 19: Hoare triple {56#(= main_~lk1~0 1)} assume 0 != ~p1~0; {56#(= main_~lk1~0 1)} is VALID [2022-04-28 08:16:05,145 INFO L290 TraceCheckUtils]: 20: Hoare triple {56#(= main_~lk1~0 1)} assume 1 != ~lk1~0; {52#false} is VALID [2022-04-28 08:16:05,145 INFO L290 TraceCheckUtils]: 21: Hoare triple {52#false} assume !false; {52#false} is VALID [2022-04-28 08:16:05,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 08:16:05,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:16:05,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194709369] [2022-04-28 08:16:05,147 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194709369] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:16:05,147 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:16:05,147 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:16:05,149 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:16:05,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2003781904] [2022-04-28 08:16:05,149 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2003781904] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:16:05,149 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:16:05,149 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:16:05,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317516004] [2022-04-28 08:16:05,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:16:05,153 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-28 08:16:05,155 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:16:05,157 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:05,181 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:16:05,182 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:16:05,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:16:05,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:16:05,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:16:05,197 INFO L87 Difference]: Start difference. First operand has 48 states, 42 states have (on average 1.880952380952381) internal successors, (79), 43 states have internal predecessors, (79), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:05,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:05,501 INFO L93 Difference]: Finished difference Result 94 states and 163 transitions. [2022-04-28 08:16:05,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:16:05,501 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-28 08:16:05,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:16:05,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:05,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 163 transitions. [2022-04-28 08:16:05,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:05,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 163 transitions. [2022-04-28 08:16:05,512 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 163 transitions. [2022-04-28 08:16:05,636 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-28 08:16:05,644 INFO L225 Difference]: With dead ends: 94 [2022-04-28 08:16:05,644 INFO L226 Difference]: Without dead ends: 79 [2022-04-28 08:16:05,645 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:16:05,647 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 191 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 08:16:05,648 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 95 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 08:16:05,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-04-28 08:16:05,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 55. [2022-04-28 08:16:05,671 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:16:05,672 INFO L82 GeneralOperation]: Start isEquivalent. First operand 79 states. Second operand has 55 states, 51 states have (on average 1.8627450980392157) internal successors, (95), 51 states have internal predecessors, (95), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:05,672 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand has 55 states, 51 states have (on average 1.8627450980392157) internal successors, (95), 51 states have internal predecessors, (95), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:05,673 INFO L87 Difference]: Start difference. First operand 79 states. Second operand has 55 states, 51 states have (on average 1.8627450980392157) internal successors, (95), 51 states have internal predecessors, (95), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:05,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:05,677 INFO L93 Difference]: Finished difference Result 79 states and 141 transitions. [2022-04-28 08:16:05,677 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 141 transitions. [2022-04-28 08:16:05,678 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:16:05,678 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:16:05,678 INFO L74 IsIncluded]: Start isIncluded. First operand has 55 states, 51 states have (on average 1.8627450980392157) internal successors, (95), 51 states have internal predecessors, (95), 2 states have call successors, (2), 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 79 states. [2022-04-28 08:16:05,679 INFO L87 Difference]: Start difference. First operand has 55 states, 51 states have (on average 1.8627450980392157) internal successors, (95), 51 states have internal predecessors, (95), 2 states have call successors, (2), 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 79 states. [2022-04-28 08:16:05,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:05,682 INFO L93 Difference]: Finished difference Result 79 states and 141 transitions. [2022-04-28 08:16:05,682 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 141 transitions. [2022-04-28 08:16:05,683 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:16:05,683 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:16:05,683 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:16:05,683 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:16:05,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 51 states have (on average 1.8627450980392157) internal successors, (95), 51 states have internal predecessors, (95), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:05,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 98 transitions. [2022-04-28 08:16:05,687 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 98 transitions. Word has length 22 [2022-04-28 08:16:05,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:16:05,687 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 98 transitions. [2022-04-28 08:16:05,687 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:05,687 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 55 states and 98 transitions. [2022-04-28 08:16:05,760 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:16:05,761 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 98 transitions. [2022-04-28 08:16:05,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-28 08:16:05,761 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:16:05,761 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:16:05,761 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 08:16:05,762 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:16:05,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:16:05,762 INFO L85 PathProgramCache]: Analyzing trace with hash -726487983, now seen corresponding path program 1 times [2022-04-28 08:16:05,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:16:05,763 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1314108503] [2022-04-28 08:16:05,763 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:16:05,763 INFO L85 PathProgramCache]: Analyzing trace with hash -726487983, now seen corresponding path program 2 times [2022-04-28 08:16:05,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:16:05,763 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613475194] [2022-04-28 08:16:05,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:16:05,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:16:05,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:16:05,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:16:05,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:16:05,815 INFO L290 TraceCheckUtils]: 0: Hoare triple {525#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {519#true} is VALID [2022-04-28 08:16:05,815 INFO L290 TraceCheckUtils]: 1: Hoare triple {519#true} assume true; {519#true} is VALID [2022-04-28 08:16:05,816 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {519#true} {519#true} #217#return; {519#true} is VALID [2022-04-28 08:16:05,816 INFO L272 TraceCheckUtils]: 0: Hoare triple {519#true} call ULTIMATE.init(); {525#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:16:05,816 INFO L290 TraceCheckUtils]: 1: Hoare triple {525#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {519#true} is VALID [2022-04-28 08:16:05,817 INFO L290 TraceCheckUtils]: 2: Hoare triple {519#true} assume true; {519#true} is VALID [2022-04-28 08:16:05,817 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {519#true} {519#true} #217#return; {519#true} is VALID [2022-04-28 08:16:05,817 INFO L272 TraceCheckUtils]: 4: Hoare triple {519#true} call #t~ret16 := main(); {519#true} is VALID [2022-04-28 08:16:05,817 INFO L290 TraceCheckUtils]: 5: Hoare triple {519#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;havoc ~cond~0; {519#true} is VALID [2022-04-28 08:16:05,817 INFO L290 TraceCheckUtils]: 6: Hoare triple {519#true} assume !false;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~cond~0 := #t~nondet15;havoc #t~nondet15; {519#true} is VALID [2022-04-28 08:16:05,817 INFO L290 TraceCheckUtils]: 7: Hoare triple {519#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0; {519#true} is VALID [2022-04-28 08:16:05,818 INFO L290 TraceCheckUtils]: 8: Hoare triple {519#true} assume !(0 != ~p1~0); {524#(= main_~p1~0 0)} is VALID [2022-04-28 08:16:05,818 INFO L290 TraceCheckUtils]: 9: Hoare triple {524#(= main_~p1~0 0)} assume !(0 != ~p2~0); {524#(= main_~p1~0 0)} is VALID [2022-04-28 08:16:05,819 INFO L290 TraceCheckUtils]: 10: Hoare triple {524#(= main_~p1~0 0)} assume 0 != ~p3~0;~lk3~0 := 1; {524#(= main_~p1~0 0)} is VALID [2022-04-28 08:16:05,819 INFO L290 TraceCheckUtils]: 11: Hoare triple {524#(= main_~p1~0 0)} assume 0 != ~p4~0;~lk4~0 := 1; {524#(= main_~p1~0 0)} is VALID [2022-04-28 08:16:05,819 INFO L290 TraceCheckUtils]: 12: Hoare triple {524#(= main_~p1~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {524#(= main_~p1~0 0)} is VALID [2022-04-28 08:16:05,820 INFO L290 TraceCheckUtils]: 13: Hoare triple {524#(= main_~p1~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {524#(= main_~p1~0 0)} is VALID [2022-04-28 08:16:05,820 INFO L290 TraceCheckUtils]: 14: Hoare triple {524#(= main_~p1~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {524#(= main_~p1~0 0)} is VALID [2022-04-28 08:16:05,820 INFO L290 TraceCheckUtils]: 15: Hoare triple {524#(= main_~p1~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {524#(= main_~p1~0 0)} is VALID [2022-04-28 08:16:05,821 INFO L290 TraceCheckUtils]: 16: Hoare triple {524#(= main_~p1~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {524#(= main_~p1~0 0)} is VALID [2022-04-28 08:16:05,821 INFO L290 TraceCheckUtils]: 17: Hoare triple {524#(= main_~p1~0 0)} assume !(0 != ~p10~0); {524#(= main_~p1~0 0)} is VALID [2022-04-28 08:16:05,822 INFO L290 TraceCheckUtils]: 18: Hoare triple {524#(= main_~p1~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {524#(= main_~p1~0 0)} is VALID [2022-04-28 08:16:05,822 INFO L290 TraceCheckUtils]: 19: Hoare triple {524#(= main_~p1~0 0)} assume 0 != ~p1~0; {520#false} is VALID [2022-04-28 08:16:05,822 INFO L290 TraceCheckUtils]: 20: Hoare triple {520#false} assume 1 != ~lk1~0; {520#false} is VALID [2022-04-28 08:16:05,822 INFO L290 TraceCheckUtils]: 21: Hoare triple {520#false} assume !false; {520#false} is VALID [2022-04-28 08:16:05,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 08:16:05,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:16:05,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613475194] [2022-04-28 08:16:05,823 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613475194] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:16:05,823 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:16:05,823 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:16:05,823 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:16:05,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1314108503] [2022-04-28 08:16:05,824 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1314108503] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:16:05,824 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:16:05,824 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:16:05,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096289006] [2022-04-28 08:16:05,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:16:05,825 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-28 08:16:05,825 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:16:05,825 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:05,838 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:16:05,838 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:16:05,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:16:05,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:16:05,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:16:05,839 INFO L87 Difference]: Start difference. First operand 55 states and 98 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:05,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:05,999 INFO L93 Difference]: Finished difference Result 128 states and 233 transitions. [2022-04-28 08:16:05,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:16:05,999 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-28 08:16:06,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:16:06,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:06,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 210 transitions. [2022-04-28 08:16:06,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:06,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 210 transitions. [2022-04-28 08:16:06,004 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 210 transitions. [2022-04-28 08:16:06,154 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 210 edges. 210 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:16:06,156 INFO L225 Difference]: With dead ends: 128 [2022-04-28 08:16:06,156 INFO L226 Difference]: Without dead ends: 79 [2022-04-28 08:16:06,156 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:16:06,157 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 163 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 08:16:06,157 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 103 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 08:16:06,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-04-28 08:16:06,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 77. [2022-04-28 08:16:06,165 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:16:06,165 INFO L82 GeneralOperation]: Start isEquivalent. First operand 79 states. Second operand has 77 states, 73 states have (on average 1.8493150684931507) internal successors, (135), 73 states have internal predecessors, (135), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:06,165 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand has 77 states, 73 states have (on average 1.8493150684931507) internal successors, (135), 73 states have internal predecessors, (135), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:06,166 INFO L87 Difference]: Start difference. First operand 79 states. Second operand has 77 states, 73 states have (on average 1.8493150684931507) internal successors, (135), 73 states have internal predecessors, (135), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:06,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:06,168 INFO L93 Difference]: Finished difference Result 79 states and 139 transitions. [2022-04-28 08:16:06,168 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 139 transitions. [2022-04-28 08:16:06,169 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:16:06,169 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:16:06,169 INFO L74 IsIncluded]: Start isIncluded. First operand has 77 states, 73 states have (on average 1.8493150684931507) internal successors, (135), 73 states have internal predecessors, (135), 2 states have call successors, (2), 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 79 states. [2022-04-28 08:16:06,169 INFO L87 Difference]: Start difference. First operand has 77 states, 73 states have (on average 1.8493150684931507) internal successors, (135), 73 states have internal predecessors, (135), 2 states have call successors, (2), 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 79 states. [2022-04-28 08:16:06,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:06,171 INFO L93 Difference]: Finished difference Result 79 states and 139 transitions. [2022-04-28 08:16:06,172 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 139 transitions. [2022-04-28 08:16:06,172 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:16:06,172 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:16:06,172 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:16:06,172 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:16:06,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 73 states have (on average 1.8493150684931507) internal successors, (135), 73 states have internal predecessors, (135), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:06,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 138 transitions. [2022-04-28 08:16:06,175 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 138 transitions. Word has length 22 [2022-04-28 08:16:06,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:16:06,175 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 138 transitions. [2022-04-28 08:16:06,175 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:06,175 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 77 states and 138 transitions. [2022-04-28 08:16:06,669 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-28 08:16:06,669 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 138 transitions. [2022-04-28 08:16:06,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-28 08:16:06,670 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:16:06,670 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:16:06,670 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 08:16:06,670 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:16:06,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:16:06,671 INFO L85 PathProgramCache]: Analyzing trace with hash 233785744, now seen corresponding path program 1 times [2022-04-28 08:16:06,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:16:06,671 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1118905915] [2022-04-28 08:16:06,671 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:16:06,672 INFO L85 PathProgramCache]: Analyzing trace with hash 233785744, now seen corresponding path program 2 times [2022-04-28 08:16:06,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:16:06,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091857521] [2022-04-28 08:16:06,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:16:06,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:16:06,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:16:06,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:16:06,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:16:06,809 INFO L290 TraceCheckUtils]: 0: Hoare triple {1105#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {1099#true} is VALID [2022-04-28 08:16:06,809 INFO L290 TraceCheckUtils]: 1: Hoare triple {1099#true} assume true; {1099#true} is VALID [2022-04-28 08:16:06,810 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1099#true} {1099#true} #217#return; {1099#true} is VALID [2022-04-28 08:16:06,810 INFO L272 TraceCheckUtils]: 0: Hoare triple {1099#true} call ULTIMATE.init(); {1105#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:16:06,810 INFO L290 TraceCheckUtils]: 1: Hoare triple {1105#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {1099#true} is VALID [2022-04-28 08:16:06,810 INFO L290 TraceCheckUtils]: 2: Hoare triple {1099#true} assume true; {1099#true} is VALID [2022-04-28 08:16:06,811 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1099#true} {1099#true} #217#return; {1099#true} is VALID [2022-04-28 08:16:06,811 INFO L272 TraceCheckUtils]: 4: Hoare triple {1099#true} call #t~ret16 := main(); {1099#true} is VALID [2022-04-28 08:16:06,811 INFO L290 TraceCheckUtils]: 5: Hoare triple {1099#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;havoc ~cond~0; {1099#true} is VALID [2022-04-28 08:16:06,811 INFO L290 TraceCheckUtils]: 6: Hoare triple {1099#true} assume !false;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~cond~0 := #t~nondet15;havoc #t~nondet15; {1099#true} is VALID [2022-04-28 08:16:06,811 INFO L290 TraceCheckUtils]: 7: Hoare triple {1099#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0; {1099#true} is VALID [2022-04-28 08:16:06,812 INFO L290 TraceCheckUtils]: 8: Hoare triple {1099#true} assume 0 != ~p1~0;~lk1~0 := 1; {1104#(not (= main_~p1~0 0))} is VALID [2022-04-28 08:16:06,812 INFO L290 TraceCheckUtils]: 9: Hoare triple {1104#(not (= main_~p1~0 0))} assume !(0 != ~p2~0); {1104#(not (= main_~p1~0 0))} is VALID [2022-04-28 08:16:06,812 INFO L290 TraceCheckUtils]: 10: Hoare triple {1104#(not (= main_~p1~0 0))} assume 0 != ~p3~0;~lk3~0 := 1; {1104#(not (= main_~p1~0 0))} is VALID [2022-04-28 08:16:06,813 INFO L290 TraceCheckUtils]: 11: Hoare triple {1104#(not (= main_~p1~0 0))} assume 0 != ~p4~0;~lk4~0 := 1; {1104#(not (= main_~p1~0 0))} is VALID [2022-04-28 08:16:06,813 INFO L290 TraceCheckUtils]: 12: Hoare triple {1104#(not (= main_~p1~0 0))} assume 0 != ~p5~0;~lk5~0 := 1; {1104#(not (= main_~p1~0 0))} is VALID [2022-04-28 08:16:06,813 INFO L290 TraceCheckUtils]: 13: Hoare triple {1104#(not (= main_~p1~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {1104#(not (= main_~p1~0 0))} is VALID [2022-04-28 08:16:06,814 INFO L290 TraceCheckUtils]: 14: Hoare triple {1104#(not (= main_~p1~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {1104#(not (= main_~p1~0 0))} is VALID [2022-04-28 08:16:06,814 INFO L290 TraceCheckUtils]: 15: Hoare triple {1104#(not (= main_~p1~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {1104#(not (= main_~p1~0 0))} is VALID [2022-04-28 08:16:06,814 INFO L290 TraceCheckUtils]: 16: Hoare triple {1104#(not (= main_~p1~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {1104#(not (= main_~p1~0 0))} is VALID [2022-04-28 08:16:06,815 INFO L290 TraceCheckUtils]: 17: Hoare triple {1104#(not (= main_~p1~0 0))} assume !(0 != ~p10~0); {1104#(not (= main_~p1~0 0))} is VALID [2022-04-28 08:16:06,815 INFO L290 TraceCheckUtils]: 18: Hoare triple {1104#(not (= main_~p1~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {1104#(not (= main_~p1~0 0))} is VALID [2022-04-28 08:16:06,815 INFO L290 TraceCheckUtils]: 19: Hoare triple {1104#(not (= main_~p1~0 0))} assume !(0 != ~p1~0); {1100#false} is VALID [2022-04-28 08:16:06,815 INFO L290 TraceCheckUtils]: 20: Hoare triple {1100#false} assume 0 != ~p2~0; {1100#false} is VALID [2022-04-28 08:16:06,816 INFO L290 TraceCheckUtils]: 21: Hoare triple {1100#false} assume 1 != ~lk2~0; {1100#false} is VALID [2022-04-28 08:16:06,816 INFO L290 TraceCheckUtils]: 22: Hoare triple {1100#false} assume !false; {1100#false} is VALID [2022-04-28 08:16:06,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 08:16:06,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:16:06,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091857521] [2022-04-28 08:16:06,816 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091857521] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:16:06,817 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:16:06,817 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:16:06,817 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:16:06,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1118905915] [2022-04-28 08:16:06,817 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1118905915] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:16:06,817 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:16:06,817 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:16:06,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392991546] [2022-04-28 08:16:06,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:16:06,818 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-28 08:16:06,818 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:16:06,818 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-28 08:16:06,831 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-28 08:16:06,831 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:16:06,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:16:06,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:16:06,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:16:06,832 INFO L87 Difference]: Start difference. First operand 77 states and 138 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-28 08:16:07,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:07,009 INFO L93 Difference]: Finished difference Result 118 states and 208 transitions. [2022-04-28 08:16:07,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:16:07,010 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-28 08:16:07,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:16:07,010 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-28 08:16:07,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 205 transitions. [2022-04-28 08:16:07,012 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-28 08:16:07,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 205 transitions. [2022-04-28 08:16:07,014 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 205 transitions. [2022-04-28 08:16:07,146 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 205 edges. 205 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:16:07,148 INFO L225 Difference]: With dead ends: 118 [2022-04-28 08:16:07,148 INFO L226 Difference]: Without dead ends: 82 [2022-04-28 08:16:07,148 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:16:07,149 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 144 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 08:16:07,150 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 123 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 08:16:07,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-04-28 08:16:07,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 80. [2022-04-28 08:16:07,156 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:16:07,156 INFO L82 GeneralOperation]: Start isEquivalent. First operand 82 states. Second operand has 80 states, 76 states have (on average 1.8026315789473684) internal successors, (137), 76 states have internal predecessors, (137), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:07,156 INFO L74 IsIncluded]: Start isIncluded. First operand 82 states. Second operand has 80 states, 76 states have (on average 1.8026315789473684) internal successors, (137), 76 states have internal predecessors, (137), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:07,157 INFO L87 Difference]: Start difference. First operand 82 states. Second operand has 80 states, 76 states have (on average 1.8026315789473684) internal successors, (137), 76 states have internal predecessors, (137), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:07,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:07,158 INFO L93 Difference]: Finished difference Result 82 states and 141 transitions. [2022-04-28 08:16:07,159 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 141 transitions. [2022-04-28 08:16:07,159 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:16:07,159 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:16:07,159 INFO L74 IsIncluded]: Start isIncluded. First operand has 80 states, 76 states have (on average 1.8026315789473684) internal successors, (137), 76 states have internal predecessors, (137), 2 states have call successors, (2), 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 82 states. [2022-04-28 08:16:07,159 INFO L87 Difference]: Start difference. First operand has 80 states, 76 states have (on average 1.8026315789473684) internal successors, (137), 76 states have internal predecessors, (137), 2 states have call successors, (2), 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 82 states. [2022-04-28 08:16:07,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:07,161 INFO L93 Difference]: Finished difference Result 82 states and 141 transitions. [2022-04-28 08:16:07,161 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 141 transitions. [2022-04-28 08:16:07,162 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:16:07,162 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:16:07,162 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:16:07,162 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:16:07,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 76 states have (on average 1.8026315789473684) internal successors, (137), 76 states have internal predecessors, (137), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:07,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 140 transitions. [2022-04-28 08:16:07,164 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 140 transitions. Word has length 23 [2022-04-28 08:16:07,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:16:07,164 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 140 transitions. [2022-04-28 08:16:07,165 INFO L496 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-28 08:16:07,165 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 80 states and 140 transitions. [2022-04-28 08:16:07,278 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 140 edges. 140 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:16:07,279 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 140 transitions. [2022-04-28 08:16:07,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-28 08:16:07,279 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:16:07,279 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:16:07,280 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-28 08:16:07,280 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:16:07,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:16:07,280 INFO L85 PathProgramCache]: Analyzing trace with hash -1046077934, now seen corresponding path program 1 times [2022-04-28 08:16:07,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:16:07,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [981731907] [2022-04-28 08:16:07,281 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:16:07,281 INFO L85 PathProgramCache]: Analyzing trace with hash -1046077934, now seen corresponding path program 2 times [2022-04-28 08:16:07,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:16:07,281 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202939589] [2022-04-28 08:16:07,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:16:07,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:16:07,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:16:07,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:16:07,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:16:07,326 INFO L290 TraceCheckUtils]: 0: Hoare triple {1677#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {1671#true} is VALID [2022-04-28 08:16:07,326 INFO L290 TraceCheckUtils]: 1: Hoare triple {1671#true} assume true; {1671#true} is VALID [2022-04-28 08:16:07,326 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1671#true} {1671#true} #217#return; {1671#true} is VALID [2022-04-28 08:16:07,327 INFO L272 TraceCheckUtils]: 0: Hoare triple {1671#true} call ULTIMATE.init(); {1677#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:16:07,327 INFO L290 TraceCheckUtils]: 1: Hoare triple {1677#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {1671#true} is VALID [2022-04-28 08:16:07,327 INFO L290 TraceCheckUtils]: 2: Hoare triple {1671#true} assume true; {1671#true} is VALID [2022-04-28 08:16:07,327 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1671#true} {1671#true} #217#return; {1671#true} is VALID [2022-04-28 08:16:07,327 INFO L272 TraceCheckUtils]: 4: Hoare triple {1671#true} call #t~ret16 := main(); {1671#true} is VALID [2022-04-28 08:16:07,327 INFO L290 TraceCheckUtils]: 5: Hoare triple {1671#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;havoc ~cond~0; {1671#true} is VALID [2022-04-28 08:16:07,327 INFO L290 TraceCheckUtils]: 6: Hoare triple {1671#true} assume !false;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~cond~0 := #t~nondet15;havoc #t~nondet15; {1671#true} is VALID [2022-04-28 08:16:07,328 INFO L290 TraceCheckUtils]: 7: Hoare triple {1671#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0; {1671#true} is VALID [2022-04-28 08:16:07,328 INFO L290 TraceCheckUtils]: 8: Hoare triple {1671#true} assume !(0 != ~p1~0); {1671#true} is VALID [2022-04-28 08:16:07,328 INFO L290 TraceCheckUtils]: 9: Hoare triple {1671#true} assume !(0 != ~p2~0); {1676#(= main_~p2~0 0)} is VALID [2022-04-28 08:16:07,328 INFO L290 TraceCheckUtils]: 10: Hoare triple {1676#(= main_~p2~0 0)} assume 0 != ~p3~0;~lk3~0 := 1; {1676#(= main_~p2~0 0)} is VALID [2022-04-28 08:16:07,329 INFO L290 TraceCheckUtils]: 11: Hoare triple {1676#(= main_~p2~0 0)} assume 0 != ~p4~0;~lk4~0 := 1; {1676#(= main_~p2~0 0)} is VALID [2022-04-28 08:16:07,329 INFO L290 TraceCheckUtils]: 12: Hoare triple {1676#(= main_~p2~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {1676#(= main_~p2~0 0)} is VALID [2022-04-28 08:16:07,330 INFO L290 TraceCheckUtils]: 13: Hoare triple {1676#(= main_~p2~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {1676#(= main_~p2~0 0)} is VALID [2022-04-28 08:16:07,330 INFO L290 TraceCheckUtils]: 14: Hoare triple {1676#(= main_~p2~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {1676#(= main_~p2~0 0)} is VALID [2022-04-28 08:16:07,330 INFO L290 TraceCheckUtils]: 15: Hoare triple {1676#(= main_~p2~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {1676#(= main_~p2~0 0)} is VALID [2022-04-28 08:16:07,330 INFO L290 TraceCheckUtils]: 16: Hoare triple {1676#(= main_~p2~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {1676#(= main_~p2~0 0)} is VALID [2022-04-28 08:16:07,331 INFO L290 TraceCheckUtils]: 17: Hoare triple {1676#(= main_~p2~0 0)} assume !(0 != ~p10~0); {1676#(= main_~p2~0 0)} is VALID [2022-04-28 08:16:07,331 INFO L290 TraceCheckUtils]: 18: Hoare triple {1676#(= main_~p2~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {1676#(= main_~p2~0 0)} is VALID [2022-04-28 08:16:07,331 INFO L290 TraceCheckUtils]: 19: Hoare triple {1676#(= main_~p2~0 0)} assume !(0 != ~p1~0); {1676#(= main_~p2~0 0)} is VALID [2022-04-28 08:16:07,332 INFO L290 TraceCheckUtils]: 20: Hoare triple {1676#(= main_~p2~0 0)} assume 0 != ~p2~0; {1672#false} is VALID [2022-04-28 08:16:07,332 INFO L290 TraceCheckUtils]: 21: Hoare triple {1672#false} assume 1 != ~lk2~0; {1672#false} is VALID [2022-04-28 08:16:07,332 INFO L290 TraceCheckUtils]: 22: Hoare triple {1672#false} assume !false; {1672#false} is VALID [2022-04-28 08:16:07,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 08:16:07,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:16:07,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202939589] [2022-04-28 08:16:07,333 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202939589] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:16:07,333 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:16:07,333 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:16:07,333 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:16:07,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [981731907] [2022-04-28 08:16:07,333 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [981731907] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:16:07,333 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:16:07,333 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:16:07,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073571648] [2022-04-28 08:16:07,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:16:07,334 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-28 08:16:07,334 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:16:07,334 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-28 08:16:07,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-28 08:16:07,347 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:16:07,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:16:07,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:16:07,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:16:07,348 INFO L87 Difference]: Start difference. First operand 80 states and 140 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-28 08:16:07,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:07,528 INFO L93 Difference]: Finished difference Result 220 states and 396 transitions. [2022-04-28 08:16:07,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:16:07,528 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-28 08:16:07,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:16:07,528 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-28 08:16:07,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 208 transitions. [2022-04-28 08:16:07,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:07,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 208 transitions. [2022-04-28 08:16:07,532 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 208 transitions. [2022-04-28 08:16:07,664 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 208 edges. 208 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:16:07,667 INFO L225 Difference]: With dead ends: 220 [2022-04-28 08:16:07,667 INFO L226 Difference]: Without dead ends: 149 [2022-04-28 08:16:07,668 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:16:07,668 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 180 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 08:16:07,669 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 85 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 08:16:07,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2022-04-28 08:16:07,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 147. [2022-04-28 08:16:07,678 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:16:07,679 INFO L82 GeneralOperation]: Start isEquivalent. First operand 149 states. Second operand has 147 states, 143 states have (on average 1.8041958041958042) internal successors, (258), 143 states have internal predecessors, (258), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:07,679 INFO L74 IsIncluded]: Start isIncluded. First operand 149 states. Second operand has 147 states, 143 states have (on average 1.8041958041958042) internal successors, (258), 143 states have internal predecessors, (258), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:07,679 INFO L87 Difference]: Start difference. First operand 149 states. Second operand has 147 states, 143 states have (on average 1.8041958041958042) internal successors, (258), 143 states have internal predecessors, (258), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:07,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:07,683 INFO L93 Difference]: Finished difference Result 149 states and 262 transitions. [2022-04-28 08:16:07,683 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 262 transitions. [2022-04-28 08:16:07,683 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:16:07,683 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:16:07,684 INFO L74 IsIncluded]: Start isIncluded. First operand has 147 states, 143 states have (on average 1.8041958041958042) internal successors, (258), 143 states have internal predecessors, (258), 2 states have call successors, (2), 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 149 states. [2022-04-28 08:16:07,684 INFO L87 Difference]: Start difference. First operand has 147 states, 143 states have (on average 1.8041958041958042) internal successors, (258), 143 states have internal predecessors, (258), 2 states have call successors, (2), 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 149 states. [2022-04-28 08:16:07,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:07,687 INFO L93 Difference]: Finished difference Result 149 states and 262 transitions. [2022-04-28 08:16:07,687 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 262 transitions. [2022-04-28 08:16:07,687 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:16:07,687 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:16:07,688 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:16:07,688 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:16:07,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 143 states have (on average 1.8041958041958042) internal successors, (258), 143 states have internal predecessors, (258), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:07,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 261 transitions. [2022-04-28 08:16:07,691 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 261 transitions. Word has length 23 [2022-04-28 08:16:07,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:16:07,692 INFO L495 AbstractCegarLoop]: Abstraction has 147 states and 261 transitions. [2022-04-28 08:16:07,692 INFO L496 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-28 08:16:07,692 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 147 states and 261 transitions. [2022-04-28 08:16:07,819 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 261 edges. 261 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:16:07,819 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 261 transitions. [2022-04-28 08:16:07,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-28 08:16:07,820 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:16:07,820 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:16:07,821 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-28 08:16:07,821 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:16:07,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:16:07,821 INFO L85 PathProgramCache]: Analyzing trace with hash -34960684, now seen corresponding path program 1 times [2022-04-28 08:16:07,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:16:07,821 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2007707196] [2022-04-28 08:16:07,822 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:16:07,822 INFO L85 PathProgramCache]: Analyzing trace with hash -34960684, now seen corresponding path program 2 times [2022-04-28 08:16:07,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:16:07,822 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194291368] [2022-04-28 08:16:07,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:16:07,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:16:07,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:16:07,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:16:07,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:16:07,870 INFO L290 TraceCheckUtils]: 0: Hoare triple {2721#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {2715#true} is VALID [2022-04-28 08:16:07,870 INFO L290 TraceCheckUtils]: 1: Hoare triple {2715#true} assume true; {2715#true} is VALID [2022-04-28 08:16:07,870 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2715#true} {2715#true} #217#return; {2715#true} is VALID [2022-04-28 08:16:07,871 INFO L272 TraceCheckUtils]: 0: Hoare triple {2715#true} call ULTIMATE.init(); {2721#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:16:07,871 INFO L290 TraceCheckUtils]: 1: Hoare triple {2721#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {2715#true} is VALID [2022-04-28 08:16:07,871 INFO L290 TraceCheckUtils]: 2: Hoare triple {2715#true} assume true; {2715#true} is VALID [2022-04-28 08:16:07,871 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2715#true} {2715#true} #217#return; {2715#true} is VALID [2022-04-28 08:16:07,871 INFO L272 TraceCheckUtils]: 4: Hoare triple {2715#true} call #t~ret16 := main(); {2715#true} is VALID [2022-04-28 08:16:07,871 INFO L290 TraceCheckUtils]: 5: Hoare triple {2715#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;havoc ~cond~0; {2715#true} is VALID [2022-04-28 08:16:07,871 INFO L290 TraceCheckUtils]: 6: Hoare triple {2715#true} assume !false;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~cond~0 := #t~nondet15;havoc #t~nondet15; {2715#true} is VALID [2022-04-28 08:16:07,872 INFO L290 TraceCheckUtils]: 7: Hoare triple {2715#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0; {2715#true} is VALID [2022-04-28 08:16:07,872 INFO L290 TraceCheckUtils]: 8: Hoare triple {2715#true} assume !(0 != ~p1~0); {2715#true} is VALID [2022-04-28 08:16:07,872 INFO L290 TraceCheckUtils]: 9: Hoare triple {2715#true} assume 0 != ~p2~0;~lk2~0 := 1; {2720#(= main_~lk2~0 1)} is VALID [2022-04-28 08:16:07,872 INFO L290 TraceCheckUtils]: 10: Hoare triple {2720#(= main_~lk2~0 1)} assume 0 != ~p3~0;~lk3~0 := 1; {2720#(= main_~lk2~0 1)} is VALID [2022-04-28 08:16:07,873 INFO L290 TraceCheckUtils]: 11: Hoare triple {2720#(= main_~lk2~0 1)} assume 0 != ~p4~0;~lk4~0 := 1; {2720#(= main_~lk2~0 1)} is VALID [2022-04-28 08:16:07,873 INFO L290 TraceCheckUtils]: 12: Hoare triple {2720#(= main_~lk2~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {2720#(= main_~lk2~0 1)} is VALID [2022-04-28 08:16:07,873 INFO L290 TraceCheckUtils]: 13: Hoare triple {2720#(= main_~lk2~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {2720#(= main_~lk2~0 1)} is VALID [2022-04-28 08:16:07,874 INFO L290 TraceCheckUtils]: 14: Hoare triple {2720#(= main_~lk2~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {2720#(= main_~lk2~0 1)} is VALID [2022-04-28 08:16:07,874 INFO L290 TraceCheckUtils]: 15: Hoare triple {2720#(= main_~lk2~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {2720#(= main_~lk2~0 1)} is VALID [2022-04-28 08:16:07,874 INFO L290 TraceCheckUtils]: 16: Hoare triple {2720#(= main_~lk2~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {2720#(= main_~lk2~0 1)} is VALID [2022-04-28 08:16:07,875 INFO L290 TraceCheckUtils]: 17: Hoare triple {2720#(= main_~lk2~0 1)} assume !(0 != ~p10~0); {2720#(= main_~lk2~0 1)} is VALID [2022-04-28 08:16:07,875 INFO L290 TraceCheckUtils]: 18: Hoare triple {2720#(= main_~lk2~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {2720#(= main_~lk2~0 1)} is VALID [2022-04-28 08:16:07,875 INFO L290 TraceCheckUtils]: 19: Hoare triple {2720#(= main_~lk2~0 1)} assume !(0 != ~p1~0); {2720#(= main_~lk2~0 1)} is VALID [2022-04-28 08:16:07,876 INFO L290 TraceCheckUtils]: 20: Hoare triple {2720#(= main_~lk2~0 1)} assume 0 != ~p2~0; {2720#(= main_~lk2~0 1)} is VALID [2022-04-28 08:16:07,876 INFO L290 TraceCheckUtils]: 21: Hoare triple {2720#(= main_~lk2~0 1)} assume 1 != ~lk2~0; {2716#false} is VALID [2022-04-28 08:16:07,876 INFO L290 TraceCheckUtils]: 22: Hoare triple {2716#false} assume !false; {2716#false} is VALID [2022-04-28 08:16:07,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 08:16:07,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:16:07,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194291368] [2022-04-28 08:16:07,877 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194291368] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:16:07,877 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:16:07,877 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:16:07,877 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:16:07,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2007707196] [2022-04-28 08:16:07,877 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2007707196] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:16:07,877 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:16:07,878 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:16:07,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328142989] [2022-04-28 08:16:07,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:16:07,878 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-28 08:16:07,878 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:16:07,878 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-28 08:16:07,891 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-28 08:16:07,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:16:07,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:16:07,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:16:07,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:16:07,892 INFO L87 Difference]: Start difference. First operand 147 states and 261 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-28 08:16:08,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:08,051 INFO L93 Difference]: Finished difference Result 191 states and 339 transitions. [2022-04-28 08:16:08,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:16:08,051 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-28 08:16:08,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:16:08,052 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-28 08:16:08,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 136 transitions. [2022-04-28 08:16:08,053 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-28 08:16:08,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 136 transitions. [2022-04-28 08:16:08,054 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 136 transitions. [2022-04-28 08:16:08,134 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-28 08:16:08,139 INFO L225 Difference]: With dead ends: 191 [2022-04-28 08:16:08,139 INFO L226 Difference]: Without dead ends: 189 [2022-04-28 08:16:08,139 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:16:08,140 INFO L413 NwaCegarLoop]: 133 mSDtfsCounter, 117 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 08:16:08,140 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 140 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 08:16:08,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2022-04-28 08:16:08,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 147. [2022-04-28 08:16:08,149 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:16:08,150 INFO L82 GeneralOperation]: Start isEquivalent. First operand 189 states. Second operand has 147 states, 143 states have (on average 1.7902097902097902) internal successors, (256), 143 states have internal predecessors, (256), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:08,150 INFO L74 IsIncluded]: Start isIncluded. First operand 189 states. Second operand has 147 states, 143 states have (on average 1.7902097902097902) internal successors, (256), 143 states have internal predecessors, (256), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:08,150 INFO L87 Difference]: Start difference. First operand 189 states. Second operand has 147 states, 143 states have (on average 1.7902097902097902) internal successors, (256), 143 states have internal predecessors, (256), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:08,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:08,157 INFO L93 Difference]: Finished difference Result 189 states and 336 transitions. [2022-04-28 08:16:08,157 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 336 transitions. [2022-04-28 08:16:08,157 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:16:08,157 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:16:08,158 INFO L74 IsIncluded]: Start isIncluded. First operand has 147 states, 143 states have (on average 1.7902097902097902) internal successors, (256), 143 states have internal predecessors, (256), 2 states have call successors, (2), 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 189 states. [2022-04-28 08:16:08,158 INFO L87 Difference]: Start difference. First operand has 147 states, 143 states have (on average 1.7902097902097902) internal successors, (256), 143 states have internal predecessors, (256), 2 states have call successors, (2), 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 189 states. [2022-04-28 08:16:08,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:08,164 INFO L93 Difference]: Finished difference Result 189 states and 336 transitions. [2022-04-28 08:16:08,164 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 336 transitions. [2022-04-28 08:16:08,164 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:16:08,164 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:16:08,164 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:16:08,165 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:16:08,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 143 states have (on average 1.7902097902097902) internal successors, (256), 143 states have internal predecessors, (256), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:08,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 259 transitions. [2022-04-28 08:16:08,169 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 259 transitions. Word has length 23 [2022-04-28 08:16:08,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:16:08,170 INFO L495 AbstractCegarLoop]: Abstraction has 147 states and 259 transitions. [2022-04-28 08:16:08,170 INFO L496 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-28 08:16:08,170 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 147 states and 259 transitions. [2022-04-28 08:16:08,372 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 259 edges. 259 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:16:08,373 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 259 transitions. [2022-04-28 08:16:08,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-28 08:16:08,373 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:16:08,373 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:16:08,374 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-28 08:16:08,374 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:16:08,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:16:08,374 INFO L85 PathProgramCache]: Analyzing trace with hash 1931535814, now seen corresponding path program 1 times [2022-04-28 08:16:08,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:16:08,375 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [917392656] [2022-04-28 08:16:08,375 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:16:08,375 INFO L85 PathProgramCache]: Analyzing trace with hash 1931535814, now seen corresponding path program 2 times [2022-04-28 08:16:08,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:16:08,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577590213] [2022-04-28 08:16:08,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:16:08,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:16:08,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:16:08,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:16:08,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:16:08,447 INFO L290 TraceCheckUtils]: 0: Hoare triple {3787#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {3781#true} is VALID [2022-04-28 08:16:08,447 INFO L290 TraceCheckUtils]: 1: Hoare triple {3781#true} assume true; {3781#true} is VALID [2022-04-28 08:16:08,447 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3781#true} {3781#true} #217#return; {3781#true} is VALID [2022-04-28 08:16:08,447 INFO L272 TraceCheckUtils]: 0: Hoare triple {3781#true} call ULTIMATE.init(); {3787#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:16:08,448 INFO L290 TraceCheckUtils]: 1: Hoare triple {3787#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {3781#true} is VALID [2022-04-28 08:16:08,448 INFO L290 TraceCheckUtils]: 2: Hoare triple {3781#true} assume true; {3781#true} is VALID [2022-04-28 08:16:08,448 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3781#true} {3781#true} #217#return; {3781#true} is VALID [2022-04-28 08:16:08,448 INFO L272 TraceCheckUtils]: 4: Hoare triple {3781#true} call #t~ret16 := main(); {3781#true} is VALID [2022-04-28 08:16:08,448 INFO L290 TraceCheckUtils]: 5: Hoare triple {3781#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;havoc ~cond~0; {3781#true} is VALID [2022-04-28 08:16:08,448 INFO L290 TraceCheckUtils]: 6: Hoare triple {3781#true} assume !false;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~cond~0 := #t~nondet15;havoc #t~nondet15; {3781#true} is VALID [2022-04-28 08:16:08,448 INFO L290 TraceCheckUtils]: 7: Hoare triple {3781#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0; {3781#true} is VALID [2022-04-28 08:16:08,448 INFO L290 TraceCheckUtils]: 8: Hoare triple {3781#true} assume !(0 != ~p1~0); {3781#true} is VALID [2022-04-28 08:16:08,449 INFO L290 TraceCheckUtils]: 9: Hoare triple {3781#true} assume !(0 != ~p2~0); {3781#true} is VALID [2022-04-28 08:16:08,449 INFO L290 TraceCheckUtils]: 10: Hoare triple {3781#true} assume 0 != ~p3~0;~lk3~0 := 1; {3786#(= main_~lk3~0 1)} is VALID [2022-04-28 08:16:08,449 INFO L290 TraceCheckUtils]: 11: Hoare triple {3786#(= main_~lk3~0 1)} assume 0 != ~p4~0;~lk4~0 := 1; {3786#(= main_~lk3~0 1)} is VALID [2022-04-28 08:16:08,450 INFO L290 TraceCheckUtils]: 12: Hoare triple {3786#(= main_~lk3~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {3786#(= main_~lk3~0 1)} is VALID [2022-04-28 08:16:08,451 INFO L290 TraceCheckUtils]: 13: Hoare triple {3786#(= main_~lk3~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {3786#(= main_~lk3~0 1)} is VALID [2022-04-28 08:16:08,451 INFO L290 TraceCheckUtils]: 14: Hoare triple {3786#(= main_~lk3~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {3786#(= main_~lk3~0 1)} is VALID [2022-04-28 08:16:08,454 INFO L290 TraceCheckUtils]: 15: Hoare triple {3786#(= main_~lk3~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {3786#(= main_~lk3~0 1)} is VALID [2022-04-28 08:16:08,454 INFO L290 TraceCheckUtils]: 16: Hoare triple {3786#(= main_~lk3~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {3786#(= main_~lk3~0 1)} is VALID [2022-04-28 08:16:08,454 INFO L290 TraceCheckUtils]: 17: Hoare triple {3786#(= main_~lk3~0 1)} assume !(0 != ~p10~0); {3786#(= main_~lk3~0 1)} is VALID [2022-04-28 08:16:08,456 INFO L290 TraceCheckUtils]: 18: Hoare triple {3786#(= main_~lk3~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {3786#(= main_~lk3~0 1)} is VALID [2022-04-28 08:16:08,456 INFO L290 TraceCheckUtils]: 19: Hoare triple {3786#(= main_~lk3~0 1)} assume !(0 != ~p1~0); {3786#(= main_~lk3~0 1)} is VALID [2022-04-28 08:16:08,456 INFO L290 TraceCheckUtils]: 20: Hoare triple {3786#(= main_~lk3~0 1)} assume !(0 != ~p2~0); {3786#(= main_~lk3~0 1)} is VALID [2022-04-28 08:16:08,456 INFO L290 TraceCheckUtils]: 21: Hoare triple {3786#(= main_~lk3~0 1)} assume 0 != ~p3~0; {3786#(= main_~lk3~0 1)} is VALID [2022-04-28 08:16:08,457 INFO L290 TraceCheckUtils]: 22: Hoare triple {3786#(= main_~lk3~0 1)} assume 1 != ~lk3~0; {3782#false} is VALID [2022-04-28 08:16:08,457 INFO L290 TraceCheckUtils]: 23: Hoare triple {3782#false} assume !false; {3782#false} is VALID [2022-04-28 08:16:08,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 08:16:08,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:16:08,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577590213] [2022-04-28 08:16:08,457 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577590213] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:16:08,458 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:16:08,458 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:16:08,458 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:16:08,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [917392656] [2022-04-28 08:16:08,458 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [917392656] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:16:08,458 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:16:08,458 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:16:08,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565165198] [2022-04-28 08:16:08,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:16:08,459 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-28 08:16:08,459 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:16:08,459 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-28 08:16:08,474 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-28 08:16:08,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:16:08,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:16:08,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:16:08,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:16:08,475 INFO L87 Difference]: Start difference. First operand 147 states and 259 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-28 08:16:08,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:08,625 INFO L93 Difference]: Finished difference Result 275 states and 491 transitions. [2022-04-28 08:16:08,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:16:08,625 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-28 08:16:08,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:16:08,626 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-28 08:16:08,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 135 transitions. [2022-04-28 08:16:08,627 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-28 08:16:08,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 135 transitions. [2022-04-28 08:16:08,638 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 135 transitions. [2022-04-28 08:16:08,720 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 135 edges. 135 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:16:08,724 INFO L225 Difference]: With dead ends: 275 [2022-04-28 08:16:08,724 INFO L226 Difference]: Without dead ends: 273 [2022-04-28 08:16:08,724 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:16:08,726 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 171 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 08:16:08,726 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 82 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 08:16:08,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2022-04-28 08:16:08,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 199. [2022-04-28 08:16:08,752 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:16:08,753 INFO L82 GeneralOperation]: Start isEquivalent. First operand 273 states. Second operand has 199 states, 195 states have (on average 1.7743589743589743) internal successors, (346), 195 states have internal predecessors, (346), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:08,753 INFO L74 IsIncluded]: Start isIncluded. First operand 273 states. Second operand has 199 states, 195 states have (on average 1.7743589743589743) internal successors, (346), 195 states have internal predecessors, (346), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:08,754 INFO L87 Difference]: Start difference. First operand 273 states. Second operand has 199 states, 195 states have (on average 1.7743589743589743) internal successors, (346), 195 states have internal predecessors, (346), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:08,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:08,759 INFO L93 Difference]: Finished difference Result 273 states and 486 transitions. [2022-04-28 08:16:08,759 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 486 transitions. [2022-04-28 08:16:08,759 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:16:08,759 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:16:08,760 INFO L74 IsIncluded]: Start isIncluded. First operand has 199 states, 195 states have (on average 1.7743589743589743) internal successors, (346), 195 states have internal predecessors, (346), 2 states have call successors, (2), 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 273 states. [2022-04-28 08:16:08,761 INFO L87 Difference]: Start difference. First operand has 199 states, 195 states have (on average 1.7743589743589743) internal successors, (346), 195 states have internal predecessors, (346), 2 states have call successors, (2), 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 273 states. [2022-04-28 08:16:08,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:08,766 INFO L93 Difference]: Finished difference Result 273 states and 486 transitions. [2022-04-28 08:16:08,767 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 486 transitions. [2022-04-28 08:16:08,767 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:16:08,767 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:16:08,767 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:16:08,767 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:16:08,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 195 states have (on average 1.7743589743589743) internal successors, (346), 195 states have internal predecessors, (346), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:08,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 349 transitions. [2022-04-28 08:16:08,771 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 349 transitions. Word has length 24 [2022-04-28 08:16:08,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:16:08,772 INFO L495 AbstractCegarLoop]: Abstraction has 199 states and 349 transitions. [2022-04-28 08:16:08,773 INFO L496 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-28 08:16:08,773 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 199 states and 349 transitions. [2022-04-28 08:16:09,065 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 349 edges. 349 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:16:09,065 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 349 transitions. [2022-04-28 08:16:09,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-28 08:16:09,066 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:16:09,066 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:16:09,066 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-28 08:16:09,066 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:16:09,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:16:09,067 INFO L85 PathProgramCache]: Analyzing trace with hash 920418564, now seen corresponding path program 1 times [2022-04-28 08:16:09,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:16:09,067 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1556477218] [2022-04-28 08:16:09,067 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:16:09,067 INFO L85 PathProgramCache]: Analyzing trace with hash 920418564, now seen corresponding path program 2 times [2022-04-28 08:16:09,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:16:09,067 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520208138] [2022-04-28 08:16:09,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:16:09,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:16:09,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:16:09,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:16:09,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:16:09,119 INFO L290 TraceCheckUtils]: 0: Hoare triple {5293#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {5287#true} is VALID [2022-04-28 08:16:09,119 INFO L290 TraceCheckUtils]: 1: Hoare triple {5287#true} assume true; {5287#true} is VALID [2022-04-28 08:16:09,119 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5287#true} {5287#true} #217#return; {5287#true} is VALID [2022-04-28 08:16:09,120 INFO L272 TraceCheckUtils]: 0: Hoare triple {5287#true} call ULTIMATE.init(); {5293#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:16:09,120 INFO L290 TraceCheckUtils]: 1: Hoare triple {5293#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {5287#true} is VALID [2022-04-28 08:16:09,120 INFO L290 TraceCheckUtils]: 2: Hoare triple {5287#true} assume true; {5287#true} is VALID [2022-04-28 08:16:09,120 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5287#true} {5287#true} #217#return; {5287#true} is VALID [2022-04-28 08:16:09,120 INFO L272 TraceCheckUtils]: 4: Hoare triple {5287#true} call #t~ret16 := main(); {5287#true} is VALID [2022-04-28 08:16:09,120 INFO L290 TraceCheckUtils]: 5: Hoare triple {5287#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;havoc ~cond~0; {5287#true} is VALID [2022-04-28 08:16:09,121 INFO L290 TraceCheckUtils]: 6: Hoare triple {5287#true} assume !false;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~cond~0 := #t~nondet15;havoc #t~nondet15; {5287#true} is VALID [2022-04-28 08:16:09,121 INFO L290 TraceCheckUtils]: 7: Hoare triple {5287#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0; {5287#true} is VALID [2022-04-28 08:16:09,121 INFO L290 TraceCheckUtils]: 8: Hoare triple {5287#true} assume !(0 != ~p1~0); {5287#true} is VALID [2022-04-28 08:16:09,121 INFO L290 TraceCheckUtils]: 9: Hoare triple {5287#true} assume !(0 != ~p2~0); {5287#true} is VALID [2022-04-28 08:16:09,121 INFO L290 TraceCheckUtils]: 10: Hoare triple {5287#true} assume !(0 != ~p3~0); {5292#(= main_~p3~0 0)} is VALID [2022-04-28 08:16:09,121 INFO L290 TraceCheckUtils]: 11: Hoare triple {5292#(= main_~p3~0 0)} assume 0 != ~p4~0;~lk4~0 := 1; {5292#(= main_~p3~0 0)} is VALID [2022-04-28 08:16:09,122 INFO L290 TraceCheckUtils]: 12: Hoare triple {5292#(= main_~p3~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {5292#(= main_~p3~0 0)} is VALID [2022-04-28 08:16:09,122 INFO L290 TraceCheckUtils]: 13: Hoare triple {5292#(= main_~p3~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {5292#(= main_~p3~0 0)} is VALID [2022-04-28 08:16:09,122 INFO L290 TraceCheckUtils]: 14: Hoare triple {5292#(= main_~p3~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {5292#(= main_~p3~0 0)} is VALID [2022-04-28 08:16:09,123 INFO L290 TraceCheckUtils]: 15: Hoare triple {5292#(= main_~p3~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {5292#(= main_~p3~0 0)} is VALID [2022-04-28 08:16:09,123 INFO L290 TraceCheckUtils]: 16: Hoare triple {5292#(= main_~p3~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {5292#(= main_~p3~0 0)} is VALID [2022-04-28 08:16:09,123 INFO L290 TraceCheckUtils]: 17: Hoare triple {5292#(= main_~p3~0 0)} assume !(0 != ~p10~0); {5292#(= main_~p3~0 0)} is VALID [2022-04-28 08:16:09,123 INFO L290 TraceCheckUtils]: 18: Hoare triple {5292#(= main_~p3~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {5292#(= main_~p3~0 0)} is VALID [2022-04-28 08:16:09,124 INFO L290 TraceCheckUtils]: 19: Hoare triple {5292#(= main_~p3~0 0)} assume !(0 != ~p1~0); {5292#(= main_~p3~0 0)} is VALID [2022-04-28 08:16:09,124 INFO L290 TraceCheckUtils]: 20: Hoare triple {5292#(= main_~p3~0 0)} assume !(0 != ~p2~0); {5292#(= main_~p3~0 0)} is VALID [2022-04-28 08:16:09,124 INFO L290 TraceCheckUtils]: 21: Hoare triple {5292#(= main_~p3~0 0)} assume 0 != ~p3~0; {5288#false} is VALID [2022-04-28 08:16:09,124 INFO L290 TraceCheckUtils]: 22: Hoare triple {5288#false} assume 1 != ~lk3~0; {5288#false} is VALID [2022-04-28 08:16:09,124 INFO L290 TraceCheckUtils]: 23: Hoare triple {5288#false} assume !false; {5288#false} is VALID [2022-04-28 08:16:09,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 08:16:09,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:16:09,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520208138] [2022-04-28 08:16:09,125 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520208138] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:16:09,125 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:16:09,125 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:16:09,125 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:16:09,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1556477218] [2022-04-28 08:16:09,125 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1556477218] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:16:09,125 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:16:09,125 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:16:09,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844740129] [2022-04-28 08:16:09,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:16:09,126 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-28 08:16:09,126 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:16:09,126 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-28 08:16:09,137 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-28 08:16:09,137 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:16:09,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:16:09,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:16:09,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:16:09,138 INFO L87 Difference]: Start difference. First operand 199 states and 349 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-28 08:16:09,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:09,290 INFO L93 Difference]: Finished difference Result 471 states and 835 transitions. [2022-04-28 08:16:09,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:16:09,290 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-28 08:16:09,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:16:09,291 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-28 08:16:09,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 204 transitions. [2022-04-28 08:16:09,292 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-28 08:16:09,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 204 transitions. [2022-04-28 08:16:09,293 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 204 transitions. [2022-04-28 08:16:09,423 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 204 edges. 204 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:16:09,427 INFO L225 Difference]: With dead ends: 471 [2022-04-28 08:16:09,427 INFO L226 Difference]: Without dead ends: 281 [2022-04-28 08:16:09,428 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:16:09,429 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 151 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 08:16:09,429 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 107 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 08:16:09,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2022-04-28 08:16:09,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 279. [2022-04-28 08:16:09,444 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:16:09,444 INFO L82 GeneralOperation]: Start isEquivalent. First operand 281 states. Second operand has 279 states, 275 states have (on average 1.76) internal successors, (484), 275 states have internal predecessors, (484), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:09,445 INFO L74 IsIncluded]: Start isIncluded. First operand 281 states. Second operand has 279 states, 275 states have (on average 1.76) internal successors, (484), 275 states have internal predecessors, (484), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:09,445 INFO L87 Difference]: Start difference. First operand 281 states. Second operand has 279 states, 275 states have (on average 1.76) internal successors, (484), 275 states have internal predecessors, (484), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:09,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:09,451 INFO L93 Difference]: Finished difference Result 281 states and 488 transitions. [2022-04-28 08:16:09,451 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 488 transitions. [2022-04-28 08:16:09,452 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:16:09,452 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:16:09,452 INFO L74 IsIncluded]: Start isIncluded. First operand has 279 states, 275 states have (on average 1.76) internal successors, (484), 275 states have internal predecessors, (484), 2 states have call successors, (2), 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 281 states. [2022-04-28 08:16:09,452 INFO L87 Difference]: Start difference. First operand has 279 states, 275 states have (on average 1.76) internal successors, (484), 275 states have internal predecessors, (484), 2 states have call successors, (2), 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 281 states. [2022-04-28 08:16:09,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:09,457 INFO L93 Difference]: Finished difference Result 281 states and 488 transitions. [2022-04-28 08:16:09,457 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 488 transitions. [2022-04-28 08:16:09,457 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:16:09,457 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:16:09,457 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:16:09,457 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:16:09,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 275 states have (on average 1.76) internal successors, (484), 275 states have internal predecessors, (484), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:09,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 487 transitions. [2022-04-28 08:16:09,463 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 487 transitions. Word has length 24 [2022-04-28 08:16:09,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:16:09,463 INFO L495 AbstractCegarLoop]: Abstraction has 279 states and 487 transitions. [2022-04-28 08:16:09,463 INFO L496 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-28 08:16:09,463 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 279 states and 487 transitions. [2022-04-28 08:16:09,893 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 487 edges. 487 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:16:09,894 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 487 transitions. [2022-04-28 08:16:09,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-28 08:16:09,894 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:16:09,894 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:16:09,894 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-28 08:16:09,895 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:16:09,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:16:09,895 INFO L85 PathProgramCache]: Analyzing trace with hash -251718169, now seen corresponding path program 1 times [2022-04-28 08:16:09,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:16:09,895 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [277215790] [2022-04-28 08:16:09,895 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:16:09,896 INFO L85 PathProgramCache]: Analyzing trace with hash -251718169, now seen corresponding path program 2 times [2022-04-28 08:16:09,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:16:09,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119804669] [2022-04-28 08:16:09,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:16:09,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:16:09,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:16:09,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:16:09,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:16:09,972 INFO L290 TraceCheckUtils]: 0: Hoare triple {7367#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {7361#true} is VALID [2022-04-28 08:16:09,972 INFO L290 TraceCheckUtils]: 1: Hoare triple {7361#true} assume true; {7361#true} is VALID [2022-04-28 08:16:09,972 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7361#true} {7361#true} #217#return; {7361#true} is VALID [2022-04-28 08:16:09,975 INFO L272 TraceCheckUtils]: 0: Hoare triple {7361#true} call ULTIMATE.init(); {7367#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:16:09,976 INFO L290 TraceCheckUtils]: 1: Hoare triple {7367#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {7361#true} is VALID [2022-04-28 08:16:09,976 INFO L290 TraceCheckUtils]: 2: Hoare triple {7361#true} assume true; {7361#true} is VALID [2022-04-28 08:16:09,976 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7361#true} {7361#true} #217#return; {7361#true} is VALID [2022-04-28 08:16:09,976 INFO L272 TraceCheckUtils]: 4: Hoare triple {7361#true} call #t~ret16 := main(); {7361#true} is VALID [2022-04-28 08:16:09,977 INFO L290 TraceCheckUtils]: 5: Hoare triple {7361#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;havoc ~cond~0; {7361#true} is VALID [2022-04-28 08:16:09,979 INFO L290 TraceCheckUtils]: 6: Hoare triple {7361#true} assume !false;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~cond~0 := #t~nondet15;havoc #t~nondet15; {7361#true} is VALID [2022-04-28 08:16:09,979 INFO L290 TraceCheckUtils]: 7: Hoare triple {7361#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0; {7361#true} is VALID [2022-04-28 08:16:09,980 INFO L290 TraceCheckUtils]: 8: Hoare triple {7361#true} assume !(0 != ~p1~0); {7361#true} is VALID [2022-04-28 08:16:09,980 INFO L290 TraceCheckUtils]: 9: Hoare triple {7361#true} assume !(0 != ~p2~0); {7361#true} is VALID [2022-04-28 08:16:09,980 INFO L290 TraceCheckUtils]: 10: Hoare triple {7361#true} assume 0 != ~p3~0;~lk3~0 := 1; {7366#(not (= main_~p3~0 0))} is VALID [2022-04-28 08:16:09,981 INFO L290 TraceCheckUtils]: 11: Hoare triple {7366#(not (= main_~p3~0 0))} assume 0 != ~p4~0;~lk4~0 := 1; {7366#(not (= main_~p3~0 0))} is VALID [2022-04-28 08:16:09,981 INFO L290 TraceCheckUtils]: 12: Hoare triple {7366#(not (= main_~p3~0 0))} assume 0 != ~p5~0;~lk5~0 := 1; {7366#(not (= main_~p3~0 0))} is VALID [2022-04-28 08:16:09,981 INFO L290 TraceCheckUtils]: 13: Hoare triple {7366#(not (= main_~p3~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {7366#(not (= main_~p3~0 0))} is VALID [2022-04-28 08:16:09,982 INFO L290 TraceCheckUtils]: 14: Hoare triple {7366#(not (= main_~p3~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {7366#(not (= main_~p3~0 0))} is VALID [2022-04-28 08:16:09,985 INFO L290 TraceCheckUtils]: 15: Hoare triple {7366#(not (= main_~p3~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {7366#(not (= main_~p3~0 0))} is VALID [2022-04-28 08:16:09,986 INFO L290 TraceCheckUtils]: 16: Hoare triple {7366#(not (= main_~p3~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {7366#(not (= main_~p3~0 0))} is VALID [2022-04-28 08:16:09,986 INFO L290 TraceCheckUtils]: 17: Hoare triple {7366#(not (= main_~p3~0 0))} assume !(0 != ~p10~0); {7366#(not (= main_~p3~0 0))} is VALID [2022-04-28 08:16:09,986 INFO L290 TraceCheckUtils]: 18: Hoare triple {7366#(not (= main_~p3~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {7366#(not (= main_~p3~0 0))} is VALID [2022-04-28 08:16:09,987 INFO L290 TraceCheckUtils]: 19: Hoare triple {7366#(not (= main_~p3~0 0))} assume !(0 != ~p1~0); {7366#(not (= main_~p3~0 0))} is VALID [2022-04-28 08:16:09,987 INFO L290 TraceCheckUtils]: 20: Hoare triple {7366#(not (= main_~p3~0 0))} assume !(0 != ~p2~0); {7366#(not (= main_~p3~0 0))} is VALID [2022-04-28 08:16:09,988 INFO L290 TraceCheckUtils]: 21: Hoare triple {7366#(not (= main_~p3~0 0))} assume !(0 != ~p3~0); {7362#false} is VALID [2022-04-28 08:16:09,988 INFO L290 TraceCheckUtils]: 22: Hoare triple {7362#false} assume 0 != ~p4~0; {7362#false} is VALID [2022-04-28 08:16:09,988 INFO L290 TraceCheckUtils]: 23: Hoare triple {7362#false} assume 1 != ~lk4~0; {7362#false} is VALID [2022-04-28 08:16:09,988 INFO L290 TraceCheckUtils]: 24: Hoare triple {7362#false} assume !false; {7362#false} is VALID [2022-04-28 08:16:09,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 08:16:09,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:16:09,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119804669] [2022-04-28 08:16:09,989 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119804669] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:16:09,989 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:16:09,989 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:16:09,989 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:16:09,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [277215790] [2022-04-28 08:16:09,989 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [277215790] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:16:09,989 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:16:09,989 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:16:09,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755391301] [2022-04-28 08:16:09,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:16:09,990 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-28 08:16:09,990 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:16:09,990 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:10,003 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:16:10,004 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:16:10,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:16:10,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:16:10,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:16:10,005 INFO L87 Difference]: Start difference. First operand 279 states and 487 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:10,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:10,183 INFO L93 Difference]: Finished difference Result 421 states and 733 transitions. [2022-04-28 08:16:10,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:16:10,183 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-28 08:16:10,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:16:10,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:10,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 199 transitions. [2022-04-28 08:16:10,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:10,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 199 transitions. [2022-04-28 08:16:10,186 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 199 transitions. [2022-04-28 08:16:10,299 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 199 edges. 199 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:16:10,304 INFO L225 Difference]: With dead ends: 421 [2022-04-28 08:16:10,304 INFO L226 Difference]: Without dead ends: 287 [2022-04-28 08:16:10,305 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:16:10,305 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 142 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 08:16:10,305 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 117 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 08:16:10,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2022-04-28 08:16:10,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 285. [2022-04-28 08:16:10,318 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:16:10,319 INFO L82 GeneralOperation]: Start isEquivalent. First operand 287 states. Second operand has 285 states, 281 states have (on average 1.7366548042704626) internal successors, (488), 281 states have internal predecessors, (488), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:10,319 INFO L74 IsIncluded]: Start isIncluded. First operand 287 states. Second operand has 285 states, 281 states have (on average 1.7366548042704626) internal successors, (488), 281 states have internal predecessors, (488), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:10,320 INFO L87 Difference]: Start difference. First operand 287 states. Second operand has 285 states, 281 states have (on average 1.7366548042704626) internal successors, (488), 281 states have internal predecessors, (488), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:10,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:10,325 INFO L93 Difference]: Finished difference Result 287 states and 492 transitions. [2022-04-28 08:16:10,325 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 492 transitions. [2022-04-28 08:16:10,325 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:16:10,325 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:16:10,326 INFO L74 IsIncluded]: Start isIncluded. First operand has 285 states, 281 states have (on average 1.7366548042704626) internal successors, (488), 281 states have internal predecessors, (488), 2 states have call successors, (2), 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 287 states. [2022-04-28 08:16:10,326 INFO L87 Difference]: Start difference. First operand has 285 states, 281 states have (on average 1.7366548042704626) internal successors, (488), 281 states have internal predecessors, (488), 2 states have call successors, (2), 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 287 states. [2022-04-28 08:16:10,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:10,331 INFO L93 Difference]: Finished difference Result 287 states and 492 transitions. [2022-04-28 08:16:10,331 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 492 transitions. [2022-04-28 08:16:10,331 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:16:10,331 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:16:10,331 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:16:10,331 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:16:10,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 281 states have (on average 1.7366548042704626) internal successors, (488), 281 states have internal predecessors, (488), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:10,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 491 transitions. [2022-04-28 08:16:10,337 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 491 transitions. Word has length 25 [2022-04-28 08:16:10,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:16:10,337 INFO L495 AbstractCegarLoop]: Abstraction has 285 states and 491 transitions. [2022-04-28 08:16:10,338 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:10,338 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 285 states and 491 transitions. [2022-04-28 08:16:10,765 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 491 edges. 491 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:16:10,766 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 491 transitions. [2022-04-28 08:16:10,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-28 08:16:10,766 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:16:10,766 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:16:10,766 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-28 08:16:10,767 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:16:10,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:16:10,767 INFO L85 PathProgramCache]: Analyzing trace with hash -1531581847, now seen corresponding path program 1 times [2022-04-28 08:16:10,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:16:10,767 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [919078089] [2022-04-28 08:16:10,767 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:16:10,767 INFO L85 PathProgramCache]: Analyzing trace with hash -1531581847, now seen corresponding path program 2 times [2022-04-28 08:16:10,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:16:10,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235924780] [2022-04-28 08:16:10,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:16:10,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:16:10,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:16:10,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:16:10,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:16:10,799 INFO L290 TraceCheckUtils]: 0: Hoare triple {9365#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {9359#true} is VALID [2022-04-28 08:16:10,799 INFO L290 TraceCheckUtils]: 1: Hoare triple {9359#true} assume true; {9359#true} is VALID [2022-04-28 08:16:10,799 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9359#true} {9359#true} #217#return; {9359#true} is VALID [2022-04-28 08:16:10,800 INFO L272 TraceCheckUtils]: 0: Hoare triple {9359#true} call ULTIMATE.init(); {9365#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:16:10,800 INFO L290 TraceCheckUtils]: 1: Hoare triple {9365#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {9359#true} is VALID [2022-04-28 08:16:10,800 INFO L290 TraceCheckUtils]: 2: Hoare triple {9359#true} assume true; {9359#true} is VALID [2022-04-28 08:16:10,800 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9359#true} {9359#true} #217#return; {9359#true} is VALID [2022-04-28 08:16:10,800 INFO L272 TraceCheckUtils]: 4: Hoare triple {9359#true} call #t~ret16 := main(); {9359#true} is VALID [2022-04-28 08:16:10,800 INFO L290 TraceCheckUtils]: 5: Hoare triple {9359#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;havoc ~cond~0; {9359#true} is VALID [2022-04-28 08:16:10,801 INFO L290 TraceCheckUtils]: 6: Hoare triple {9359#true} assume !false;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~cond~0 := #t~nondet15;havoc #t~nondet15; {9359#true} is VALID [2022-04-28 08:16:10,801 INFO L290 TraceCheckUtils]: 7: Hoare triple {9359#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0; {9359#true} is VALID [2022-04-28 08:16:10,801 INFO L290 TraceCheckUtils]: 8: Hoare triple {9359#true} assume !(0 != ~p1~0); {9359#true} is VALID [2022-04-28 08:16:10,801 INFO L290 TraceCheckUtils]: 9: Hoare triple {9359#true} assume !(0 != ~p2~0); {9359#true} is VALID [2022-04-28 08:16:10,801 INFO L290 TraceCheckUtils]: 10: Hoare triple {9359#true} assume !(0 != ~p3~0); {9359#true} is VALID [2022-04-28 08:16:10,801 INFO L290 TraceCheckUtils]: 11: Hoare triple {9359#true} assume 0 != ~p4~0;~lk4~0 := 1; {9364#(= main_~lk4~0 1)} is VALID [2022-04-28 08:16:10,801 INFO L290 TraceCheckUtils]: 12: Hoare triple {9364#(= main_~lk4~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {9364#(= main_~lk4~0 1)} is VALID [2022-04-28 08:16:10,802 INFO L290 TraceCheckUtils]: 13: Hoare triple {9364#(= main_~lk4~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {9364#(= main_~lk4~0 1)} is VALID [2022-04-28 08:16:10,802 INFO L290 TraceCheckUtils]: 14: Hoare triple {9364#(= main_~lk4~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {9364#(= main_~lk4~0 1)} is VALID [2022-04-28 08:16:10,802 INFO L290 TraceCheckUtils]: 15: Hoare triple {9364#(= main_~lk4~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {9364#(= main_~lk4~0 1)} is VALID [2022-04-28 08:16:10,803 INFO L290 TraceCheckUtils]: 16: Hoare triple {9364#(= main_~lk4~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {9364#(= main_~lk4~0 1)} is VALID [2022-04-28 08:16:10,803 INFO L290 TraceCheckUtils]: 17: Hoare triple {9364#(= main_~lk4~0 1)} assume !(0 != ~p10~0); {9364#(= main_~lk4~0 1)} is VALID [2022-04-28 08:16:10,803 INFO L290 TraceCheckUtils]: 18: Hoare triple {9364#(= main_~lk4~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {9364#(= main_~lk4~0 1)} is VALID [2022-04-28 08:16:10,803 INFO L290 TraceCheckUtils]: 19: Hoare triple {9364#(= main_~lk4~0 1)} assume !(0 != ~p1~0); {9364#(= main_~lk4~0 1)} is VALID [2022-04-28 08:16:10,804 INFO L290 TraceCheckUtils]: 20: Hoare triple {9364#(= main_~lk4~0 1)} assume !(0 != ~p2~0); {9364#(= main_~lk4~0 1)} is VALID [2022-04-28 08:16:10,804 INFO L290 TraceCheckUtils]: 21: Hoare triple {9364#(= main_~lk4~0 1)} assume !(0 != ~p3~0); {9364#(= main_~lk4~0 1)} is VALID [2022-04-28 08:16:10,804 INFO L290 TraceCheckUtils]: 22: Hoare triple {9364#(= main_~lk4~0 1)} assume 0 != ~p4~0; {9364#(= main_~lk4~0 1)} is VALID [2022-04-28 08:16:10,805 INFO L290 TraceCheckUtils]: 23: Hoare triple {9364#(= main_~lk4~0 1)} assume 1 != ~lk4~0; {9360#false} is VALID [2022-04-28 08:16:10,805 INFO L290 TraceCheckUtils]: 24: Hoare triple {9360#false} assume !false; {9360#false} is VALID [2022-04-28 08:16:10,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 08:16:10,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:16:10,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235924780] [2022-04-28 08:16:10,805 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235924780] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:16:10,805 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:16:10,805 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:16:10,805 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:16:10,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [919078089] [2022-04-28 08:16:10,805 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [919078089] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:16:10,806 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:16:10,806 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:16:10,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428343634] [2022-04-28 08:16:10,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:16:10,806 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-28 08:16:10,806 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:16:10,806 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:10,819 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:16:10,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:16:10,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:16:10,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:16:10,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:16:10,819 INFO L87 Difference]: Start difference. First operand 285 states and 491 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:10,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:10,997 INFO L93 Difference]: Finished difference Result 525 states and 917 transitions. [2022-04-28 08:16:10,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:16:10,998 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-28 08:16:10,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:16:10,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:10,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 131 transitions. [2022-04-28 08:16:10,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:11,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 131 transitions. [2022-04-28 08:16:11,000 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 131 transitions. [2022-04-28 08:16:11,078 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 131 edges. 131 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:16:11,089 INFO L225 Difference]: With dead ends: 525 [2022-04-28 08:16:11,089 INFO L226 Difference]: Without dead ends: 523 [2022-04-28 08:16:11,089 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:16:11,090 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 164 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 08:16:11,090 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 81 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 08:16:11,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2022-04-28 08:16:11,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 393. [2022-04-28 08:16:11,111 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:16:11,112 INFO L82 GeneralOperation]: Start isEquivalent. First operand 523 states. Second operand has 393 states, 389 states have (on average 1.7069408740359897) internal successors, (664), 389 states have internal predecessors, (664), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:11,113 INFO L74 IsIncluded]: Start isIncluded. First operand 523 states. Second operand has 393 states, 389 states have (on average 1.7069408740359897) internal successors, (664), 389 states have internal predecessors, (664), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:11,113 INFO L87 Difference]: Start difference. First operand 523 states. Second operand has 393 states, 389 states have (on average 1.7069408740359897) internal successors, (664), 389 states have internal predecessors, (664), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:11,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:11,124 INFO L93 Difference]: Finished difference Result 523 states and 908 transitions. [2022-04-28 08:16:11,124 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 908 transitions. [2022-04-28 08:16:11,124 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:16:11,124 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:16:11,125 INFO L74 IsIncluded]: Start isIncluded. First operand has 393 states, 389 states have (on average 1.7069408740359897) internal successors, (664), 389 states have internal predecessors, (664), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 523 states. [2022-04-28 08:16:11,125 INFO L87 Difference]: Start difference. First operand has 393 states, 389 states have (on average 1.7069408740359897) internal successors, (664), 389 states have internal predecessors, (664), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 523 states. [2022-04-28 08:16:11,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:11,136 INFO L93 Difference]: Finished difference Result 523 states and 908 transitions. [2022-04-28 08:16:11,136 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 908 transitions. [2022-04-28 08:16:11,136 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:16:11,137 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:16:11,137 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:16:11,137 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:16:11,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 389 states have (on average 1.7069408740359897) internal successors, (664), 389 states have internal predecessors, (664), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:11,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 667 transitions. [2022-04-28 08:16:11,146 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 667 transitions. Word has length 25 [2022-04-28 08:16:11,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:16:11,146 INFO L495 AbstractCegarLoop]: Abstraction has 393 states and 667 transitions. [2022-04-28 08:16:11,146 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:11,146 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 393 states and 667 transitions. [2022-04-28 08:16:11,712 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 667 edges. 667 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:16:11,712 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 667 transitions. [2022-04-28 08:16:11,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-28 08:16:11,713 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:16:11,713 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:16:11,713 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-28 08:16:11,713 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:16:11,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:16:11,713 INFO L85 PathProgramCache]: Analyzing trace with hash 1752268199, now seen corresponding path program 1 times [2022-04-28 08:16:11,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:16:11,714 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1770140741] [2022-04-28 08:16:11,714 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:16:11,714 INFO L85 PathProgramCache]: Analyzing trace with hash 1752268199, now seen corresponding path program 2 times [2022-04-28 08:16:11,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:16:11,714 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852087419] [2022-04-28 08:16:11,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:16:11,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:16:11,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:16:11,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:16:11,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:16:11,759 INFO L290 TraceCheckUtils]: 0: Hoare triple {12259#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {12253#true} is VALID [2022-04-28 08:16:11,759 INFO L290 TraceCheckUtils]: 1: Hoare triple {12253#true} assume true; {12253#true} is VALID [2022-04-28 08:16:11,759 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12253#true} {12253#true} #217#return; {12253#true} is VALID [2022-04-28 08:16:11,759 INFO L272 TraceCheckUtils]: 0: Hoare triple {12253#true} call ULTIMATE.init(); {12259#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:16:11,759 INFO L290 TraceCheckUtils]: 1: Hoare triple {12259#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {12253#true} is VALID [2022-04-28 08:16:11,760 INFO L290 TraceCheckUtils]: 2: Hoare triple {12253#true} assume true; {12253#true} is VALID [2022-04-28 08:16:11,760 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12253#true} {12253#true} #217#return; {12253#true} is VALID [2022-04-28 08:16:11,760 INFO L272 TraceCheckUtils]: 4: Hoare triple {12253#true} call #t~ret16 := main(); {12253#true} is VALID [2022-04-28 08:16:11,760 INFO L290 TraceCheckUtils]: 5: Hoare triple {12253#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;havoc ~cond~0; {12253#true} is VALID [2022-04-28 08:16:11,760 INFO L290 TraceCheckUtils]: 6: Hoare triple {12253#true} assume !false;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~cond~0 := #t~nondet15;havoc #t~nondet15; {12253#true} is VALID [2022-04-28 08:16:11,760 INFO L290 TraceCheckUtils]: 7: Hoare triple {12253#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0; {12253#true} is VALID [2022-04-28 08:16:11,760 INFO L290 TraceCheckUtils]: 8: Hoare triple {12253#true} assume !(0 != ~p1~0); {12253#true} is VALID [2022-04-28 08:16:11,760 INFO L290 TraceCheckUtils]: 9: Hoare triple {12253#true} assume !(0 != ~p2~0); {12253#true} is VALID [2022-04-28 08:16:11,760 INFO L290 TraceCheckUtils]: 10: Hoare triple {12253#true} assume !(0 != ~p3~0); {12253#true} is VALID [2022-04-28 08:16:11,761 INFO L290 TraceCheckUtils]: 11: Hoare triple {12253#true} assume !(0 != ~p4~0); {12258#(= main_~p4~0 0)} is VALID [2022-04-28 08:16:11,761 INFO L290 TraceCheckUtils]: 12: Hoare triple {12258#(= main_~p4~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {12258#(= main_~p4~0 0)} is VALID [2022-04-28 08:16:11,761 INFO L290 TraceCheckUtils]: 13: Hoare triple {12258#(= main_~p4~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {12258#(= main_~p4~0 0)} is VALID [2022-04-28 08:16:11,761 INFO L290 TraceCheckUtils]: 14: Hoare triple {12258#(= main_~p4~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {12258#(= main_~p4~0 0)} is VALID [2022-04-28 08:16:11,762 INFO L290 TraceCheckUtils]: 15: Hoare triple {12258#(= main_~p4~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {12258#(= main_~p4~0 0)} is VALID [2022-04-28 08:16:11,762 INFO L290 TraceCheckUtils]: 16: Hoare triple {12258#(= main_~p4~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {12258#(= main_~p4~0 0)} is VALID [2022-04-28 08:16:11,762 INFO L290 TraceCheckUtils]: 17: Hoare triple {12258#(= main_~p4~0 0)} assume !(0 != ~p10~0); {12258#(= main_~p4~0 0)} is VALID [2022-04-28 08:16:11,763 INFO L290 TraceCheckUtils]: 18: Hoare triple {12258#(= main_~p4~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {12258#(= main_~p4~0 0)} is VALID [2022-04-28 08:16:11,763 INFO L290 TraceCheckUtils]: 19: Hoare triple {12258#(= main_~p4~0 0)} assume !(0 != ~p1~0); {12258#(= main_~p4~0 0)} is VALID [2022-04-28 08:16:11,763 INFO L290 TraceCheckUtils]: 20: Hoare triple {12258#(= main_~p4~0 0)} assume !(0 != ~p2~0); {12258#(= main_~p4~0 0)} is VALID [2022-04-28 08:16:11,763 INFO L290 TraceCheckUtils]: 21: Hoare triple {12258#(= main_~p4~0 0)} assume !(0 != ~p3~0); {12258#(= main_~p4~0 0)} is VALID [2022-04-28 08:16:11,764 INFO L290 TraceCheckUtils]: 22: Hoare triple {12258#(= main_~p4~0 0)} assume 0 != ~p4~0; {12254#false} is VALID [2022-04-28 08:16:11,764 INFO L290 TraceCheckUtils]: 23: Hoare triple {12254#false} assume 1 != ~lk4~0; {12254#false} is VALID [2022-04-28 08:16:11,764 INFO L290 TraceCheckUtils]: 24: Hoare triple {12254#false} assume !false; {12254#false} is VALID [2022-04-28 08:16:11,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 08:16:11,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:16:11,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852087419] [2022-04-28 08:16:11,764 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852087419] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:16:11,764 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:16:11,765 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:16:11,765 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:16:11,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1770140741] [2022-04-28 08:16:11,765 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1770140741] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:16:11,765 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:16:11,765 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:16:11,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582513265] [2022-04-28 08:16:11,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:16:11,765 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-28 08:16:11,765 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:16:11,765 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:11,779 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:16:11,779 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:16:11,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:16:11,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:16:11,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:16:11,780 INFO L87 Difference]: Start difference. First operand 393 states and 667 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:12,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:12,023 INFO L93 Difference]: Finished difference Result 925 states and 1581 transitions. [2022-04-28 08:16:12,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:16:12,023 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-28 08:16:12,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:16:12,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:12,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 201 transitions. [2022-04-28 08:16:12,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:12,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 201 transitions. [2022-04-28 08:16:12,026 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 201 transitions. [2022-04-28 08:16:12,155 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 201 edges. 201 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:16:12,167 INFO L225 Difference]: With dead ends: 925 [2022-04-28 08:16:12,167 INFO L226 Difference]: Without dead ends: 547 [2022-04-28 08:16:12,168 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:16:12,169 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 145 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 08:16:12,169 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 109 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 08:16:12,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2022-04-28 08:16:12,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 545. [2022-04-28 08:16:12,196 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:16:12,196 INFO L82 GeneralOperation]: Start isEquivalent. First operand 547 states. Second operand has 545 states, 541 states have (on average 1.6931608133086875) internal successors, (916), 541 states have internal predecessors, (916), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:12,197 INFO L74 IsIncluded]: Start isIncluded. First operand 547 states. Second operand has 545 states, 541 states have (on average 1.6931608133086875) internal successors, (916), 541 states have internal predecessors, (916), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:12,198 INFO L87 Difference]: Start difference. First operand 547 states. Second operand has 545 states, 541 states have (on average 1.6931608133086875) internal successors, (916), 541 states have internal predecessors, (916), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:12,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:12,208 INFO L93 Difference]: Finished difference Result 547 states and 920 transitions. [2022-04-28 08:16:12,208 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 920 transitions. [2022-04-28 08:16:12,209 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:16:12,209 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:16:12,210 INFO L74 IsIncluded]: Start isIncluded. First operand has 545 states, 541 states have (on average 1.6931608133086875) internal successors, (916), 541 states have internal predecessors, (916), 2 states have call successors, (2), 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 547 states. [2022-04-28 08:16:12,210 INFO L87 Difference]: Start difference. First operand has 545 states, 541 states have (on average 1.6931608133086875) internal successors, (916), 541 states have internal predecessors, (916), 2 states have call successors, (2), 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 547 states. [2022-04-28 08:16:12,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:12,221 INFO L93 Difference]: Finished difference Result 547 states and 920 transitions. [2022-04-28 08:16:12,221 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 920 transitions. [2022-04-28 08:16:12,222 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:16:12,222 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:16:12,222 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:16:12,222 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:16:12,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 545 states, 541 states have (on average 1.6931608133086875) internal successors, (916), 541 states have internal predecessors, (916), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:12,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 919 transitions. [2022-04-28 08:16:12,235 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 919 transitions. Word has length 25 [2022-04-28 08:16:12,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:16:12,235 INFO L495 AbstractCegarLoop]: Abstraction has 545 states and 919 transitions. [2022-04-28 08:16:12,235 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:12,235 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 545 states and 919 transitions. [2022-04-28 08:16:13,109 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 919 edges. 919 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:16:13,110 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 919 transitions. [2022-04-28 08:16:13,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-28 08:16:13,110 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:16:13,111 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:16:13,111 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-28 08:16:13,111 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:16:13,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:16:13,111 INFO L85 PathProgramCache]: Analyzing trace with hash -234182919, now seen corresponding path program 1 times [2022-04-28 08:16:13,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:16:13,111 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [993729806] [2022-04-28 08:16:13,111 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:16:13,112 INFO L85 PathProgramCache]: Analyzing trace with hash -234182919, now seen corresponding path program 2 times [2022-04-28 08:16:13,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:16:13,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808054122] [2022-04-28 08:16:13,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:16:13,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:16:13,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:16:13,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:16:13,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:16:13,151 INFO L290 TraceCheckUtils]: 0: Hoare triple {16305#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {16299#true} is VALID [2022-04-28 08:16:13,152 INFO L290 TraceCheckUtils]: 1: Hoare triple {16299#true} assume true; {16299#true} is VALID [2022-04-28 08:16:13,152 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16299#true} {16299#true} #217#return; {16299#true} is VALID [2022-04-28 08:16:13,152 INFO L272 TraceCheckUtils]: 0: Hoare triple {16299#true} call ULTIMATE.init(); {16305#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:16:13,152 INFO L290 TraceCheckUtils]: 1: Hoare triple {16305#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {16299#true} is VALID [2022-04-28 08:16:13,152 INFO L290 TraceCheckUtils]: 2: Hoare triple {16299#true} assume true; {16299#true} is VALID [2022-04-28 08:16:13,152 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16299#true} {16299#true} #217#return; {16299#true} is VALID [2022-04-28 08:16:13,153 INFO L272 TraceCheckUtils]: 4: Hoare triple {16299#true} call #t~ret16 := main(); {16299#true} is VALID [2022-04-28 08:16:13,153 INFO L290 TraceCheckUtils]: 5: Hoare triple {16299#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;havoc ~cond~0; {16299#true} is VALID [2022-04-28 08:16:13,153 INFO L290 TraceCheckUtils]: 6: Hoare triple {16299#true} assume !false;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~cond~0 := #t~nondet15;havoc #t~nondet15; {16299#true} is VALID [2022-04-28 08:16:13,153 INFO L290 TraceCheckUtils]: 7: Hoare triple {16299#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0; {16299#true} is VALID [2022-04-28 08:16:13,153 INFO L290 TraceCheckUtils]: 8: Hoare triple {16299#true} assume !(0 != ~p1~0); {16299#true} is VALID [2022-04-28 08:16:13,153 INFO L290 TraceCheckUtils]: 9: Hoare triple {16299#true} assume !(0 != ~p2~0); {16299#true} is VALID [2022-04-28 08:16:13,153 INFO L290 TraceCheckUtils]: 10: Hoare triple {16299#true} assume !(0 != ~p3~0); {16299#true} is VALID [2022-04-28 08:16:13,153 INFO L290 TraceCheckUtils]: 11: Hoare triple {16299#true} assume 0 != ~p4~0;~lk4~0 := 1; {16304#(not (= main_~p4~0 0))} is VALID [2022-04-28 08:16:13,154 INFO L290 TraceCheckUtils]: 12: Hoare triple {16304#(not (= main_~p4~0 0))} assume 0 != ~p5~0;~lk5~0 := 1; {16304#(not (= main_~p4~0 0))} is VALID [2022-04-28 08:16:13,154 INFO L290 TraceCheckUtils]: 13: Hoare triple {16304#(not (= main_~p4~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {16304#(not (= main_~p4~0 0))} is VALID [2022-04-28 08:16:13,154 INFO L290 TraceCheckUtils]: 14: Hoare triple {16304#(not (= main_~p4~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {16304#(not (= main_~p4~0 0))} is VALID [2022-04-28 08:16:13,154 INFO L290 TraceCheckUtils]: 15: Hoare triple {16304#(not (= main_~p4~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {16304#(not (= main_~p4~0 0))} is VALID [2022-04-28 08:16:13,155 INFO L290 TraceCheckUtils]: 16: Hoare triple {16304#(not (= main_~p4~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {16304#(not (= main_~p4~0 0))} is VALID [2022-04-28 08:16:13,155 INFO L290 TraceCheckUtils]: 17: Hoare triple {16304#(not (= main_~p4~0 0))} assume !(0 != ~p10~0); {16304#(not (= main_~p4~0 0))} is VALID [2022-04-28 08:16:13,155 INFO L290 TraceCheckUtils]: 18: Hoare triple {16304#(not (= main_~p4~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {16304#(not (= main_~p4~0 0))} is VALID [2022-04-28 08:16:13,156 INFO L290 TraceCheckUtils]: 19: Hoare triple {16304#(not (= main_~p4~0 0))} assume !(0 != ~p1~0); {16304#(not (= main_~p4~0 0))} is VALID [2022-04-28 08:16:13,156 INFO L290 TraceCheckUtils]: 20: Hoare triple {16304#(not (= main_~p4~0 0))} assume !(0 != ~p2~0); {16304#(not (= main_~p4~0 0))} is VALID [2022-04-28 08:16:13,156 INFO L290 TraceCheckUtils]: 21: Hoare triple {16304#(not (= main_~p4~0 0))} assume !(0 != ~p3~0); {16304#(not (= main_~p4~0 0))} is VALID [2022-04-28 08:16:13,156 INFO L290 TraceCheckUtils]: 22: Hoare triple {16304#(not (= main_~p4~0 0))} assume !(0 != ~p4~0); {16300#false} is VALID [2022-04-28 08:16:13,157 INFO L290 TraceCheckUtils]: 23: Hoare triple {16300#false} assume 0 != ~p5~0; {16300#false} is VALID [2022-04-28 08:16:13,157 INFO L290 TraceCheckUtils]: 24: Hoare triple {16300#false} assume 1 != ~lk5~0; {16300#false} is VALID [2022-04-28 08:16:13,157 INFO L290 TraceCheckUtils]: 25: Hoare triple {16300#false} assume !false; {16300#false} is VALID [2022-04-28 08:16:13,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 08:16:13,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:16:13,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808054122] [2022-04-28 08:16:13,157 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808054122] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:16:13,157 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:16:13,157 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:16:13,158 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:16:13,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [993729806] [2022-04-28 08:16:13,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [993729806] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:16:13,158 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:16:13,158 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:16:13,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763023044] [2022-04-28 08:16:13,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:16:13,158 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-28 08:16:13,158 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:16:13,158 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:13,172 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:16:13,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:16:13,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:16:13,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:16:13,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:16:13,173 INFO L87 Difference]: Start difference. First operand 545 states and 919 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:13,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:13,376 INFO L93 Difference]: Finished difference Result 817 states and 1373 transitions. [2022-04-28 08:16:13,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:16:13,376 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-28 08:16:13,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:16:13,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:13,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 196 transitions. [2022-04-28 08:16:13,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:13,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 196 transitions. [2022-04-28 08:16:13,379 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 196 transitions. [2022-04-28 08:16:13,501 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 196 edges. 196 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:16:13,514 INFO L225 Difference]: With dead ends: 817 [2022-04-28 08:16:13,514 INFO L226 Difference]: Without dead ends: 555 [2022-04-28 08:16:13,514 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:16:13,515 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 141 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 08:16:13,515 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 114 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 08:16:13,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2022-04-28 08:16:13,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 553. [2022-04-28 08:16:13,543 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:16:13,544 INFO L82 GeneralOperation]: Start isEquivalent. First operand 555 states. Second operand has 553 states, 549 states have (on average 1.668488160291439) internal successors, (916), 549 states have internal predecessors, (916), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:13,545 INFO L74 IsIncluded]: Start isIncluded. First operand 555 states. Second operand has 553 states, 549 states have (on average 1.668488160291439) internal successors, (916), 549 states have internal predecessors, (916), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:13,545 INFO L87 Difference]: Start difference. First operand 555 states. Second operand has 553 states, 549 states have (on average 1.668488160291439) internal successors, (916), 549 states have internal predecessors, (916), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:13,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:13,556 INFO L93 Difference]: Finished difference Result 555 states and 920 transitions. [2022-04-28 08:16:13,556 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 920 transitions. [2022-04-28 08:16:13,557 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:16:13,557 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:16:13,558 INFO L74 IsIncluded]: Start isIncluded. First operand has 553 states, 549 states have (on average 1.668488160291439) internal successors, (916), 549 states have internal predecessors, (916), 2 states have call successors, (2), 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 555 states. [2022-04-28 08:16:13,558 INFO L87 Difference]: Start difference. First operand has 553 states, 549 states have (on average 1.668488160291439) internal successors, (916), 549 states have internal predecessors, (916), 2 states have call successors, (2), 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 555 states. [2022-04-28 08:16:13,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:13,570 INFO L93 Difference]: Finished difference Result 555 states and 920 transitions. [2022-04-28 08:16:13,570 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 920 transitions. [2022-04-28 08:16:13,570 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:16:13,570 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:16:13,571 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:16:13,571 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:16:13,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 553 states, 549 states have (on average 1.668488160291439) internal successors, (916), 549 states have internal predecessors, (916), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:13,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 919 transitions. [2022-04-28 08:16:13,613 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 919 transitions. Word has length 26 [2022-04-28 08:16:13,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:16:13,614 INFO L495 AbstractCegarLoop]: Abstraction has 553 states and 919 transitions. [2022-04-28 08:16:13,614 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:13,614 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 553 states and 919 transitions. [2022-04-28 08:16:14,473 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 919 edges. 919 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:16:14,473 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 919 transitions. [2022-04-28 08:16:14,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-28 08:16:14,474 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:16:14,474 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:16:14,474 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-28 08:16:14,474 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:16:14,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:16:14,475 INFO L85 PathProgramCache]: Analyzing trace with hash -1514046597, now seen corresponding path program 1 times [2022-04-28 08:16:14,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:16:14,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2112664200] [2022-04-28 08:16:14,475 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:16:14,475 INFO L85 PathProgramCache]: Analyzing trace with hash -1514046597, now seen corresponding path program 2 times [2022-04-28 08:16:14,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:16:14,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585826303] [2022-04-28 08:16:14,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:16:14,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:16:14,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:16:14,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:16:14,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:16:14,522 INFO L290 TraceCheckUtils]: 0: Hoare triple {20167#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {20161#true} is VALID [2022-04-28 08:16:14,522 INFO L290 TraceCheckUtils]: 1: Hoare triple {20161#true} assume true; {20161#true} is VALID [2022-04-28 08:16:14,522 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {20161#true} {20161#true} #217#return; {20161#true} is VALID [2022-04-28 08:16:14,523 INFO L272 TraceCheckUtils]: 0: Hoare triple {20161#true} call ULTIMATE.init(); {20167#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:16:14,523 INFO L290 TraceCheckUtils]: 1: Hoare triple {20167#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {20161#true} is VALID [2022-04-28 08:16:14,523 INFO L290 TraceCheckUtils]: 2: Hoare triple {20161#true} assume true; {20161#true} is VALID [2022-04-28 08:16:14,523 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20161#true} {20161#true} #217#return; {20161#true} is VALID [2022-04-28 08:16:14,523 INFO L272 TraceCheckUtils]: 4: Hoare triple {20161#true} call #t~ret16 := main(); {20161#true} is VALID [2022-04-28 08:16:14,523 INFO L290 TraceCheckUtils]: 5: Hoare triple {20161#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;havoc ~cond~0; {20161#true} is VALID [2022-04-28 08:16:14,523 INFO L290 TraceCheckUtils]: 6: Hoare triple {20161#true} assume !false;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~cond~0 := #t~nondet15;havoc #t~nondet15; {20161#true} is VALID [2022-04-28 08:16:14,524 INFO L290 TraceCheckUtils]: 7: Hoare triple {20161#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0; {20161#true} is VALID [2022-04-28 08:16:14,525 INFO L290 TraceCheckUtils]: 8: Hoare triple {20161#true} assume !(0 != ~p1~0); {20161#true} is VALID [2022-04-28 08:16:14,525 INFO L290 TraceCheckUtils]: 9: Hoare triple {20161#true} assume !(0 != ~p2~0); {20161#true} is VALID [2022-04-28 08:16:14,525 INFO L290 TraceCheckUtils]: 10: Hoare triple {20161#true} assume !(0 != ~p3~0); {20161#true} is VALID [2022-04-28 08:16:14,527 INFO L290 TraceCheckUtils]: 11: Hoare triple {20161#true} assume !(0 != ~p4~0); {20161#true} is VALID [2022-04-28 08:16:14,527 INFO L290 TraceCheckUtils]: 12: Hoare triple {20161#true} assume 0 != ~p5~0;~lk5~0 := 1; {20166#(= main_~lk5~0 1)} is VALID [2022-04-28 08:16:14,527 INFO L290 TraceCheckUtils]: 13: Hoare triple {20166#(= main_~lk5~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {20166#(= main_~lk5~0 1)} is VALID [2022-04-28 08:16:14,527 INFO L290 TraceCheckUtils]: 14: Hoare triple {20166#(= main_~lk5~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {20166#(= main_~lk5~0 1)} is VALID [2022-04-28 08:16:14,528 INFO L290 TraceCheckUtils]: 15: Hoare triple {20166#(= main_~lk5~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {20166#(= main_~lk5~0 1)} is VALID [2022-04-28 08:16:14,528 INFO L290 TraceCheckUtils]: 16: Hoare triple {20166#(= main_~lk5~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {20166#(= main_~lk5~0 1)} is VALID [2022-04-28 08:16:14,528 INFO L290 TraceCheckUtils]: 17: Hoare triple {20166#(= main_~lk5~0 1)} assume !(0 != ~p10~0); {20166#(= main_~lk5~0 1)} is VALID [2022-04-28 08:16:14,528 INFO L290 TraceCheckUtils]: 18: Hoare triple {20166#(= main_~lk5~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {20166#(= main_~lk5~0 1)} is VALID [2022-04-28 08:16:14,528 INFO L290 TraceCheckUtils]: 19: Hoare triple {20166#(= main_~lk5~0 1)} assume !(0 != ~p1~0); {20166#(= main_~lk5~0 1)} is VALID [2022-04-28 08:16:14,529 INFO L290 TraceCheckUtils]: 20: Hoare triple {20166#(= main_~lk5~0 1)} assume !(0 != ~p2~0); {20166#(= main_~lk5~0 1)} is VALID [2022-04-28 08:16:14,529 INFO L290 TraceCheckUtils]: 21: Hoare triple {20166#(= main_~lk5~0 1)} assume !(0 != ~p3~0); {20166#(= main_~lk5~0 1)} is VALID [2022-04-28 08:16:14,529 INFO L290 TraceCheckUtils]: 22: Hoare triple {20166#(= main_~lk5~0 1)} assume !(0 != ~p4~0); {20166#(= main_~lk5~0 1)} is VALID [2022-04-28 08:16:14,531 INFO L290 TraceCheckUtils]: 23: Hoare triple {20166#(= main_~lk5~0 1)} assume 0 != ~p5~0; {20166#(= main_~lk5~0 1)} is VALID [2022-04-28 08:16:14,531 INFO L290 TraceCheckUtils]: 24: Hoare triple {20166#(= main_~lk5~0 1)} assume 1 != ~lk5~0; {20162#false} is VALID [2022-04-28 08:16:14,531 INFO L290 TraceCheckUtils]: 25: Hoare triple {20162#false} assume !false; {20162#false} is VALID [2022-04-28 08:16:14,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 08:16:14,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:16:14,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585826303] [2022-04-28 08:16:14,532 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585826303] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:16:14,532 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:16:14,532 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:16:14,532 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:16:14,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2112664200] [2022-04-28 08:16:14,532 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2112664200] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:16:14,532 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:16:14,532 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:16:14,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54441164] [2022-04-28 08:16:14,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:16:14,533 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-28 08:16:14,533 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:16:14,533 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:14,543 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:16:14,544 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:16:14,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:16:14,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:16:14,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:16:14,545 INFO L87 Difference]: Start difference. First operand 553 states and 919 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:14,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:14,801 INFO L93 Difference]: Finished difference Result 1005 states and 1697 transitions. [2022-04-28 08:16:14,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:16:14,801 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-28 08:16:14,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:16:14,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:14,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 127 transitions. [2022-04-28 08:16:14,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:14,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 127 transitions. [2022-04-28 08:16:14,803 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 127 transitions. [2022-04-28 08:16:14,878 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-28 08:16:14,916 INFO L225 Difference]: With dead ends: 1005 [2022-04-28 08:16:14,916 INFO L226 Difference]: Without dead ends: 1003 [2022-04-28 08:16:14,916 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:16:14,916 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 157 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 08:16:14,917 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 80 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 08:16:14,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1003 states. [2022-04-28 08:16:14,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1003 to 777. [2022-04-28 08:16:14,956 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:16:14,957 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1003 states. Second operand has 777 states, 773 states have (on average 1.630012936610608) internal successors, (1260), 773 states have internal predecessors, (1260), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:14,958 INFO L74 IsIncluded]: Start isIncluded. First operand 1003 states. Second operand has 777 states, 773 states have (on average 1.630012936610608) internal successors, (1260), 773 states have internal predecessors, (1260), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:14,959 INFO L87 Difference]: Start difference. First operand 1003 states. Second operand has 777 states, 773 states have (on average 1.630012936610608) internal successors, (1260), 773 states have internal predecessors, (1260), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:14,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:14,988 INFO L93 Difference]: Finished difference Result 1003 states and 1680 transitions. [2022-04-28 08:16:14,988 INFO L276 IsEmpty]: Start isEmpty. Operand 1003 states and 1680 transitions. [2022-04-28 08:16:14,989 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:16:14,989 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:16:14,990 INFO L74 IsIncluded]: Start isIncluded. First operand has 777 states, 773 states have (on average 1.630012936610608) internal successors, (1260), 773 states have internal predecessors, (1260), 2 states have call successors, (2), 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 1003 states. [2022-04-28 08:16:14,991 INFO L87 Difference]: Start difference. First operand has 777 states, 773 states have (on average 1.630012936610608) internal successors, (1260), 773 states have internal predecessors, (1260), 2 states have call successors, (2), 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 1003 states. [2022-04-28 08:16:15,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:15,019 INFO L93 Difference]: Finished difference Result 1003 states and 1680 transitions. [2022-04-28 08:16:15,020 INFO L276 IsEmpty]: Start isEmpty. Operand 1003 states and 1680 transitions. [2022-04-28 08:16:15,021 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:16:15,021 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:16:15,021 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:16:15,021 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:16:15,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 777 states, 773 states have (on average 1.630012936610608) internal successors, (1260), 773 states have internal predecessors, (1260), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:15,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 1263 transitions. [2022-04-28 08:16:15,047 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 1263 transitions. Word has length 26 [2022-04-28 08:16:15,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:16:15,047 INFO L495 AbstractCegarLoop]: Abstraction has 777 states and 1263 transitions. [2022-04-28 08:16:15,047 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:15,047 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 777 states and 1263 transitions. [2022-04-28 08:16:16,009 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1263 edges. 1263 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:16:16,009 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 1263 transitions. [2022-04-28 08:16:16,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-28 08:16:16,013 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:16:16,013 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:16:16,013 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-28 08:16:16,013 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:16:16,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:16:16,015 INFO L85 PathProgramCache]: Analyzing trace with hash 1769803449, now seen corresponding path program 1 times [2022-04-28 08:16:16,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:16:16,015 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [263748754] [2022-04-28 08:16:16,031 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:16:16,031 INFO L85 PathProgramCache]: Analyzing trace with hash 1769803449, now seen corresponding path program 2 times [2022-04-28 08:16:16,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:16:16,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810278623] [2022-04-28 08:16:16,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:16:16,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:16:16,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:16:16,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:16:16,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:16:16,093 INFO L290 TraceCheckUtils]: 0: Hoare triple {25749#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {25743#true} is VALID [2022-04-28 08:16:16,093 INFO L290 TraceCheckUtils]: 1: Hoare triple {25743#true} assume true; {25743#true} is VALID [2022-04-28 08:16:16,093 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25743#true} {25743#true} #217#return; {25743#true} is VALID [2022-04-28 08:16:16,094 INFO L272 TraceCheckUtils]: 0: Hoare triple {25743#true} call ULTIMATE.init(); {25749#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:16:16,094 INFO L290 TraceCheckUtils]: 1: Hoare triple {25749#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {25743#true} is VALID [2022-04-28 08:16:16,094 INFO L290 TraceCheckUtils]: 2: Hoare triple {25743#true} assume true; {25743#true} is VALID [2022-04-28 08:16:16,094 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25743#true} {25743#true} #217#return; {25743#true} is VALID [2022-04-28 08:16:16,094 INFO L272 TraceCheckUtils]: 4: Hoare triple {25743#true} call #t~ret16 := main(); {25743#true} is VALID [2022-04-28 08:16:16,094 INFO L290 TraceCheckUtils]: 5: Hoare triple {25743#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;havoc ~cond~0; {25743#true} is VALID [2022-04-28 08:16:16,094 INFO L290 TraceCheckUtils]: 6: Hoare triple {25743#true} assume !false;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~cond~0 := #t~nondet15;havoc #t~nondet15; {25743#true} is VALID [2022-04-28 08:16:16,095 INFO L290 TraceCheckUtils]: 7: Hoare triple {25743#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0; {25743#true} is VALID [2022-04-28 08:16:16,095 INFO L290 TraceCheckUtils]: 8: Hoare triple {25743#true} assume !(0 != ~p1~0); {25743#true} is VALID [2022-04-28 08:16:16,095 INFO L290 TraceCheckUtils]: 9: Hoare triple {25743#true} assume !(0 != ~p2~0); {25743#true} is VALID [2022-04-28 08:16:16,095 INFO L290 TraceCheckUtils]: 10: Hoare triple {25743#true} assume !(0 != ~p3~0); {25743#true} is VALID [2022-04-28 08:16:16,095 INFO L290 TraceCheckUtils]: 11: Hoare triple {25743#true} assume !(0 != ~p4~0); {25743#true} is VALID [2022-04-28 08:16:16,096 INFO L290 TraceCheckUtils]: 12: Hoare triple {25743#true} assume !(0 != ~p5~0); {25748#(= main_~p5~0 0)} is VALID [2022-04-28 08:16:16,096 INFO L290 TraceCheckUtils]: 13: Hoare triple {25748#(= main_~p5~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {25748#(= main_~p5~0 0)} is VALID [2022-04-28 08:16:16,096 INFO L290 TraceCheckUtils]: 14: Hoare triple {25748#(= main_~p5~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {25748#(= main_~p5~0 0)} is VALID [2022-04-28 08:16:16,097 INFO L290 TraceCheckUtils]: 15: Hoare triple {25748#(= main_~p5~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {25748#(= main_~p5~0 0)} is VALID [2022-04-28 08:16:16,097 INFO L290 TraceCheckUtils]: 16: Hoare triple {25748#(= main_~p5~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {25748#(= main_~p5~0 0)} is VALID [2022-04-28 08:16:16,097 INFO L290 TraceCheckUtils]: 17: Hoare triple {25748#(= main_~p5~0 0)} assume !(0 != ~p10~0); {25748#(= main_~p5~0 0)} is VALID [2022-04-28 08:16:16,097 INFO L290 TraceCheckUtils]: 18: Hoare triple {25748#(= main_~p5~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {25748#(= main_~p5~0 0)} is VALID [2022-04-28 08:16:16,098 INFO L290 TraceCheckUtils]: 19: Hoare triple {25748#(= main_~p5~0 0)} assume !(0 != ~p1~0); {25748#(= main_~p5~0 0)} is VALID [2022-04-28 08:16:16,098 INFO L290 TraceCheckUtils]: 20: Hoare triple {25748#(= main_~p5~0 0)} assume !(0 != ~p2~0); {25748#(= main_~p5~0 0)} is VALID [2022-04-28 08:16:16,098 INFO L290 TraceCheckUtils]: 21: Hoare triple {25748#(= main_~p5~0 0)} assume !(0 != ~p3~0); {25748#(= main_~p5~0 0)} is VALID [2022-04-28 08:16:16,099 INFO L290 TraceCheckUtils]: 22: Hoare triple {25748#(= main_~p5~0 0)} assume !(0 != ~p4~0); {25748#(= main_~p5~0 0)} is VALID [2022-04-28 08:16:16,099 INFO L290 TraceCheckUtils]: 23: Hoare triple {25748#(= main_~p5~0 0)} assume 0 != ~p5~0; {25744#false} is VALID [2022-04-28 08:16:16,099 INFO L290 TraceCheckUtils]: 24: Hoare triple {25744#false} assume 1 != ~lk5~0; {25744#false} is VALID [2022-04-28 08:16:16,099 INFO L290 TraceCheckUtils]: 25: Hoare triple {25744#false} assume !false; {25744#false} is VALID [2022-04-28 08:16:16,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 08:16:16,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:16:16,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810278623] [2022-04-28 08:16:16,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810278623] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:16:16,099 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:16:16,100 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:16:16,100 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:16:16,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [263748754] [2022-04-28 08:16:16,100 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [263748754] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:16:16,100 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:16:16,100 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:16:16,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529156101] [2022-04-28 08:16:16,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:16:16,100 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-28 08:16:16,100 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:16:16,101 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:16,113 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:16:16,113 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:16:16,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:16:16,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:16:16,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:16:16,114 INFO L87 Difference]: Start difference. First operand 777 states and 1263 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:16,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:16,454 INFO L93 Difference]: Finished difference Result 1821 states and 2977 transitions. [2022-04-28 08:16:16,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:16:16,454 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-28 08:16:16,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:16:16,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:16,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 198 transitions. [2022-04-28 08:16:16,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:16,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 198 transitions. [2022-04-28 08:16:16,457 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 198 transitions. [2022-04-28 08:16:16,569 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 198 edges. 198 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:16:16,611 INFO L225 Difference]: With dead ends: 1821 [2022-04-28 08:16:16,611 INFO L226 Difference]: Without dead ends: 1067 [2022-04-28 08:16:16,612 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:16:16,613 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 139 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 08:16:16,613 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 111 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 08:16:16,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1067 states. [2022-04-28 08:16:16,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1067 to 1065. [2022-04-28 08:16:16,671 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:16:16,673 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1067 states. Second operand has 1065 states, 1061 states have (on average 1.6173421300659756) internal successors, (1716), 1061 states have internal predecessors, (1716), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:16,675 INFO L74 IsIncluded]: Start isIncluded. First operand 1067 states. Second operand has 1065 states, 1061 states have (on average 1.6173421300659756) internal successors, (1716), 1061 states have internal predecessors, (1716), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:16,676 INFO L87 Difference]: Start difference. First operand 1067 states. Second operand has 1065 states, 1061 states have (on average 1.6173421300659756) internal successors, (1716), 1061 states have internal predecessors, (1716), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:16,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:16,706 INFO L93 Difference]: Finished difference Result 1067 states and 1720 transitions. [2022-04-28 08:16:16,706 INFO L276 IsEmpty]: Start isEmpty. Operand 1067 states and 1720 transitions. [2022-04-28 08:16:16,707 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:16:16,707 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:16:16,708 INFO L74 IsIncluded]: Start isIncluded. First operand has 1065 states, 1061 states have (on average 1.6173421300659756) internal successors, (1716), 1061 states have internal predecessors, (1716), 2 states have call successors, (2), 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 1067 states. [2022-04-28 08:16:16,709 INFO L87 Difference]: Start difference. First operand has 1065 states, 1061 states have (on average 1.6173421300659756) internal successors, (1716), 1061 states have internal predecessors, (1716), 2 states have call successors, (2), 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 1067 states. [2022-04-28 08:16:16,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:16,739 INFO L93 Difference]: Finished difference Result 1067 states and 1720 transitions. [2022-04-28 08:16:16,739 INFO L276 IsEmpty]: Start isEmpty. Operand 1067 states and 1720 transitions. [2022-04-28 08:16:16,740 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:16:16,740 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:16:16,741 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:16:16,741 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:16:16,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1065 states, 1061 states have (on average 1.6173421300659756) internal successors, (1716), 1061 states have internal predecessors, (1716), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:16,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1065 states to 1065 states and 1719 transitions. [2022-04-28 08:16:16,784 INFO L78 Accepts]: Start accepts. Automaton has 1065 states and 1719 transitions. Word has length 26 [2022-04-28 08:16:16,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:16:16,784 INFO L495 AbstractCegarLoop]: Abstraction has 1065 states and 1719 transitions. [2022-04-28 08:16:16,787 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:16,788 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1065 states and 1719 transitions. [2022-04-28 08:16:17,964 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1719 edges. 1719 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:16:17,964 INFO L276 IsEmpty]: Start isEmpty. Operand 1065 states and 1719 transitions. [2022-04-28 08:16:17,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-28 08:16:17,965 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:16:17,965 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:16:17,965 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-28 08:16:17,966 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:16:17,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:16:17,966 INFO L85 PathProgramCache]: Analyzing trace with hash 309410172, now seen corresponding path program 1 times [2022-04-28 08:16:17,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:16:17,966 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2039108574] [2022-04-28 08:16:17,966 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:16:17,966 INFO L85 PathProgramCache]: Analyzing trace with hash 309410172, now seen corresponding path program 2 times [2022-04-28 08:16:17,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:16:17,966 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573014184] [2022-04-28 08:16:17,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:16:17,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:16:17,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:16:18,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:16:18,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:16:18,004 INFO L290 TraceCheckUtils]: 0: Hoare triple {33667#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {33661#true} is VALID [2022-04-28 08:16:18,004 INFO L290 TraceCheckUtils]: 1: Hoare triple {33661#true} assume true; {33661#true} is VALID [2022-04-28 08:16:18,004 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {33661#true} {33661#true} #217#return; {33661#true} is VALID [2022-04-28 08:16:18,004 INFO L272 TraceCheckUtils]: 0: Hoare triple {33661#true} call ULTIMATE.init(); {33667#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:16:18,004 INFO L290 TraceCheckUtils]: 1: Hoare triple {33667#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {33661#true} is VALID [2022-04-28 08:16:18,005 INFO L290 TraceCheckUtils]: 2: Hoare triple {33661#true} assume true; {33661#true} is VALID [2022-04-28 08:16:18,005 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33661#true} {33661#true} #217#return; {33661#true} is VALID [2022-04-28 08:16:18,005 INFO L272 TraceCheckUtils]: 4: Hoare triple {33661#true} call #t~ret16 := main(); {33661#true} is VALID [2022-04-28 08:16:18,005 INFO L290 TraceCheckUtils]: 5: Hoare triple {33661#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;havoc ~cond~0; {33661#true} is VALID [2022-04-28 08:16:18,005 INFO L290 TraceCheckUtils]: 6: Hoare triple {33661#true} assume !false;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~cond~0 := #t~nondet15;havoc #t~nondet15; {33661#true} is VALID [2022-04-28 08:16:18,005 INFO L290 TraceCheckUtils]: 7: Hoare triple {33661#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0; {33661#true} is VALID [2022-04-28 08:16:18,005 INFO L290 TraceCheckUtils]: 8: Hoare triple {33661#true} assume !(0 != ~p1~0); {33661#true} is VALID [2022-04-28 08:16:18,005 INFO L290 TraceCheckUtils]: 9: Hoare triple {33661#true} assume !(0 != ~p2~0); {33661#true} is VALID [2022-04-28 08:16:18,005 INFO L290 TraceCheckUtils]: 10: Hoare triple {33661#true} assume !(0 != ~p3~0); {33661#true} is VALID [2022-04-28 08:16:18,005 INFO L290 TraceCheckUtils]: 11: Hoare triple {33661#true} assume !(0 != ~p4~0); {33661#true} is VALID [2022-04-28 08:16:18,006 INFO L290 TraceCheckUtils]: 12: Hoare triple {33661#true} assume 0 != ~p5~0;~lk5~0 := 1; {33666#(not (= main_~p5~0 0))} is VALID [2022-04-28 08:16:18,006 INFO L290 TraceCheckUtils]: 13: Hoare triple {33666#(not (= main_~p5~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {33666#(not (= main_~p5~0 0))} is VALID [2022-04-28 08:16:18,006 INFO L290 TraceCheckUtils]: 14: Hoare triple {33666#(not (= main_~p5~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {33666#(not (= main_~p5~0 0))} is VALID [2022-04-28 08:16:18,007 INFO L290 TraceCheckUtils]: 15: Hoare triple {33666#(not (= main_~p5~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {33666#(not (= main_~p5~0 0))} is VALID [2022-04-28 08:16:18,007 INFO L290 TraceCheckUtils]: 16: Hoare triple {33666#(not (= main_~p5~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {33666#(not (= main_~p5~0 0))} is VALID [2022-04-28 08:16:18,007 INFO L290 TraceCheckUtils]: 17: Hoare triple {33666#(not (= main_~p5~0 0))} assume !(0 != ~p10~0); {33666#(not (= main_~p5~0 0))} is VALID [2022-04-28 08:16:18,007 INFO L290 TraceCheckUtils]: 18: Hoare triple {33666#(not (= main_~p5~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {33666#(not (= main_~p5~0 0))} is VALID [2022-04-28 08:16:18,010 INFO L290 TraceCheckUtils]: 19: Hoare triple {33666#(not (= main_~p5~0 0))} assume !(0 != ~p1~0); {33666#(not (= main_~p5~0 0))} is VALID [2022-04-28 08:16:18,010 INFO L290 TraceCheckUtils]: 20: Hoare triple {33666#(not (= main_~p5~0 0))} assume !(0 != ~p2~0); {33666#(not (= main_~p5~0 0))} is VALID [2022-04-28 08:16:18,010 INFO L290 TraceCheckUtils]: 21: Hoare triple {33666#(not (= main_~p5~0 0))} assume !(0 != ~p3~0); {33666#(not (= main_~p5~0 0))} is VALID [2022-04-28 08:16:18,010 INFO L290 TraceCheckUtils]: 22: Hoare triple {33666#(not (= main_~p5~0 0))} assume !(0 != ~p4~0); {33666#(not (= main_~p5~0 0))} is VALID [2022-04-28 08:16:18,011 INFO L290 TraceCheckUtils]: 23: Hoare triple {33666#(not (= main_~p5~0 0))} assume !(0 != ~p5~0); {33662#false} is VALID [2022-04-28 08:16:18,011 INFO L290 TraceCheckUtils]: 24: Hoare triple {33662#false} assume 0 != ~p6~0; {33662#false} is VALID [2022-04-28 08:16:18,011 INFO L290 TraceCheckUtils]: 25: Hoare triple {33662#false} assume 1 != ~lk6~0; {33662#false} is VALID [2022-04-28 08:16:18,011 INFO L290 TraceCheckUtils]: 26: Hoare triple {33662#false} assume !false; {33662#false} is VALID [2022-04-28 08:16:18,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 08:16:18,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:16:18,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573014184] [2022-04-28 08:16:18,034 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573014184] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:16:18,034 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:16:18,034 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:16:18,034 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:16:18,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2039108574] [2022-04-28 08:16:18,034 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2039108574] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:16:18,034 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:16:18,034 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:16:18,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364495492] [2022-04-28 08:16:18,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:16:18,035 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 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 27 [2022-04-28 08:16:18,035 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:16:18,035 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:18,049 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:16:18,050 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:16:18,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:16:18,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:16:18,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:16:18,051 INFO L87 Difference]: Start difference. First operand 1065 states and 1719 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:18,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:18,346 INFO L93 Difference]: Finished difference Result 1597 states and 2569 transitions. [2022-04-28 08:16:18,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:16:18,347 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 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 27 [2022-04-28 08:16:18,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:16:18,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:18,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 193 transitions. [2022-04-28 08:16:18,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:18,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 193 transitions. [2022-04-28 08:16:18,349 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 193 transitions. [2022-04-28 08:16:18,456 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 193 edges. 193 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:16:18,503 INFO L225 Difference]: With dead ends: 1597 [2022-04-28 08:16:18,503 INFO L226 Difference]: Without dead ends: 1083 [2022-04-28 08:16:18,504 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:16:18,505 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 140 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 08:16:18,505 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 111 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 08:16:18,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1083 states. [2022-04-28 08:16:18,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1083 to 1081. [2022-04-28 08:16:18,566 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:16:18,568 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1083 states. Second operand has 1081 states, 1077 states have (on average 1.5933147632311977) internal successors, (1716), 1077 states have internal predecessors, (1716), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:18,569 INFO L74 IsIncluded]: Start isIncluded. First operand 1083 states. Second operand has 1081 states, 1077 states have (on average 1.5933147632311977) internal successors, (1716), 1077 states have internal predecessors, (1716), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:18,570 INFO L87 Difference]: Start difference. First operand 1083 states. Second operand has 1081 states, 1077 states have (on average 1.5933147632311977) internal successors, (1716), 1077 states have internal predecessors, (1716), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:18,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:18,636 INFO L93 Difference]: Finished difference Result 1083 states and 1720 transitions. [2022-04-28 08:16:18,636 INFO L276 IsEmpty]: Start isEmpty. Operand 1083 states and 1720 transitions. [2022-04-28 08:16:18,637 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:16:18,637 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:16:18,638 INFO L74 IsIncluded]: Start isIncluded. First operand has 1081 states, 1077 states have (on average 1.5933147632311977) internal successors, (1716), 1077 states have internal predecessors, (1716), 2 states have call successors, (2), 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 1083 states. [2022-04-28 08:16:18,640 INFO L87 Difference]: Start difference. First operand has 1081 states, 1077 states have (on average 1.5933147632311977) internal successors, (1716), 1077 states have internal predecessors, (1716), 2 states have call successors, (2), 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 1083 states. [2022-04-28 08:16:18,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:18,672 INFO L93 Difference]: Finished difference Result 1083 states and 1720 transitions. [2022-04-28 08:16:18,672 INFO L276 IsEmpty]: Start isEmpty. Operand 1083 states and 1720 transitions. [2022-04-28 08:16:18,673 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:16:18,673 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:16:18,673 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:16:18,673 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:16:18,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1081 states, 1077 states have (on average 1.5933147632311977) internal successors, (1716), 1077 states have internal predecessors, (1716), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:18,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1081 states to 1081 states and 1719 transitions. [2022-04-28 08:16:18,718 INFO L78 Accepts]: Start accepts. Automaton has 1081 states and 1719 transitions. Word has length 27 [2022-04-28 08:16:18,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:16:18,719 INFO L495 AbstractCegarLoop]: Abstraction has 1081 states and 1719 transitions. [2022-04-28 08:16:18,719 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:18,719 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1081 states and 1719 transitions. [2022-04-28 08:16:20,350 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1719 edges. 1719 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:16:20,350 INFO L276 IsEmpty]: Start isEmpty. Operand 1081 states and 1719 transitions. [2022-04-28 08:16:20,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-28 08:16:20,351 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:16:20,351 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:16:20,351 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-28 08:16:20,351 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:16:20,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:16:20,351 INFO L85 PathProgramCache]: Analyzing trace with hash -970453506, now seen corresponding path program 1 times [2022-04-28 08:16:20,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:16:20,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1501664000] [2022-04-28 08:16:20,352 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:16:20,352 INFO L85 PathProgramCache]: Analyzing trace with hash -970453506, now seen corresponding path program 2 times [2022-04-28 08:16:20,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:16:20,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501744322] [2022-04-28 08:16:20,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:16:20,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:16:20,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:16:20,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:16:20,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:16:20,402 INFO L290 TraceCheckUtils]: 0: Hoare triple {41201#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {41195#true} is VALID [2022-04-28 08:16:20,402 INFO L290 TraceCheckUtils]: 1: Hoare triple {41195#true} assume true; {41195#true} is VALID [2022-04-28 08:16:20,402 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {41195#true} {41195#true} #217#return; {41195#true} is VALID [2022-04-28 08:16:20,405 INFO L272 TraceCheckUtils]: 0: Hoare triple {41195#true} call ULTIMATE.init(); {41201#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:16:20,405 INFO L290 TraceCheckUtils]: 1: Hoare triple {41201#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {41195#true} is VALID [2022-04-28 08:16:20,405 INFO L290 TraceCheckUtils]: 2: Hoare triple {41195#true} assume true; {41195#true} is VALID [2022-04-28 08:16:20,405 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41195#true} {41195#true} #217#return; {41195#true} is VALID [2022-04-28 08:16:20,405 INFO L272 TraceCheckUtils]: 4: Hoare triple {41195#true} call #t~ret16 := main(); {41195#true} is VALID [2022-04-28 08:16:20,406 INFO L290 TraceCheckUtils]: 5: Hoare triple {41195#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;havoc ~cond~0; {41195#true} is VALID [2022-04-28 08:16:20,406 INFO L290 TraceCheckUtils]: 6: Hoare triple {41195#true} assume !false;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~cond~0 := #t~nondet15;havoc #t~nondet15; {41195#true} is VALID [2022-04-28 08:16:20,406 INFO L290 TraceCheckUtils]: 7: Hoare triple {41195#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0; {41195#true} is VALID [2022-04-28 08:16:20,406 INFO L290 TraceCheckUtils]: 8: Hoare triple {41195#true} assume !(0 != ~p1~0); {41195#true} is VALID [2022-04-28 08:16:20,406 INFO L290 TraceCheckUtils]: 9: Hoare triple {41195#true} assume !(0 != ~p2~0); {41195#true} is VALID [2022-04-28 08:16:20,406 INFO L290 TraceCheckUtils]: 10: Hoare triple {41195#true} assume !(0 != ~p3~0); {41195#true} is VALID [2022-04-28 08:16:20,406 INFO L290 TraceCheckUtils]: 11: Hoare triple {41195#true} assume !(0 != ~p4~0); {41195#true} is VALID [2022-04-28 08:16:20,406 INFO L290 TraceCheckUtils]: 12: Hoare triple {41195#true} assume !(0 != ~p5~0); {41195#true} is VALID [2022-04-28 08:16:20,406 INFO L290 TraceCheckUtils]: 13: Hoare triple {41195#true} assume 0 != ~p6~0;~lk6~0 := 1; {41200#(= main_~lk6~0 1)} is VALID [2022-04-28 08:16:20,407 INFO L290 TraceCheckUtils]: 14: Hoare triple {41200#(= main_~lk6~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {41200#(= main_~lk6~0 1)} is VALID [2022-04-28 08:16:20,407 INFO L290 TraceCheckUtils]: 15: Hoare triple {41200#(= main_~lk6~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {41200#(= main_~lk6~0 1)} is VALID [2022-04-28 08:16:20,407 INFO L290 TraceCheckUtils]: 16: Hoare triple {41200#(= main_~lk6~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {41200#(= main_~lk6~0 1)} is VALID [2022-04-28 08:16:20,407 INFO L290 TraceCheckUtils]: 17: Hoare triple {41200#(= main_~lk6~0 1)} assume !(0 != ~p10~0); {41200#(= main_~lk6~0 1)} is VALID [2022-04-28 08:16:20,407 INFO L290 TraceCheckUtils]: 18: Hoare triple {41200#(= main_~lk6~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {41200#(= main_~lk6~0 1)} is VALID [2022-04-28 08:16:20,408 INFO L290 TraceCheckUtils]: 19: Hoare triple {41200#(= main_~lk6~0 1)} assume !(0 != ~p1~0); {41200#(= main_~lk6~0 1)} is VALID [2022-04-28 08:16:20,408 INFO L290 TraceCheckUtils]: 20: Hoare triple {41200#(= main_~lk6~0 1)} assume !(0 != ~p2~0); {41200#(= main_~lk6~0 1)} is VALID [2022-04-28 08:16:20,408 INFO L290 TraceCheckUtils]: 21: Hoare triple {41200#(= main_~lk6~0 1)} assume !(0 != ~p3~0); {41200#(= main_~lk6~0 1)} is VALID [2022-04-28 08:16:20,408 INFO L290 TraceCheckUtils]: 22: Hoare triple {41200#(= main_~lk6~0 1)} assume !(0 != ~p4~0); {41200#(= main_~lk6~0 1)} is VALID [2022-04-28 08:16:20,408 INFO L290 TraceCheckUtils]: 23: Hoare triple {41200#(= main_~lk6~0 1)} assume !(0 != ~p5~0); {41200#(= main_~lk6~0 1)} is VALID [2022-04-28 08:16:20,408 INFO L290 TraceCheckUtils]: 24: Hoare triple {41200#(= main_~lk6~0 1)} assume 0 != ~p6~0; {41200#(= main_~lk6~0 1)} is VALID [2022-04-28 08:16:20,409 INFO L290 TraceCheckUtils]: 25: Hoare triple {41200#(= main_~lk6~0 1)} assume 1 != ~lk6~0; {41196#false} is VALID [2022-04-28 08:16:20,409 INFO L290 TraceCheckUtils]: 26: Hoare triple {41196#false} assume !false; {41196#false} is VALID [2022-04-28 08:16:20,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 08:16:20,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:16:20,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501744322] [2022-04-28 08:16:20,409 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501744322] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:16:20,409 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:16:20,409 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:16:20,410 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:16:20,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1501664000] [2022-04-28 08:16:20,410 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1501664000] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:16:20,410 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:16:20,410 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:16:20,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185850496] [2022-04-28 08:16:20,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:16:20,410 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 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 27 [2022-04-28 08:16:20,410 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:16:20,410 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:20,422 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:16:20,422 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:16:20,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:16:20,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:16:20,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:16:20,423 INFO L87 Difference]: Start difference. First operand 1081 states and 1719 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:20,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:20,822 INFO L93 Difference]: Finished difference Result 1933 states and 3129 transitions. [2022-04-28 08:16:20,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:16:20,822 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 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 27 [2022-04-28 08:16:20,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:16:20,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:20,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 123 transitions. [2022-04-28 08:16:20,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:20,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 123 transitions. [2022-04-28 08:16:20,826 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 123 transitions. [2022-04-28 08:16:20,898 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-28 08:16:21,059 INFO L225 Difference]: With dead ends: 1933 [2022-04-28 08:16:21,060 INFO L226 Difference]: Without dead ends: 1931 [2022-04-28 08:16:21,060 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:16:21,060 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 150 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 08:16:21,061 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 79 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 08:16:21,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1931 states. [2022-04-28 08:16:21,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1931 to 1545. [2022-04-28 08:16:21,147 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:16:21,149 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1931 states. Second operand has 1545 states, 1541 states have (on average 1.5496430889033095) internal successors, (2388), 1541 states have internal predecessors, (2388), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:21,150 INFO L74 IsIncluded]: Start isIncluded. First operand 1931 states. Second operand has 1545 states, 1541 states have (on average 1.5496430889033095) internal successors, (2388), 1541 states have internal predecessors, (2388), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:21,151 INFO L87 Difference]: Start difference. First operand 1931 states. Second operand has 1545 states, 1541 states have (on average 1.5496430889033095) internal successors, (2388), 1541 states have internal predecessors, (2388), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:21,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:21,242 INFO L93 Difference]: Finished difference Result 1931 states and 3096 transitions. [2022-04-28 08:16:21,242 INFO L276 IsEmpty]: Start isEmpty. Operand 1931 states and 3096 transitions. [2022-04-28 08:16:21,243 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:16:21,244 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:16:21,245 INFO L74 IsIncluded]: Start isIncluded. First operand has 1545 states, 1541 states have (on average 1.5496430889033095) internal successors, (2388), 1541 states have internal predecessors, (2388), 2 states have call successors, (2), 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 1931 states. [2022-04-28 08:16:21,247 INFO L87 Difference]: Start difference. First operand has 1545 states, 1541 states have (on average 1.5496430889033095) internal successors, (2388), 1541 states have internal predecessors, (2388), 2 states have call successors, (2), 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 1931 states. [2022-04-28 08:16:21,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:21,336 INFO L93 Difference]: Finished difference Result 1931 states and 3096 transitions. [2022-04-28 08:16:21,336 INFO L276 IsEmpty]: Start isEmpty. Operand 1931 states and 3096 transitions. [2022-04-28 08:16:21,338 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:16:21,338 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:16:21,338 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:16:21,338 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:16:21,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1545 states, 1541 states have (on average 1.5496430889033095) internal successors, (2388), 1541 states have internal predecessors, (2388), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:21,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1545 states to 1545 states and 2391 transitions. [2022-04-28 08:16:21,456 INFO L78 Accepts]: Start accepts. Automaton has 1545 states and 2391 transitions. Word has length 27 [2022-04-28 08:16:21,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:16:21,457 INFO L495 AbstractCegarLoop]: Abstraction has 1545 states and 2391 transitions. [2022-04-28 08:16:21,457 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:21,457 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 1545 states and 2391 transitions. [2022-04-28 08:16:23,470 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 2391 edges. 2391 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:16:23,470 INFO L276 IsEmpty]: Start isEmpty. Operand 1545 states and 2391 transitions. [2022-04-28 08:16:23,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-28 08:16:23,472 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:16:23,472 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:16:23,473 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-28 08:16:23,473 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:16:23,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:16:23,473 INFO L85 PathProgramCache]: Analyzing trace with hash -1981570756, now seen corresponding path program 1 times [2022-04-28 08:16:23,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:16:23,473 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1524629447] [2022-04-28 08:16:23,473 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:16:23,473 INFO L85 PathProgramCache]: Analyzing trace with hash -1981570756, now seen corresponding path program 2 times [2022-04-28 08:16:23,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:16:23,474 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228224071] [2022-04-28 08:16:23,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:16:23,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:16:23,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:16:23,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:16:23,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:16:23,533 INFO L290 TraceCheckUtils]: 0: Hoare triple {52031#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {52025#true} is VALID [2022-04-28 08:16:23,533 INFO L290 TraceCheckUtils]: 1: Hoare triple {52025#true} assume true; {52025#true} is VALID [2022-04-28 08:16:23,533 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {52025#true} {52025#true} #217#return; {52025#true} is VALID [2022-04-28 08:16:23,533 INFO L272 TraceCheckUtils]: 0: Hoare triple {52025#true} call ULTIMATE.init(); {52031#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:16:23,534 INFO L290 TraceCheckUtils]: 1: Hoare triple {52031#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {52025#true} is VALID [2022-04-28 08:16:23,534 INFO L290 TraceCheckUtils]: 2: Hoare triple {52025#true} assume true; {52025#true} is VALID [2022-04-28 08:16:23,534 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {52025#true} {52025#true} #217#return; {52025#true} is VALID [2022-04-28 08:16:23,534 INFO L272 TraceCheckUtils]: 4: Hoare triple {52025#true} call #t~ret16 := main(); {52025#true} is VALID [2022-04-28 08:16:23,534 INFO L290 TraceCheckUtils]: 5: Hoare triple {52025#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;havoc ~cond~0; {52025#true} is VALID [2022-04-28 08:16:23,534 INFO L290 TraceCheckUtils]: 6: Hoare triple {52025#true} assume !false;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~cond~0 := #t~nondet15;havoc #t~nondet15; {52025#true} is VALID [2022-04-28 08:16:23,534 INFO L290 TraceCheckUtils]: 7: Hoare triple {52025#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0; {52025#true} is VALID [2022-04-28 08:16:23,534 INFO L290 TraceCheckUtils]: 8: Hoare triple {52025#true} assume !(0 != ~p1~0); {52025#true} is VALID [2022-04-28 08:16:23,534 INFO L290 TraceCheckUtils]: 9: Hoare triple {52025#true} assume !(0 != ~p2~0); {52025#true} is VALID [2022-04-28 08:16:23,534 INFO L290 TraceCheckUtils]: 10: Hoare triple {52025#true} assume !(0 != ~p3~0); {52025#true} is VALID [2022-04-28 08:16:23,534 INFO L290 TraceCheckUtils]: 11: Hoare triple {52025#true} assume !(0 != ~p4~0); {52025#true} is VALID [2022-04-28 08:16:23,535 INFO L290 TraceCheckUtils]: 12: Hoare triple {52025#true} assume !(0 != ~p5~0); {52025#true} is VALID [2022-04-28 08:16:23,535 INFO L290 TraceCheckUtils]: 13: Hoare triple {52025#true} assume !(0 != ~p6~0); {52030#(= main_~p6~0 0)} is VALID [2022-04-28 08:16:23,535 INFO L290 TraceCheckUtils]: 14: Hoare triple {52030#(= main_~p6~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {52030#(= main_~p6~0 0)} is VALID [2022-04-28 08:16:23,535 INFO L290 TraceCheckUtils]: 15: Hoare triple {52030#(= main_~p6~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {52030#(= main_~p6~0 0)} is VALID [2022-04-28 08:16:23,536 INFO L290 TraceCheckUtils]: 16: Hoare triple {52030#(= main_~p6~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {52030#(= main_~p6~0 0)} is VALID [2022-04-28 08:16:23,536 INFO L290 TraceCheckUtils]: 17: Hoare triple {52030#(= main_~p6~0 0)} assume !(0 != ~p10~0); {52030#(= main_~p6~0 0)} is VALID [2022-04-28 08:16:23,536 INFO L290 TraceCheckUtils]: 18: Hoare triple {52030#(= main_~p6~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {52030#(= main_~p6~0 0)} is VALID [2022-04-28 08:16:23,536 INFO L290 TraceCheckUtils]: 19: Hoare triple {52030#(= main_~p6~0 0)} assume !(0 != ~p1~0); {52030#(= main_~p6~0 0)} is VALID [2022-04-28 08:16:23,537 INFO L290 TraceCheckUtils]: 20: Hoare triple {52030#(= main_~p6~0 0)} assume !(0 != ~p2~0); {52030#(= main_~p6~0 0)} is VALID [2022-04-28 08:16:23,537 INFO L290 TraceCheckUtils]: 21: Hoare triple {52030#(= main_~p6~0 0)} assume !(0 != ~p3~0); {52030#(= main_~p6~0 0)} is VALID [2022-04-28 08:16:23,537 INFO L290 TraceCheckUtils]: 22: Hoare triple {52030#(= main_~p6~0 0)} assume !(0 != ~p4~0); {52030#(= main_~p6~0 0)} is VALID [2022-04-28 08:16:23,537 INFO L290 TraceCheckUtils]: 23: Hoare triple {52030#(= main_~p6~0 0)} assume !(0 != ~p5~0); {52030#(= main_~p6~0 0)} is VALID [2022-04-28 08:16:23,538 INFO L290 TraceCheckUtils]: 24: Hoare triple {52030#(= main_~p6~0 0)} assume 0 != ~p6~0; {52026#false} is VALID [2022-04-28 08:16:23,538 INFO L290 TraceCheckUtils]: 25: Hoare triple {52026#false} assume 1 != ~lk6~0; {52026#false} is VALID [2022-04-28 08:16:23,538 INFO L290 TraceCheckUtils]: 26: Hoare triple {52026#false} assume !false; {52026#false} is VALID [2022-04-28 08:16:23,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 08:16:23,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:16:23,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228224071] [2022-04-28 08:16:23,538 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228224071] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:16:23,538 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:16:23,538 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:16:23,538 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:16:23,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1524629447] [2022-04-28 08:16:23,539 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1524629447] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:16:23,539 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:16:23,539 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:16:23,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151793594] [2022-04-28 08:16:23,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:16:23,539 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 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 27 [2022-04-28 08:16:23,539 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:16:23,539 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:23,552 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:16:23,552 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:16:23,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:16:23,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:16:23,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:16:23,553 INFO L87 Difference]: Start difference. First operand 1545 states and 2391 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:24,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:24,339 INFO L93 Difference]: Finished difference Result 3597 states and 5593 transitions. [2022-04-28 08:16:24,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:16:24,340 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 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 27 [2022-04-28 08:16:24,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:16:24,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:24,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 195 transitions. [2022-04-28 08:16:24,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:24,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 195 transitions. [2022-04-28 08:16:24,342 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 195 transitions. [2022-04-28 08:16:24,413 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 195 edges. 195 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:16:24,595 INFO L225 Difference]: With dead ends: 3597 [2022-04-28 08:16:24,595 INFO L226 Difference]: Without dead ends: 2091 [2022-04-28 08:16:24,597 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:16:24,598 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 133 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 08:16:24,598 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 113 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 08:16:24,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2091 states. [2022-04-28 08:16:24,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2091 to 2089. [2022-04-28 08:16:24,727 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:16:24,730 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2091 states. Second operand has 2089 states, 2085 states have (on average 1.5366906474820143) internal successors, (3204), 2085 states have internal predecessors, (3204), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:24,732 INFO L74 IsIncluded]: Start isIncluded. First operand 2091 states. Second operand has 2089 states, 2085 states have (on average 1.5366906474820143) internal successors, (3204), 2085 states have internal predecessors, (3204), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:24,733 INFO L87 Difference]: Start difference. First operand 2091 states. Second operand has 2089 states, 2085 states have (on average 1.5366906474820143) internal successors, (3204), 2085 states have internal predecessors, (3204), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:24,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:24,836 INFO L93 Difference]: Finished difference Result 2091 states and 3208 transitions. [2022-04-28 08:16:24,836 INFO L276 IsEmpty]: Start isEmpty. Operand 2091 states and 3208 transitions. [2022-04-28 08:16:24,838 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:16:24,838 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:16:24,841 INFO L74 IsIncluded]: Start isIncluded. First operand has 2089 states, 2085 states have (on average 1.5366906474820143) internal successors, (3204), 2085 states have internal predecessors, (3204), 2 states have call successors, (2), 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 2091 states. [2022-04-28 08:16:24,842 INFO L87 Difference]: Start difference. First operand has 2089 states, 2085 states have (on average 1.5366906474820143) internal successors, (3204), 2085 states have internal predecessors, (3204), 2 states have call successors, (2), 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 2091 states. [2022-04-28 08:16:24,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:24,952 INFO L93 Difference]: Finished difference Result 2091 states and 3208 transitions. [2022-04-28 08:16:24,952 INFO L276 IsEmpty]: Start isEmpty. Operand 2091 states and 3208 transitions. [2022-04-28 08:16:24,954 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:16:24,954 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:16:24,954 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:16:24,954 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:16:24,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2089 states, 2085 states have (on average 1.5366906474820143) internal successors, (3204), 2085 states have internal predecessors, (3204), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:25,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2089 states to 2089 states and 3207 transitions. [2022-04-28 08:16:25,179 INFO L78 Accepts]: Start accepts. Automaton has 2089 states and 3207 transitions. Word has length 27 [2022-04-28 08:16:25,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:16:25,179 INFO L495 AbstractCegarLoop]: Abstraction has 2089 states and 3207 transitions. [2022-04-28 08:16:25,179 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:25,180 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 2089 states and 3207 transitions. [2022-04-28 08:16:27,869 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 3207 edges. 3207 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:16:27,869 INFO L276 IsEmpty]: Start isEmpty. Operand 2089 states and 3207 transitions. [2022-04-28 08:16:27,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-28 08:16:27,870 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:16:27,871 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:16:27,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-28 08:16:27,871 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:16:27,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:16:27,871 INFO L85 PathProgramCache]: Analyzing trace with hash -19072850, now seen corresponding path program 1 times [2022-04-28 08:16:27,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:16:27,871 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [57254352] [2022-04-28 08:16:27,871 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:16:27,872 INFO L85 PathProgramCache]: Analyzing trace with hash -19072850, now seen corresponding path program 2 times [2022-04-28 08:16:27,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:16:27,872 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324755253] [2022-04-28 08:16:27,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:16:27,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:16:27,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:16:27,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:16:27,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:16:27,917 INFO L290 TraceCheckUtils]: 0: Hoare triple {67597#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {67591#true} is VALID [2022-04-28 08:16:27,917 INFO L290 TraceCheckUtils]: 1: Hoare triple {67591#true} assume true; {67591#true} is VALID [2022-04-28 08:16:27,917 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {67591#true} {67591#true} #217#return; {67591#true} is VALID [2022-04-28 08:16:27,918 INFO L272 TraceCheckUtils]: 0: Hoare triple {67591#true} call ULTIMATE.init(); {67597#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:16:27,918 INFO L290 TraceCheckUtils]: 1: Hoare triple {67597#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {67591#true} is VALID [2022-04-28 08:16:27,918 INFO L290 TraceCheckUtils]: 2: Hoare triple {67591#true} assume true; {67591#true} is VALID [2022-04-28 08:16:27,918 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {67591#true} {67591#true} #217#return; {67591#true} is VALID [2022-04-28 08:16:27,918 INFO L272 TraceCheckUtils]: 4: Hoare triple {67591#true} call #t~ret16 := main(); {67591#true} is VALID [2022-04-28 08:16:27,918 INFO L290 TraceCheckUtils]: 5: Hoare triple {67591#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;havoc ~cond~0; {67591#true} is VALID [2022-04-28 08:16:27,918 INFO L290 TraceCheckUtils]: 6: Hoare triple {67591#true} assume !false;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~cond~0 := #t~nondet15;havoc #t~nondet15; {67591#true} is VALID [2022-04-28 08:16:27,918 INFO L290 TraceCheckUtils]: 7: Hoare triple {67591#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0; {67591#true} is VALID [2022-04-28 08:16:27,919 INFO L290 TraceCheckUtils]: 8: Hoare triple {67591#true} assume !(0 != ~p1~0); {67591#true} is VALID [2022-04-28 08:16:27,919 INFO L290 TraceCheckUtils]: 9: Hoare triple {67591#true} assume !(0 != ~p2~0); {67591#true} is VALID [2022-04-28 08:16:27,919 INFO L290 TraceCheckUtils]: 10: Hoare triple {67591#true} assume !(0 != ~p3~0); {67591#true} is VALID [2022-04-28 08:16:27,919 INFO L290 TraceCheckUtils]: 11: Hoare triple {67591#true} assume !(0 != ~p4~0); {67591#true} is VALID [2022-04-28 08:16:27,919 INFO L290 TraceCheckUtils]: 12: Hoare triple {67591#true} assume !(0 != ~p5~0); {67591#true} is VALID [2022-04-28 08:16:27,919 INFO L290 TraceCheckUtils]: 13: Hoare triple {67591#true} assume 0 != ~p6~0;~lk6~0 := 1; {67596#(not (= main_~p6~0 0))} is VALID [2022-04-28 08:16:27,920 INFO L290 TraceCheckUtils]: 14: Hoare triple {67596#(not (= main_~p6~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {67596#(not (= main_~p6~0 0))} is VALID [2022-04-28 08:16:27,920 INFO L290 TraceCheckUtils]: 15: Hoare triple {67596#(not (= main_~p6~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {67596#(not (= main_~p6~0 0))} is VALID [2022-04-28 08:16:27,920 INFO L290 TraceCheckUtils]: 16: Hoare triple {67596#(not (= main_~p6~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {67596#(not (= main_~p6~0 0))} is VALID [2022-04-28 08:16:27,921 INFO L290 TraceCheckUtils]: 17: Hoare triple {67596#(not (= main_~p6~0 0))} assume !(0 != ~p10~0); {67596#(not (= main_~p6~0 0))} is VALID [2022-04-28 08:16:27,921 INFO L290 TraceCheckUtils]: 18: Hoare triple {67596#(not (= main_~p6~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {67596#(not (= main_~p6~0 0))} is VALID [2022-04-28 08:16:27,921 INFO L290 TraceCheckUtils]: 19: Hoare triple {67596#(not (= main_~p6~0 0))} assume !(0 != ~p1~0); {67596#(not (= main_~p6~0 0))} is VALID [2022-04-28 08:16:27,922 INFO L290 TraceCheckUtils]: 20: Hoare triple {67596#(not (= main_~p6~0 0))} assume !(0 != ~p2~0); {67596#(not (= main_~p6~0 0))} is VALID [2022-04-28 08:16:27,922 INFO L290 TraceCheckUtils]: 21: Hoare triple {67596#(not (= main_~p6~0 0))} assume !(0 != ~p3~0); {67596#(not (= main_~p6~0 0))} is VALID [2022-04-28 08:16:27,922 INFO L290 TraceCheckUtils]: 22: Hoare triple {67596#(not (= main_~p6~0 0))} assume !(0 != ~p4~0); {67596#(not (= main_~p6~0 0))} is VALID [2022-04-28 08:16:27,923 INFO L290 TraceCheckUtils]: 23: Hoare triple {67596#(not (= main_~p6~0 0))} assume !(0 != ~p5~0); {67596#(not (= main_~p6~0 0))} is VALID [2022-04-28 08:16:27,923 INFO L290 TraceCheckUtils]: 24: Hoare triple {67596#(not (= main_~p6~0 0))} assume !(0 != ~p6~0); {67592#false} is VALID [2022-04-28 08:16:27,923 INFO L290 TraceCheckUtils]: 25: Hoare triple {67592#false} assume 0 != ~p7~0; {67592#false} is VALID [2022-04-28 08:16:27,923 INFO L290 TraceCheckUtils]: 26: Hoare triple {67592#false} assume 1 != ~lk7~0; {67592#false} is VALID [2022-04-28 08:16:27,923 INFO L290 TraceCheckUtils]: 27: Hoare triple {67592#false} assume !false; {67592#false} is VALID [2022-04-28 08:16:27,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 08:16:27,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:16:27,924 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324755253] [2022-04-28 08:16:27,924 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324755253] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:16:27,924 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:16:27,924 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:16:27,924 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:16:27,924 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [57254352] [2022-04-28 08:16:27,924 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [57254352] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:16:27,924 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:16:27,924 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:16:27,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505190766] [2022-04-28 08:16:27,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:16:27,925 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 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 28 [2022-04-28 08:16:27,925 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:16:27,925 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:27,943 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:16:27,943 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:16:27,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:16:27,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:16:27,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:16:27,944 INFO L87 Difference]: Start difference. First operand 2089 states and 3207 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:28,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:28,613 INFO L93 Difference]: Finished difference Result 3133 states and 4793 transitions. [2022-04-28 08:16:28,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:16:28,614 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 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 28 [2022-04-28 08:16:28,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:16:28,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:28,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 190 transitions. [2022-04-28 08:16:28,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:28,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 190 transitions. [2022-04-28 08:16:28,616 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 190 transitions. [2022-04-28 08:16:28,718 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 190 edges. 190 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:16:28,898 INFO L225 Difference]: With dead ends: 3133 [2022-04-28 08:16:28,899 INFO L226 Difference]: Without dead ends: 2123 [2022-04-28 08:16:28,900 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:16:28,900 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 139 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 08:16:28,900 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 108 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 08:16:28,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2123 states. [2022-04-28 08:16:29,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2123 to 2121. [2022-04-28 08:16:29,029 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:16:29,032 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2123 states. Second operand has 2121 states, 2117 states have (on average 1.5134624468587623) internal successors, (3204), 2117 states have internal predecessors, (3204), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:29,033 INFO L74 IsIncluded]: Start isIncluded. First operand 2123 states. Second operand has 2121 states, 2117 states have (on average 1.5134624468587623) internal successors, (3204), 2117 states have internal predecessors, (3204), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:29,035 INFO L87 Difference]: Start difference. First operand 2123 states. Second operand has 2121 states, 2117 states have (on average 1.5134624468587623) internal successors, (3204), 2117 states have internal predecessors, (3204), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:29,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:29,142 INFO L93 Difference]: Finished difference Result 2123 states and 3208 transitions. [2022-04-28 08:16:29,142 INFO L276 IsEmpty]: Start isEmpty. Operand 2123 states and 3208 transitions. [2022-04-28 08:16:29,144 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:16:29,144 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:16:29,147 INFO L74 IsIncluded]: Start isIncluded. First operand has 2121 states, 2117 states have (on average 1.5134624468587623) internal successors, (3204), 2117 states have internal predecessors, (3204), 2 states have call successors, (2), 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 2123 states. [2022-04-28 08:16:29,148 INFO L87 Difference]: Start difference. First operand has 2121 states, 2117 states have (on average 1.5134624468587623) internal successors, (3204), 2117 states have internal predecessors, (3204), 2 states have call successors, (2), 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 2123 states. [2022-04-28 08:16:29,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:29,260 INFO L93 Difference]: Finished difference Result 2123 states and 3208 transitions. [2022-04-28 08:16:29,260 INFO L276 IsEmpty]: Start isEmpty. Operand 2123 states and 3208 transitions. [2022-04-28 08:16:29,262 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:16:29,262 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:16:29,262 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:16:29,262 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:16:29,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2121 states, 2117 states have (on average 1.5134624468587623) internal successors, (3204), 2117 states have internal predecessors, (3204), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:29,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2121 states to 2121 states and 3207 transitions. [2022-04-28 08:16:29,466 INFO L78 Accepts]: Start accepts. Automaton has 2121 states and 3207 transitions. Word has length 28 [2022-04-28 08:16:29,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:16:29,466 INFO L495 AbstractCegarLoop]: Abstraction has 2121 states and 3207 transitions. [2022-04-28 08:16:29,466 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:29,466 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 2121 states and 3207 transitions. [2022-04-28 08:16:32,142 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 3207 edges. 3207 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:16:32,143 INFO L276 IsEmpty]: Start isEmpty. Operand 2121 states and 3207 transitions. [2022-04-28 08:16:32,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-28 08:16:32,144 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:16:32,144 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:16:32,144 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-04-28 08:16:32,145 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:16:32,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:16:32,145 INFO L85 PathProgramCache]: Analyzing trace with hash -1298936528, now seen corresponding path program 1 times [2022-04-28 08:16:32,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:16:32,145 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [40998178] [2022-04-28 08:16:32,145 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:16:32,145 INFO L85 PathProgramCache]: Analyzing trace with hash -1298936528, now seen corresponding path program 2 times [2022-04-28 08:16:32,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:16:32,146 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483515401] [2022-04-28 08:16:32,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:16:32,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:16:32,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:16:32,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:16:32,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:16:32,185 INFO L290 TraceCheckUtils]: 0: Hoare triple {82363#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {82357#true} is VALID [2022-04-28 08:16:32,185 INFO L290 TraceCheckUtils]: 1: Hoare triple {82357#true} assume true; {82357#true} is VALID [2022-04-28 08:16:32,185 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {82357#true} {82357#true} #217#return; {82357#true} is VALID [2022-04-28 08:16:32,185 INFO L272 TraceCheckUtils]: 0: Hoare triple {82357#true} call ULTIMATE.init(); {82363#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:16:32,186 INFO L290 TraceCheckUtils]: 1: Hoare triple {82363#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {82357#true} is VALID [2022-04-28 08:16:32,186 INFO L290 TraceCheckUtils]: 2: Hoare triple {82357#true} assume true; {82357#true} is VALID [2022-04-28 08:16:32,186 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {82357#true} {82357#true} #217#return; {82357#true} is VALID [2022-04-28 08:16:32,186 INFO L272 TraceCheckUtils]: 4: Hoare triple {82357#true} call #t~ret16 := main(); {82357#true} is VALID [2022-04-28 08:16:32,186 INFO L290 TraceCheckUtils]: 5: Hoare triple {82357#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;havoc ~cond~0; {82357#true} is VALID [2022-04-28 08:16:32,186 INFO L290 TraceCheckUtils]: 6: Hoare triple {82357#true} assume !false;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~cond~0 := #t~nondet15;havoc #t~nondet15; {82357#true} is VALID [2022-04-28 08:16:32,186 INFO L290 TraceCheckUtils]: 7: Hoare triple {82357#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0; {82357#true} is VALID [2022-04-28 08:16:32,186 INFO L290 TraceCheckUtils]: 8: Hoare triple {82357#true} assume !(0 != ~p1~0); {82357#true} is VALID [2022-04-28 08:16:32,186 INFO L290 TraceCheckUtils]: 9: Hoare triple {82357#true} assume !(0 != ~p2~0); {82357#true} is VALID [2022-04-28 08:16:32,186 INFO L290 TraceCheckUtils]: 10: Hoare triple {82357#true} assume !(0 != ~p3~0); {82357#true} is VALID [2022-04-28 08:16:32,186 INFO L290 TraceCheckUtils]: 11: Hoare triple {82357#true} assume !(0 != ~p4~0); {82357#true} is VALID [2022-04-28 08:16:32,186 INFO L290 TraceCheckUtils]: 12: Hoare triple {82357#true} assume !(0 != ~p5~0); {82357#true} is VALID [2022-04-28 08:16:32,187 INFO L290 TraceCheckUtils]: 13: Hoare triple {82357#true} assume !(0 != ~p6~0); {82357#true} is VALID [2022-04-28 08:16:32,187 INFO L290 TraceCheckUtils]: 14: Hoare triple {82357#true} assume 0 != ~p7~0;~lk7~0 := 1; {82362#(= main_~lk7~0 1)} is VALID [2022-04-28 08:16:32,187 INFO L290 TraceCheckUtils]: 15: Hoare triple {82362#(= main_~lk7~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {82362#(= main_~lk7~0 1)} is VALID [2022-04-28 08:16:32,188 INFO L290 TraceCheckUtils]: 16: Hoare triple {82362#(= main_~lk7~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {82362#(= main_~lk7~0 1)} is VALID [2022-04-28 08:16:32,189 INFO L290 TraceCheckUtils]: 17: Hoare triple {82362#(= main_~lk7~0 1)} assume !(0 != ~p10~0); {82362#(= main_~lk7~0 1)} is VALID [2022-04-28 08:16:32,189 INFO L290 TraceCheckUtils]: 18: Hoare triple {82362#(= main_~lk7~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {82362#(= main_~lk7~0 1)} is VALID [2022-04-28 08:16:32,189 INFO L290 TraceCheckUtils]: 19: Hoare triple {82362#(= main_~lk7~0 1)} assume !(0 != ~p1~0); {82362#(= main_~lk7~0 1)} is VALID [2022-04-28 08:16:32,189 INFO L290 TraceCheckUtils]: 20: Hoare triple {82362#(= main_~lk7~0 1)} assume !(0 != ~p2~0); {82362#(= main_~lk7~0 1)} is VALID [2022-04-28 08:16:32,190 INFO L290 TraceCheckUtils]: 21: Hoare triple {82362#(= main_~lk7~0 1)} assume !(0 != ~p3~0); {82362#(= main_~lk7~0 1)} is VALID [2022-04-28 08:16:32,194 INFO L290 TraceCheckUtils]: 22: Hoare triple {82362#(= main_~lk7~0 1)} assume !(0 != ~p4~0); {82362#(= main_~lk7~0 1)} is VALID [2022-04-28 08:16:32,194 INFO L290 TraceCheckUtils]: 23: Hoare triple {82362#(= main_~lk7~0 1)} assume !(0 != ~p5~0); {82362#(= main_~lk7~0 1)} is VALID [2022-04-28 08:16:32,194 INFO L290 TraceCheckUtils]: 24: Hoare triple {82362#(= main_~lk7~0 1)} assume !(0 != ~p6~0); {82362#(= main_~lk7~0 1)} is VALID [2022-04-28 08:16:32,194 INFO L290 TraceCheckUtils]: 25: Hoare triple {82362#(= main_~lk7~0 1)} assume 0 != ~p7~0; {82362#(= main_~lk7~0 1)} is VALID [2022-04-28 08:16:32,197 INFO L290 TraceCheckUtils]: 26: Hoare triple {82362#(= main_~lk7~0 1)} assume 1 != ~lk7~0; {82358#false} is VALID [2022-04-28 08:16:32,197 INFO L290 TraceCheckUtils]: 27: Hoare triple {82358#false} assume !false; {82358#false} is VALID [2022-04-28 08:16:32,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 08:16:32,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:16:32,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483515401] [2022-04-28 08:16:32,198 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483515401] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:16:32,198 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:16:32,198 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:16:32,198 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:16:32,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [40998178] [2022-04-28 08:16:32,198 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [40998178] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:16:32,198 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:16:32,199 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:16:32,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623949546] [2022-04-28 08:16:32,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:16:32,199 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 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 28 [2022-04-28 08:16:32,199 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:16:32,199 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:32,212 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:16:32,212 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:16:32,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:16:32,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:16:32,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:16:32,213 INFO L87 Difference]: Start difference. First operand 2121 states and 3207 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:33,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:33,139 INFO L93 Difference]: Finished difference Result 3725 states and 5737 transitions. [2022-04-28 08:16:33,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:16:33,139 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 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 28 [2022-04-28 08:16:33,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:16:33,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:33,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 119 transitions. [2022-04-28 08:16:33,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:33,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 119 transitions. [2022-04-28 08:16:33,140 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 119 transitions. [2022-04-28 08:16:33,208 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 119 edges. 119 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:16:33,773 INFO L225 Difference]: With dead ends: 3725 [2022-04-28 08:16:33,773 INFO L226 Difference]: Without dead ends: 3723 [2022-04-28 08:16:33,774 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:16:33,775 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 143 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 08:16:33,776 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 78 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 08:16:33,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3723 states. [2022-04-28 08:16:33,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3723 to 3081. [2022-04-28 08:16:33,985 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:16:33,988 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3723 states. Second operand has 3081 states, 3077 states have (on average 1.4676633084172896) internal successors, (4516), 3077 states have internal predecessors, (4516), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:33,991 INFO L74 IsIncluded]: Start isIncluded. First operand 3723 states. Second operand has 3081 states, 3077 states have (on average 1.4676633084172896) internal successors, (4516), 3077 states have internal predecessors, (4516), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:33,994 INFO L87 Difference]: Start difference. First operand 3723 states. Second operand has 3081 states, 3077 states have (on average 1.4676633084172896) internal successors, (4516), 3077 states have internal predecessors, (4516), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:34,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:34,345 INFO L93 Difference]: Finished difference Result 3723 states and 5672 transitions. [2022-04-28 08:16:34,345 INFO L276 IsEmpty]: Start isEmpty. Operand 3723 states and 5672 transitions. [2022-04-28 08:16:34,349 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:16:34,349 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:16:34,353 INFO L74 IsIncluded]: Start isIncluded. First operand has 3081 states, 3077 states have (on average 1.4676633084172896) internal successors, (4516), 3077 states have internal predecessors, (4516), 2 states have call successors, (2), 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 3723 states. [2022-04-28 08:16:34,355 INFO L87 Difference]: Start difference. First operand has 3081 states, 3077 states have (on average 1.4676633084172896) internal successors, (4516), 3077 states have internal predecessors, (4516), 2 states have call successors, (2), 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 3723 states. [2022-04-28 08:16:34,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:34,713 INFO L93 Difference]: Finished difference Result 3723 states and 5672 transitions. [2022-04-28 08:16:34,713 INFO L276 IsEmpty]: Start isEmpty. Operand 3723 states and 5672 transitions. [2022-04-28 08:16:34,717 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:16:34,717 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:16:34,717 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:16:34,717 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:16:34,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3081 states, 3077 states have (on average 1.4676633084172896) internal successors, (4516), 3077 states have internal predecessors, (4516), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:35,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3081 states to 3081 states and 4519 transitions. [2022-04-28 08:16:35,190 INFO L78 Accepts]: Start accepts. Automaton has 3081 states and 4519 transitions. Word has length 28 [2022-04-28 08:16:35,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:16:35,190 INFO L495 AbstractCegarLoop]: Abstraction has 3081 states and 4519 transitions. [2022-04-28 08:16:35,190 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:35,190 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3081 states and 4519 transitions. [2022-04-28 08:16:38,616 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 4519 edges. 4519 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:16:38,616 INFO L276 IsEmpty]: Start isEmpty. Operand 3081 states and 4519 transitions. [2022-04-28 08:16:38,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-28 08:16:38,619 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:16:38,619 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:16:38,619 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-04-28 08:16:38,620 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:16:38,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:16:38,620 INFO L85 PathProgramCache]: Analyzing trace with hash 1984913518, now seen corresponding path program 1 times [2022-04-28 08:16:38,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:16:38,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1907041599] [2022-04-28 08:16:38,620 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:16:38,620 INFO L85 PathProgramCache]: Analyzing trace with hash 1984913518, now seen corresponding path program 2 times [2022-04-28 08:16:38,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:16:38,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090277779] [2022-04-28 08:16:38,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:16:38,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:16:38,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:16:38,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:16:38,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:16:38,690 INFO L290 TraceCheckUtils]: 0: Hoare triple {103433#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {103427#true} is VALID [2022-04-28 08:16:38,690 INFO L290 TraceCheckUtils]: 1: Hoare triple {103427#true} assume true; {103427#true} is VALID [2022-04-28 08:16:38,690 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {103427#true} {103427#true} #217#return; {103427#true} is VALID [2022-04-28 08:16:38,692 INFO L272 TraceCheckUtils]: 0: Hoare triple {103427#true} call ULTIMATE.init(); {103433#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:16:38,692 INFO L290 TraceCheckUtils]: 1: Hoare triple {103433#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {103427#true} is VALID [2022-04-28 08:16:38,692 INFO L290 TraceCheckUtils]: 2: Hoare triple {103427#true} assume true; {103427#true} is VALID [2022-04-28 08:16:38,692 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {103427#true} {103427#true} #217#return; {103427#true} is VALID [2022-04-28 08:16:38,692 INFO L272 TraceCheckUtils]: 4: Hoare triple {103427#true} call #t~ret16 := main(); {103427#true} is VALID [2022-04-28 08:16:38,692 INFO L290 TraceCheckUtils]: 5: Hoare triple {103427#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;havoc ~cond~0; {103427#true} is VALID [2022-04-28 08:16:38,692 INFO L290 TraceCheckUtils]: 6: Hoare triple {103427#true} assume !false;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~cond~0 := #t~nondet15;havoc #t~nondet15; {103427#true} is VALID [2022-04-28 08:16:38,692 INFO L290 TraceCheckUtils]: 7: Hoare triple {103427#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0; {103427#true} is VALID [2022-04-28 08:16:38,692 INFO L290 TraceCheckUtils]: 8: Hoare triple {103427#true} assume !(0 != ~p1~0); {103427#true} is VALID [2022-04-28 08:16:38,692 INFO L290 TraceCheckUtils]: 9: Hoare triple {103427#true} assume !(0 != ~p2~0); {103427#true} is VALID [2022-04-28 08:16:38,692 INFO L290 TraceCheckUtils]: 10: Hoare triple {103427#true} assume !(0 != ~p3~0); {103427#true} is VALID [2022-04-28 08:16:38,693 INFO L290 TraceCheckUtils]: 11: Hoare triple {103427#true} assume !(0 != ~p4~0); {103427#true} is VALID [2022-04-28 08:16:38,693 INFO L290 TraceCheckUtils]: 12: Hoare triple {103427#true} assume !(0 != ~p5~0); {103427#true} is VALID [2022-04-28 08:16:38,693 INFO L290 TraceCheckUtils]: 13: Hoare triple {103427#true} assume !(0 != ~p6~0); {103427#true} is VALID [2022-04-28 08:16:38,694 INFO L290 TraceCheckUtils]: 14: Hoare triple {103427#true} assume !(0 != ~p7~0); {103432#(= main_~p7~0 0)} is VALID [2022-04-28 08:16:38,694 INFO L290 TraceCheckUtils]: 15: Hoare triple {103432#(= main_~p7~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {103432#(= main_~p7~0 0)} is VALID [2022-04-28 08:16:38,694 INFO L290 TraceCheckUtils]: 16: Hoare triple {103432#(= main_~p7~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {103432#(= main_~p7~0 0)} is VALID [2022-04-28 08:16:38,694 INFO L290 TraceCheckUtils]: 17: Hoare triple {103432#(= main_~p7~0 0)} assume !(0 != ~p10~0); {103432#(= main_~p7~0 0)} is VALID [2022-04-28 08:16:38,694 INFO L290 TraceCheckUtils]: 18: Hoare triple {103432#(= main_~p7~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {103432#(= main_~p7~0 0)} is VALID [2022-04-28 08:16:38,695 INFO L290 TraceCheckUtils]: 19: Hoare triple {103432#(= main_~p7~0 0)} assume !(0 != ~p1~0); {103432#(= main_~p7~0 0)} is VALID [2022-04-28 08:16:38,695 INFO L290 TraceCheckUtils]: 20: Hoare triple {103432#(= main_~p7~0 0)} assume !(0 != ~p2~0); {103432#(= main_~p7~0 0)} is VALID [2022-04-28 08:16:38,695 INFO L290 TraceCheckUtils]: 21: Hoare triple {103432#(= main_~p7~0 0)} assume !(0 != ~p3~0); {103432#(= main_~p7~0 0)} is VALID [2022-04-28 08:16:38,695 INFO L290 TraceCheckUtils]: 22: Hoare triple {103432#(= main_~p7~0 0)} assume !(0 != ~p4~0); {103432#(= main_~p7~0 0)} is VALID [2022-04-28 08:16:38,695 INFO L290 TraceCheckUtils]: 23: Hoare triple {103432#(= main_~p7~0 0)} assume !(0 != ~p5~0); {103432#(= main_~p7~0 0)} is VALID [2022-04-28 08:16:38,696 INFO L290 TraceCheckUtils]: 24: Hoare triple {103432#(= main_~p7~0 0)} assume !(0 != ~p6~0); {103432#(= main_~p7~0 0)} is VALID [2022-04-28 08:16:38,696 INFO L290 TraceCheckUtils]: 25: Hoare triple {103432#(= main_~p7~0 0)} assume 0 != ~p7~0; {103428#false} is VALID [2022-04-28 08:16:38,696 INFO L290 TraceCheckUtils]: 26: Hoare triple {103428#false} assume 1 != ~lk7~0; {103428#false} is VALID [2022-04-28 08:16:38,696 INFO L290 TraceCheckUtils]: 27: Hoare triple {103428#false} assume !false; {103428#false} is VALID [2022-04-28 08:16:38,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 08:16:38,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:16:38,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090277779] [2022-04-28 08:16:38,696 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2090277779] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:16:38,697 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:16:38,697 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:16:38,697 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:16:38,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1907041599] [2022-04-28 08:16:38,697 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1907041599] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:16:38,697 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:16:38,697 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:16:38,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928585814] [2022-04-28 08:16:38,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:16:38,697 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 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 28 [2022-04-28 08:16:38,698 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:16:38,698 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:38,707 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:16:38,708 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:16:38,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:16:38,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:16:38,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:16:38,708 INFO L87 Difference]: Start difference. First operand 3081 states and 4519 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:41,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:41,201 INFO L93 Difference]: Finished difference Result 7117 states and 10473 transitions. [2022-04-28 08:16:41,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:16:41,201 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 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 28 [2022-04-28 08:16:41,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:16:41,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:41,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 192 transitions. [2022-04-28 08:16:41,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:41,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 192 transitions. [2022-04-28 08:16:41,204 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 192 transitions. [2022-04-28 08:16:41,306 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 192 edges. 192 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:16:42,029 INFO L225 Difference]: With dead ends: 7117 [2022-04-28 08:16:42,030 INFO L226 Difference]: Without dead ends: 4107 [2022-04-28 08:16:42,051 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:16:42,052 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 127 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 08:16:42,052 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 115 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 08:16:42,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4107 states. [2022-04-28 08:16:42,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4107 to 4105. [2022-04-28 08:16:42,325 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:16:42,330 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4107 states. Second operand has 4105 states, 4101 states have (on average 1.4523287003169958) internal successors, (5956), 4101 states have internal predecessors, (5956), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:42,332 INFO L74 IsIncluded]: Start isIncluded. First operand 4107 states. Second operand has 4105 states, 4101 states have (on average 1.4523287003169958) internal successors, (5956), 4101 states have internal predecessors, (5956), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:42,335 INFO L87 Difference]: Start difference. First operand 4107 states. Second operand has 4105 states, 4101 states have (on average 1.4523287003169958) internal successors, (5956), 4101 states have internal predecessors, (5956), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:42,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:42,761 INFO L93 Difference]: Finished difference Result 4107 states and 5960 transitions. [2022-04-28 08:16:42,762 INFO L276 IsEmpty]: Start isEmpty. Operand 4107 states and 5960 transitions. [2022-04-28 08:16:42,765 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:16:42,766 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:16:42,770 INFO L74 IsIncluded]: Start isIncluded. First operand has 4105 states, 4101 states have (on average 1.4523287003169958) internal successors, (5956), 4101 states have internal predecessors, (5956), 2 states have call successors, (2), 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 4107 states. [2022-04-28 08:16:42,773 INFO L87 Difference]: Start difference. First operand has 4105 states, 4101 states have (on average 1.4523287003169958) internal successors, (5956), 4101 states have internal predecessors, (5956), 2 states have call successors, (2), 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 4107 states. [2022-04-28 08:16:43,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:43,202 INFO L93 Difference]: Finished difference Result 4107 states and 5960 transitions. [2022-04-28 08:16:43,202 INFO L276 IsEmpty]: Start isEmpty. Operand 4107 states and 5960 transitions. [2022-04-28 08:16:43,206 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:16:43,206 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:16:43,206 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:16:43,206 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:16:43,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4105 states, 4101 states have (on average 1.4523287003169958) internal successors, (5956), 4101 states have internal predecessors, (5956), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:43,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4105 states to 4105 states and 5959 transitions. [2022-04-28 08:16:43,932 INFO L78 Accepts]: Start accepts. Automaton has 4105 states and 5959 transitions. Word has length 28 [2022-04-28 08:16:43,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:16:43,932 INFO L495 AbstractCegarLoop]: Abstraction has 4105 states and 5959 transitions. [2022-04-28 08:16:43,932 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:43,932 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4105 states and 5959 transitions. [2022-04-28 08:16:48,917 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 5959 edges. 5959 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:16:48,917 INFO L276 IsEmpty]: Start isEmpty. Operand 4105 states and 5959 transitions. [2022-04-28 08:16:48,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-28 08:16:48,920 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:16:48,920 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:16:48,920 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-04-28 08:16:48,921 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:16:48,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:16:48,921 INFO L85 PathProgramCache]: Analyzing trace with hash -1612111599, now seen corresponding path program 1 times [2022-04-28 08:16:48,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:16:48,921 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1806228149] [2022-04-28 08:16:48,921 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:16:48,921 INFO L85 PathProgramCache]: Analyzing trace with hash -1612111599, now seen corresponding path program 2 times [2022-04-28 08:16:48,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:16:48,922 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496777233] [2022-04-28 08:16:48,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:16:48,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:16:48,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:16:48,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:16:48,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:16:48,966 INFO L290 TraceCheckUtils]: 0: Hoare triple {134103#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {134097#true} is VALID [2022-04-28 08:16:48,966 INFO L290 TraceCheckUtils]: 1: Hoare triple {134097#true} assume true; {134097#true} is VALID [2022-04-28 08:16:48,966 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {134097#true} {134097#true} #217#return; {134097#true} is VALID [2022-04-28 08:16:48,966 INFO L272 TraceCheckUtils]: 0: Hoare triple {134097#true} call ULTIMATE.init(); {134103#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:16:48,966 INFO L290 TraceCheckUtils]: 1: Hoare triple {134103#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {134097#true} is VALID [2022-04-28 08:16:48,966 INFO L290 TraceCheckUtils]: 2: Hoare triple {134097#true} assume true; {134097#true} is VALID [2022-04-28 08:16:48,966 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {134097#true} {134097#true} #217#return; {134097#true} is VALID [2022-04-28 08:16:48,966 INFO L272 TraceCheckUtils]: 4: Hoare triple {134097#true} call #t~ret16 := main(); {134097#true} is VALID [2022-04-28 08:16:48,967 INFO L290 TraceCheckUtils]: 5: Hoare triple {134097#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;havoc ~cond~0; {134097#true} is VALID [2022-04-28 08:16:48,967 INFO L290 TraceCheckUtils]: 6: Hoare triple {134097#true} assume !false;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~cond~0 := #t~nondet15;havoc #t~nondet15; {134097#true} is VALID [2022-04-28 08:16:48,967 INFO L290 TraceCheckUtils]: 7: Hoare triple {134097#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0; {134097#true} is VALID [2022-04-28 08:16:48,967 INFO L290 TraceCheckUtils]: 8: Hoare triple {134097#true} assume !(0 != ~p1~0); {134097#true} is VALID [2022-04-28 08:16:48,967 INFO L290 TraceCheckUtils]: 9: Hoare triple {134097#true} assume !(0 != ~p2~0); {134097#true} is VALID [2022-04-28 08:16:48,967 INFO L290 TraceCheckUtils]: 10: Hoare triple {134097#true} assume !(0 != ~p3~0); {134097#true} is VALID [2022-04-28 08:16:48,967 INFO L290 TraceCheckUtils]: 11: Hoare triple {134097#true} assume !(0 != ~p4~0); {134097#true} is VALID [2022-04-28 08:16:48,967 INFO L290 TraceCheckUtils]: 12: Hoare triple {134097#true} assume !(0 != ~p5~0); {134097#true} is VALID [2022-04-28 08:16:48,967 INFO L290 TraceCheckUtils]: 13: Hoare triple {134097#true} assume !(0 != ~p6~0); {134097#true} is VALID [2022-04-28 08:16:48,967 INFO L290 TraceCheckUtils]: 14: Hoare triple {134097#true} assume 0 != ~p7~0;~lk7~0 := 1; {134102#(not (= main_~p7~0 0))} is VALID [2022-04-28 08:16:48,968 INFO L290 TraceCheckUtils]: 15: Hoare triple {134102#(not (= main_~p7~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {134102#(not (= main_~p7~0 0))} is VALID [2022-04-28 08:16:48,968 INFO L290 TraceCheckUtils]: 16: Hoare triple {134102#(not (= main_~p7~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {134102#(not (= main_~p7~0 0))} is VALID [2022-04-28 08:16:48,968 INFO L290 TraceCheckUtils]: 17: Hoare triple {134102#(not (= main_~p7~0 0))} assume !(0 != ~p10~0); {134102#(not (= main_~p7~0 0))} is VALID [2022-04-28 08:16:48,968 INFO L290 TraceCheckUtils]: 18: Hoare triple {134102#(not (= main_~p7~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {134102#(not (= main_~p7~0 0))} is VALID [2022-04-28 08:16:48,969 INFO L290 TraceCheckUtils]: 19: Hoare triple {134102#(not (= main_~p7~0 0))} assume !(0 != ~p1~0); {134102#(not (= main_~p7~0 0))} is VALID [2022-04-28 08:16:48,969 INFO L290 TraceCheckUtils]: 20: Hoare triple {134102#(not (= main_~p7~0 0))} assume !(0 != ~p2~0); {134102#(not (= main_~p7~0 0))} is VALID [2022-04-28 08:16:48,969 INFO L290 TraceCheckUtils]: 21: Hoare triple {134102#(not (= main_~p7~0 0))} assume !(0 != ~p3~0); {134102#(not (= main_~p7~0 0))} is VALID [2022-04-28 08:16:48,969 INFO L290 TraceCheckUtils]: 22: Hoare triple {134102#(not (= main_~p7~0 0))} assume !(0 != ~p4~0); {134102#(not (= main_~p7~0 0))} is VALID [2022-04-28 08:16:48,969 INFO L290 TraceCheckUtils]: 23: Hoare triple {134102#(not (= main_~p7~0 0))} assume !(0 != ~p5~0); {134102#(not (= main_~p7~0 0))} is VALID [2022-04-28 08:16:48,970 INFO L290 TraceCheckUtils]: 24: Hoare triple {134102#(not (= main_~p7~0 0))} assume !(0 != ~p6~0); {134102#(not (= main_~p7~0 0))} is VALID [2022-04-28 08:16:48,970 INFO L290 TraceCheckUtils]: 25: Hoare triple {134102#(not (= main_~p7~0 0))} assume !(0 != ~p7~0); {134098#false} is VALID [2022-04-28 08:16:48,970 INFO L290 TraceCheckUtils]: 26: Hoare triple {134098#false} assume 0 != ~p8~0; {134098#false} is VALID [2022-04-28 08:16:48,970 INFO L290 TraceCheckUtils]: 27: Hoare triple {134098#false} assume 1 != ~lk8~0; {134098#false} is VALID [2022-04-28 08:16:48,970 INFO L290 TraceCheckUtils]: 28: Hoare triple {134098#false} assume !false; {134098#false} is VALID [2022-04-28 08:16:48,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 08:16:48,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:16:48,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496777233] [2022-04-28 08:16:48,972 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496777233] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:16:48,972 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:16:48,973 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:16:48,973 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:16:48,973 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1806228149] [2022-04-28 08:16:48,973 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1806228149] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:16:48,973 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:16:48,973 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:16:48,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576873836] [2022-04-28 08:16:48,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:16:48,973 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 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 29 [2022-04-28 08:16:48,973 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:16:48,974 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:48,986 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:16:48,986 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:16:48,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:16:48,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:16:48,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:16:48,987 INFO L87 Difference]: Start difference. First operand 4105 states and 5959 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:50,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:50,959 INFO L93 Difference]: Finished difference Result 6157 states and 8905 transitions. [2022-04-28 08:16:50,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:16:50,959 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 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 29 [2022-04-28 08:16:50,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:16:50,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:50,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 187 transitions. [2022-04-28 08:16:50,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:50,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 187 transitions. [2022-04-28 08:16:50,963 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 187 transitions. [2022-04-28 08:16:51,064 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 187 edges. 187 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:16:51,772 INFO L225 Difference]: With dead ends: 6157 [2022-04-28 08:16:51,772 INFO L226 Difference]: Without dead ends: 4171 [2022-04-28 08:16:51,785 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:16:51,785 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 138 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 08:16:51,786 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 105 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 08:16:51,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4171 states. [2022-04-28 08:16:52,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4171 to 4169. [2022-04-28 08:16:52,058 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:16:52,063 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4171 states. Second operand has 4169 states, 4165 states have (on average 1.4300120048019207) internal successors, (5956), 4165 states have internal predecessors, (5956), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:52,065 INFO L74 IsIncluded]: Start isIncluded. First operand 4171 states. Second operand has 4169 states, 4165 states have (on average 1.4300120048019207) internal successors, (5956), 4165 states have internal predecessors, (5956), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:52,068 INFO L87 Difference]: Start difference. First operand 4171 states. Second operand has 4169 states, 4165 states have (on average 1.4300120048019207) internal successors, (5956), 4165 states have internal predecessors, (5956), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:52,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:52,499 INFO L93 Difference]: Finished difference Result 4171 states and 5960 transitions. [2022-04-28 08:16:52,499 INFO L276 IsEmpty]: Start isEmpty. Operand 4171 states and 5960 transitions. [2022-04-28 08:16:52,503 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:16:52,503 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:16:52,528 INFO L74 IsIncluded]: Start isIncluded. First operand has 4169 states, 4165 states have (on average 1.4300120048019207) internal successors, (5956), 4165 states have internal predecessors, (5956), 2 states have call successors, (2), 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 4171 states. [2022-04-28 08:16:52,532 INFO L87 Difference]: Start difference. First operand has 4169 states, 4165 states have (on average 1.4300120048019207) internal successors, (5956), 4165 states have internal predecessors, (5956), 2 states have call successors, (2), 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 4171 states. [2022-04-28 08:16:52,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:16:52,963 INFO L93 Difference]: Finished difference Result 4171 states and 5960 transitions. [2022-04-28 08:16:52,963 INFO L276 IsEmpty]: Start isEmpty. Operand 4171 states and 5960 transitions. [2022-04-28 08:16:52,967 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:16:52,967 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:16:52,967 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:16:52,967 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:16:52,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4169 states, 4165 states have (on average 1.4300120048019207) internal successors, (5956), 4165 states have internal predecessors, (5956), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:53,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4169 states to 4169 states and 5959 transitions. [2022-04-28 08:16:53,712 INFO L78 Accepts]: Start accepts. Automaton has 4169 states and 5959 transitions. Word has length 29 [2022-04-28 08:16:53,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:16:53,712 INFO L495 AbstractCegarLoop]: Abstraction has 4169 states and 5959 transitions. [2022-04-28 08:16:53,712 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:53,712 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4169 states and 5959 transitions. [2022-04-28 08:16:59,319 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 5959 edges. 5959 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:16:59,319 INFO L276 IsEmpty]: Start isEmpty. Operand 4169 states and 5959 transitions. [2022-04-28 08:16:59,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-28 08:16:59,322 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:16:59,322 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:16:59,322 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-04-28 08:16:59,322 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:16:59,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:16:59,323 INFO L85 PathProgramCache]: Analyzing trace with hash 1402992019, now seen corresponding path program 1 times [2022-04-28 08:16:59,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:16:59,323 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [719307536] [2022-04-28 08:16:59,323 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:16:59,323 INFO L85 PathProgramCache]: Analyzing trace with hash 1402992019, now seen corresponding path program 2 times [2022-04-28 08:16:59,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:16:59,323 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078017918] [2022-04-28 08:16:59,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:16:59,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:16:59,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:16:59,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:16:59,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:16:59,362 INFO L290 TraceCheckUtils]: 0: Hoare triple {163109#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {163103#true} is VALID [2022-04-28 08:16:59,362 INFO L290 TraceCheckUtils]: 1: Hoare triple {163103#true} assume true; {163103#true} is VALID [2022-04-28 08:16:59,363 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {163103#true} {163103#true} #217#return; {163103#true} is VALID [2022-04-28 08:16:59,363 INFO L272 TraceCheckUtils]: 0: Hoare triple {163103#true} call ULTIMATE.init(); {163109#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:16:59,363 INFO L290 TraceCheckUtils]: 1: Hoare triple {163109#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {163103#true} is VALID [2022-04-28 08:16:59,363 INFO L290 TraceCheckUtils]: 2: Hoare triple {163103#true} assume true; {163103#true} is VALID [2022-04-28 08:16:59,363 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {163103#true} {163103#true} #217#return; {163103#true} is VALID [2022-04-28 08:16:59,363 INFO L272 TraceCheckUtils]: 4: Hoare triple {163103#true} call #t~ret16 := main(); {163103#true} is VALID [2022-04-28 08:16:59,363 INFO L290 TraceCheckUtils]: 5: Hoare triple {163103#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;havoc ~cond~0; {163103#true} is VALID [2022-04-28 08:16:59,363 INFO L290 TraceCheckUtils]: 6: Hoare triple {163103#true} assume !false;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~cond~0 := #t~nondet15;havoc #t~nondet15; {163103#true} is VALID [2022-04-28 08:16:59,364 INFO L290 TraceCheckUtils]: 7: Hoare triple {163103#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0; {163103#true} is VALID [2022-04-28 08:16:59,364 INFO L290 TraceCheckUtils]: 8: Hoare triple {163103#true} assume !(0 != ~p1~0); {163103#true} is VALID [2022-04-28 08:16:59,364 INFO L290 TraceCheckUtils]: 9: Hoare triple {163103#true} assume !(0 != ~p2~0); {163103#true} is VALID [2022-04-28 08:16:59,364 INFO L290 TraceCheckUtils]: 10: Hoare triple {163103#true} assume !(0 != ~p3~0); {163103#true} is VALID [2022-04-28 08:16:59,364 INFO L290 TraceCheckUtils]: 11: Hoare triple {163103#true} assume !(0 != ~p4~0); {163103#true} is VALID [2022-04-28 08:16:59,364 INFO L290 TraceCheckUtils]: 12: Hoare triple {163103#true} assume !(0 != ~p5~0); {163103#true} is VALID [2022-04-28 08:16:59,364 INFO L290 TraceCheckUtils]: 13: Hoare triple {163103#true} assume !(0 != ~p6~0); {163103#true} is VALID [2022-04-28 08:16:59,364 INFO L290 TraceCheckUtils]: 14: Hoare triple {163103#true} assume !(0 != ~p7~0); {163103#true} is VALID [2022-04-28 08:16:59,395 INFO L290 TraceCheckUtils]: 15: Hoare triple {163103#true} assume 0 != ~p8~0;~lk8~0 := 1; {163108#(= main_~lk8~0 1)} is VALID [2022-04-28 08:16:59,395 INFO L290 TraceCheckUtils]: 16: Hoare triple {163108#(= main_~lk8~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {163108#(= main_~lk8~0 1)} is VALID [2022-04-28 08:16:59,395 INFO L290 TraceCheckUtils]: 17: Hoare triple {163108#(= main_~lk8~0 1)} assume !(0 != ~p10~0); {163108#(= main_~lk8~0 1)} is VALID [2022-04-28 08:16:59,396 INFO L290 TraceCheckUtils]: 18: Hoare triple {163108#(= main_~lk8~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {163108#(= main_~lk8~0 1)} is VALID [2022-04-28 08:16:59,396 INFO L290 TraceCheckUtils]: 19: Hoare triple {163108#(= main_~lk8~0 1)} assume !(0 != ~p1~0); {163108#(= main_~lk8~0 1)} is VALID [2022-04-28 08:16:59,396 INFO L290 TraceCheckUtils]: 20: Hoare triple {163108#(= main_~lk8~0 1)} assume !(0 != ~p2~0); {163108#(= main_~lk8~0 1)} is VALID [2022-04-28 08:16:59,396 INFO L290 TraceCheckUtils]: 21: Hoare triple {163108#(= main_~lk8~0 1)} assume !(0 != ~p3~0); {163108#(= main_~lk8~0 1)} is VALID [2022-04-28 08:16:59,396 INFO L290 TraceCheckUtils]: 22: Hoare triple {163108#(= main_~lk8~0 1)} assume !(0 != ~p4~0); {163108#(= main_~lk8~0 1)} is VALID [2022-04-28 08:16:59,397 INFO L290 TraceCheckUtils]: 23: Hoare triple {163108#(= main_~lk8~0 1)} assume !(0 != ~p5~0); {163108#(= main_~lk8~0 1)} is VALID [2022-04-28 08:16:59,397 INFO L290 TraceCheckUtils]: 24: Hoare triple {163108#(= main_~lk8~0 1)} assume !(0 != ~p6~0); {163108#(= main_~lk8~0 1)} is VALID [2022-04-28 08:16:59,397 INFO L290 TraceCheckUtils]: 25: Hoare triple {163108#(= main_~lk8~0 1)} assume !(0 != ~p7~0); {163108#(= main_~lk8~0 1)} is VALID [2022-04-28 08:16:59,397 INFO L290 TraceCheckUtils]: 26: Hoare triple {163108#(= main_~lk8~0 1)} assume 0 != ~p8~0; {163108#(= main_~lk8~0 1)} is VALID [2022-04-28 08:16:59,397 INFO L290 TraceCheckUtils]: 27: Hoare triple {163108#(= main_~lk8~0 1)} assume 1 != ~lk8~0; {163104#false} is VALID [2022-04-28 08:16:59,397 INFO L290 TraceCheckUtils]: 28: Hoare triple {163104#false} assume !false; {163104#false} is VALID [2022-04-28 08:16:59,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 08:16:59,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:16:59,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078017918] [2022-04-28 08:16:59,398 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078017918] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:16:59,398 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:16:59,398 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:16:59,398 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:16:59,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [719307536] [2022-04-28 08:16:59,398 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [719307536] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:16:59,398 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:16:59,398 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:16:59,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690347418] [2022-04-28 08:16:59,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:16:59,399 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 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 29 [2022-04-28 08:16:59,399 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:16:59,399 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:16:59,409 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:16:59,409 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:16:59,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:16:59,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:16:59,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:16:59,409 INFO L87 Difference]: Start difference. First operand 4169 states and 5959 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:17:02,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:17:02,202 INFO L93 Difference]: Finished difference Result 7181 states and 10441 transitions. [2022-04-28 08:17:02,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:17:02,202 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 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 29 [2022-04-28 08:17:02,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:17:02,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:17:02,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 115 transitions. [2022-04-28 08:17:02,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:17:02,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 115 transitions. [2022-04-28 08:17:02,204 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 115 transitions. [2022-04-28 08:17:02,266 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 115 edges. 115 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:17:04,427 INFO L225 Difference]: With dead ends: 7181 [2022-04-28 08:17:04,427 INFO L226 Difference]: Without dead ends: 7179 [2022-04-28 08:17:04,428 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:17:04,428 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 136 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 08:17:04,428 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 77 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 08:17:04,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7179 states. [2022-04-28 08:17:04,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7179 to 6153. [2022-04-28 08:17:04,882 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:17:04,888 INFO L82 GeneralOperation]: Start isEquivalent. First operand 7179 states. Second operand has 6153 states, 6149 states have (on average 1.3849406407545943) internal successors, (8516), 6149 states have internal predecessors, (8516), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:17:04,892 INFO L74 IsIncluded]: Start isIncluded. First operand 7179 states. Second operand has 6153 states, 6149 states have (on average 1.3849406407545943) internal successors, (8516), 6149 states have internal predecessors, (8516), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:17:04,897 INFO L87 Difference]: Start difference. First operand 7179 states. Second operand has 6153 states, 6149 states have (on average 1.3849406407545943) internal successors, (8516), 6149 states have internal predecessors, (8516), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:17:06,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:17:06,229 INFO L93 Difference]: Finished difference Result 7179 states and 10312 transitions. [2022-04-28 08:17:06,229 INFO L276 IsEmpty]: Start isEmpty. Operand 7179 states and 10312 transitions. [2022-04-28 08:17:06,235 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:17:06,235 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:17:06,242 INFO L74 IsIncluded]: Start isIncluded. First operand has 6153 states, 6149 states have (on average 1.3849406407545943) internal successors, (8516), 6149 states have internal predecessors, (8516), 2 states have call successors, (2), 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 7179 states. [2022-04-28 08:17:06,246 INFO L87 Difference]: Start difference. First operand has 6153 states, 6149 states have (on average 1.3849406407545943) internal successors, (8516), 6149 states have internal predecessors, (8516), 2 states have call successors, (2), 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 7179 states. [2022-04-28 08:17:07,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:17:07,587 INFO L93 Difference]: Finished difference Result 7179 states and 10312 transitions. [2022-04-28 08:17:07,587 INFO L276 IsEmpty]: Start isEmpty. Operand 7179 states and 10312 transitions. [2022-04-28 08:17:07,593 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:17:07,593 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:17:07,593 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:17:07,593 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:17:07,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6153 states, 6149 states have (on average 1.3849406407545943) internal successors, (8516), 6149 states have internal predecessors, (8516), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:17:09,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6153 states to 6153 states and 8519 transitions. [2022-04-28 08:17:09,269 INFO L78 Accepts]: Start accepts. Automaton has 6153 states and 8519 transitions. Word has length 29 [2022-04-28 08:17:09,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:17:09,269 INFO L495 AbstractCegarLoop]: Abstraction has 6153 states and 8519 transitions. [2022-04-28 08:17:09,270 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:17:09,270 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6153 states and 8519 transitions. [2022-04-28 08:17:16,797 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 8519 edges. 8519 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:17:16,797 INFO L276 IsEmpty]: Start isEmpty. Operand 6153 states and 8519 transitions. [2022-04-28 08:17:16,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-28 08:17:16,802 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:17:16,802 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:17:16,802 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-04-28 08:17:16,802 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:17:16,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:17:16,807 INFO L85 PathProgramCache]: Analyzing trace with hash 391874769, now seen corresponding path program 1 times [2022-04-28 08:17:16,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:17:16,807 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [468717350] [2022-04-28 08:17:16,808 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:17:16,808 INFO L85 PathProgramCache]: Analyzing trace with hash 391874769, now seen corresponding path program 2 times [2022-04-28 08:17:16,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:17:16,810 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840525982] [2022-04-28 08:17:16,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:17:16,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:17:16,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:17:16,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:17:16,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:17:16,874 INFO L290 TraceCheckUtils]: 0: Hoare triple {204147#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {204141#true} is VALID [2022-04-28 08:17:16,874 INFO L290 TraceCheckUtils]: 1: Hoare triple {204141#true} assume true; {204141#true} is VALID [2022-04-28 08:17:16,874 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {204141#true} {204141#true} #217#return; {204141#true} is VALID [2022-04-28 08:17:16,874 INFO L272 TraceCheckUtils]: 0: Hoare triple {204141#true} call ULTIMATE.init(); {204147#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:17:16,875 INFO L290 TraceCheckUtils]: 1: Hoare triple {204147#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {204141#true} is VALID [2022-04-28 08:17:16,875 INFO L290 TraceCheckUtils]: 2: Hoare triple {204141#true} assume true; {204141#true} is VALID [2022-04-28 08:17:16,875 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {204141#true} {204141#true} #217#return; {204141#true} is VALID [2022-04-28 08:17:16,875 INFO L272 TraceCheckUtils]: 4: Hoare triple {204141#true} call #t~ret16 := main(); {204141#true} is VALID [2022-04-28 08:17:16,875 INFO L290 TraceCheckUtils]: 5: Hoare triple {204141#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;havoc ~cond~0; {204141#true} is VALID [2022-04-28 08:17:16,875 INFO L290 TraceCheckUtils]: 6: Hoare triple {204141#true} assume !false;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~cond~0 := #t~nondet15;havoc #t~nondet15; {204141#true} is VALID [2022-04-28 08:17:16,875 INFO L290 TraceCheckUtils]: 7: Hoare triple {204141#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0; {204141#true} is VALID [2022-04-28 08:17:16,875 INFO L290 TraceCheckUtils]: 8: Hoare triple {204141#true} assume !(0 != ~p1~0); {204141#true} is VALID [2022-04-28 08:17:16,875 INFO L290 TraceCheckUtils]: 9: Hoare triple {204141#true} assume !(0 != ~p2~0); {204141#true} is VALID [2022-04-28 08:17:16,875 INFO L290 TraceCheckUtils]: 10: Hoare triple {204141#true} assume !(0 != ~p3~0); {204141#true} is VALID [2022-04-28 08:17:16,875 INFO L290 TraceCheckUtils]: 11: Hoare triple {204141#true} assume !(0 != ~p4~0); {204141#true} is VALID [2022-04-28 08:17:16,875 INFO L290 TraceCheckUtils]: 12: Hoare triple {204141#true} assume !(0 != ~p5~0); {204141#true} is VALID [2022-04-28 08:17:16,875 INFO L290 TraceCheckUtils]: 13: Hoare triple {204141#true} assume !(0 != ~p6~0); {204141#true} is VALID [2022-04-28 08:17:16,876 INFO L290 TraceCheckUtils]: 14: Hoare triple {204141#true} assume !(0 != ~p7~0); {204141#true} is VALID [2022-04-28 08:17:16,876 INFO L290 TraceCheckUtils]: 15: Hoare triple {204141#true} assume !(0 != ~p8~0); {204146#(= main_~p8~0 0)} is VALID [2022-04-28 08:17:16,876 INFO L290 TraceCheckUtils]: 16: Hoare triple {204146#(= main_~p8~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {204146#(= main_~p8~0 0)} is VALID [2022-04-28 08:17:16,876 INFO L290 TraceCheckUtils]: 17: Hoare triple {204146#(= main_~p8~0 0)} assume !(0 != ~p10~0); {204146#(= main_~p8~0 0)} is VALID [2022-04-28 08:17:16,876 INFO L290 TraceCheckUtils]: 18: Hoare triple {204146#(= main_~p8~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {204146#(= main_~p8~0 0)} is VALID [2022-04-28 08:17:16,877 INFO L290 TraceCheckUtils]: 19: Hoare triple {204146#(= main_~p8~0 0)} assume !(0 != ~p1~0); {204146#(= main_~p8~0 0)} is VALID [2022-04-28 08:17:16,877 INFO L290 TraceCheckUtils]: 20: Hoare triple {204146#(= main_~p8~0 0)} assume !(0 != ~p2~0); {204146#(= main_~p8~0 0)} is VALID [2022-04-28 08:17:16,877 INFO L290 TraceCheckUtils]: 21: Hoare triple {204146#(= main_~p8~0 0)} assume !(0 != ~p3~0); {204146#(= main_~p8~0 0)} is VALID [2022-04-28 08:17:16,877 INFO L290 TraceCheckUtils]: 22: Hoare triple {204146#(= main_~p8~0 0)} assume !(0 != ~p4~0); {204146#(= main_~p8~0 0)} is VALID [2022-04-28 08:17:16,878 INFO L290 TraceCheckUtils]: 23: Hoare triple {204146#(= main_~p8~0 0)} assume !(0 != ~p5~0); {204146#(= main_~p8~0 0)} is VALID [2022-04-28 08:17:16,878 INFO L290 TraceCheckUtils]: 24: Hoare triple {204146#(= main_~p8~0 0)} assume !(0 != ~p6~0); {204146#(= main_~p8~0 0)} is VALID [2022-04-28 08:17:16,878 INFO L290 TraceCheckUtils]: 25: Hoare triple {204146#(= main_~p8~0 0)} assume !(0 != ~p7~0); {204146#(= main_~p8~0 0)} is VALID [2022-04-28 08:17:16,879 INFO L290 TraceCheckUtils]: 26: Hoare triple {204146#(= main_~p8~0 0)} assume 0 != ~p8~0; {204142#false} is VALID [2022-04-28 08:17:16,879 INFO L290 TraceCheckUtils]: 27: Hoare triple {204142#false} assume 1 != ~lk8~0; {204142#false} is VALID [2022-04-28 08:17:16,879 INFO L290 TraceCheckUtils]: 28: Hoare triple {204142#false} assume !false; {204142#false} is VALID [2022-04-28 08:17:16,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 08:17:16,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:17:16,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840525982] [2022-04-28 08:17:16,879 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840525982] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:17:16,880 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:17:16,880 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:17:16,880 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:17:16,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [468717350] [2022-04-28 08:17:16,880 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [468717350] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:17:16,880 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:17:16,880 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:17:16,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609591132] [2022-04-28 08:17:16,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:17:16,880 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 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 29 [2022-04-28 08:17:16,881 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:17:16,881 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:17:16,893 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:17:16,893 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:17:16,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:17:16,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:17:16,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:17:16,894 INFO L87 Difference]: Start difference. First operand 6153 states and 8519 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:17:25,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:17:25,943 INFO L93 Difference]: Finished difference Result 14093 states and 19529 transitions. [2022-04-28 08:17:25,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:17:25,944 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 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 29 [2022-04-28 08:17:25,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:17:25,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:17:25,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 189 transitions. [2022-04-28 08:17:25,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:17:25,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 189 transitions. [2022-04-28 08:17:25,946 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 189 transitions. [2022-04-28 08:17:26,044 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 189 edges. 189 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:17:28,768 INFO L225 Difference]: With dead ends: 14093 [2022-04-28 08:17:28,769 INFO L226 Difference]: Without dead ends: 8075 [2022-04-28 08:17:28,775 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:17:28,775 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 121 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 08:17:28,776 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 117 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 08:17:28,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8075 states. [2022-04-28 08:17:29,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8075 to 8073. [2022-04-28 08:17:29,372 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:17:29,379 INFO L82 GeneralOperation]: Start isEquivalent. First operand 8075 states. Second operand has 8073 states, 8069 states have (on average 1.3647292105589293) internal successors, (11012), 8069 states have internal predecessors, (11012), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:17:29,385 INFO L74 IsIncluded]: Start isIncluded. First operand 8075 states. Second operand has 8073 states, 8069 states have (on average 1.3647292105589293) internal successors, (11012), 8069 states have internal predecessors, (11012), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:17:29,391 INFO L87 Difference]: Start difference. First operand 8075 states. Second operand has 8073 states, 8069 states have (on average 1.3647292105589293) internal successors, (11012), 8069 states have internal predecessors, (11012), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:17:31,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:17:31,069 INFO L93 Difference]: Finished difference Result 8075 states and 11016 transitions. [2022-04-28 08:17:31,069 INFO L276 IsEmpty]: Start isEmpty. Operand 8075 states and 11016 transitions. [2022-04-28 08:17:31,076 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:17:31,076 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:17:31,084 INFO L74 IsIncluded]: Start isIncluded. First operand has 8073 states, 8069 states have (on average 1.3647292105589293) internal successors, (11012), 8069 states have internal predecessors, (11012), 2 states have call successors, (2), 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 8075 states. [2022-04-28 08:17:31,089 INFO L87 Difference]: Start difference. First operand has 8073 states, 8069 states have (on average 1.3647292105589293) internal successors, (11012), 8069 states have internal predecessors, (11012), 2 states have call successors, (2), 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 8075 states. [2022-04-28 08:17:32,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:17:32,780 INFO L93 Difference]: Finished difference Result 8075 states and 11016 transitions. [2022-04-28 08:17:32,780 INFO L276 IsEmpty]: Start isEmpty. Operand 8075 states and 11016 transitions. [2022-04-28 08:17:32,786 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:17:32,786 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:17:32,786 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:17:32,786 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:17:32,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8073 states, 8069 states have (on average 1.3647292105589293) internal successors, (11012), 8069 states have internal predecessors, (11012), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:17:35,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8073 states to 8073 states and 11015 transitions. [2022-04-28 08:17:35,556 INFO L78 Accepts]: Start accepts. Automaton has 8073 states and 11015 transitions. Word has length 29 [2022-04-28 08:17:35,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:17:35,556 INFO L495 AbstractCegarLoop]: Abstraction has 8073 states and 11015 transitions. [2022-04-28 08:17:35,556 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:17:35,556 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8073 states and 11015 transitions. [2022-04-28 08:17:45,700 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11015 edges. 11015 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:17:45,700 INFO L276 IsEmpty]: Start isEmpty. Operand 8073 states and 11015 transitions. [2022-04-28 08:17:45,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-28 08:17:45,705 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:17:45,706 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:17:45,706 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-04-28 08:17:45,706 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:17:45,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:17:45,706 INFO L85 PathProgramCache]: Analyzing trace with hash 543295075, now seen corresponding path program 1 times [2022-04-28 08:17:45,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:17:45,706 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [240027124] [2022-04-28 08:17:45,706 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:17:45,707 INFO L85 PathProgramCache]: Analyzing trace with hash 543295075, now seen corresponding path program 2 times [2022-04-28 08:17:45,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:17:45,707 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180881048] [2022-04-28 08:17:45,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:17:45,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:17:45,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:17:45,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:17:45,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:17:45,751 INFO L290 TraceCheckUtils]: 0: Hoare triple {264641#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {264635#true} is VALID [2022-04-28 08:17:45,752 INFO L290 TraceCheckUtils]: 1: Hoare triple {264635#true} assume true; {264635#true} is VALID [2022-04-28 08:17:45,752 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {264635#true} {264635#true} #217#return; {264635#true} is VALID [2022-04-28 08:17:45,752 INFO L272 TraceCheckUtils]: 0: Hoare triple {264635#true} call ULTIMATE.init(); {264641#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:17:45,752 INFO L290 TraceCheckUtils]: 1: Hoare triple {264641#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {264635#true} is VALID [2022-04-28 08:17:45,752 INFO L290 TraceCheckUtils]: 2: Hoare triple {264635#true} assume true; {264635#true} is VALID [2022-04-28 08:17:45,752 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {264635#true} {264635#true} #217#return; {264635#true} is VALID [2022-04-28 08:17:45,752 INFO L272 TraceCheckUtils]: 4: Hoare triple {264635#true} call #t~ret16 := main(); {264635#true} is VALID [2022-04-28 08:17:45,753 INFO L290 TraceCheckUtils]: 5: Hoare triple {264635#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;havoc ~cond~0; {264635#true} is VALID [2022-04-28 08:17:45,753 INFO L290 TraceCheckUtils]: 6: Hoare triple {264635#true} assume !false;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~cond~0 := #t~nondet15;havoc #t~nondet15; {264635#true} is VALID [2022-04-28 08:17:45,753 INFO L290 TraceCheckUtils]: 7: Hoare triple {264635#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0; {264635#true} is VALID [2022-04-28 08:17:45,753 INFO L290 TraceCheckUtils]: 8: Hoare triple {264635#true} assume !(0 != ~p1~0); {264635#true} is VALID [2022-04-28 08:17:45,754 INFO L290 TraceCheckUtils]: 9: Hoare triple {264635#true} assume !(0 != ~p2~0); {264635#true} is VALID [2022-04-28 08:17:45,754 INFO L290 TraceCheckUtils]: 10: Hoare triple {264635#true} assume !(0 != ~p3~0); {264635#true} is VALID [2022-04-28 08:17:45,754 INFO L290 TraceCheckUtils]: 11: Hoare triple {264635#true} assume !(0 != ~p4~0); {264635#true} is VALID [2022-04-28 08:17:45,754 INFO L290 TraceCheckUtils]: 12: Hoare triple {264635#true} assume !(0 != ~p5~0); {264635#true} is VALID [2022-04-28 08:17:45,754 INFO L290 TraceCheckUtils]: 13: Hoare triple {264635#true} assume !(0 != ~p6~0); {264635#true} is VALID [2022-04-28 08:17:45,754 INFO L290 TraceCheckUtils]: 14: Hoare triple {264635#true} assume !(0 != ~p7~0); {264635#true} is VALID [2022-04-28 08:17:45,754 INFO L290 TraceCheckUtils]: 15: Hoare triple {264635#true} assume 0 != ~p8~0;~lk8~0 := 1; {264640#(not (= main_~p8~0 0))} is VALID [2022-04-28 08:17:45,754 INFO L290 TraceCheckUtils]: 16: Hoare triple {264640#(not (= main_~p8~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {264640#(not (= main_~p8~0 0))} is VALID [2022-04-28 08:17:45,755 INFO L290 TraceCheckUtils]: 17: Hoare triple {264640#(not (= main_~p8~0 0))} assume !(0 != ~p10~0); {264640#(not (= main_~p8~0 0))} is VALID [2022-04-28 08:17:45,755 INFO L290 TraceCheckUtils]: 18: Hoare triple {264640#(not (= main_~p8~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {264640#(not (= main_~p8~0 0))} is VALID [2022-04-28 08:17:45,755 INFO L290 TraceCheckUtils]: 19: Hoare triple {264640#(not (= main_~p8~0 0))} assume !(0 != ~p1~0); {264640#(not (= main_~p8~0 0))} is VALID [2022-04-28 08:17:45,755 INFO L290 TraceCheckUtils]: 20: Hoare triple {264640#(not (= main_~p8~0 0))} assume !(0 != ~p2~0); {264640#(not (= main_~p8~0 0))} is VALID [2022-04-28 08:17:45,755 INFO L290 TraceCheckUtils]: 21: Hoare triple {264640#(not (= main_~p8~0 0))} assume !(0 != ~p3~0); {264640#(not (= main_~p8~0 0))} is VALID [2022-04-28 08:17:45,756 INFO L290 TraceCheckUtils]: 22: Hoare triple {264640#(not (= main_~p8~0 0))} assume !(0 != ~p4~0); {264640#(not (= main_~p8~0 0))} is VALID [2022-04-28 08:17:45,756 INFO L290 TraceCheckUtils]: 23: Hoare triple {264640#(not (= main_~p8~0 0))} assume !(0 != ~p5~0); {264640#(not (= main_~p8~0 0))} is VALID [2022-04-28 08:17:45,756 INFO L290 TraceCheckUtils]: 24: Hoare triple {264640#(not (= main_~p8~0 0))} assume !(0 != ~p6~0); {264640#(not (= main_~p8~0 0))} is VALID [2022-04-28 08:17:45,756 INFO L290 TraceCheckUtils]: 25: Hoare triple {264640#(not (= main_~p8~0 0))} assume !(0 != ~p7~0); {264640#(not (= main_~p8~0 0))} is VALID [2022-04-28 08:17:45,757 INFO L290 TraceCheckUtils]: 26: Hoare triple {264640#(not (= main_~p8~0 0))} assume !(0 != ~p8~0); {264636#false} is VALID [2022-04-28 08:17:45,757 INFO L290 TraceCheckUtils]: 27: Hoare triple {264636#false} assume 0 != ~p9~0; {264636#false} is VALID [2022-04-28 08:17:45,757 INFO L290 TraceCheckUtils]: 28: Hoare triple {264636#false} assume 1 != ~lk9~0; {264636#false} is VALID [2022-04-28 08:17:45,757 INFO L290 TraceCheckUtils]: 29: Hoare triple {264636#false} assume !false; {264636#false} is VALID [2022-04-28 08:17:45,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 08:17:45,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:17:45,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180881048] [2022-04-28 08:17:45,757 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [180881048] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:17:45,757 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:17:45,757 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:17:45,759 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:17:45,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [240027124] [2022-04-28 08:17:45,759 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [240027124] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:17:45,759 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:17:45,759 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:17:45,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421881398] [2022-04-28 08:17:45,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:17:45,760 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 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 30 [2022-04-28 08:17:45,760 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:17:45,760 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:17:45,773 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:17:45,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:17:45,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:17:45,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:17:45,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:17:45,774 INFO L87 Difference]: Start difference. First operand 8073 states and 11015 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:17:52,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:17:52,219 INFO L93 Difference]: Finished difference Result 12109 states and 16457 transitions. [2022-04-28 08:17:52,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:17:52,219 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 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 30 [2022-04-28 08:17:52,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:17:52,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:17:52,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 184 transitions. [2022-04-28 08:17:52,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:17:52,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 184 transitions. [2022-04-28 08:17:52,221 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 184 transitions. [2022-04-28 08:17:52,312 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 184 edges. 184 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:17:55,112 INFO L225 Difference]: With dead ends: 12109 [2022-04-28 08:17:55,113 INFO L226 Difference]: Without dead ends: 8203 [2022-04-28 08:17:55,117 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:17:55,122 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 137 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 08:17:55,123 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 102 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 08:17:55,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8203 states. [2022-04-28 08:17:55,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8203 to 8201. [2022-04-28 08:17:55,765 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:17:55,773 INFO L82 GeneralOperation]: Start isEquivalent. First operand 8203 states. Second operand has 8201 states, 8197 states have (on average 1.3434183237769917) internal successors, (11012), 8197 states have internal predecessors, (11012), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:17:55,778 INFO L74 IsIncluded]: Start isIncluded. First operand 8203 states. Second operand has 8201 states, 8197 states have (on average 1.3434183237769917) internal successors, (11012), 8197 states have internal predecessors, (11012), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:17:55,782 INFO L87 Difference]: Start difference. First operand 8203 states. Second operand has 8201 states, 8197 states have (on average 1.3434183237769917) internal successors, (11012), 8197 states have internal predecessors, (11012), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:17:57,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:17:57,444 INFO L93 Difference]: Finished difference Result 8203 states and 11016 transitions. [2022-04-28 08:17:57,444 INFO L276 IsEmpty]: Start isEmpty. Operand 8203 states and 11016 transitions. [2022-04-28 08:17:57,450 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:17:57,450 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:17:57,458 INFO L74 IsIncluded]: Start isIncluded. First operand has 8201 states, 8197 states have (on average 1.3434183237769917) internal successors, (11012), 8197 states have internal predecessors, (11012), 2 states have call successors, (2), 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 8203 states. [2022-04-28 08:17:57,463 INFO L87 Difference]: Start difference. First operand has 8201 states, 8197 states have (on average 1.3434183237769917) internal successors, (11012), 8197 states have internal predecessors, (11012), 2 states have call successors, (2), 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 8203 states. [2022-04-28 08:17:59,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:17:59,143 INFO L93 Difference]: Finished difference Result 8203 states and 11016 transitions. [2022-04-28 08:17:59,143 INFO L276 IsEmpty]: Start isEmpty. Operand 8203 states and 11016 transitions. [2022-04-28 08:17:59,164 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:17:59,164 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:17:59,164 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:17:59,164 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:17:59,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8201 states, 8197 states have (on average 1.3434183237769917) internal successors, (11012), 8197 states have internal predecessors, (11012), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:18:02,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8201 states to 8201 states and 11015 transitions. [2022-04-28 08:18:02,030 INFO L78 Accepts]: Start accepts. Automaton has 8201 states and 11015 transitions. Word has length 30 [2022-04-28 08:18:02,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:18:02,030 INFO L495 AbstractCegarLoop]: Abstraction has 8201 states and 11015 transitions. [2022-04-28 08:18:02,030 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:18:02,030 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8201 states and 11015 transitions. [2022-04-28 08:18:12,623 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11015 edges. 11015 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:18:12,623 INFO L276 IsEmpty]: Start isEmpty. Operand 8201 states and 11015 transitions. [2022-04-28 08:18:12,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-28 08:18:12,637 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:18:12,637 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:18:12,637 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-04-28 08:18:12,637 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:18:12,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:18:12,637 INFO L85 PathProgramCache]: Analyzing trace with hash -736568603, now seen corresponding path program 1 times [2022-04-28 08:18:12,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:18:12,637 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [903311977] [2022-04-28 08:18:12,638 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:18:12,638 INFO L85 PathProgramCache]: Analyzing trace with hash -736568603, now seen corresponding path program 2 times [2022-04-28 08:18:12,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:18:12,638 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833543829] [2022-04-28 08:18:12,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:18:12,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:18:12,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:18:12,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:18:12,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:18:12,688 INFO L290 TraceCheckUtils]: 0: Hoare triple {321679#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {321673#true} is VALID [2022-04-28 08:18:12,689 INFO L290 TraceCheckUtils]: 1: Hoare triple {321673#true} assume true; {321673#true} is VALID [2022-04-28 08:18:12,689 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {321673#true} {321673#true} #217#return; {321673#true} is VALID [2022-04-28 08:18:12,689 INFO L272 TraceCheckUtils]: 0: Hoare triple {321673#true} call ULTIMATE.init(); {321679#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:18:12,689 INFO L290 TraceCheckUtils]: 1: Hoare triple {321679#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {321673#true} is VALID [2022-04-28 08:18:12,689 INFO L290 TraceCheckUtils]: 2: Hoare triple {321673#true} assume true; {321673#true} is VALID [2022-04-28 08:18:12,689 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {321673#true} {321673#true} #217#return; {321673#true} is VALID [2022-04-28 08:18:12,689 INFO L272 TraceCheckUtils]: 4: Hoare triple {321673#true} call #t~ret16 := main(); {321673#true} is VALID [2022-04-28 08:18:12,689 INFO L290 TraceCheckUtils]: 5: Hoare triple {321673#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;havoc ~cond~0; {321673#true} is VALID [2022-04-28 08:18:12,689 INFO L290 TraceCheckUtils]: 6: Hoare triple {321673#true} assume !false;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~cond~0 := #t~nondet15;havoc #t~nondet15; {321673#true} is VALID [2022-04-28 08:18:12,690 INFO L290 TraceCheckUtils]: 7: Hoare triple {321673#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0; {321673#true} is VALID [2022-04-28 08:18:12,690 INFO L290 TraceCheckUtils]: 8: Hoare triple {321673#true} assume !(0 != ~p1~0); {321673#true} is VALID [2022-04-28 08:18:12,690 INFO L290 TraceCheckUtils]: 9: Hoare triple {321673#true} assume !(0 != ~p2~0); {321673#true} is VALID [2022-04-28 08:18:12,690 INFO L290 TraceCheckUtils]: 10: Hoare triple {321673#true} assume !(0 != ~p3~0); {321673#true} is VALID [2022-04-28 08:18:12,690 INFO L290 TraceCheckUtils]: 11: Hoare triple {321673#true} assume !(0 != ~p4~0); {321673#true} is VALID [2022-04-28 08:18:12,690 INFO L290 TraceCheckUtils]: 12: Hoare triple {321673#true} assume !(0 != ~p5~0); {321673#true} is VALID [2022-04-28 08:18:12,690 INFO L290 TraceCheckUtils]: 13: Hoare triple {321673#true} assume !(0 != ~p6~0); {321673#true} is VALID [2022-04-28 08:18:12,690 INFO L290 TraceCheckUtils]: 14: Hoare triple {321673#true} assume !(0 != ~p7~0); {321673#true} is VALID [2022-04-28 08:18:12,690 INFO L290 TraceCheckUtils]: 15: Hoare triple {321673#true} assume !(0 != ~p8~0); {321673#true} is VALID [2022-04-28 08:18:12,690 INFO L290 TraceCheckUtils]: 16: Hoare triple {321673#true} assume 0 != ~p9~0;~lk9~0 := 1; {321678#(= main_~lk9~0 1)} is VALID [2022-04-28 08:18:12,691 INFO L290 TraceCheckUtils]: 17: Hoare triple {321678#(= main_~lk9~0 1)} assume !(0 != ~p10~0); {321678#(= main_~lk9~0 1)} is VALID [2022-04-28 08:18:12,691 INFO L290 TraceCheckUtils]: 18: Hoare triple {321678#(= main_~lk9~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {321678#(= main_~lk9~0 1)} is VALID [2022-04-28 08:18:12,691 INFO L290 TraceCheckUtils]: 19: Hoare triple {321678#(= main_~lk9~0 1)} assume !(0 != ~p1~0); {321678#(= main_~lk9~0 1)} is VALID [2022-04-28 08:18:12,691 INFO L290 TraceCheckUtils]: 20: Hoare triple {321678#(= main_~lk9~0 1)} assume !(0 != ~p2~0); {321678#(= main_~lk9~0 1)} is VALID [2022-04-28 08:18:12,692 INFO L290 TraceCheckUtils]: 21: Hoare triple {321678#(= main_~lk9~0 1)} assume !(0 != ~p3~0); {321678#(= main_~lk9~0 1)} is VALID [2022-04-28 08:18:12,692 INFO L290 TraceCheckUtils]: 22: Hoare triple {321678#(= main_~lk9~0 1)} assume !(0 != ~p4~0); {321678#(= main_~lk9~0 1)} is VALID [2022-04-28 08:18:12,692 INFO L290 TraceCheckUtils]: 23: Hoare triple {321678#(= main_~lk9~0 1)} assume !(0 != ~p5~0); {321678#(= main_~lk9~0 1)} is VALID [2022-04-28 08:18:12,692 INFO L290 TraceCheckUtils]: 24: Hoare triple {321678#(= main_~lk9~0 1)} assume !(0 != ~p6~0); {321678#(= main_~lk9~0 1)} is VALID [2022-04-28 08:18:12,692 INFO L290 TraceCheckUtils]: 25: Hoare triple {321678#(= main_~lk9~0 1)} assume !(0 != ~p7~0); {321678#(= main_~lk9~0 1)} is VALID [2022-04-28 08:18:12,693 INFO L290 TraceCheckUtils]: 26: Hoare triple {321678#(= main_~lk9~0 1)} assume !(0 != ~p8~0); {321678#(= main_~lk9~0 1)} is VALID [2022-04-28 08:18:12,693 INFO L290 TraceCheckUtils]: 27: Hoare triple {321678#(= main_~lk9~0 1)} assume 0 != ~p9~0; {321678#(= main_~lk9~0 1)} is VALID [2022-04-28 08:18:12,693 INFO L290 TraceCheckUtils]: 28: Hoare triple {321678#(= main_~lk9~0 1)} assume 1 != ~lk9~0; {321674#false} is VALID [2022-04-28 08:18:12,693 INFO L290 TraceCheckUtils]: 29: Hoare triple {321674#false} assume !false; {321674#false} is VALID [2022-04-28 08:18:12,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 08:18:12,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:18:12,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833543829] [2022-04-28 08:18:12,694 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833543829] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:18:12,694 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:18:12,694 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:18:12,694 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:18:12,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [903311977] [2022-04-28 08:18:12,695 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [903311977] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:18:12,695 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:18:12,695 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:18:12,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970981064] [2022-04-28 08:18:12,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:18:12,695 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 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 30 [2022-04-28 08:18:12,696 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:18:12,696 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:18:12,710 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:18:12,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:18:12,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:18:12,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:18:12,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:18:12,710 INFO L87 Difference]: Start difference. First operand 8201 states and 11015 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:18:22,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:18:22,214 INFO L93 Difference]: Finished difference Result 13837 states and 18825 transitions. [2022-04-28 08:18:22,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:18:22,214 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 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 30 [2022-04-28 08:18:22,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:18:22,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:18:22,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 111 transitions. [2022-04-28 08:18:22,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:18:22,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 111 transitions. [2022-04-28 08:18:22,216 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 111 transitions. [2022-04-28 08:18:22,279 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:18:30,744 INFO L225 Difference]: With dead ends: 13837 [2022-04-28 08:18:30,744 INFO L226 Difference]: Without dead ends: 13835 [2022-04-28 08:18:30,747 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:18:30,749 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 129 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 08:18:30,749 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 76 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 08:18:30,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13835 states. [2022-04-28 08:18:31,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13835 to 12297. [2022-04-28 08:18:31,722 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:18:31,734 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13835 states. Second operand has 12297 states, 12293 states have (on average 1.3018791181973481) internal successors, (16004), 12293 states have internal predecessors, (16004), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:18:31,747 INFO L74 IsIncluded]: Start isIncluded. First operand 13835 states. Second operand has 12297 states, 12293 states have (on average 1.3018791181973481) internal successors, (16004), 12293 states have internal predecessors, (16004), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:18:31,760 INFO L87 Difference]: Start difference. First operand 13835 states. Second operand has 12297 states, 12293 states have (on average 1.3018791181973481) internal successors, (16004), 12293 states have internal predecessors, (16004), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:18:36,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:18:36,961 INFO L93 Difference]: Finished difference Result 13835 states and 18568 transitions. [2022-04-28 08:18:36,961 INFO L276 IsEmpty]: Start isEmpty. Operand 13835 states and 18568 transitions. [2022-04-28 08:18:36,972 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:18:36,972 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:18:36,987 INFO L74 IsIncluded]: Start isIncluded. First operand has 12297 states, 12293 states have (on average 1.3018791181973481) internal successors, (16004), 12293 states have internal predecessors, (16004), 2 states have call successors, (2), 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 13835 states. [2022-04-28 08:18:37,000 INFO L87 Difference]: Start difference. First operand has 12297 states, 12293 states have (on average 1.3018791181973481) internal successors, (16004), 12293 states have internal predecessors, (16004), 2 states have call successors, (2), 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 13835 states. [2022-04-28 08:18:42,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:18:42,312 INFO L93 Difference]: Finished difference Result 13835 states and 18568 transitions. [2022-04-28 08:18:42,312 INFO L276 IsEmpty]: Start isEmpty. Operand 13835 states and 18568 transitions. [2022-04-28 08:18:42,325 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:18:42,325 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:18:42,325 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:18:42,325 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:18:42,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12297 states, 12293 states have (on average 1.3018791181973481) internal successors, (16004), 12293 states have internal predecessors, (16004), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:18:49,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12297 states to 12297 states and 16007 transitions. [2022-04-28 08:18:49,188 INFO L78 Accepts]: Start accepts. Automaton has 12297 states and 16007 transitions. Word has length 30 [2022-04-28 08:18:49,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:18:49,188 INFO L495 AbstractCegarLoop]: Abstraction has 12297 states and 16007 transitions. [2022-04-28 08:18:49,189 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:18:49,189 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12297 states and 16007 transitions. [2022-04-28 08:19:03,842 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16007 edges. 16007 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:19:03,842 INFO L276 IsEmpty]: Start isEmpty. Operand 12297 states and 16007 transitions. [2022-04-28 08:19:03,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-28 08:19:03,851 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:19:03,851 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:19:03,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-04-28 08:19:03,851 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:19:03,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:19:03,851 INFO L85 PathProgramCache]: Analyzing trace with hash -1747685853, now seen corresponding path program 1 times [2022-04-28 08:19:03,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:19:03,851 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [846472964] [2022-04-28 08:19:03,852 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:19:03,852 INFO L85 PathProgramCache]: Analyzing trace with hash -1747685853, now seen corresponding path program 2 times [2022-04-28 08:19:03,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:19:03,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724798961] [2022-04-28 08:19:03,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:19:03,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:19:03,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:19:03,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:19:03,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:19:03,888 INFO L290 TraceCheckUtils]: 0: Hoare triple {401629#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {401623#true} is VALID [2022-04-28 08:19:03,888 INFO L290 TraceCheckUtils]: 1: Hoare triple {401623#true} assume true; {401623#true} is VALID [2022-04-28 08:19:03,888 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {401623#true} {401623#true} #217#return; {401623#true} is VALID [2022-04-28 08:19:03,889 INFO L272 TraceCheckUtils]: 0: Hoare triple {401623#true} call ULTIMATE.init(); {401629#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:19:03,889 INFO L290 TraceCheckUtils]: 1: Hoare triple {401629#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {401623#true} is VALID [2022-04-28 08:19:03,889 INFO L290 TraceCheckUtils]: 2: Hoare triple {401623#true} assume true; {401623#true} is VALID [2022-04-28 08:19:03,889 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {401623#true} {401623#true} #217#return; {401623#true} is VALID [2022-04-28 08:19:03,889 INFO L272 TraceCheckUtils]: 4: Hoare triple {401623#true} call #t~ret16 := main(); {401623#true} is VALID [2022-04-28 08:19:03,889 INFO L290 TraceCheckUtils]: 5: Hoare triple {401623#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;havoc ~cond~0; {401623#true} is VALID [2022-04-28 08:19:03,889 INFO L290 TraceCheckUtils]: 6: Hoare triple {401623#true} assume !false;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~cond~0 := #t~nondet15;havoc #t~nondet15; {401623#true} is VALID [2022-04-28 08:19:03,889 INFO L290 TraceCheckUtils]: 7: Hoare triple {401623#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0; {401623#true} is VALID [2022-04-28 08:19:03,889 INFO L290 TraceCheckUtils]: 8: Hoare triple {401623#true} assume !(0 != ~p1~0); {401623#true} is VALID [2022-04-28 08:19:03,889 INFO L290 TraceCheckUtils]: 9: Hoare triple {401623#true} assume !(0 != ~p2~0); {401623#true} is VALID [2022-04-28 08:19:03,889 INFO L290 TraceCheckUtils]: 10: Hoare triple {401623#true} assume !(0 != ~p3~0); {401623#true} is VALID [2022-04-28 08:19:03,889 INFO L290 TraceCheckUtils]: 11: Hoare triple {401623#true} assume !(0 != ~p4~0); {401623#true} is VALID [2022-04-28 08:19:03,890 INFO L290 TraceCheckUtils]: 12: Hoare triple {401623#true} assume !(0 != ~p5~0); {401623#true} is VALID [2022-04-28 08:19:03,890 INFO L290 TraceCheckUtils]: 13: Hoare triple {401623#true} assume !(0 != ~p6~0); {401623#true} is VALID [2022-04-28 08:19:03,890 INFO L290 TraceCheckUtils]: 14: Hoare triple {401623#true} assume !(0 != ~p7~0); {401623#true} is VALID [2022-04-28 08:19:03,890 INFO L290 TraceCheckUtils]: 15: Hoare triple {401623#true} assume !(0 != ~p8~0); {401623#true} is VALID [2022-04-28 08:19:03,890 INFO L290 TraceCheckUtils]: 16: Hoare triple {401623#true} assume !(0 != ~p9~0); {401628#(= main_~p9~0 0)} is VALID [2022-04-28 08:19:03,890 INFO L290 TraceCheckUtils]: 17: Hoare triple {401628#(= main_~p9~0 0)} assume !(0 != ~p10~0); {401628#(= main_~p9~0 0)} is VALID [2022-04-28 08:19:03,901 INFO L290 TraceCheckUtils]: 18: Hoare triple {401628#(= main_~p9~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {401628#(= main_~p9~0 0)} is VALID [2022-04-28 08:19:03,902 INFO L290 TraceCheckUtils]: 19: Hoare triple {401628#(= main_~p9~0 0)} assume !(0 != ~p1~0); {401628#(= main_~p9~0 0)} is VALID [2022-04-28 08:19:03,902 INFO L290 TraceCheckUtils]: 20: Hoare triple {401628#(= main_~p9~0 0)} assume !(0 != ~p2~0); {401628#(= main_~p9~0 0)} is VALID [2022-04-28 08:19:03,902 INFO L290 TraceCheckUtils]: 21: Hoare triple {401628#(= main_~p9~0 0)} assume !(0 != ~p3~0); {401628#(= main_~p9~0 0)} is VALID [2022-04-28 08:19:03,902 INFO L290 TraceCheckUtils]: 22: Hoare triple {401628#(= main_~p9~0 0)} assume !(0 != ~p4~0); {401628#(= main_~p9~0 0)} is VALID [2022-04-28 08:19:03,902 INFO L290 TraceCheckUtils]: 23: Hoare triple {401628#(= main_~p9~0 0)} assume !(0 != ~p5~0); {401628#(= main_~p9~0 0)} is VALID [2022-04-28 08:19:03,903 INFO L290 TraceCheckUtils]: 24: Hoare triple {401628#(= main_~p9~0 0)} assume !(0 != ~p6~0); {401628#(= main_~p9~0 0)} is VALID [2022-04-28 08:19:03,903 INFO L290 TraceCheckUtils]: 25: Hoare triple {401628#(= main_~p9~0 0)} assume !(0 != ~p7~0); {401628#(= main_~p9~0 0)} is VALID [2022-04-28 08:19:03,903 INFO L290 TraceCheckUtils]: 26: Hoare triple {401628#(= main_~p9~0 0)} assume !(0 != ~p8~0); {401628#(= main_~p9~0 0)} is VALID [2022-04-28 08:19:03,903 INFO L290 TraceCheckUtils]: 27: Hoare triple {401628#(= main_~p9~0 0)} assume 0 != ~p9~0; {401624#false} is VALID [2022-04-28 08:19:03,903 INFO L290 TraceCheckUtils]: 28: Hoare triple {401624#false} assume 1 != ~lk9~0; {401624#false} is VALID [2022-04-28 08:19:03,903 INFO L290 TraceCheckUtils]: 29: Hoare triple {401624#false} assume !false; {401624#false} is VALID [2022-04-28 08:19:03,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 08:19:03,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:19:03,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724798961] [2022-04-28 08:19:03,904 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724798961] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:19:03,904 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:19:03,904 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:19:03,904 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:19:03,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [846472964] [2022-04-28 08:19:03,904 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [846472964] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:19:03,904 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:19:03,904 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:19:03,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173443317] [2022-04-28 08:19:03,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:19:03,905 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 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 30 [2022-04-28 08:19:03,905 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:19:03,905 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:19:03,918 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:19:03,918 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:19:03,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:19:03,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:19:03,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:19:03,919 INFO L87 Difference]: Start difference. First operand 12297 states and 16007 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:19:42,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:19:42,920 INFO L93 Difference]: Finished difference Result 27917 states and 36233 transitions. [2022-04-28 08:19:42,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:19:42,920 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 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 30 [2022-04-28 08:19:42,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:19:42,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:19:42,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 186 transitions. [2022-04-28 08:19:42,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:19:42,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 186 transitions. [2022-04-28 08:19:42,922 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 186 transitions. [2022-04-28 08:19:42,988 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 186 edges. 186 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:19:53,974 INFO L225 Difference]: With dead ends: 27917 [2022-04-28 08:19:53,975 INFO L226 Difference]: Without dead ends: 15883 [2022-04-28 08:19:53,987 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:19:53,987 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 115 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 08:19:53,988 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 119 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 08:19:53,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15883 states. [2022-04-28 08:19:55,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15883 to 15881. [2022-04-28 08:19:55,223 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:19:55,246 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15883 states. Second operand has 15881 states, 15877 states have (on average 1.2740442149020597) internal successors, (20228), 15877 states have internal predecessors, (20228), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:19:55,268 INFO L74 IsIncluded]: Start isIncluded. First operand 15883 states. Second operand has 15881 states, 15877 states have (on average 1.2740442149020597) internal successors, (20228), 15877 states have internal predecessors, (20228), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:19:55,289 INFO L87 Difference]: Start difference. First operand 15883 states. Second operand has 15881 states, 15877 states have (on average 1.2740442149020597) internal successors, (20228), 15877 states have internal predecessors, (20228), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:20:01,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:20:01,550 INFO L93 Difference]: Finished difference Result 15883 states and 20232 transitions. [2022-04-28 08:20:01,550 INFO L276 IsEmpty]: Start isEmpty. Operand 15883 states and 20232 transitions. [2022-04-28 08:20:01,561 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:20:01,562 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:20:01,582 INFO L74 IsIncluded]: Start isIncluded. First operand has 15881 states, 15877 states have (on average 1.2740442149020597) internal successors, (20228), 15877 states have internal predecessors, (20228), 2 states have call successors, (2), 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 15883 states. [2022-04-28 08:20:01,603 INFO L87 Difference]: Start difference. First operand has 15881 states, 15877 states have (on average 1.2740442149020597) internal successors, (20228), 15877 states have internal predecessors, (20228), 2 states have call successors, (2), 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 15883 states. [2022-04-28 08:20:07,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:20:07,901 INFO L93 Difference]: Finished difference Result 15883 states and 20232 transitions. [2022-04-28 08:20:07,901 INFO L276 IsEmpty]: Start isEmpty. Operand 15883 states and 20232 transitions. [2022-04-28 08:20:07,913 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:20:07,913 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:20:07,913 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:20:07,913 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:20:07,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15881 states, 15877 states have (on average 1.2740442149020597) internal successors, (20228), 15877 states have internal predecessors, (20228), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:20:19,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15881 states to 15881 states and 20231 transitions. [2022-04-28 08:20:19,090 INFO L78 Accepts]: Start accepts. Automaton has 15881 states and 20231 transitions. Word has length 30 [2022-04-28 08:20:19,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:20:19,090 INFO L495 AbstractCegarLoop]: Abstraction has 15881 states and 20231 transitions. [2022-04-28 08:20:19,090 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:20:19,090 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15881 states and 20231 transitions. [2022-04-28 08:20:39,532 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20231 edges. 20231 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:20:39,532 INFO L276 IsEmpty]: Start isEmpty. Operand 15881 states and 20231 transitions. [2022-04-28 08:20:39,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-28 08:20:39,542 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:20:39,542 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:20:39,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-04-28 08:20:39,542 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:20:39,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:20:39,542 INFO L85 PathProgramCache]: Analyzing trace with hash -1358574426, now seen corresponding path program 1 times [2022-04-28 08:20:39,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:20:39,542 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1342926903] [2022-04-28 08:20:39,543 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:20:39,543 INFO L85 PathProgramCache]: Analyzing trace with hash -1358574426, now seen corresponding path program 2 times [2022-04-28 08:20:39,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:20:39,543 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962813332] [2022-04-28 08:20:39,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:20:39,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:20:39,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:20:39,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:20:39,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:20:39,590 INFO L290 TraceCheckUtils]: 0: Hoare triple {521003#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {520997#true} is VALID [2022-04-28 08:20:39,590 INFO L290 TraceCheckUtils]: 1: Hoare triple {520997#true} assume true; {520997#true} is VALID [2022-04-28 08:20:39,590 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {520997#true} {520997#true} #217#return; {520997#true} is VALID [2022-04-28 08:20:39,590 INFO L272 TraceCheckUtils]: 0: Hoare triple {520997#true} call ULTIMATE.init(); {521003#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:20:39,590 INFO L290 TraceCheckUtils]: 1: Hoare triple {521003#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {520997#true} is VALID [2022-04-28 08:20:39,590 INFO L290 TraceCheckUtils]: 2: Hoare triple {520997#true} assume true; {520997#true} is VALID [2022-04-28 08:20:39,590 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {520997#true} {520997#true} #217#return; {520997#true} is VALID [2022-04-28 08:20:39,590 INFO L272 TraceCheckUtils]: 4: Hoare triple {520997#true} call #t~ret16 := main(); {520997#true} is VALID [2022-04-28 08:20:39,591 INFO L290 TraceCheckUtils]: 5: Hoare triple {520997#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;havoc ~cond~0; {520997#true} is VALID [2022-04-28 08:20:39,591 INFO L290 TraceCheckUtils]: 6: Hoare triple {520997#true} assume !false;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~cond~0 := #t~nondet15;havoc #t~nondet15; {520997#true} is VALID [2022-04-28 08:20:39,591 INFO L290 TraceCheckUtils]: 7: Hoare triple {520997#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0; {520997#true} is VALID [2022-04-28 08:20:39,591 INFO L290 TraceCheckUtils]: 8: Hoare triple {520997#true} assume !(0 != ~p1~0); {520997#true} is VALID [2022-04-28 08:20:39,591 INFO L290 TraceCheckUtils]: 9: Hoare triple {520997#true} assume !(0 != ~p2~0); {520997#true} is VALID [2022-04-28 08:20:39,591 INFO L290 TraceCheckUtils]: 10: Hoare triple {520997#true} assume !(0 != ~p3~0); {520997#true} is VALID [2022-04-28 08:20:39,591 INFO L290 TraceCheckUtils]: 11: Hoare triple {520997#true} assume !(0 != ~p4~0); {520997#true} is VALID [2022-04-28 08:20:39,591 INFO L290 TraceCheckUtils]: 12: Hoare triple {520997#true} assume !(0 != ~p5~0); {520997#true} is VALID [2022-04-28 08:20:39,591 INFO L290 TraceCheckUtils]: 13: Hoare triple {520997#true} assume !(0 != ~p6~0); {520997#true} is VALID [2022-04-28 08:20:39,591 INFO L290 TraceCheckUtils]: 14: Hoare triple {520997#true} assume !(0 != ~p7~0); {520997#true} is VALID [2022-04-28 08:20:39,591 INFO L290 TraceCheckUtils]: 15: Hoare triple {520997#true} assume !(0 != ~p8~0); {520997#true} is VALID [2022-04-28 08:20:39,592 INFO L290 TraceCheckUtils]: 16: Hoare triple {520997#true} assume 0 != ~p9~0;~lk9~0 := 1; {521002#(not (= main_~p9~0 0))} is VALID [2022-04-28 08:20:39,592 INFO L290 TraceCheckUtils]: 17: Hoare triple {521002#(not (= main_~p9~0 0))} assume !(0 != ~p10~0); {521002#(not (= main_~p9~0 0))} is VALID [2022-04-28 08:20:39,592 INFO L290 TraceCheckUtils]: 18: Hoare triple {521002#(not (= main_~p9~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {521002#(not (= main_~p9~0 0))} is VALID [2022-04-28 08:20:39,592 INFO L290 TraceCheckUtils]: 19: Hoare triple {521002#(not (= main_~p9~0 0))} assume !(0 != ~p1~0); {521002#(not (= main_~p9~0 0))} is VALID [2022-04-28 08:20:39,593 INFO L290 TraceCheckUtils]: 20: Hoare triple {521002#(not (= main_~p9~0 0))} assume !(0 != ~p2~0); {521002#(not (= main_~p9~0 0))} is VALID [2022-04-28 08:20:39,593 INFO L290 TraceCheckUtils]: 21: Hoare triple {521002#(not (= main_~p9~0 0))} assume !(0 != ~p3~0); {521002#(not (= main_~p9~0 0))} is VALID [2022-04-28 08:20:39,593 INFO L290 TraceCheckUtils]: 22: Hoare triple {521002#(not (= main_~p9~0 0))} assume !(0 != ~p4~0); {521002#(not (= main_~p9~0 0))} is VALID [2022-04-28 08:20:39,593 INFO L290 TraceCheckUtils]: 23: Hoare triple {521002#(not (= main_~p9~0 0))} assume !(0 != ~p5~0); {521002#(not (= main_~p9~0 0))} is VALID [2022-04-28 08:20:39,594 INFO L290 TraceCheckUtils]: 24: Hoare triple {521002#(not (= main_~p9~0 0))} assume !(0 != ~p6~0); {521002#(not (= main_~p9~0 0))} is VALID [2022-04-28 08:20:39,594 INFO L290 TraceCheckUtils]: 25: Hoare triple {521002#(not (= main_~p9~0 0))} assume !(0 != ~p7~0); {521002#(not (= main_~p9~0 0))} is VALID [2022-04-28 08:20:39,594 INFO L290 TraceCheckUtils]: 26: Hoare triple {521002#(not (= main_~p9~0 0))} assume !(0 != ~p8~0); {521002#(not (= main_~p9~0 0))} is VALID [2022-04-28 08:20:39,594 INFO L290 TraceCheckUtils]: 27: Hoare triple {521002#(not (= main_~p9~0 0))} assume !(0 != ~p9~0); {520998#false} is VALID [2022-04-28 08:20:39,595 INFO L290 TraceCheckUtils]: 28: Hoare triple {520998#false} assume 0 != ~p10~0; {520998#false} is VALID [2022-04-28 08:20:39,595 INFO L290 TraceCheckUtils]: 29: Hoare triple {520998#false} assume 1 != ~lk10~0; {520998#false} is VALID [2022-04-28 08:20:39,595 INFO L290 TraceCheckUtils]: 30: Hoare triple {520998#false} assume !false; {520998#false} is VALID [2022-04-28 08:20:39,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 08:20:39,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:20:39,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962813332] [2022-04-28 08:20:39,595 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962813332] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:20:39,595 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:20:39,595 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:20:39,595 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:20:39,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1342926903] [2022-04-28 08:20:39,595 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1342926903] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:20:39,596 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:20:39,596 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:20:39,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141117110] [2022-04-28 08:20:39,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:20:39,596 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 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 31 [2022-04-28 08:20:39,596 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:20:39,596 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:20:39,611 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:20:39,611 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:20:39,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:20:39,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:20:39,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:20:39,612 INFO L87 Difference]: Start difference. First operand 15881 states and 20231 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:21:04,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:21:04,430 INFO L93 Difference]: Finished difference Result 23821 states and 30217 transitions. [2022-04-28 08:21:04,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:21:04,430 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 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 31 [2022-04-28 08:21:04,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:21:04,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:21:04,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 181 transitions. [2022-04-28 08:21:04,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:21:04,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 181 transitions. [2022-04-28 08:21:04,432 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 181 transitions. [2022-04-28 08:21:04,545 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 181 edges. 181 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:21:15,474 INFO L225 Difference]: With dead ends: 23821 [2022-04-28 08:21:15,475 INFO L226 Difference]: Without dead ends: 16139 [2022-04-28 08:21:15,485 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:21:15,485 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 136 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 08:21:15,485 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 99 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 08:21:15,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16139 states. [2022-04-28 08:21:16,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16139 to 16137. [2022-04-28 08:21:16,754 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:21:16,774 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16139 states. Second operand has 16137 states, 16133 states have (on average 1.2538275584206284) internal successors, (20228), 16133 states have internal predecessors, (20228), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:21:16,792 INFO L74 IsIncluded]: Start isIncluded. First operand 16139 states. Second operand has 16137 states, 16133 states have (on average 1.2538275584206284) internal successors, (20228), 16133 states have internal predecessors, (20228), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:21:16,809 INFO L87 Difference]: Start difference. First operand 16139 states. Second operand has 16137 states, 16133 states have (on average 1.2538275584206284) internal successors, (20228), 16133 states have internal predecessors, (20228), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:21:23,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:21:23,705 INFO L93 Difference]: Finished difference Result 16139 states and 20232 transitions. [2022-04-28 08:21:23,705 INFO L276 IsEmpty]: Start isEmpty. Operand 16139 states and 20232 transitions. [2022-04-28 08:21:23,718 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:21:23,718 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:21:23,739 INFO L74 IsIncluded]: Start isIncluded. First operand has 16137 states, 16133 states have (on average 1.2538275584206284) internal successors, (20228), 16133 states have internal predecessors, (20228), 2 states have call successors, (2), 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 16139 states. [2022-04-28 08:21:23,760 INFO L87 Difference]: Start difference. First operand has 16137 states, 16133 states have (on average 1.2538275584206284) internal successors, (20228), 16133 states have internal predecessors, (20228), 2 states have call successors, (2), 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 16139 states. [2022-04-28 08:21:30,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:21:30,681 INFO L93 Difference]: Finished difference Result 16139 states and 20232 transitions. [2022-04-28 08:21:30,681 INFO L276 IsEmpty]: Start isEmpty. Operand 16139 states and 20232 transitions. [2022-04-28 08:21:30,694 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:21:30,694 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:21:30,694 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:21:30,694 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:21:30,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16137 states, 16133 states have (on average 1.2538275584206284) internal successors, (20228), 16133 states have internal predecessors, (20228), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:21:41,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16137 states to 16137 states and 20231 transitions. [2022-04-28 08:21:41,983 INFO L78 Accepts]: Start accepts. Automaton has 16137 states and 20231 transitions. Word has length 31 [2022-04-28 08:21:41,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:21:41,984 INFO L495 AbstractCegarLoop]: Abstraction has 16137 states and 20231 transitions. [2022-04-28 08:21:41,984 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:21:41,984 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16137 states and 20231 transitions. [2022-04-28 08:21:59,952 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20231 edges. 20231 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:21:59,953 INFO L276 IsEmpty]: Start isEmpty. Operand 16137 states and 20231 transitions. [2022-04-28 08:21:59,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-28 08:21:59,962 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:21:59,962 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:21:59,962 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-04-28 08:21:59,963 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:21:59,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:21:59,963 INFO L85 PathProgramCache]: Analyzing trace with hash 1656529192, now seen corresponding path program 1 times [2022-04-28 08:21:59,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:21:59,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [679874398] [2022-04-28 08:21:59,963 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:21:59,963 INFO L85 PathProgramCache]: Analyzing trace with hash 1656529192, now seen corresponding path program 2 times [2022-04-28 08:21:59,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:21:59,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791903285] [2022-04-28 08:21:59,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:21:59,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:21:59,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:21:59,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:21:59,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:21:59,994 INFO L290 TraceCheckUtils]: 0: Hoare triple {633209#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {633203#true} is VALID [2022-04-28 08:21:59,994 INFO L290 TraceCheckUtils]: 1: Hoare triple {633203#true} assume true; {633203#true} is VALID [2022-04-28 08:21:59,994 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {633203#true} {633203#true} #217#return; {633203#true} is VALID [2022-04-28 08:21:59,995 INFO L272 TraceCheckUtils]: 0: Hoare triple {633203#true} call ULTIMATE.init(); {633209#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:21:59,995 INFO L290 TraceCheckUtils]: 1: Hoare triple {633209#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {633203#true} is VALID [2022-04-28 08:21:59,995 INFO L290 TraceCheckUtils]: 2: Hoare triple {633203#true} assume true; {633203#true} is VALID [2022-04-28 08:21:59,995 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {633203#true} {633203#true} #217#return; {633203#true} is VALID [2022-04-28 08:21:59,995 INFO L272 TraceCheckUtils]: 4: Hoare triple {633203#true} call #t~ret16 := main(); {633203#true} is VALID [2022-04-28 08:21:59,995 INFO L290 TraceCheckUtils]: 5: Hoare triple {633203#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;havoc ~cond~0; {633203#true} is VALID [2022-04-28 08:21:59,995 INFO L290 TraceCheckUtils]: 6: Hoare triple {633203#true} assume !false;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~cond~0 := #t~nondet15;havoc #t~nondet15; {633203#true} is VALID [2022-04-28 08:21:59,995 INFO L290 TraceCheckUtils]: 7: Hoare triple {633203#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0; {633203#true} is VALID [2022-04-28 08:21:59,995 INFO L290 TraceCheckUtils]: 8: Hoare triple {633203#true} assume !(0 != ~p1~0); {633203#true} is VALID [2022-04-28 08:21:59,995 INFO L290 TraceCheckUtils]: 9: Hoare triple {633203#true} assume !(0 != ~p2~0); {633203#true} is VALID [2022-04-28 08:21:59,996 INFO L290 TraceCheckUtils]: 10: Hoare triple {633203#true} assume !(0 != ~p3~0); {633203#true} is VALID [2022-04-28 08:21:59,996 INFO L290 TraceCheckUtils]: 11: Hoare triple {633203#true} assume !(0 != ~p4~0); {633203#true} is VALID [2022-04-28 08:21:59,996 INFO L290 TraceCheckUtils]: 12: Hoare triple {633203#true} assume !(0 != ~p5~0); {633203#true} is VALID [2022-04-28 08:21:59,996 INFO L290 TraceCheckUtils]: 13: Hoare triple {633203#true} assume !(0 != ~p6~0); {633203#true} is VALID [2022-04-28 08:21:59,996 INFO L290 TraceCheckUtils]: 14: Hoare triple {633203#true} assume !(0 != ~p7~0); {633203#true} is VALID [2022-04-28 08:21:59,996 INFO L290 TraceCheckUtils]: 15: Hoare triple {633203#true} assume !(0 != ~p8~0); {633203#true} is VALID [2022-04-28 08:21:59,996 INFO L290 TraceCheckUtils]: 16: Hoare triple {633203#true} assume !(0 != ~p9~0); {633203#true} is VALID [2022-04-28 08:21:59,996 INFO L290 TraceCheckUtils]: 17: Hoare triple {633203#true} assume !(0 != ~p10~0); {633208#(= main_~p10~0 0)} is VALID [2022-04-28 08:21:59,996 INFO L290 TraceCheckUtils]: 18: Hoare triple {633208#(= main_~p10~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {633208#(= main_~p10~0 0)} is VALID [2022-04-28 08:21:59,997 INFO L290 TraceCheckUtils]: 19: Hoare triple {633208#(= main_~p10~0 0)} assume !(0 != ~p1~0); {633208#(= main_~p10~0 0)} is VALID [2022-04-28 08:21:59,997 INFO L290 TraceCheckUtils]: 20: Hoare triple {633208#(= main_~p10~0 0)} assume !(0 != ~p2~0); {633208#(= main_~p10~0 0)} is VALID [2022-04-28 08:21:59,997 INFO L290 TraceCheckUtils]: 21: Hoare triple {633208#(= main_~p10~0 0)} assume !(0 != ~p3~0); {633208#(= main_~p10~0 0)} is VALID [2022-04-28 08:21:59,997 INFO L290 TraceCheckUtils]: 22: Hoare triple {633208#(= main_~p10~0 0)} assume !(0 != ~p4~0); {633208#(= main_~p10~0 0)} is VALID [2022-04-28 08:21:59,998 INFO L290 TraceCheckUtils]: 23: Hoare triple {633208#(= main_~p10~0 0)} assume !(0 != ~p5~0); {633208#(= main_~p10~0 0)} is VALID [2022-04-28 08:21:59,998 INFO L290 TraceCheckUtils]: 24: Hoare triple {633208#(= main_~p10~0 0)} assume !(0 != ~p6~0); {633208#(= main_~p10~0 0)} is VALID [2022-04-28 08:21:59,998 INFO L290 TraceCheckUtils]: 25: Hoare triple {633208#(= main_~p10~0 0)} assume !(0 != ~p7~0); {633208#(= main_~p10~0 0)} is VALID [2022-04-28 08:21:59,998 INFO L290 TraceCheckUtils]: 26: Hoare triple {633208#(= main_~p10~0 0)} assume !(0 != ~p8~0); {633208#(= main_~p10~0 0)} is VALID [2022-04-28 08:21:59,999 INFO L290 TraceCheckUtils]: 27: Hoare triple {633208#(= main_~p10~0 0)} assume !(0 != ~p9~0); {633208#(= main_~p10~0 0)} is VALID [2022-04-28 08:21:59,999 INFO L290 TraceCheckUtils]: 28: Hoare triple {633208#(= main_~p10~0 0)} assume 0 != ~p10~0; {633204#false} is VALID [2022-04-28 08:21:59,999 INFO L290 TraceCheckUtils]: 29: Hoare triple {633204#false} assume 1 != ~lk10~0; {633204#false} is VALID [2022-04-28 08:21:59,999 INFO L290 TraceCheckUtils]: 30: Hoare triple {633204#false} assume !false; {633204#false} is VALID [2022-04-28 08:21:59,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 08:21:59,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:21:59,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791903285] [2022-04-28 08:21:59,999 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791903285] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:21:59,999 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:22:00,000 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:22:00,000 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:22:00,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [679874398] [2022-04-28 08:22:00,000 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [679874398] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:22:00,000 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:22:00,000 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:22:00,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943101325] [2022-04-28 08:22:00,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:22:00,000 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 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 31 [2022-04-28 08:22:00,000 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:22:00,000 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:22:00,014 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:22:00,014 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:22:00,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:22:00,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:22:00,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:22:00,014 INFO L87 Difference]: Start difference. First operand 16137 states and 20231 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:25:35,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:25:35,776 INFO L93 Difference]: Finished difference Result 46861 states and 57609 transitions. [2022-04-28 08:25:35,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:25:35,776 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 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 31 [2022-04-28 08:25:35,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:25:35,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:25:35,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 184 transitions. [2022-04-28 08:25:35,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:25:35,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 184 transitions. [2022-04-28 08:25:35,778 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 184 transitions. [2022-04-28 08:25:35,892 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 184 edges. 184 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:26:23,100 INFO L225 Difference]: With dead ends: 46861 [2022-04-28 08:26:23,100 INFO L226 Difference]: Without dead ends: 31243 [2022-04-28 08:26:23,122 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:26:23,123 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 140 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 08:26:23,123 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 93 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 08:26:23,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31243 states. [2022-04-28 08:26:25,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31243 to 31241. [2022-04-28 08:26:25,701 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:26:25,736 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31243 states. Second operand has 31241 states, 31237 states have (on average 1.1966578096488139) internal successors, (37380), 31237 states have internal predecessors, (37380), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:26:25,771 INFO L74 IsIncluded]: Start isIncluded. First operand 31243 states. Second operand has 31241 states, 31237 states have (on average 1.1966578096488139) internal successors, (37380), 31237 states have internal predecessors, (37380), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:26:25,806 INFO L87 Difference]: Start difference. First operand 31243 states. Second operand has 31241 states, 31237 states have (on average 1.1966578096488139) internal successors, (37380), 31237 states have internal predecessors, (37380), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:27:00,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:27:00,618 INFO L93 Difference]: Finished difference Result 31243 states and 37384 transitions. [2022-04-28 08:27:00,618 INFO L276 IsEmpty]: Start isEmpty. Operand 31243 states and 37384 transitions. [2022-04-28 08:27:00,641 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:27:00,642 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:27:00,678 INFO L74 IsIncluded]: Start isIncluded. First operand has 31241 states, 31237 states have (on average 1.1966578096488139) internal successors, (37380), 31237 states have internal predecessors, (37380), 2 states have call successors, (2), 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 31243 states. [2022-04-28 08:27:00,714 INFO L87 Difference]: Start difference. First operand has 31241 states, 31237 states have (on average 1.1966578096488139) internal successors, (37380), 31237 states have internal predecessors, (37380), 2 states have call successors, (2), 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 31243 states. [2022-04-28 08:27:30,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:27:30,409 INFO L93 Difference]: Finished difference Result 31243 states and 37384 transitions. [2022-04-28 08:27:30,409 INFO L276 IsEmpty]: Start isEmpty. Operand 31243 states and 37384 transitions. [2022-04-28 08:27:30,430 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:27:30,431 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:27:30,431 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:27:30,431 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:27:30,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31241 states, 31237 states have (on average 1.1966578096488139) internal successors, (37380), 31237 states have internal predecessors, (37380), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:28:42,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31241 states to 31241 states and 37383 transitions. [2022-04-28 08:28:42,436 INFO L78 Accepts]: Start accepts. Automaton has 31241 states and 37383 transitions. Word has length 31 [2022-04-28 08:28:42,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:28:42,437 INFO L495 AbstractCegarLoop]: Abstraction has 31241 states and 37383 transitions. [2022-04-28 08:28:42,437 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:28:42,437 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31241 states and 37383 transitions. [2022-04-28 08:29:18,812 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37383 edges. 37383 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:29:18,813 INFO L276 IsEmpty]: Start isEmpty. Operand 31241 states and 37383 transitions. [2022-04-28 08:29:18,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-28 08:29:18,832 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:29:18,832 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:29:18,832 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-04-28 08:29:18,832 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:29:18,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:29:18,833 INFO L85 PathProgramCache]: Analyzing trace with hash -1627320854, now seen corresponding path program 1 times [2022-04-28 08:29:18,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:29:18,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1788187374] [2022-04-28 08:29:18,833 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:29:18,833 INFO L85 PathProgramCache]: Analyzing trace with hash -1627320854, now seen corresponding path program 2 times [2022-04-28 08:29:18,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:29:18,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017704865] [2022-04-28 08:29:18,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:29:18,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:29:18,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:29:18,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:29:18,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:29:18,869 INFO L290 TraceCheckUtils]: 0: Hoare triple {851911#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {851905#true} is VALID [2022-04-28 08:29:18,869 INFO L290 TraceCheckUtils]: 1: Hoare triple {851905#true} assume true; {851905#true} is VALID [2022-04-28 08:29:18,869 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {851905#true} {851905#true} #217#return; {851905#true} is VALID [2022-04-28 08:29:18,870 INFO L272 TraceCheckUtils]: 0: Hoare triple {851905#true} call ULTIMATE.init(); {851911#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:29:18,870 INFO L290 TraceCheckUtils]: 1: Hoare triple {851911#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {851905#true} is VALID [2022-04-28 08:29:18,870 INFO L290 TraceCheckUtils]: 2: Hoare triple {851905#true} assume true; {851905#true} is VALID [2022-04-28 08:29:18,870 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {851905#true} {851905#true} #217#return; {851905#true} is VALID [2022-04-28 08:29:18,870 INFO L272 TraceCheckUtils]: 4: Hoare triple {851905#true} call #t~ret16 := main(); {851905#true} is VALID [2022-04-28 08:29:18,870 INFO L290 TraceCheckUtils]: 5: Hoare triple {851905#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;havoc ~cond~0; {851905#true} is VALID [2022-04-28 08:29:18,876 INFO L290 TraceCheckUtils]: 6: Hoare triple {851905#true} assume !false;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~cond~0 := #t~nondet15;havoc #t~nondet15; {851905#true} is VALID [2022-04-28 08:29:18,876 INFO L290 TraceCheckUtils]: 7: Hoare triple {851905#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0; {851905#true} is VALID [2022-04-28 08:29:18,877 INFO L290 TraceCheckUtils]: 8: Hoare triple {851905#true} assume !(0 != ~p1~0); {851905#true} is VALID [2022-04-28 08:29:18,877 INFO L290 TraceCheckUtils]: 9: Hoare triple {851905#true} assume !(0 != ~p2~0); {851905#true} is VALID [2022-04-28 08:29:18,877 INFO L290 TraceCheckUtils]: 10: Hoare triple {851905#true} assume !(0 != ~p3~0); {851905#true} is VALID [2022-04-28 08:29:18,877 INFO L290 TraceCheckUtils]: 11: Hoare triple {851905#true} assume !(0 != ~p4~0); {851905#true} is VALID [2022-04-28 08:29:18,877 INFO L290 TraceCheckUtils]: 12: Hoare triple {851905#true} assume !(0 != ~p5~0); {851905#true} is VALID [2022-04-28 08:29:18,877 INFO L290 TraceCheckUtils]: 13: Hoare triple {851905#true} assume !(0 != ~p6~0); {851905#true} is VALID [2022-04-28 08:29:18,877 INFO L290 TraceCheckUtils]: 14: Hoare triple {851905#true} assume !(0 != ~p7~0); {851905#true} is VALID [2022-04-28 08:29:18,877 INFO L290 TraceCheckUtils]: 15: Hoare triple {851905#true} assume !(0 != ~p8~0); {851905#true} is VALID [2022-04-28 08:29:18,877 INFO L290 TraceCheckUtils]: 16: Hoare triple {851905#true} assume !(0 != ~p9~0); {851905#true} is VALID [2022-04-28 08:29:18,878 INFO L290 TraceCheckUtils]: 17: Hoare triple {851905#true} assume 0 != ~p10~0;~lk10~0 := 1; {851910#(= main_~lk10~0 1)} is VALID [2022-04-28 08:29:18,878 INFO L290 TraceCheckUtils]: 18: Hoare triple {851910#(= main_~lk10~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {851910#(= main_~lk10~0 1)} is VALID [2022-04-28 08:29:18,878 INFO L290 TraceCheckUtils]: 19: Hoare triple {851910#(= main_~lk10~0 1)} assume !(0 != ~p1~0); {851910#(= main_~lk10~0 1)} is VALID [2022-04-28 08:29:18,879 INFO L290 TraceCheckUtils]: 20: Hoare triple {851910#(= main_~lk10~0 1)} assume !(0 != ~p2~0); {851910#(= main_~lk10~0 1)} is VALID [2022-04-28 08:29:18,879 INFO L290 TraceCheckUtils]: 21: Hoare triple {851910#(= main_~lk10~0 1)} assume !(0 != ~p3~0); {851910#(= main_~lk10~0 1)} is VALID [2022-04-28 08:29:18,879 INFO L290 TraceCheckUtils]: 22: Hoare triple {851910#(= main_~lk10~0 1)} assume !(0 != ~p4~0); {851910#(= main_~lk10~0 1)} is VALID [2022-04-28 08:29:18,880 INFO L290 TraceCheckUtils]: 23: Hoare triple {851910#(= main_~lk10~0 1)} assume !(0 != ~p5~0); {851910#(= main_~lk10~0 1)} is VALID [2022-04-28 08:29:18,880 INFO L290 TraceCheckUtils]: 24: Hoare triple {851910#(= main_~lk10~0 1)} assume !(0 != ~p6~0); {851910#(= main_~lk10~0 1)} is VALID [2022-04-28 08:29:18,880 INFO L290 TraceCheckUtils]: 25: Hoare triple {851910#(= main_~lk10~0 1)} assume !(0 != ~p7~0); {851910#(= main_~lk10~0 1)} is VALID [2022-04-28 08:29:18,880 INFO L290 TraceCheckUtils]: 26: Hoare triple {851910#(= main_~lk10~0 1)} assume !(0 != ~p8~0); {851910#(= main_~lk10~0 1)} is VALID [2022-04-28 08:29:18,881 INFO L290 TraceCheckUtils]: 27: Hoare triple {851910#(= main_~lk10~0 1)} assume !(0 != ~p9~0); {851910#(= main_~lk10~0 1)} is VALID [2022-04-28 08:29:18,881 INFO L290 TraceCheckUtils]: 28: Hoare triple {851910#(= main_~lk10~0 1)} assume 0 != ~p10~0; {851910#(= main_~lk10~0 1)} is VALID [2022-04-28 08:29:18,881 INFO L290 TraceCheckUtils]: 29: Hoare triple {851910#(= main_~lk10~0 1)} assume 1 != ~lk10~0; {851906#false} is VALID [2022-04-28 08:29:18,881 INFO L290 TraceCheckUtils]: 30: Hoare triple {851906#false} assume !false; {851906#false} is VALID [2022-04-28 08:29:18,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 08:29:18,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:29:18,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017704865] [2022-04-28 08:29:18,882 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017704865] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:29:18,882 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:29:18,882 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:29:18,882 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:29:18,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1788187374] [2022-04-28 08:29:18,882 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1788187374] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:29:18,882 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:29:18,882 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:29:18,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647576141] [2022-04-28 08:29:18,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:29:18,883 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 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 31 [2022-04-28 08:29:18,883 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:29:18,883 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:29:18,903 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:29:18,903 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:29:18,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:29:18,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:29:18,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:29:18,903 INFO L87 Difference]: Start difference. First operand 31241 states and 37383 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)