/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/locks/test_locks_14-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 15:09:36,471 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 15:09:36,473 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 15:09:36,515 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 15:09:36,516 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 15:09:36,516 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 15:09:36,518 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 15:09:36,519 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 15:09:36,520 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 15:09:36,521 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 15:09:36,522 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 15:09:36,523 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 15:09:36,523 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 15:09:36,524 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 15:09:36,525 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 15:09:36,525 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 15:09:36,526 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 15:09:36,527 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 15:09:36,530 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 15:09:36,532 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 15:09:36,533 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 15:09:36,534 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 15:09:36,535 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 15:09:36,536 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 15:09:36,536 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 15:09:36,539 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 15:09:36,539 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 15:09:36,539 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 15:09:36,540 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 15:09:36,540 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 15:09:36,541 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 15:09:36,541 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 15:09:36,542 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 15:09:36,542 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 15:09:36,543 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 15:09:36,544 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 15:09:36,544 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 15:09:36,544 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 15:09:36,545 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 15:09:36,545 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 15:09:36,546 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 15:09:36,546 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 15:09:36,547 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2022-04-27 15:09:36,571 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 15:09:36,572 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 15:09:36,572 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 15:09:36,572 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 15:09:36,573 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 15:09:36,573 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 15:09:36,573 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 15:09:36,573 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 15:09:36,574 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 15:09:36,574 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 15:09:36,574 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 15:09:36,574 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 15:09:36,574 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 15:09:36,575 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 15:09:36,575 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 15:09:36,575 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 15:09:36,575 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 15:09:36,575 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 15:09:36,575 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 15:09:36,575 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 15:09:36,576 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 15:09:36,576 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 15:09:36,576 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 15:09:36,576 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 15:09:36,576 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 15:09:36,576 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 15:09:36,577 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 15:09:36,577 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 15:09:36,577 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 15:09:36,577 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 15:09:36,577 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 15:09:36,577 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 15:09:36,577 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 15:09:36,578 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-27 15:09:36,760 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 15:09:36,785 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 15:09:36,787 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 15:09:36,787 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 15:09:36,788 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 15:09:36,789 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_14-1.c [2022-04-27 15:09:36,851 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c429753a/e06e06b3ad7249cfadc37b5220848956/FLAG9407abdbd [2022-04-27 15:09:37,189 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 15:09:37,189 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_14-1.c [2022-04-27 15:09:37,201 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c429753a/e06e06b3ad7249cfadc37b5220848956/FLAG9407abdbd [2022-04-27 15:09:37,629 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c429753a/e06e06b3ad7249cfadc37b5220848956 [2022-04-27 15:09:37,631 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 15:09:37,632 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 15:09:37,634 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 15:09:37,635 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 15:09:37,637 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 15:09:37,638 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 03:09:37" (1/1) ... [2022-04-27 15:09:37,640 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@738e50d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:09:37, skipping insertion in model container [2022-04-27 15:09:37,640 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 03:09:37" (1/1) ... [2022-04-27 15:09:37,645 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 15:09:37,674 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 15:09:37,824 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_14-1.c[5283,5296] [2022-04-27 15:09:37,827 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 15:09:37,833 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 15:09:37,859 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_14-1.c[5283,5296] [2022-04-27 15:09:37,860 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 15:09:37,871 INFO L208 MainTranslator]: Completed translation [2022-04-27 15:09:37,871 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:09:37 WrapperNode [2022-04-27 15:09:37,872 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 15:09:37,872 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 15:09:37,873 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 15:09:37,873 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 15:09:37,881 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:09:37" (1/1) ... [2022-04-27 15:09:37,881 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:09:37" (1/1) ... [2022-04-27 15:09:37,886 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:09:37" (1/1) ... [2022-04-27 15:09:37,887 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:09:37" (1/1) ... [2022-04-27 15:09:37,895 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:09:37" (1/1) ... [2022-04-27 15:09:37,902 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:09:37" (1/1) ... [2022-04-27 15:09:37,904 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:09:37" (1/1) ... [2022-04-27 15:09:37,906 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 15:09:37,907 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 15:09:37,907 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 15:09:37,907 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 15:09:37,908 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:09:37" (1/1) ... [2022-04-27 15:09:37,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 15:09:37,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 15:09:37,946 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-27 15:09:37,954 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-27 15:09:37,976 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 15:09:37,976 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 15:09:37,976 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 15:09:37,977 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 15:09:37,977 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 15:09:37,977 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 15:09:37,977 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 15:09:37,977 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 15:09:37,977 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 15:09:37,977 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 15:09:37,978 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 15:09:37,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 15:09:37,978 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 15:09:37,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 15:09:37,978 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 15:09:37,978 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 15:09:38,030 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 15:09:38,031 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 15:09:38,270 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 15:09:38,276 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 15:09:38,277 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 15:09:38,278 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 03:09:38 BoogieIcfgContainer [2022-04-27 15:09:38,278 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 15:09:38,280 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 15:09:38,280 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 15:09:38,302 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 15:09:38,302 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 03:09:37" (1/3) ... [2022-04-27 15:09:38,303 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a0fa45b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 03:09:38, skipping insertion in model container [2022-04-27 15:09:38,303 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:09:37" (2/3) ... [2022-04-27 15:09:38,303 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a0fa45b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 03:09:38, skipping insertion in model container [2022-04-27 15:09:38,303 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 03:09:38" (3/3) ... [2022-04-27 15:09:38,306 INFO L111 eAbstractionObserver]: Analyzing ICFG test_locks_14-1.c [2022-04-27 15:09:38,326 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 15:09:38,326 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 15:09:38,371 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 15:09:38,376 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@598de9d2, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@c4bf249 [2022-04-27 15:09:38,377 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 15:09:38,386 INFO L276 IsEmpty]: Start isEmpty. Operand has 57 states, 51 states have (on average 1.9019607843137254) internal successors, (97), 52 states have internal predecessors, (97), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 15:09:38,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-27 15:09:38,391 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:09:38,392 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-27 15:09:38,392 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:09:38,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:09:38,396 INFO L85 PathProgramCache]: Analyzing trace with hash -406532905, now seen corresponding path program 1 times [2022-04-27 15:09:38,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:09:38,407 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609865690] [2022-04-27 15:09:38,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:09:38,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:09:38,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:38,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:09:38,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:38,741 INFO L290 TraceCheckUtils]: 0: Hoare triple {66#(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(18, 2);call #Ultimate.allocInit(12, 3); {60#true} is VALID [2022-04-27 15:09:38,741 INFO L290 TraceCheckUtils]: 1: Hoare triple {60#true} assume true; {60#true} is VALID [2022-04-27 15:09:38,741 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {60#true} {60#true} #268#return; {60#true} is VALID [2022-04-27 15:09:38,743 INFO L272 TraceCheckUtils]: 0: Hoare triple {60#true} call ULTIMATE.init(); {66#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:09:38,743 INFO L290 TraceCheckUtils]: 1: Hoare triple {66#(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(18, 2);call #Ultimate.allocInit(12, 3); {60#true} is VALID [2022-04-27 15:09:38,744 INFO L290 TraceCheckUtils]: 2: Hoare triple {60#true} assume true; {60#true} is VALID [2022-04-27 15:09:38,744 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {60#true} {60#true} #268#return; {60#true} is VALID [2022-04-27 15:09:38,744 INFO L272 TraceCheckUtils]: 4: Hoare triple {60#true} call #t~ret19 := main(); {60#true} is VALID [2022-04-27 15:09:38,745 INFO L290 TraceCheckUtils]: 5: Hoare triple {60#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;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;havoc ~cond~0; {60#true} is VALID [2022-04-27 15:09:38,745 INFO L290 TraceCheckUtils]: 6: Hoare triple {60#true} assume !false;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~cond~0 := #t~nondet18;havoc #t~nondet18; {60#true} is VALID [2022-04-27 15:09:38,745 INFO L290 TraceCheckUtils]: 7: Hoare triple {60#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;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0; {60#true} is VALID [2022-04-27 15:09:38,747 INFO L290 TraceCheckUtils]: 8: Hoare triple {60#true} assume 0 != ~p1~0;~lk1~0 := 1; {65#(= main_~lk1~0 1)} is VALID [2022-04-27 15:09:38,748 INFO L290 TraceCheckUtils]: 9: Hoare triple {65#(= main_~lk1~0 1)} assume !(0 != ~p2~0); {65#(= main_~lk1~0 1)} is VALID [2022-04-27 15:09:38,748 INFO L290 TraceCheckUtils]: 10: Hoare triple {65#(= main_~lk1~0 1)} assume 0 != ~p3~0;~lk3~0 := 1; {65#(= main_~lk1~0 1)} is VALID [2022-04-27 15:09:38,749 INFO L290 TraceCheckUtils]: 11: Hoare triple {65#(= main_~lk1~0 1)} assume 0 != ~p4~0;~lk4~0 := 1; {65#(= main_~lk1~0 1)} is VALID [2022-04-27 15:09:38,749 INFO L290 TraceCheckUtils]: 12: Hoare triple {65#(= main_~lk1~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {65#(= main_~lk1~0 1)} is VALID [2022-04-27 15:09:38,751 INFO L290 TraceCheckUtils]: 13: Hoare triple {65#(= main_~lk1~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {65#(= main_~lk1~0 1)} is VALID [2022-04-27 15:09:38,753 INFO L290 TraceCheckUtils]: 14: Hoare triple {65#(= main_~lk1~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {65#(= main_~lk1~0 1)} is VALID [2022-04-27 15:09:38,755 INFO L290 TraceCheckUtils]: 15: Hoare triple {65#(= main_~lk1~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {65#(= main_~lk1~0 1)} is VALID [2022-04-27 15:09:38,757 INFO L290 TraceCheckUtils]: 16: Hoare triple {65#(= main_~lk1~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {65#(= main_~lk1~0 1)} is VALID [2022-04-27 15:09:38,760 INFO L290 TraceCheckUtils]: 17: Hoare triple {65#(= main_~lk1~0 1)} assume !(0 != ~p10~0); {65#(= main_~lk1~0 1)} is VALID [2022-04-27 15:09:38,760 INFO L290 TraceCheckUtils]: 18: Hoare triple {65#(= main_~lk1~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {65#(= main_~lk1~0 1)} is VALID [2022-04-27 15:09:38,761 INFO L290 TraceCheckUtils]: 19: Hoare triple {65#(= main_~lk1~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {65#(= main_~lk1~0 1)} is VALID [2022-04-27 15:09:38,762 INFO L290 TraceCheckUtils]: 20: Hoare triple {65#(= main_~lk1~0 1)} assume 0 != ~p13~0;~lk13~0 := 1; {65#(= main_~lk1~0 1)} is VALID [2022-04-27 15:09:38,762 INFO L290 TraceCheckUtils]: 21: Hoare triple {65#(= main_~lk1~0 1)} assume 0 != ~p14~0;~lk14~0 := 1; {65#(= main_~lk1~0 1)} is VALID [2022-04-27 15:09:38,763 INFO L290 TraceCheckUtils]: 22: Hoare triple {65#(= main_~lk1~0 1)} assume 0 != ~p1~0; {65#(= main_~lk1~0 1)} is VALID [2022-04-27 15:09:38,764 INFO L290 TraceCheckUtils]: 23: Hoare triple {65#(= main_~lk1~0 1)} assume 1 != ~lk1~0; {61#false} is VALID [2022-04-27 15:09:38,765 INFO L290 TraceCheckUtils]: 24: Hoare triple {61#false} assume !false; {61#false} is VALID [2022-04-27 15:09:38,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:09:38,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:09:38,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609865690] [2022-04-27 15:09:38,767 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609865690] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:09:38,767 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:09:38,768 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:09:38,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410631243] [2022-04-27 15:09:38,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:09:38,773 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-27 15:09:38,774 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:09:38,776 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-27 15:09:38,815 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-27 15:09:38,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:09:38,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:09:38,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:09:38,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:09:38,853 INFO L87 Difference]: Start difference. First operand has 57 states, 51 states have (on average 1.9019607843137254) internal successors, (97), 52 states have internal predecessors, (97), 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 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-27 15:09:39,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:39,304 INFO L93 Difference]: Finished difference Result 112 states and 199 transitions. [2022-04-27 15:09:39,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:09:39,305 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-27 15:09:39,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:09:39,306 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-27 15:09:39,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 199 transitions. [2022-04-27 15:09:39,317 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-27 15:09:39,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 199 transitions. [2022-04-27 15:09:39,325 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 199 transitions. [2022-04-27 15:09:39,516 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-27 15:09:39,531 INFO L225 Difference]: With dead ends: 112 [2022-04-27 15:09:39,532 INFO L226 Difference]: Without dead ends: 97 [2022-04-27 15:09:39,535 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-27 15:09:39,539 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 242 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 15:09:39,540 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 113 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 15:09:39,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-04-27 15:09:39,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 67. [2022-04-27 15:09:39,574 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:09:39,576 INFO L82 GeneralOperation]: Start isEquivalent. First operand 97 states. Second operand has 67 states, 63 states have (on average 1.8888888888888888) internal successors, (119), 63 states have internal predecessors, (119), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:39,578 INFO L74 IsIncluded]: Start isIncluded. First operand 97 states. Second operand has 67 states, 63 states have (on average 1.8888888888888888) internal successors, (119), 63 states have internal predecessors, (119), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:39,579 INFO L87 Difference]: Start difference. First operand 97 states. Second operand has 67 states, 63 states have (on average 1.8888888888888888) internal successors, (119), 63 states have internal predecessors, (119), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:39,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:39,596 INFO L93 Difference]: Finished difference Result 97 states and 177 transitions. [2022-04-27 15:09:39,596 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 177 transitions. [2022-04-27 15:09:39,597 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:09:39,597 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:09:39,598 INFO L74 IsIncluded]: Start isIncluded. First operand has 67 states, 63 states have (on average 1.8888888888888888) internal successors, (119), 63 states have internal predecessors, (119), 2 states have call successors, (2), 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 97 states. [2022-04-27 15:09:39,598 INFO L87 Difference]: Start difference. First operand has 67 states, 63 states have (on average 1.8888888888888888) internal successors, (119), 63 states have internal predecessors, (119), 2 states have call successors, (2), 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 97 states. [2022-04-27 15:09:39,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:39,606 INFO L93 Difference]: Finished difference Result 97 states and 177 transitions. [2022-04-27 15:09:39,607 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 177 transitions. [2022-04-27 15:09:39,607 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:09:39,608 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:09:39,608 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:09:39,608 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:09:39,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 63 states have (on average 1.8888888888888888) internal successors, (119), 63 states have internal predecessors, (119), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:39,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 122 transitions. [2022-04-27 15:09:39,615 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 122 transitions. Word has length 25 [2022-04-27 15:09:39,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:09:39,615 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 122 transitions. [2022-04-27 15:09:39,616 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-27 15:09:39,616 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 122 transitions. [2022-04-27 15:09:39,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-27 15:09:39,617 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:09:39,617 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-27 15:09:39,617 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 15:09:39,617 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:09:39,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:09:39,618 INFO L85 PathProgramCache]: Analyzing trace with hash -1994880807, now seen corresponding path program 1 times [2022-04-27 15:09:39,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:09:39,619 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150864027] [2022-04-27 15:09:39,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:09:39,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:09:39,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:39,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:09:39,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:39,714 INFO L290 TraceCheckUtils]: 0: Hoare triple {469#(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(18, 2);call #Ultimate.allocInit(12, 3); {463#true} is VALID [2022-04-27 15:09:39,715 INFO L290 TraceCheckUtils]: 1: Hoare triple {463#true} assume true; {463#true} is VALID [2022-04-27 15:09:39,715 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {463#true} {463#true} #268#return; {463#true} is VALID [2022-04-27 15:09:39,716 INFO L272 TraceCheckUtils]: 0: Hoare triple {463#true} call ULTIMATE.init(); {469#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:09:39,716 INFO L290 TraceCheckUtils]: 1: Hoare triple {469#(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(18, 2);call #Ultimate.allocInit(12, 3); {463#true} is VALID [2022-04-27 15:09:39,716 INFO L290 TraceCheckUtils]: 2: Hoare triple {463#true} assume true; {463#true} is VALID [2022-04-27 15:09:39,717 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {463#true} {463#true} #268#return; {463#true} is VALID [2022-04-27 15:09:39,717 INFO L272 TraceCheckUtils]: 4: Hoare triple {463#true} call #t~ret19 := main(); {463#true} is VALID [2022-04-27 15:09:39,717 INFO L290 TraceCheckUtils]: 5: Hoare triple {463#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;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;havoc ~cond~0; {463#true} is VALID [2022-04-27 15:09:39,717 INFO L290 TraceCheckUtils]: 6: Hoare triple {463#true} assume !false;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~cond~0 := #t~nondet18;havoc #t~nondet18; {463#true} is VALID [2022-04-27 15:09:39,717 INFO L290 TraceCheckUtils]: 7: Hoare triple {463#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;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0; {463#true} is VALID [2022-04-27 15:09:39,718 INFO L290 TraceCheckUtils]: 8: Hoare triple {463#true} assume !(0 != ~p1~0); {468#(= main_~p1~0 0)} is VALID [2022-04-27 15:09:39,719 INFO L290 TraceCheckUtils]: 9: Hoare triple {468#(= main_~p1~0 0)} assume !(0 != ~p2~0); {468#(= main_~p1~0 0)} is VALID [2022-04-27 15:09:39,719 INFO L290 TraceCheckUtils]: 10: Hoare triple {468#(= main_~p1~0 0)} assume 0 != ~p3~0;~lk3~0 := 1; {468#(= main_~p1~0 0)} is VALID [2022-04-27 15:09:39,719 INFO L290 TraceCheckUtils]: 11: Hoare triple {468#(= main_~p1~0 0)} assume 0 != ~p4~0;~lk4~0 := 1; {468#(= main_~p1~0 0)} is VALID [2022-04-27 15:09:39,720 INFO L290 TraceCheckUtils]: 12: Hoare triple {468#(= main_~p1~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {468#(= main_~p1~0 0)} is VALID [2022-04-27 15:09:39,723 INFO L290 TraceCheckUtils]: 13: Hoare triple {468#(= main_~p1~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {468#(= main_~p1~0 0)} is VALID [2022-04-27 15:09:39,723 INFO L290 TraceCheckUtils]: 14: Hoare triple {468#(= main_~p1~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {468#(= main_~p1~0 0)} is VALID [2022-04-27 15:09:39,724 INFO L290 TraceCheckUtils]: 15: Hoare triple {468#(= main_~p1~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {468#(= main_~p1~0 0)} is VALID [2022-04-27 15:09:39,724 INFO L290 TraceCheckUtils]: 16: Hoare triple {468#(= main_~p1~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {468#(= main_~p1~0 0)} is VALID [2022-04-27 15:09:39,725 INFO L290 TraceCheckUtils]: 17: Hoare triple {468#(= main_~p1~0 0)} assume !(0 != ~p10~0); {468#(= main_~p1~0 0)} is VALID [2022-04-27 15:09:39,725 INFO L290 TraceCheckUtils]: 18: Hoare triple {468#(= main_~p1~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {468#(= main_~p1~0 0)} is VALID [2022-04-27 15:09:39,726 INFO L290 TraceCheckUtils]: 19: Hoare triple {468#(= main_~p1~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {468#(= main_~p1~0 0)} is VALID [2022-04-27 15:09:39,726 INFO L290 TraceCheckUtils]: 20: Hoare triple {468#(= main_~p1~0 0)} assume 0 != ~p13~0;~lk13~0 := 1; {468#(= main_~p1~0 0)} is VALID [2022-04-27 15:09:39,726 INFO L290 TraceCheckUtils]: 21: Hoare triple {468#(= main_~p1~0 0)} assume 0 != ~p14~0;~lk14~0 := 1; {468#(= main_~p1~0 0)} is VALID [2022-04-27 15:09:39,727 INFO L290 TraceCheckUtils]: 22: Hoare triple {468#(= main_~p1~0 0)} assume 0 != ~p1~0; {464#false} is VALID [2022-04-27 15:09:39,727 INFO L290 TraceCheckUtils]: 23: Hoare triple {464#false} assume 1 != ~lk1~0; {464#false} is VALID [2022-04-27 15:09:39,727 INFO L290 TraceCheckUtils]: 24: Hoare triple {464#false} assume !false; {464#false} is VALID [2022-04-27 15:09:39,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:09:39,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:09:39,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150864027] [2022-04-27 15:09:39,728 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150864027] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:09:39,728 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:09:39,728 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:09:39,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661322774] [2022-04-27 15:09:39,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:09:39,730 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-27 15:09:39,730 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:09:39,730 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-27 15:09:39,756 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-27 15:09:39,756 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:09:39,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:09:39,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:09:39,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:09:39,758 INFO L87 Difference]: Start difference. First operand 67 states and 122 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-27 15:09:40,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:40,067 INFO L93 Difference]: Finished difference Result 158 states and 293 transitions. [2022-04-27 15:09:40,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:09:40,068 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-27 15:09:40,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:09:40,068 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-27 15:09:40,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 264 transitions. [2022-04-27 15:09:40,073 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-27 15:09:40,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 264 transitions. [2022-04-27 15:09:40,076 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 264 transitions. [2022-04-27 15:09:40,294 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 264 edges. 264 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:09:40,297 INFO L225 Difference]: With dead ends: 158 [2022-04-27 15:09:40,297 INFO L226 Difference]: Without dead ends: 97 [2022-04-27 15:09:40,298 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-27 15:09:40,299 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 208 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 15:09:40,300 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 127 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 15:09:40,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-04-27 15:09:40,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 95. [2022-04-27 15:09:40,307 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:09:40,307 INFO L82 GeneralOperation]: Start isEquivalent. First operand 97 states. Second operand has 95 states, 91 states have (on average 1.879120879120879) internal successors, (171), 91 states have internal predecessors, (171), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:40,308 INFO L74 IsIncluded]: Start isIncluded. First operand 97 states. Second operand has 95 states, 91 states have (on average 1.879120879120879) internal successors, (171), 91 states have internal predecessors, (171), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:40,308 INFO L87 Difference]: Start difference. First operand 97 states. Second operand has 95 states, 91 states have (on average 1.879120879120879) internal successors, (171), 91 states have internal predecessors, (171), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:40,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:40,311 INFO L93 Difference]: Finished difference Result 97 states and 175 transitions. [2022-04-27 15:09:40,312 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 175 transitions. [2022-04-27 15:09:40,312 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:09:40,312 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:09:40,313 INFO L74 IsIncluded]: Start isIncluded. First operand has 95 states, 91 states have (on average 1.879120879120879) internal successors, (171), 91 states have internal predecessors, (171), 2 states have call successors, (2), 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 97 states. [2022-04-27 15:09:40,313 INFO L87 Difference]: Start difference. First operand has 95 states, 91 states have (on average 1.879120879120879) internal successors, (171), 91 states have internal predecessors, (171), 2 states have call successors, (2), 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 97 states. [2022-04-27 15:09:40,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:40,317 INFO L93 Difference]: Finished difference Result 97 states and 175 transitions. [2022-04-27 15:09:40,317 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 175 transitions. [2022-04-27 15:09:40,318 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:09:40,318 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:09:40,318 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:09:40,318 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:09:40,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 91 states have (on average 1.879120879120879) internal successors, (171), 91 states have internal predecessors, (171), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:40,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 174 transitions. [2022-04-27 15:09:40,322 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 174 transitions. Word has length 25 [2022-04-27 15:09:40,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:09:40,323 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 174 transitions. [2022-04-27 15:09:40,323 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-27 15:09:40,323 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 174 transitions. [2022-04-27 15:09:40,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-27 15:09:40,324 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:09:40,324 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-27 15:09:40,324 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 15:09:40,324 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:09:40,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:09:40,325 INFO L85 PathProgramCache]: Analyzing trace with hash 282593920, now seen corresponding path program 1 times [2022-04-27 15:09:40,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:09:40,325 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111867150] [2022-04-27 15:09:40,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:09:40,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:09:40,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:40,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:09:40,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:40,386 INFO L290 TraceCheckUtils]: 0: Hoare triple {945#(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(18, 2);call #Ultimate.allocInit(12, 3); {939#true} is VALID [2022-04-27 15:09:40,387 INFO L290 TraceCheckUtils]: 1: Hoare triple {939#true} assume true; {939#true} is VALID [2022-04-27 15:09:40,387 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {939#true} {939#true} #268#return; {939#true} is VALID [2022-04-27 15:09:40,388 INFO L272 TraceCheckUtils]: 0: Hoare triple {939#true} call ULTIMATE.init(); {945#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:09:40,389 INFO L290 TraceCheckUtils]: 1: Hoare triple {945#(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(18, 2);call #Ultimate.allocInit(12, 3); {939#true} is VALID [2022-04-27 15:09:40,389 INFO L290 TraceCheckUtils]: 2: Hoare triple {939#true} assume true; {939#true} is VALID [2022-04-27 15:09:40,389 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {939#true} {939#true} #268#return; {939#true} is VALID [2022-04-27 15:09:40,389 INFO L272 TraceCheckUtils]: 4: Hoare triple {939#true} call #t~ret19 := main(); {939#true} is VALID [2022-04-27 15:09:40,389 INFO L290 TraceCheckUtils]: 5: Hoare triple {939#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;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;havoc ~cond~0; {939#true} is VALID [2022-04-27 15:09:40,390 INFO L290 TraceCheckUtils]: 6: Hoare triple {939#true} assume !false;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~cond~0 := #t~nondet18;havoc #t~nondet18; {939#true} is VALID [2022-04-27 15:09:40,390 INFO L290 TraceCheckUtils]: 7: Hoare triple {939#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;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0; {939#true} is VALID [2022-04-27 15:09:40,391 INFO L290 TraceCheckUtils]: 8: Hoare triple {939#true} assume 0 != ~p1~0;~lk1~0 := 1; {944#(not (= main_~p1~0 0))} is VALID [2022-04-27 15:09:40,391 INFO L290 TraceCheckUtils]: 9: Hoare triple {944#(not (= main_~p1~0 0))} assume !(0 != ~p2~0); {944#(not (= main_~p1~0 0))} is VALID [2022-04-27 15:09:40,392 INFO L290 TraceCheckUtils]: 10: Hoare triple {944#(not (= main_~p1~0 0))} assume 0 != ~p3~0;~lk3~0 := 1; {944#(not (= main_~p1~0 0))} is VALID [2022-04-27 15:09:40,392 INFO L290 TraceCheckUtils]: 11: Hoare triple {944#(not (= main_~p1~0 0))} assume 0 != ~p4~0;~lk4~0 := 1; {944#(not (= main_~p1~0 0))} is VALID [2022-04-27 15:09:40,392 INFO L290 TraceCheckUtils]: 12: Hoare triple {944#(not (= main_~p1~0 0))} assume 0 != ~p5~0;~lk5~0 := 1; {944#(not (= main_~p1~0 0))} is VALID [2022-04-27 15:09:40,393 INFO L290 TraceCheckUtils]: 13: Hoare triple {944#(not (= main_~p1~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {944#(not (= main_~p1~0 0))} is VALID [2022-04-27 15:09:40,393 INFO L290 TraceCheckUtils]: 14: Hoare triple {944#(not (= main_~p1~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {944#(not (= main_~p1~0 0))} is VALID [2022-04-27 15:09:40,394 INFO L290 TraceCheckUtils]: 15: Hoare triple {944#(not (= main_~p1~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {944#(not (= main_~p1~0 0))} is VALID [2022-04-27 15:09:40,394 INFO L290 TraceCheckUtils]: 16: Hoare triple {944#(not (= main_~p1~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {944#(not (= main_~p1~0 0))} is VALID [2022-04-27 15:09:40,394 INFO L290 TraceCheckUtils]: 17: Hoare triple {944#(not (= main_~p1~0 0))} assume !(0 != ~p10~0); {944#(not (= main_~p1~0 0))} is VALID [2022-04-27 15:09:40,395 INFO L290 TraceCheckUtils]: 18: Hoare triple {944#(not (= main_~p1~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {944#(not (= main_~p1~0 0))} is VALID [2022-04-27 15:09:40,395 INFO L290 TraceCheckUtils]: 19: Hoare triple {944#(not (= main_~p1~0 0))} assume 0 != ~p12~0;~lk12~0 := 1; {944#(not (= main_~p1~0 0))} is VALID [2022-04-27 15:09:40,396 INFO L290 TraceCheckUtils]: 20: Hoare triple {944#(not (= main_~p1~0 0))} assume 0 != ~p13~0;~lk13~0 := 1; {944#(not (= main_~p1~0 0))} is VALID [2022-04-27 15:09:40,396 INFO L290 TraceCheckUtils]: 21: Hoare triple {944#(not (= main_~p1~0 0))} assume 0 != ~p14~0;~lk14~0 := 1; {944#(not (= main_~p1~0 0))} is VALID [2022-04-27 15:09:40,397 INFO L290 TraceCheckUtils]: 22: Hoare triple {944#(not (= main_~p1~0 0))} assume !(0 != ~p1~0); {940#false} is VALID [2022-04-27 15:09:40,397 INFO L290 TraceCheckUtils]: 23: Hoare triple {940#false} assume 0 != ~p2~0; {940#false} is VALID [2022-04-27 15:09:40,397 INFO L290 TraceCheckUtils]: 24: Hoare triple {940#false} assume 1 != ~lk2~0; {940#false} is VALID [2022-04-27 15:09:40,397 INFO L290 TraceCheckUtils]: 25: Hoare triple {940#false} assume !false; {940#false} is VALID [2022-04-27 15:09:40,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:09:40,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:09:40,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111867150] [2022-04-27 15:09:40,398 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111867150] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:09:40,399 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:09:40,399 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:09:40,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131642306] [2022-04-27 15:09:40,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:09:40,400 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-27 15:09:40,400 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:09:40,401 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-27 15:09:40,417 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-27 15:09:40,417 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:09:40,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:09:40,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:09:40,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:09:40,418 INFO L87 Difference]: Start difference. First operand 95 states and 174 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-27 15:09:40,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:40,672 INFO L93 Difference]: Finished difference Result 145 states and 262 transitions. [2022-04-27 15:09:40,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:09:40,672 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-27 15:09:40,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:09:40,673 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-27 15:09:40,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 259 transitions. [2022-04-27 15:09:40,676 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-27 15:09:40,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 259 transitions. [2022-04-27 15:09:40,679 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 259 transitions. [2022-04-27 15:09:40,904 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-27 15:09:40,907 INFO L225 Difference]: With dead ends: 145 [2022-04-27 15:09:40,907 INFO L226 Difference]: Without dead ends: 100 [2022-04-27 15:09:40,909 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-27 15:09:40,917 INFO L413 NwaCegarLoop]: 146 mSDtfsCounter, 183 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 15:09:40,918 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 153 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 15:09:40,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-04-27 15:09:40,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 98. [2022-04-27 15:09:40,931 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:09:40,931 INFO L82 GeneralOperation]: Start isEquivalent. First operand 100 states. Second operand has 98 states, 94 states have (on average 1.8404255319148937) internal successors, (173), 94 states have internal predecessors, (173), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:40,932 INFO L74 IsIncluded]: Start isIncluded. First operand 100 states. Second operand has 98 states, 94 states have (on average 1.8404255319148937) internal successors, (173), 94 states have internal predecessors, (173), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:40,932 INFO L87 Difference]: Start difference. First operand 100 states. Second operand has 98 states, 94 states have (on average 1.8404255319148937) internal successors, (173), 94 states have internal predecessors, (173), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:40,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:40,935 INFO L93 Difference]: Finished difference Result 100 states and 177 transitions. [2022-04-27 15:09:40,935 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 177 transitions. [2022-04-27 15:09:40,936 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:09:40,936 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:09:40,936 INFO L74 IsIncluded]: Start isIncluded. First operand has 98 states, 94 states have (on average 1.8404255319148937) internal successors, (173), 94 states have internal predecessors, (173), 2 states have call successors, (2), 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 100 states. [2022-04-27 15:09:40,936 INFO L87 Difference]: Start difference. First operand has 98 states, 94 states have (on average 1.8404255319148937) internal successors, (173), 94 states have internal predecessors, (173), 2 states have call successors, (2), 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 100 states. [2022-04-27 15:09:40,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:40,947 INFO L93 Difference]: Finished difference Result 100 states and 177 transitions. [2022-04-27 15:09:40,947 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 177 transitions. [2022-04-27 15:09:40,950 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:09:40,950 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:09:40,950 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:09:40,950 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:09:40,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 94 states have (on average 1.8404255319148937) internal successors, (173), 94 states have internal predecessors, (173), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:40,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 176 transitions. [2022-04-27 15:09:40,956 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 176 transitions. Word has length 26 [2022-04-27 15:09:40,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:09:40,956 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 176 transitions. [2022-04-27 15:09:40,956 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-27 15:09:40,957 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 176 transitions. [2022-04-27 15:09:40,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-27 15:09:40,957 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:09:40,957 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-27 15:09:40,957 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-27 15:09:40,958 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:09:40,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:09:40,959 INFO L85 PathProgramCache]: Analyzing trace with hash -1711550786, now seen corresponding path program 1 times [2022-04-27 15:09:40,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:09:40,959 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271338780] [2022-04-27 15:09:40,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:09:40,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:09:41,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:41,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:09:41,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:41,069 INFO L290 TraceCheckUtils]: 0: Hoare triple {1419#(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(18, 2);call #Ultimate.allocInit(12, 3); {1413#true} is VALID [2022-04-27 15:09:41,069 INFO L290 TraceCheckUtils]: 1: Hoare triple {1413#true} assume true; {1413#true} is VALID [2022-04-27 15:09:41,069 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1413#true} {1413#true} #268#return; {1413#true} is VALID [2022-04-27 15:09:41,070 INFO L272 TraceCheckUtils]: 0: Hoare triple {1413#true} call ULTIMATE.init(); {1419#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:09:41,070 INFO L290 TraceCheckUtils]: 1: Hoare triple {1419#(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(18, 2);call #Ultimate.allocInit(12, 3); {1413#true} is VALID [2022-04-27 15:09:41,072 INFO L290 TraceCheckUtils]: 2: Hoare triple {1413#true} assume true; {1413#true} is VALID [2022-04-27 15:09:41,072 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1413#true} {1413#true} #268#return; {1413#true} is VALID [2022-04-27 15:09:41,073 INFO L272 TraceCheckUtils]: 4: Hoare triple {1413#true} call #t~ret19 := main(); {1413#true} is VALID [2022-04-27 15:09:41,073 INFO L290 TraceCheckUtils]: 5: Hoare triple {1413#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;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;havoc ~cond~0; {1413#true} is VALID [2022-04-27 15:09:41,073 INFO L290 TraceCheckUtils]: 6: Hoare triple {1413#true} assume !false;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~cond~0 := #t~nondet18;havoc #t~nondet18; {1413#true} is VALID [2022-04-27 15:09:41,073 INFO L290 TraceCheckUtils]: 7: Hoare triple {1413#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;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0; {1413#true} is VALID [2022-04-27 15:09:41,073 INFO L290 TraceCheckUtils]: 8: Hoare triple {1413#true} assume !(0 != ~p1~0); {1413#true} is VALID [2022-04-27 15:09:41,073 INFO L290 TraceCheckUtils]: 9: Hoare triple {1413#true} assume !(0 != ~p2~0); {1418#(= main_~p2~0 0)} is VALID [2022-04-27 15:09:41,074 INFO L290 TraceCheckUtils]: 10: Hoare triple {1418#(= main_~p2~0 0)} assume 0 != ~p3~0;~lk3~0 := 1; {1418#(= main_~p2~0 0)} is VALID [2022-04-27 15:09:41,075 INFO L290 TraceCheckUtils]: 11: Hoare triple {1418#(= main_~p2~0 0)} assume 0 != ~p4~0;~lk4~0 := 1; {1418#(= main_~p2~0 0)} is VALID [2022-04-27 15:09:41,075 INFO L290 TraceCheckUtils]: 12: Hoare triple {1418#(= main_~p2~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {1418#(= main_~p2~0 0)} is VALID [2022-04-27 15:09:41,075 INFO L290 TraceCheckUtils]: 13: Hoare triple {1418#(= main_~p2~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {1418#(= main_~p2~0 0)} is VALID [2022-04-27 15:09:41,076 INFO L290 TraceCheckUtils]: 14: Hoare triple {1418#(= main_~p2~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {1418#(= main_~p2~0 0)} is VALID [2022-04-27 15:09:41,079 INFO L290 TraceCheckUtils]: 15: Hoare triple {1418#(= main_~p2~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {1418#(= main_~p2~0 0)} is VALID [2022-04-27 15:09:41,079 INFO L290 TraceCheckUtils]: 16: Hoare triple {1418#(= main_~p2~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {1418#(= main_~p2~0 0)} is VALID [2022-04-27 15:09:41,080 INFO L290 TraceCheckUtils]: 17: Hoare triple {1418#(= main_~p2~0 0)} assume !(0 != ~p10~0); {1418#(= main_~p2~0 0)} is VALID [2022-04-27 15:09:41,080 INFO L290 TraceCheckUtils]: 18: Hoare triple {1418#(= main_~p2~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {1418#(= main_~p2~0 0)} is VALID [2022-04-27 15:09:41,080 INFO L290 TraceCheckUtils]: 19: Hoare triple {1418#(= main_~p2~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {1418#(= main_~p2~0 0)} is VALID [2022-04-27 15:09:41,081 INFO L290 TraceCheckUtils]: 20: Hoare triple {1418#(= main_~p2~0 0)} assume 0 != ~p13~0;~lk13~0 := 1; {1418#(= main_~p2~0 0)} is VALID [2022-04-27 15:09:41,081 INFO L290 TraceCheckUtils]: 21: Hoare triple {1418#(= main_~p2~0 0)} assume 0 != ~p14~0;~lk14~0 := 1; {1418#(= main_~p2~0 0)} is VALID [2022-04-27 15:09:41,082 INFO L290 TraceCheckUtils]: 22: Hoare triple {1418#(= main_~p2~0 0)} assume !(0 != ~p1~0); {1418#(= main_~p2~0 0)} is VALID [2022-04-27 15:09:41,082 INFO L290 TraceCheckUtils]: 23: Hoare triple {1418#(= main_~p2~0 0)} assume 0 != ~p2~0; {1414#false} is VALID [2022-04-27 15:09:41,082 INFO L290 TraceCheckUtils]: 24: Hoare triple {1414#false} assume 1 != ~lk2~0; {1414#false} is VALID [2022-04-27 15:09:41,082 INFO L290 TraceCheckUtils]: 25: Hoare triple {1414#false} assume !false; {1414#false} is VALID [2022-04-27 15:09:41,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:09:41,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:09:41,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271338780] [2022-04-27 15:09:41,083 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271338780] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:09:41,083 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:09:41,083 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:09:41,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773706279] [2022-04-27 15:09:41,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:09:41,084 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-27 15:09:41,084 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:09:41,084 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-27 15:09:41,102 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-27 15:09:41,102 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:09:41,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:09:41,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:09:41,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:09:41,104 INFO L87 Difference]: Start difference. First operand 98 states and 176 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-27 15:09:41,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:41,344 INFO L93 Difference]: Finished difference Result 274 states and 504 transitions. [2022-04-27 15:09:41,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:09:41,344 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-27 15:09:41,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:09:41,345 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-27 15:09:41,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 262 transitions. [2022-04-27 15:09:41,348 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-27 15:09:41,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 262 transitions. [2022-04-27 15:09:41,351 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 262 transitions. [2022-04-27 15:09:41,548 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 262 edges. 262 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:09:41,551 INFO L225 Difference]: With dead ends: 274 [2022-04-27 15:09:41,551 INFO L226 Difference]: Without dead ends: 185 [2022-04-27 15:09:41,551 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-27 15:09:41,552 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 231 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 15:09:41,553 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 103 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 15:09:41,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2022-04-27 15:09:41,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 183. [2022-04-27 15:09:41,560 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:09:41,560 INFO L82 GeneralOperation]: Start isEquivalent. First operand 185 states. Second operand has 183 states, 179 states have (on average 1.8435754189944134) internal successors, (330), 179 states have internal predecessors, (330), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:41,561 INFO L74 IsIncluded]: Start isIncluded. First operand 185 states. Second operand has 183 states, 179 states have (on average 1.8435754189944134) internal successors, (330), 179 states have internal predecessors, (330), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:41,561 INFO L87 Difference]: Start difference. First operand 185 states. Second operand has 183 states, 179 states have (on average 1.8435754189944134) internal successors, (330), 179 states have internal predecessors, (330), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:41,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:41,567 INFO L93 Difference]: Finished difference Result 185 states and 334 transitions. [2022-04-27 15:09:41,567 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 334 transitions. [2022-04-27 15:09:41,568 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:09:41,568 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:09:41,568 INFO L74 IsIncluded]: Start isIncluded. First operand has 183 states, 179 states have (on average 1.8435754189944134) internal successors, (330), 179 states have internal predecessors, (330), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 185 states. [2022-04-27 15:09:41,569 INFO L87 Difference]: Start difference. First operand has 183 states, 179 states have (on average 1.8435754189944134) internal successors, (330), 179 states have internal predecessors, (330), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 185 states. [2022-04-27 15:09:41,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:41,574 INFO L93 Difference]: Finished difference Result 185 states and 334 transitions. [2022-04-27 15:09:41,574 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 334 transitions. [2022-04-27 15:09:41,575 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:09:41,575 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:09:41,575 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:09:41,575 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:09:41,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 179 states have (on average 1.8435754189944134) internal successors, (330), 179 states have internal predecessors, (330), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:41,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 333 transitions. [2022-04-27 15:09:41,580 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 333 transitions. Word has length 26 [2022-04-27 15:09:41,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:09:41,581 INFO L495 AbstractCegarLoop]: Abstraction has 183 states and 333 transitions. [2022-04-27 15:09:41,581 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-27 15:09:41,581 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 333 transitions. [2022-04-27 15:09:41,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-27 15:09:41,581 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:09:41,581 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-27 15:09:41,581 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-27 15:09:41,582 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:09:41,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:09:41,582 INFO L85 PathProgramCache]: Analyzing trace with hash -123202884, now seen corresponding path program 1 times [2022-04-27 15:09:41,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:09:41,582 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773958632] [2022-04-27 15:09:41,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:09:41,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:09:41,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:41,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:09:41,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:41,630 INFO L290 TraceCheckUtils]: 0: Hoare triple {2282#(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(18, 2);call #Ultimate.allocInit(12, 3); {2276#true} is VALID [2022-04-27 15:09:41,630 INFO L290 TraceCheckUtils]: 1: Hoare triple {2276#true} assume true; {2276#true} is VALID [2022-04-27 15:09:41,630 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2276#true} {2276#true} #268#return; {2276#true} is VALID [2022-04-27 15:09:41,631 INFO L272 TraceCheckUtils]: 0: Hoare triple {2276#true} call ULTIMATE.init(); {2282#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:09:41,631 INFO L290 TraceCheckUtils]: 1: Hoare triple {2282#(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(18, 2);call #Ultimate.allocInit(12, 3); {2276#true} is VALID [2022-04-27 15:09:41,631 INFO L290 TraceCheckUtils]: 2: Hoare triple {2276#true} assume true; {2276#true} is VALID [2022-04-27 15:09:41,631 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2276#true} {2276#true} #268#return; {2276#true} is VALID [2022-04-27 15:09:41,632 INFO L272 TraceCheckUtils]: 4: Hoare triple {2276#true} call #t~ret19 := main(); {2276#true} is VALID [2022-04-27 15:09:41,632 INFO L290 TraceCheckUtils]: 5: Hoare triple {2276#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;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;havoc ~cond~0; {2276#true} is VALID [2022-04-27 15:09:41,632 INFO L290 TraceCheckUtils]: 6: Hoare triple {2276#true} assume !false;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~cond~0 := #t~nondet18;havoc #t~nondet18; {2276#true} is VALID [2022-04-27 15:09:41,632 INFO L290 TraceCheckUtils]: 7: Hoare triple {2276#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;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0; {2276#true} is VALID [2022-04-27 15:09:41,632 INFO L290 TraceCheckUtils]: 8: Hoare triple {2276#true} assume !(0 != ~p1~0); {2276#true} is VALID [2022-04-27 15:09:41,632 INFO L290 TraceCheckUtils]: 9: Hoare triple {2276#true} assume 0 != ~p2~0;~lk2~0 := 1; {2281#(= main_~lk2~0 1)} is VALID [2022-04-27 15:09:41,633 INFO L290 TraceCheckUtils]: 10: Hoare triple {2281#(= main_~lk2~0 1)} assume 0 != ~p3~0;~lk3~0 := 1; {2281#(= main_~lk2~0 1)} is VALID [2022-04-27 15:09:41,633 INFO L290 TraceCheckUtils]: 11: Hoare triple {2281#(= main_~lk2~0 1)} assume 0 != ~p4~0;~lk4~0 := 1; {2281#(= main_~lk2~0 1)} is VALID [2022-04-27 15:09:41,633 INFO L290 TraceCheckUtils]: 12: Hoare triple {2281#(= main_~lk2~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {2281#(= main_~lk2~0 1)} is VALID [2022-04-27 15:09:41,634 INFO L290 TraceCheckUtils]: 13: Hoare triple {2281#(= main_~lk2~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {2281#(= main_~lk2~0 1)} is VALID [2022-04-27 15:09:41,634 INFO L290 TraceCheckUtils]: 14: Hoare triple {2281#(= main_~lk2~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {2281#(= main_~lk2~0 1)} is VALID [2022-04-27 15:09:41,635 INFO L290 TraceCheckUtils]: 15: Hoare triple {2281#(= main_~lk2~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {2281#(= main_~lk2~0 1)} is VALID [2022-04-27 15:09:41,635 INFO L290 TraceCheckUtils]: 16: Hoare triple {2281#(= main_~lk2~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {2281#(= main_~lk2~0 1)} is VALID [2022-04-27 15:09:41,635 INFO L290 TraceCheckUtils]: 17: Hoare triple {2281#(= main_~lk2~0 1)} assume !(0 != ~p10~0); {2281#(= main_~lk2~0 1)} is VALID [2022-04-27 15:09:41,636 INFO L290 TraceCheckUtils]: 18: Hoare triple {2281#(= main_~lk2~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {2281#(= main_~lk2~0 1)} is VALID [2022-04-27 15:09:41,636 INFO L290 TraceCheckUtils]: 19: Hoare triple {2281#(= main_~lk2~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {2281#(= main_~lk2~0 1)} is VALID [2022-04-27 15:09:41,636 INFO L290 TraceCheckUtils]: 20: Hoare triple {2281#(= main_~lk2~0 1)} assume 0 != ~p13~0;~lk13~0 := 1; {2281#(= main_~lk2~0 1)} is VALID [2022-04-27 15:09:41,637 INFO L290 TraceCheckUtils]: 21: Hoare triple {2281#(= main_~lk2~0 1)} assume 0 != ~p14~0;~lk14~0 := 1; {2281#(= main_~lk2~0 1)} is VALID [2022-04-27 15:09:41,637 INFO L290 TraceCheckUtils]: 22: Hoare triple {2281#(= main_~lk2~0 1)} assume !(0 != ~p1~0); {2281#(= main_~lk2~0 1)} is VALID [2022-04-27 15:09:41,637 INFO L290 TraceCheckUtils]: 23: Hoare triple {2281#(= main_~lk2~0 1)} assume 0 != ~p2~0; {2281#(= main_~lk2~0 1)} is VALID [2022-04-27 15:09:41,638 INFO L290 TraceCheckUtils]: 24: Hoare triple {2281#(= main_~lk2~0 1)} assume 1 != ~lk2~0; {2277#false} is VALID [2022-04-27 15:09:41,638 INFO L290 TraceCheckUtils]: 25: Hoare triple {2277#false} assume !false; {2277#false} is VALID [2022-04-27 15:09:41,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:09:41,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:09:41,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773958632] [2022-04-27 15:09:41,638 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773958632] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:09:41,638 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:09:41,638 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:09:41,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809926613] [2022-04-27 15:09:41,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:09:41,639 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-27 15:09:41,639 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:09:41,639 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-27 15:09:41,656 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-27 15:09:41,656 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:09:41,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:09:41,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:09:41,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:09:41,657 INFO L87 Difference]: Start difference. First operand 183 states and 333 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-27 15:09:41,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:41,891 INFO L93 Difference]: Finished difference Result 239 states and 435 transitions. [2022-04-27 15:09:41,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:09:41,891 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-27 15:09:41,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:09:41,891 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-27 15:09:41,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 172 transitions. [2022-04-27 15:09:41,893 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-27 15:09:41,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 172 transitions. [2022-04-27 15:09:41,900 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 172 transitions. [2022-04-27 15:09:42,044 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 172 edges. 172 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:09:42,048 INFO L225 Difference]: With dead ends: 239 [2022-04-27 15:09:42,048 INFO L226 Difference]: Without dead ends: 237 [2022-04-27 15:09:42,048 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-27 15:09:42,049 INFO L413 NwaCegarLoop]: 169 mSDtfsCounter, 150 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 15:09:42,049 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 176 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 15:09:42,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2022-04-27 15:09:42,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 183. [2022-04-27 15:09:42,057 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:09:42,057 INFO L82 GeneralOperation]: Start isEquivalent. First operand 237 states. Second operand has 183 states, 179 states have (on average 1.8324022346368716) internal successors, (328), 179 states have internal predecessors, (328), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:42,058 INFO L74 IsIncluded]: Start isIncluded. First operand 237 states. Second operand has 183 states, 179 states have (on average 1.8324022346368716) internal successors, (328), 179 states have internal predecessors, (328), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:42,058 INFO L87 Difference]: Start difference. First operand 237 states. Second operand has 183 states, 179 states have (on average 1.8324022346368716) internal successors, (328), 179 states have internal predecessors, (328), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:42,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:42,065 INFO L93 Difference]: Finished difference Result 237 states and 432 transitions. [2022-04-27 15:09:42,065 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 432 transitions. [2022-04-27 15:09:42,066 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:09:42,066 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:09:42,067 INFO L74 IsIncluded]: Start isIncluded. First operand has 183 states, 179 states have (on average 1.8324022346368716) internal successors, (328), 179 states have internal predecessors, (328), 2 states have call successors, (2), 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 237 states. [2022-04-27 15:09:42,067 INFO L87 Difference]: Start difference. First operand has 183 states, 179 states have (on average 1.8324022346368716) internal successors, (328), 179 states have internal predecessors, (328), 2 states have call successors, (2), 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 237 states. [2022-04-27 15:09:42,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:42,074 INFO L93 Difference]: Finished difference Result 237 states and 432 transitions. [2022-04-27 15:09:42,074 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 432 transitions. [2022-04-27 15:09:42,075 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:09:42,075 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:09:42,075 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:09:42,075 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:09:42,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 179 states have (on average 1.8324022346368716) internal successors, (328), 179 states have internal predecessors, (328), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:42,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 331 transitions. [2022-04-27 15:09:42,081 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 331 transitions. Word has length 26 [2022-04-27 15:09:42,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:09:42,081 INFO L495 AbstractCegarLoop]: Abstraction has 183 states and 331 transitions. [2022-04-27 15:09:42,081 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-27 15:09:42,081 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 331 transitions. [2022-04-27 15:09:42,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-27 15:09:42,082 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:09:42,082 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-27 15:09:42,082 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-27 15:09:42,082 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:09:42,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:09:42,082 INFO L85 PathProgramCache]: Analyzing trace with hash -1518254386, now seen corresponding path program 1 times [2022-04-27 15:09:42,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:09:42,083 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22910364] [2022-04-27 15:09:42,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:09:42,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:09:42,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:42,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:09:42,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:42,128 INFO L290 TraceCheckUtils]: 0: Hoare triple {3214#(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(18, 2);call #Ultimate.allocInit(12, 3); {3208#true} is VALID [2022-04-27 15:09:42,129 INFO L290 TraceCheckUtils]: 1: Hoare triple {3208#true} assume true; {3208#true} is VALID [2022-04-27 15:09:42,129 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3208#true} {3208#true} #268#return; {3208#true} is VALID [2022-04-27 15:09:42,129 INFO L272 TraceCheckUtils]: 0: Hoare triple {3208#true} call ULTIMATE.init(); {3214#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:09:42,129 INFO L290 TraceCheckUtils]: 1: Hoare triple {3214#(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(18, 2);call #Ultimate.allocInit(12, 3); {3208#true} is VALID [2022-04-27 15:09:42,130 INFO L290 TraceCheckUtils]: 2: Hoare triple {3208#true} assume true; {3208#true} is VALID [2022-04-27 15:09:42,130 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3208#true} {3208#true} #268#return; {3208#true} is VALID [2022-04-27 15:09:42,130 INFO L272 TraceCheckUtils]: 4: Hoare triple {3208#true} call #t~ret19 := main(); {3208#true} is VALID [2022-04-27 15:09:42,130 INFO L290 TraceCheckUtils]: 5: Hoare triple {3208#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;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;havoc ~cond~0; {3208#true} is VALID [2022-04-27 15:09:42,130 INFO L290 TraceCheckUtils]: 6: Hoare triple {3208#true} assume !false;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~cond~0 := #t~nondet18;havoc #t~nondet18; {3208#true} is VALID [2022-04-27 15:09:42,130 INFO L290 TraceCheckUtils]: 7: Hoare triple {3208#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;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0; {3208#true} is VALID [2022-04-27 15:09:42,130 INFO L290 TraceCheckUtils]: 8: Hoare triple {3208#true} assume !(0 != ~p1~0); {3208#true} is VALID [2022-04-27 15:09:42,130 INFO L290 TraceCheckUtils]: 9: Hoare triple {3208#true} assume !(0 != ~p2~0); {3208#true} is VALID [2022-04-27 15:09:42,131 INFO L290 TraceCheckUtils]: 10: Hoare triple {3208#true} assume 0 != ~p3~0;~lk3~0 := 1; {3213#(= main_~lk3~0 1)} is VALID [2022-04-27 15:09:42,131 INFO L290 TraceCheckUtils]: 11: Hoare triple {3213#(= main_~lk3~0 1)} assume 0 != ~p4~0;~lk4~0 := 1; {3213#(= main_~lk3~0 1)} is VALID [2022-04-27 15:09:42,131 INFO L290 TraceCheckUtils]: 12: Hoare triple {3213#(= main_~lk3~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {3213#(= main_~lk3~0 1)} is VALID [2022-04-27 15:09:42,132 INFO L290 TraceCheckUtils]: 13: Hoare triple {3213#(= main_~lk3~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {3213#(= main_~lk3~0 1)} is VALID [2022-04-27 15:09:42,132 INFO L290 TraceCheckUtils]: 14: Hoare triple {3213#(= main_~lk3~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {3213#(= main_~lk3~0 1)} is VALID [2022-04-27 15:09:42,132 INFO L290 TraceCheckUtils]: 15: Hoare triple {3213#(= main_~lk3~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {3213#(= main_~lk3~0 1)} is VALID [2022-04-27 15:09:42,133 INFO L290 TraceCheckUtils]: 16: Hoare triple {3213#(= main_~lk3~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {3213#(= main_~lk3~0 1)} is VALID [2022-04-27 15:09:42,133 INFO L290 TraceCheckUtils]: 17: Hoare triple {3213#(= main_~lk3~0 1)} assume !(0 != ~p10~0); {3213#(= main_~lk3~0 1)} is VALID [2022-04-27 15:09:42,133 INFO L290 TraceCheckUtils]: 18: Hoare triple {3213#(= main_~lk3~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {3213#(= main_~lk3~0 1)} is VALID [2022-04-27 15:09:42,134 INFO L290 TraceCheckUtils]: 19: Hoare triple {3213#(= main_~lk3~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {3213#(= main_~lk3~0 1)} is VALID [2022-04-27 15:09:42,134 INFO L290 TraceCheckUtils]: 20: Hoare triple {3213#(= main_~lk3~0 1)} assume 0 != ~p13~0;~lk13~0 := 1; {3213#(= main_~lk3~0 1)} is VALID [2022-04-27 15:09:42,134 INFO L290 TraceCheckUtils]: 21: Hoare triple {3213#(= main_~lk3~0 1)} assume 0 != ~p14~0;~lk14~0 := 1; {3213#(= main_~lk3~0 1)} is VALID [2022-04-27 15:09:42,135 INFO L290 TraceCheckUtils]: 22: Hoare triple {3213#(= main_~lk3~0 1)} assume !(0 != ~p1~0); {3213#(= main_~lk3~0 1)} is VALID [2022-04-27 15:09:42,135 INFO L290 TraceCheckUtils]: 23: Hoare triple {3213#(= main_~lk3~0 1)} assume !(0 != ~p2~0); {3213#(= main_~lk3~0 1)} is VALID [2022-04-27 15:09:42,135 INFO L290 TraceCheckUtils]: 24: Hoare triple {3213#(= main_~lk3~0 1)} assume 0 != ~p3~0; {3213#(= main_~lk3~0 1)} is VALID [2022-04-27 15:09:42,136 INFO L290 TraceCheckUtils]: 25: Hoare triple {3213#(= main_~lk3~0 1)} assume 1 != ~lk3~0; {3209#false} is VALID [2022-04-27 15:09:42,136 INFO L290 TraceCheckUtils]: 26: Hoare triple {3209#false} assume !false; {3209#false} is VALID [2022-04-27 15:09:42,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:09:42,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:09:42,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22910364] [2022-04-27 15:09:42,136 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22910364] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:09:42,136 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:09:42,137 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:09:42,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828181881] [2022-04-27 15:09:42,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:09:42,137 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-27 15:09:42,137 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:09:42,138 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-27 15:09:42,155 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-27 15:09:42,155 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:09:42,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:09:42,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:09:42,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:09:42,156 INFO L87 Difference]: Start difference. First operand 183 states and 331 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-27 15:09:42,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:42,418 INFO L93 Difference]: Finished difference Result 347 states and 635 transitions. [2022-04-27 15:09:42,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:09:42,418 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-27 15:09:42,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:09:42,418 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-27 15:09:42,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 171 transitions. [2022-04-27 15:09:42,421 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-27 15:09:42,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 171 transitions. [2022-04-27 15:09:42,423 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 171 transitions. [2022-04-27 15:09:42,561 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 171 edges. 171 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:09:42,567 INFO L225 Difference]: With dead ends: 347 [2022-04-27 15:09:42,567 INFO L226 Difference]: Without dead ends: 345 [2022-04-27 15:09:42,568 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-27 15:09:42,568 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 222 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 15:09:42,568 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 100 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 15:09:42,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2022-04-27 15:09:42,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 247. [2022-04-27 15:09:42,576 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:09:42,576 INFO L82 GeneralOperation]: Start isEquivalent. First operand 345 states. Second operand has 247 states, 243 states have (on average 1.8189300411522633) internal successors, (442), 243 states have internal predecessors, (442), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:42,577 INFO L74 IsIncluded]: Start isIncluded. First operand 345 states. Second operand has 247 states, 243 states have (on average 1.8189300411522633) internal successors, (442), 243 states have internal predecessors, (442), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:42,578 INFO L87 Difference]: Start difference. First operand 345 states. Second operand has 247 states, 243 states have (on average 1.8189300411522633) internal successors, (442), 243 states have internal predecessors, (442), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:42,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:42,588 INFO L93 Difference]: Finished difference Result 345 states and 630 transitions. [2022-04-27 15:09:42,588 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 630 transitions. [2022-04-27 15:09:42,589 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:09:42,589 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:09:42,589 INFO L74 IsIncluded]: Start isIncluded. First operand has 247 states, 243 states have (on average 1.8189300411522633) internal successors, (442), 243 states have internal predecessors, (442), 2 states have call successors, (2), 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 345 states. [2022-04-27 15:09:42,590 INFO L87 Difference]: Start difference. First operand has 247 states, 243 states have (on average 1.8189300411522633) internal successors, (442), 243 states have internal predecessors, (442), 2 states have call successors, (2), 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 345 states. [2022-04-27 15:09:42,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:42,600 INFO L93 Difference]: Finished difference Result 345 states and 630 transitions. [2022-04-27 15:09:42,600 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 630 transitions. [2022-04-27 15:09:42,600 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:09:42,600 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:09:42,600 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:09:42,601 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:09:42,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 243 states have (on average 1.8189300411522633) internal successors, (442), 243 states have internal predecessors, (442), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:42,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 445 transitions. [2022-04-27 15:09:42,608 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 445 transitions. Word has length 27 [2022-04-27 15:09:42,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:09:42,608 INFO L495 AbstractCegarLoop]: Abstraction has 247 states and 445 transitions. [2022-04-27 15:09:42,608 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-27 15:09:42,608 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 445 transitions. [2022-04-27 15:09:42,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-27 15:09:42,609 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:09:42,611 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-27 15:09:42,611 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-27 15:09:42,611 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:09:42,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:09:42,611 INFO L85 PathProgramCache]: Analyzing trace with hash 1188365008, now seen corresponding path program 1 times [2022-04-27 15:09:42,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:09:42,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813758118] [2022-04-27 15:09:42,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:09:42,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:09:42,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:42,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:09:42,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:42,687 INFO L290 TraceCheckUtils]: 0: Hoare triple {4536#(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(18, 2);call #Ultimate.allocInit(12, 3); {4530#true} is VALID [2022-04-27 15:09:42,687 INFO L290 TraceCheckUtils]: 1: Hoare triple {4530#true} assume true; {4530#true} is VALID [2022-04-27 15:09:42,688 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4530#true} {4530#true} #268#return; {4530#true} is VALID [2022-04-27 15:09:42,698 INFO L272 TraceCheckUtils]: 0: Hoare triple {4530#true} call ULTIMATE.init(); {4536#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:09:42,698 INFO L290 TraceCheckUtils]: 1: Hoare triple {4536#(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(18, 2);call #Ultimate.allocInit(12, 3); {4530#true} is VALID [2022-04-27 15:09:42,699 INFO L290 TraceCheckUtils]: 2: Hoare triple {4530#true} assume true; {4530#true} is VALID [2022-04-27 15:09:42,699 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4530#true} {4530#true} #268#return; {4530#true} is VALID [2022-04-27 15:09:42,699 INFO L272 TraceCheckUtils]: 4: Hoare triple {4530#true} call #t~ret19 := main(); {4530#true} is VALID [2022-04-27 15:09:42,699 INFO L290 TraceCheckUtils]: 5: Hoare triple {4530#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;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;havoc ~cond~0; {4530#true} is VALID [2022-04-27 15:09:42,699 INFO L290 TraceCheckUtils]: 6: Hoare triple {4530#true} assume !false;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~cond~0 := #t~nondet18;havoc #t~nondet18; {4530#true} is VALID [2022-04-27 15:09:42,699 INFO L290 TraceCheckUtils]: 7: Hoare triple {4530#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;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0; {4530#true} is VALID [2022-04-27 15:09:42,699 INFO L290 TraceCheckUtils]: 8: Hoare triple {4530#true} assume !(0 != ~p1~0); {4530#true} is VALID [2022-04-27 15:09:42,699 INFO L290 TraceCheckUtils]: 9: Hoare triple {4530#true} assume !(0 != ~p2~0); {4530#true} is VALID [2022-04-27 15:09:42,700 INFO L290 TraceCheckUtils]: 10: Hoare triple {4530#true} assume !(0 != ~p3~0); {4535#(= main_~p3~0 0)} is VALID [2022-04-27 15:09:42,700 INFO L290 TraceCheckUtils]: 11: Hoare triple {4535#(= main_~p3~0 0)} assume 0 != ~p4~0;~lk4~0 := 1; {4535#(= main_~p3~0 0)} is VALID [2022-04-27 15:09:42,701 INFO L290 TraceCheckUtils]: 12: Hoare triple {4535#(= main_~p3~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {4535#(= main_~p3~0 0)} is VALID [2022-04-27 15:09:42,701 INFO L290 TraceCheckUtils]: 13: Hoare triple {4535#(= main_~p3~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {4535#(= main_~p3~0 0)} is VALID [2022-04-27 15:09:42,701 INFO L290 TraceCheckUtils]: 14: Hoare triple {4535#(= main_~p3~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {4535#(= main_~p3~0 0)} is VALID [2022-04-27 15:09:42,702 INFO L290 TraceCheckUtils]: 15: Hoare triple {4535#(= main_~p3~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {4535#(= main_~p3~0 0)} is VALID [2022-04-27 15:09:42,702 INFO L290 TraceCheckUtils]: 16: Hoare triple {4535#(= main_~p3~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {4535#(= main_~p3~0 0)} is VALID [2022-04-27 15:09:42,702 INFO L290 TraceCheckUtils]: 17: Hoare triple {4535#(= main_~p3~0 0)} assume !(0 != ~p10~0); {4535#(= main_~p3~0 0)} is VALID [2022-04-27 15:09:42,703 INFO L290 TraceCheckUtils]: 18: Hoare triple {4535#(= main_~p3~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {4535#(= main_~p3~0 0)} is VALID [2022-04-27 15:09:42,703 INFO L290 TraceCheckUtils]: 19: Hoare triple {4535#(= main_~p3~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {4535#(= main_~p3~0 0)} is VALID [2022-04-27 15:09:42,703 INFO L290 TraceCheckUtils]: 20: Hoare triple {4535#(= main_~p3~0 0)} assume 0 != ~p13~0;~lk13~0 := 1; {4535#(= main_~p3~0 0)} is VALID [2022-04-27 15:09:42,704 INFO L290 TraceCheckUtils]: 21: Hoare triple {4535#(= main_~p3~0 0)} assume 0 != ~p14~0;~lk14~0 := 1; {4535#(= main_~p3~0 0)} is VALID [2022-04-27 15:09:42,704 INFO L290 TraceCheckUtils]: 22: Hoare triple {4535#(= main_~p3~0 0)} assume !(0 != ~p1~0); {4535#(= main_~p3~0 0)} is VALID [2022-04-27 15:09:42,704 INFO L290 TraceCheckUtils]: 23: Hoare triple {4535#(= main_~p3~0 0)} assume !(0 != ~p2~0); {4535#(= main_~p3~0 0)} is VALID [2022-04-27 15:09:42,705 INFO L290 TraceCheckUtils]: 24: Hoare triple {4535#(= main_~p3~0 0)} assume 0 != ~p3~0; {4531#false} is VALID [2022-04-27 15:09:42,705 INFO L290 TraceCheckUtils]: 25: Hoare triple {4531#false} assume 1 != ~lk3~0; {4531#false} is VALID [2022-04-27 15:09:42,705 INFO L290 TraceCheckUtils]: 26: Hoare triple {4531#false} assume !false; {4531#false} is VALID [2022-04-27 15:09:42,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:09:42,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:09:42,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813758118] [2022-04-27 15:09:42,705 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813758118] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:09:42,706 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:09:42,706 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:09:42,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620997383] [2022-04-27 15:09:42,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:09:42,706 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-27 15:09:42,706 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:09:42,706 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-27 15:09:42,731 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-27 15:09:42,731 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:09:42,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:09:42,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:09:42,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:09:42,732 INFO L87 Difference]: Start difference. First operand 247 states and 445 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-27 15:09:42,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:42,985 INFO L93 Difference]: Finished difference Result 591 states and 1075 transitions. [2022-04-27 15:09:42,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:09:42,986 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-27 15:09:42,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:09:42,987 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-27 15:09:42,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 258 transitions. [2022-04-27 15:09:42,992 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-27 15:09:42,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 258 transitions. [2022-04-27 15:09:42,995 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 258 transitions. [2022-04-27 15:09:43,197 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 258 edges. 258 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:09:43,205 INFO L225 Difference]: With dead ends: 591 [2022-04-27 15:09:43,205 INFO L226 Difference]: Without dead ends: 353 [2022-04-27 15:09:43,206 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-27 15:09:43,206 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 196 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 15:09:43,207 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 131 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 15:09:43,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2022-04-27 15:09:43,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 351. [2022-04-27 15:09:43,214 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:09:43,215 INFO L82 GeneralOperation]: Start isEquivalent. First operand 353 states. Second operand has 351 states, 347 states have (on average 1.8097982708933718) internal successors, (628), 347 states have internal predecessors, (628), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:43,216 INFO L74 IsIncluded]: Start isIncluded. First operand 353 states. Second operand has 351 states, 347 states have (on average 1.8097982708933718) internal successors, (628), 347 states have internal predecessors, (628), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:43,217 INFO L87 Difference]: Start difference. First operand 353 states. Second operand has 351 states, 347 states have (on average 1.8097982708933718) internal successors, (628), 347 states have internal predecessors, (628), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:43,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:43,226 INFO L93 Difference]: Finished difference Result 353 states and 632 transitions. [2022-04-27 15:09:43,226 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 632 transitions. [2022-04-27 15:09:43,227 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:09:43,227 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:09:43,228 INFO L74 IsIncluded]: Start isIncluded. First operand has 351 states, 347 states have (on average 1.8097982708933718) internal successors, (628), 347 states have internal predecessors, (628), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 353 states. [2022-04-27 15:09:43,229 INFO L87 Difference]: Start difference. First operand has 351 states, 347 states have (on average 1.8097982708933718) internal successors, (628), 347 states have internal predecessors, (628), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 353 states. [2022-04-27 15:09:43,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:43,238 INFO L93 Difference]: Finished difference Result 353 states and 632 transitions. [2022-04-27 15:09:43,238 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 632 transitions. [2022-04-27 15:09:43,238 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:09:43,238 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:09:43,238 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:09:43,238 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:09:43,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 347 states have (on average 1.8097982708933718) internal successors, (628), 347 states have internal predecessors, (628), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:43,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 631 transitions. [2022-04-27 15:09:43,248 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 631 transitions. Word has length 27 [2022-04-27 15:09:43,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:09:43,248 INFO L495 AbstractCegarLoop]: Abstraction has 351 states and 631 transitions. [2022-04-27 15:09:43,248 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-27 15:09:43,248 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 631 transitions. [2022-04-27 15:09:43,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-27 15:09:43,249 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:09:43,249 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-27 15:09:43,249 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-27 15:09:43,249 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:09:43,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:09:43,250 INFO L85 PathProgramCache]: Analyzing trace with hash 178967059, now seen corresponding path program 1 times [2022-04-27 15:09:43,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:09:43,250 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085473287] [2022-04-27 15:09:43,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:09:43,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:09:43,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:43,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:09:43,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:43,287 INFO L290 TraceCheckUtils]: 0: Hoare triple {6230#(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(18, 2);call #Ultimate.allocInit(12, 3); {6224#true} is VALID [2022-04-27 15:09:43,287 INFO L290 TraceCheckUtils]: 1: Hoare triple {6224#true} assume true; {6224#true} is VALID [2022-04-27 15:09:43,287 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6224#true} {6224#true} #268#return; {6224#true} is VALID [2022-04-27 15:09:43,288 INFO L272 TraceCheckUtils]: 0: Hoare triple {6224#true} call ULTIMATE.init(); {6230#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:09:43,288 INFO L290 TraceCheckUtils]: 1: Hoare triple {6230#(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(18, 2);call #Ultimate.allocInit(12, 3); {6224#true} is VALID [2022-04-27 15:09:43,288 INFO L290 TraceCheckUtils]: 2: Hoare triple {6224#true} assume true; {6224#true} is VALID [2022-04-27 15:09:43,288 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6224#true} {6224#true} #268#return; {6224#true} is VALID [2022-04-27 15:09:43,288 INFO L272 TraceCheckUtils]: 4: Hoare triple {6224#true} call #t~ret19 := main(); {6224#true} is VALID [2022-04-27 15:09:43,289 INFO L290 TraceCheckUtils]: 5: Hoare triple {6224#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;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;havoc ~cond~0; {6224#true} is VALID [2022-04-27 15:09:43,289 INFO L290 TraceCheckUtils]: 6: Hoare triple {6224#true} assume !false;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~cond~0 := #t~nondet18;havoc #t~nondet18; {6224#true} is VALID [2022-04-27 15:09:43,289 INFO L290 TraceCheckUtils]: 7: Hoare triple {6224#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;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0; {6224#true} is VALID [2022-04-27 15:09:43,289 INFO L290 TraceCheckUtils]: 8: Hoare triple {6224#true} assume !(0 != ~p1~0); {6224#true} is VALID [2022-04-27 15:09:43,289 INFO L290 TraceCheckUtils]: 9: Hoare triple {6224#true} assume !(0 != ~p2~0); {6224#true} is VALID [2022-04-27 15:09:43,289 INFO L290 TraceCheckUtils]: 10: Hoare triple {6224#true} assume 0 != ~p3~0;~lk3~0 := 1; {6229#(not (= main_~p3~0 0))} is VALID [2022-04-27 15:09:43,290 INFO L290 TraceCheckUtils]: 11: Hoare triple {6229#(not (= main_~p3~0 0))} assume 0 != ~p4~0;~lk4~0 := 1; {6229#(not (= main_~p3~0 0))} is VALID [2022-04-27 15:09:43,290 INFO L290 TraceCheckUtils]: 12: Hoare triple {6229#(not (= main_~p3~0 0))} assume 0 != ~p5~0;~lk5~0 := 1; {6229#(not (= main_~p3~0 0))} is VALID [2022-04-27 15:09:43,290 INFO L290 TraceCheckUtils]: 13: Hoare triple {6229#(not (= main_~p3~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {6229#(not (= main_~p3~0 0))} is VALID [2022-04-27 15:09:43,291 INFO L290 TraceCheckUtils]: 14: Hoare triple {6229#(not (= main_~p3~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {6229#(not (= main_~p3~0 0))} is VALID [2022-04-27 15:09:43,291 INFO L290 TraceCheckUtils]: 15: Hoare triple {6229#(not (= main_~p3~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {6229#(not (= main_~p3~0 0))} is VALID [2022-04-27 15:09:43,291 INFO L290 TraceCheckUtils]: 16: Hoare triple {6229#(not (= main_~p3~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {6229#(not (= main_~p3~0 0))} is VALID [2022-04-27 15:09:43,292 INFO L290 TraceCheckUtils]: 17: Hoare triple {6229#(not (= main_~p3~0 0))} assume !(0 != ~p10~0); {6229#(not (= main_~p3~0 0))} is VALID [2022-04-27 15:09:43,292 INFO L290 TraceCheckUtils]: 18: Hoare triple {6229#(not (= main_~p3~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {6229#(not (= main_~p3~0 0))} is VALID [2022-04-27 15:09:43,292 INFO L290 TraceCheckUtils]: 19: Hoare triple {6229#(not (= main_~p3~0 0))} assume 0 != ~p12~0;~lk12~0 := 1; {6229#(not (= main_~p3~0 0))} is VALID [2022-04-27 15:09:43,292 INFO L290 TraceCheckUtils]: 20: Hoare triple {6229#(not (= main_~p3~0 0))} assume 0 != ~p13~0;~lk13~0 := 1; {6229#(not (= main_~p3~0 0))} is VALID [2022-04-27 15:09:43,293 INFO L290 TraceCheckUtils]: 21: Hoare triple {6229#(not (= main_~p3~0 0))} assume 0 != ~p14~0;~lk14~0 := 1; {6229#(not (= main_~p3~0 0))} is VALID [2022-04-27 15:09:43,293 INFO L290 TraceCheckUtils]: 22: Hoare triple {6229#(not (= main_~p3~0 0))} assume !(0 != ~p1~0); {6229#(not (= main_~p3~0 0))} is VALID [2022-04-27 15:09:43,293 INFO L290 TraceCheckUtils]: 23: Hoare triple {6229#(not (= main_~p3~0 0))} assume !(0 != ~p2~0); {6229#(not (= main_~p3~0 0))} is VALID [2022-04-27 15:09:43,294 INFO L290 TraceCheckUtils]: 24: Hoare triple {6229#(not (= main_~p3~0 0))} assume !(0 != ~p3~0); {6225#false} is VALID [2022-04-27 15:09:43,294 INFO L290 TraceCheckUtils]: 25: Hoare triple {6225#false} assume 0 != ~p4~0; {6225#false} is VALID [2022-04-27 15:09:43,294 INFO L290 TraceCheckUtils]: 26: Hoare triple {6225#false} assume 1 != ~lk4~0; {6225#false} is VALID [2022-04-27 15:09:43,294 INFO L290 TraceCheckUtils]: 27: Hoare triple {6225#false} assume !false; {6225#false} is VALID [2022-04-27 15:09:43,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:09:43,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:09:43,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085473287] [2022-04-27 15:09:43,295 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085473287] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:09:43,295 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:09:43,295 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:09:43,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476099125] [2022-04-27 15:09:43,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:09:43,295 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-27 15:09:43,295 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:09:43,296 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-27 15:09:43,313 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-27 15:09:43,313 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:09:43,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:09:43,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:09:43,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:09:43,314 INFO L87 Difference]: Start difference. First operand 351 states and 631 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-27 15:09:43,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:43,554 INFO L93 Difference]: Finished difference Result 529 states and 949 transitions. [2022-04-27 15:09:43,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:09:43,554 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-27 15:09:43,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:09:43,554 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-27 15:09:43,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 253 transitions. [2022-04-27 15:09:43,557 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-27 15:09:43,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 253 transitions. [2022-04-27 15:09:43,559 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 253 transitions. [2022-04-27 15:09:43,743 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 253 edges. 253 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:09:43,751 INFO L225 Difference]: With dead ends: 529 [2022-04-27 15:09:43,751 INFO L226 Difference]: Without dead ends: 359 [2022-04-27 15:09:43,751 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-27 15:09:43,752 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 181 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 15:09:43,752 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 147 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 15:09:43,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2022-04-27 15:09:43,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 357. [2022-04-27 15:09:43,759 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:09:43,760 INFO L82 GeneralOperation]: Start isEquivalent. First operand 359 states. Second operand has 357 states, 353 states have (on average 1.7903682719546743) internal successors, (632), 353 states have internal predecessors, (632), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:43,761 INFO L74 IsIncluded]: Start isIncluded. First operand 359 states. Second operand has 357 states, 353 states have (on average 1.7903682719546743) internal successors, (632), 353 states have internal predecessors, (632), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:43,762 INFO L87 Difference]: Start difference. First operand 359 states. Second operand has 357 states, 353 states have (on average 1.7903682719546743) internal successors, (632), 353 states have internal predecessors, (632), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:43,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:43,787 INFO L93 Difference]: Finished difference Result 359 states and 636 transitions. [2022-04-27 15:09:43,787 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 636 transitions. [2022-04-27 15:09:43,788 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:09:43,788 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:09:43,789 INFO L74 IsIncluded]: Start isIncluded. First operand has 357 states, 353 states have (on average 1.7903682719546743) internal successors, (632), 353 states have internal predecessors, (632), 2 states have call successors, (2), 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 359 states. [2022-04-27 15:09:43,790 INFO L87 Difference]: Start difference. First operand has 357 states, 353 states have (on average 1.7903682719546743) internal successors, (632), 353 states have internal predecessors, (632), 2 states have call successors, (2), 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 359 states. [2022-04-27 15:09:43,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:43,799 INFO L93 Difference]: Finished difference Result 359 states and 636 transitions. [2022-04-27 15:09:43,799 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 636 transitions. [2022-04-27 15:09:43,800 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:09:43,800 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:09:43,800 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:09:43,800 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:09:43,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 353 states have (on average 1.7903682719546743) internal successors, (632), 353 states have internal predecessors, (632), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:43,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 635 transitions. [2022-04-27 15:09:43,810 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 635 transitions. Word has length 28 [2022-04-27 15:09:43,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:09:43,811 INFO L495 AbstractCegarLoop]: Abstraction has 357 states and 635 transitions. [2022-04-27 15:09:43,811 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-27 15:09:43,811 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 635 transitions. [2022-04-27 15:09:43,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-27 15:09:43,811 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:09:43,812 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-27 15:09:43,812 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-27 15:09:43,812 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:09:43,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:09:43,812 INFO L85 PathProgramCache]: Analyzing trace with hash -1815177647, now seen corresponding path program 1 times [2022-04-27 15:09:43,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:09:43,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050807892] [2022-04-27 15:09:43,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:09:43,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:09:43,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:43,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:09:43,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:43,857 INFO L290 TraceCheckUtils]: 0: Hoare triple {7880#(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(18, 2);call #Ultimate.allocInit(12, 3); {7874#true} is VALID [2022-04-27 15:09:43,857 INFO L290 TraceCheckUtils]: 1: Hoare triple {7874#true} assume true; {7874#true} is VALID [2022-04-27 15:09:43,857 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7874#true} {7874#true} #268#return; {7874#true} is VALID [2022-04-27 15:09:43,858 INFO L272 TraceCheckUtils]: 0: Hoare triple {7874#true} call ULTIMATE.init(); {7880#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:09:43,858 INFO L290 TraceCheckUtils]: 1: Hoare triple {7880#(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(18, 2);call #Ultimate.allocInit(12, 3); {7874#true} is VALID [2022-04-27 15:09:43,858 INFO L290 TraceCheckUtils]: 2: Hoare triple {7874#true} assume true; {7874#true} is VALID [2022-04-27 15:09:43,858 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7874#true} {7874#true} #268#return; {7874#true} is VALID [2022-04-27 15:09:43,859 INFO L272 TraceCheckUtils]: 4: Hoare triple {7874#true} call #t~ret19 := main(); {7874#true} is VALID [2022-04-27 15:09:43,859 INFO L290 TraceCheckUtils]: 5: Hoare triple {7874#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;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;havoc ~cond~0; {7874#true} is VALID [2022-04-27 15:09:43,859 INFO L290 TraceCheckUtils]: 6: Hoare triple {7874#true} assume !false;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~cond~0 := #t~nondet18;havoc #t~nondet18; {7874#true} is VALID [2022-04-27 15:09:43,859 INFO L290 TraceCheckUtils]: 7: Hoare triple {7874#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;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0; {7874#true} is VALID [2022-04-27 15:09:43,859 INFO L290 TraceCheckUtils]: 8: Hoare triple {7874#true} assume !(0 != ~p1~0); {7874#true} is VALID [2022-04-27 15:09:43,859 INFO L290 TraceCheckUtils]: 9: Hoare triple {7874#true} assume !(0 != ~p2~0); {7874#true} is VALID [2022-04-27 15:09:43,859 INFO L290 TraceCheckUtils]: 10: Hoare triple {7874#true} assume !(0 != ~p3~0); {7874#true} is VALID [2022-04-27 15:09:43,860 INFO L290 TraceCheckUtils]: 11: Hoare triple {7874#true} assume 0 != ~p4~0;~lk4~0 := 1; {7879#(= main_~lk4~0 1)} is VALID [2022-04-27 15:09:43,860 INFO L290 TraceCheckUtils]: 12: Hoare triple {7879#(= main_~lk4~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {7879#(= main_~lk4~0 1)} is VALID [2022-04-27 15:09:43,861 INFO L290 TraceCheckUtils]: 13: Hoare triple {7879#(= main_~lk4~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {7879#(= main_~lk4~0 1)} is VALID [2022-04-27 15:09:43,861 INFO L290 TraceCheckUtils]: 14: Hoare triple {7879#(= main_~lk4~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {7879#(= main_~lk4~0 1)} is VALID [2022-04-27 15:09:43,861 INFO L290 TraceCheckUtils]: 15: Hoare triple {7879#(= main_~lk4~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {7879#(= main_~lk4~0 1)} is VALID [2022-04-27 15:09:43,862 INFO L290 TraceCheckUtils]: 16: Hoare triple {7879#(= main_~lk4~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {7879#(= main_~lk4~0 1)} is VALID [2022-04-27 15:09:43,862 INFO L290 TraceCheckUtils]: 17: Hoare triple {7879#(= main_~lk4~0 1)} assume !(0 != ~p10~0); {7879#(= main_~lk4~0 1)} is VALID [2022-04-27 15:09:43,862 INFO L290 TraceCheckUtils]: 18: Hoare triple {7879#(= main_~lk4~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {7879#(= main_~lk4~0 1)} is VALID [2022-04-27 15:09:43,863 INFO L290 TraceCheckUtils]: 19: Hoare triple {7879#(= main_~lk4~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {7879#(= main_~lk4~0 1)} is VALID [2022-04-27 15:09:43,863 INFO L290 TraceCheckUtils]: 20: Hoare triple {7879#(= main_~lk4~0 1)} assume 0 != ~p13~0;~lk13~0 := 1; {7879#(= main_~lk4~0 1)} is VALID [2022-04-27 15:09:43,863 INFO L290 TraceCheckUtils]: 21: Hoare triple {7879#(= main_~lk4~0 1)} assume 0 != ~p14~0;~lk14~0 := 1; {7879#(= main_~lk4~0 1)} is VALID [2022-04-27 15:09:43,864 INFO L290 TraceCheckUtils]: 22: Hoare triple {7879#(= main_~lk4~0 1)} assume !(0 != ~p1~0); {7879#(= main_~lk4~0 1)} is VALID [2022-04-27 15:09:43,864 INFO L290 TraceCheckUtils]: 23: Hoare triple {7879#(= main_~lk4~0 1)} assume !(0 != ~p2~0); {7879#(= main_~lk4~0 1)} is VALID [2022-04-27 15:09:43,865 INFO L290 TraceCheckUtils]: 24: Hoare triple {7879#(= main_~lk4~0 1)} assume !(0 != ~p3~0); {7879#(= main_~lk4~0 1)} is VALID [2022-04-27 15:09:43,865 INFO L290 TraceCheckUtils]: 25: Hoare triple {7879#(= main_~lk4~0 1)} assume 0 != ~p4~0; {7879#(= main_~lk4~0 1)} is VALID [2022-04-27 15:09:43,865 INFO L290 TraceCheckUtils]: 26: Hoare triple {7879#(= main_~lk4~0 1)} assume 1 != ~lk4~0; {7875#false} is VALID [2022-04-27 15:09:43,865 INFO L290 TraceCheckUtils]: 27: Hoare triple {7875#false} assume !false; {7875#false} is VALID [2022-04-27 15:09:43,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:09:43,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:09:43,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050807892] [2022-04-27 15:09:43,866 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050807892] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:09:43,866 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:09:43,866 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:09:43,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800172160] [2022-04-27 15:09:43,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:09:43,867 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-27 15:09:43,867 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:09:43,867 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-27 15:09:43,887 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-27 15:09:43,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:09:43,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:09:43,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:09:43,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:09:43,888 INFO L87 Difference]: Start difference. First operand 357 states and 635 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-27 15:09:44,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:44,132 INFO L93 Difference]: Finished difference Result 669 states and 1205 transitions. [2022-04-27 15:09:44,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:09:44,133 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-27 15:09:44,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:09:44,133 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-27 15:09:44,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 167 transitions. [2022-04-27 15:09:44,135 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-27 15:09:44,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 167 transitions. [2022-04-27 15:09:44,136 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 167 transitions. [2022-04-27 15:09:44,265 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 167 edges. 167 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:09:44,296 INFO L225 Difference]: With dead ends: 669 [2022-04-27 15:09:44,296 INFO L226 Difference]: Without dead ends: 667 [2022-04-27 15:09:44,297 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-27 15:09:44,298 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 215 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 15:09:44,298 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 99 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 15:09:44,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 667 states. [2022-04-27 15:09:44,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 667 to 489. [2022-04-27 15:09:44,308 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:09:44,309 INFO L82 GeneralOperation]: Start isEquivalent. First operand 667 states. Second operand has 489 states, 485 states have (on average 1.7649484536082474) internal successors, (856), 485 states have internal predecessors, (856), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:44,309 INFO L74 IsIncluded]: Start isIncluded. First operand 667 states. Second operand has 489 states, 485 states have (on average 1.7649484536082474) internal successors, (856), 485 states have internal predecessors, (856), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:44,310 INFO L87 Difference]: Start difference. First operand 667 states. Second operand has 489 states, 485 states have (on average 1.7649484536082474) internal successors, (856), 485 states have internal predecessors, (856), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:44,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:44,332 INFO L93 Difference]: Finished difference Result 667 states and 1196 transitions. [2022-04-27 15:09:44,332 INFO L276 IsEmpty]: Start isEmpty. Operand 667 states and 1196 transitions. [2022-04-27 15:09:44,333 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:09:44,333 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:09:44,334 INFO L74 IsIncluded]: Start isIncluded. First operand has 489 states, 485 states have (on average 1.7649484536082474) internal successors, (856), 485 states have internal predecessors, (856), 2 states have call successors, (2), 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 667 states. [2022-04-27 15:09:44,335 INFO L87 Difference]: Start difference. First operand has 489 states, 485 states have (on average 1.7649484536082474) internal successors, (856), 485 states have internal predecessors, (856), 2 states have call successors, (2), 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 667 states. [2022-04-27 15:09:44,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:44,357 INFO L93 Difference]: Finished difference Result 667 states and 1196 transitions. [2022-04-27 15:09:44,357 INFO L276 IsEmpty]: Start isEmpty. Operand 667 states and 1196 transitions. [2022-04-27 15:09:44,358 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:09:44,358 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:09:44,358 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:09:44,358 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:09:44,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 489 states, 485 states have (on average 1.7649484536082474) internal successors, (856), 485 states have internal predecessors, (856), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:44,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 859 transitions. [2022-04-27 15:09:44,373 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 859 transitions. Word has length 28 [2022-04-27 15:09:44,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:09:44,373 INFO L495 AbstractCegarLoop]: Abstraction has 489 states and 859 transitions. [2022-04-27 15:09:44,373 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-27 15:09:44,373 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 859 transitions. [2022-04-27 15:09:44,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-27 15:09:44,374 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:09:44,374 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-27 15:09:44,374 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-27 15:09:44,374 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:09:44,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:09:44,375 INFO L85 PathProgramCache]: Analyzing trace with hash 891441747, now seen corresponding path program 1 times [2022-04-27 15:09:44,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:09:44,375 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938519648] [2022-04-27 15:09:44,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:09:44,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:09:44,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:44,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:09:44,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:44,410 INFO L290 TraceCheckUtils]: 0: Hoare triple {10422#(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(18, 2);call #Ultimate.allocInit(12, 3); {10416#true} is VALID [2022-04-27 15:09:44,411 INFO L290 TraceCheckUtils]: 1: Hoare triple {10416#true} assume true; {10416#true} is VALID [2022-04-27 15:09:44,411 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10416#true} {10416#true} #268#return; {10416#true} is VALID [2022-04-27 15:09:44,411 INFO L272 TraceCheckUtils]: 0: Hoare triple {10416#true} call ULTIMATE.init(); {10422#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:09:44,411 INFO L290 TraceCheckUtils]: 1: Hoare triple {10422#(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(18, 2);call #Ultimate.allocInit(12, 3); {10416#true} is VALID [2022-04-27 15:09:44,411 INFO L290 TraceCheckUtils]: 2: Hoare triple {10416#true} assume true; {10416#true} is VALID [2022-04-27 15:09:44,412 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10416#true} {10416#true} #268#return; {10416#true} is VALID [2022-04-27 15:09:44,412 INFO L272 TraceCheckUtils]: 4: Hoare triple {10416#true} call #t~ret19 := main(); {10416#true} is VALID [2022-04-27 15:09:44,412 INFO L290 TraceCheckUtils]: 5: Hoare triple {10416#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;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;havoc ~cond~0; {10416#true} is VALID [2022-04-27 15:09:44,412 INFO L290 TraceCheckUtils]: 6: Hoare triple {10416#true} assume !false;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~cond~0 := #t~nondet18;havoc #t~nondet18; {10416#true} is VALID [2022-04-27 15:09:44,412 INFO L290 TraceCheckUtils]: 7: Hoare triple {10416#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;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0; {10416#true} is VALID [2022-04-27 15:09:44,412 INFO L290 TraceCheckUtils]: 8: Hoare triple {10416#true} assume !(0 != ~p1~0); {10416#true} is VALID [2022-04-27 15:09:44,412 INFO L290 TraceCheckUtils]: 9: Hoare triple {10416#true} assume !(0 != ~p2~0); {10416#true} is VALID [2022-04-27 15:09:44,412 INFO L290 TraceCheckUtils]: 10: Hoare triple {10416#true} assume !(0 != ~p3~0); {10416#true} is VALID [2022-04-27 15:09:44,413 INFO L290 TraceCheckUtils]: 11: Hoare triple {10416#true} assume !(0 != ~p4~0); {10421#(= main_~p4~0 0)} is VALID [2022-04-27 15:09:44,413 INFO L290 TraceCheckUtils]: 12: Hoare triple {10421#(= main_~p4~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {10421#(= main_~p4~0 0)} is VALID [2022-04-27 15:09:44,413 INFO L290 TraceCheckUtils]: 13: Hoare triple {10421#(= main_~p4~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {10421#(= main_~p4~0 0)} is VALID [2022-04-27 15:09:44,414 INFO L290 TraceCheckUtils]: 14: Hoare triple {10421#(= main_~p4~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {10421#(= main_~p4~0 0)} is VALID [2022-04-27 15:09:44,414 INFO L290 TraceCheckUtils]: 15: Hoare triple {10421#(= main_~p4~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {10421#(= main_~p4~0 0)} is VALID [2022-04-27 15:09:44,414 INFO L290 TraceCheckUtils]: 16: Hoare triple {10421#(= main_~p4~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {10421#(= main_~p4~0 0)} is VALID [2022-04-27 15:09:44,415 INFO L290 TraceCheckUtils]: 17: Hoare triple {10421#(= main_~p4~0 0)} assume !(0 != ~p10~0); {10421#(= main_~p4~0 0)} is VALID [2022-04-27 15:09:44,415 INFO L290 TraceCheckUtils]: 18: Hoare triple {10421#(= main_~p4~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {10421#(= main_~p4~0 0)} is VALID [2022-04-27 15:09:44,415 INFO L290 TraceCheckUtils]: 19: Hoare triple {10421#(= main_~p4~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {10421#(= main_~p4~0 0)} is VALID [2022-04-27 15:09:44,416 INFO L290 TraceCheckUtils]: 20: Hoare triple {10421#(= main_~p4~0 0)} assume 0 != ~p13~0;~lk13~0 := 1; {10421#(= main_~p4~0 0)} is VALID [2022-04-27 15:09:44,416 INFO L290 TraceCheckUtils]: 21: Hoare triple {10421#(= main_~p4~0 0)} assume 0 != ~p14~0;~lk14~0 := 1; {10421#(= main_~p4~0 0)} is VALID [2022-04-27 15:09:44,416 INFO L290 TraceCheckUtils]: 22: Hoare triple {10421#(= main_~p4~0 0)} assume !(0 != ~p1~0); {10421#(= main_~p4~0 0)} is VALID [2022-04-27 15:09:44,417 INFO L290 TraceCheckUtils]: 23: Hoare triple {10421#(= main_~p4~0 0)} assume !(0 != ~p2~0); {10421#(= main_~p4~0 0)} is VALID [2022-04-27 15:09:44,417 INFO L290 TraceCheckUtils]: 24: Hoare triple {10421#(= main_~p4~0 0)} assume !(0 != ~p3~0); {10421#(= main_~p4~0 0)} is VALID [2022-04-27 15:09:44,417 INFO L290 TraceCheckUtils]: 25: Hoare triple {10421#(= main_~p4~0 0)} assume 0 != ~p4~0; {10417#false} is VALID [2022-04-27 15:09:44,417 INFO L290 TraceCheckUtils]: 26: Hoare triple {10417#false} assume 1 != ~lk4~0; {10417#false} is VALID [2022-04-27 15:09:44,417 INFO L290 TraceCheckUtils]: 27: Hoare triple {10417#false} assume !false; {10417#false} is VALID [2022-04-27 15:09:44,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:09:44,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:09:44,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938519648] [2022-04-27 15:09:44,418 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938519648] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:09:44,418 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:09:44,418 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:09:44,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883103858] [2022-04-27 15:09:44,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:09:44,419 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-27 15:09:44,419 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:09:44,419 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-27 15:09:44,436 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-27 15:09:44,436 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:09:44,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:09:44,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:09:44,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:09:44,437 INFO L87 Difference]: Start difference. First operand 489 states and 859 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-27 15:09:44,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:44,716 INFO L93 Difference]: Finished difference Result 1165 states and 2061 transitions. [2022-04-27 15:09:44,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:09:44,717 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-27 15:09:44,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:09:44,718 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-27 15:09:44,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 255 transitions. [2022-04-27 15:09:44,720 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-27 15:09:44,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 255 transitions. [2022-04-27 15:09:44,722 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 255 transitions. [2022-04-27 15:09:44,889 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 255 edges. 255 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:09:44,912 INFO L225 Difference]: With dead ends: 1165 [2022-04-27 15:09:44,912 INFO L226 Difference]: Without dead ends: 691 [2022-04-27 15:09:44,913 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-27 15:09:44,914 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 190 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 15:09:44,915 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 133 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 15:09:44,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 691 states. [2022-04-27 15:09:44,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 691 to 689. [2022-04-27 15:09:44,928 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:09:44,930 INFO L82 GeneralOperation]: Start isEquivalent. First operand 691 states. Second operand has 689 states, 685 states have (on average 1.7576642335766424) internal successors, (1204), 685 states have internal predecessors, (1204), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:44,930 INFO L74 IsIncluded]: Start isIncluded. First operand 691 states. Second operand has 689 states, 685 states have (on average 1.7576642335766424) internal successors, (1204), 685 states have internal predecessors, (1204), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:44,933 INFO L87 Difference]: Start difference. First operand 691 states. Second operand has 689 states, 685 states have (on average 1.7576642335766424) internal successors, (1204), 685 states have internal predecessors, (1204), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:44,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:44,955 INFO L93 Difference]: Finished difference Result 691 states and 1208 transitions. [2022-04-27 15:09:44,955 INFO L276 IsEmpty]: Start isEmpty. Operand 691 states and 1208 transitions. [2022-04-27 15:09:44,956 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:09:44,956 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:09:44,958 INFO L74 IsIncluded]: Start isIncluded. First operand has 689 states, 685 states have (on average 1.7576642335766424) internal successors, (1204), 685 states have internal predecessors, (1204), 2 states have call successors, (2), 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 691 states. [2022-04-27 15:09:44,959 INFO L87 Difference]: Start difference. First operand has 689 states, 685 states have (on average 1.7576642335766424) internal successors, (1204), 685 states have internal predecessors, (1204), 2 states have call successors, (2), 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 691 states. [2022-04-27 15:09:44,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:44,982 INFO L93 Difference]: Finished difference Result 691 states and 1208 transitions. [2022-04-27 15:09:44,982 INFO L276 IsEmpty]: Start isEmpty. Operand 691 states and 1208 transitions. [2022-04-27 15:09:44,983 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:09:44,983 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:09:44,983 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:09:44,983 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:09:44,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 689 states, 685 states have (on average 1.7576642335766424) internal successors, (1204), 685 states have internal predecessors, (1204), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:45,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 689 states to 689 states and 1207 transitions. [2022-04-27 15:09:45,008 INFO L78 Accepts]: Start accepts. Automaton has 689 states and 1207 transitions. Word has length 28 [2022-04-27 15:09:45,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:09:45,008 INFO L495 AbstractCegarLoop]: Abstraction has 689 states and 1207 transitions. [2022-04-27 15:09:45,008 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-27 15:09:45,008 INFO L276 IsEmpty]: Start isEmpty. Operand 689 states and 1207 transitions. [2022-04-27 15:09:45,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-27 15:09:45,009 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:09:45,009 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-27 15:09:45,009 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-27 15:09:45,009 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:09:45,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:09:45,009 INFO L85 PathProgramCache]: Analyzing trace with hash -435719099, now seen corresponding path program 1 times [2022-04-27 15:09:45,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:09:45,010 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038762887] [2022-04-27 15:09:45,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:09:45,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:09:45,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:45,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:09:45,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:45,064 INFO L290 TraceCheckUtils]: 0: Hoare triple {13724#(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(18, 2);call #Ultimate.allocInit(12, 3); {13718#true} is VALID [2022-04-27 15:09:45,064 INFO L290 TraceCheckUtils]: 1: Hoare triple {13718#true} assume true; {13718#true} is VALID [2022-04-27 15:09:45,064 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13718#true} {13718#true} #268#return; {13718#true} is VALID [2022-04-27 15:09:45,064 INFO L272 TraceCheckUtils]: 0: Hoare triple {13718#true} call ULTIMATE.init(); {13724#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:09:45,065 INFO L290 TraceCheckUtils]: 1: Hoare triple {13724#(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(18, 2);call #Ultimate.allocInit(12, 3); {13718#true} is VALID [2022-04-27 15:09:45,065 INFO L290 TraceCheckUtils]: 2: Hoare triple {13718#true} assume true; {13718#true} is VALID [2022-04-27 15:09:45,065 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13718#true} {13718#true} #268#return; {13718#true} is VALID [2022-04-27 15:09:45,067 INFO L272 TraceCheckUtils]: 4: Hoare triple {13718#true} call #t~ret19 := main(); {13718#true} is VALID [2022-04-27 15:09:45,067 INFO L290 TraceCheckUtils]: 5: Hoare triple {13718#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;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;havoc ~cond~0; {13718#true} is VALID [2022-04-27 15:09:45,067 INFO L290 TraceCheckUtils]: 6: Hoare triple {13718#true} assume !false;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~cond~0 := #t~nondet18;havoc #t~nondet18; {13718#true} is VALID [2022-04-27 15:09:45,069 INFO L290 TraceCheckUtils]: 7: Hoare triple {13718#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;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0; {13718#true} is VALID [2022-04-27 15:09:45,069 INFO L290 TraceCheckUtils]: 8: Hoare triple {13718#true} assume !(0 != ~p1~0); {13718#true} is VALID [2022-04-27 15:09:45,069 INFO L290 TraceCheckUtils]: 9: Hoare triple {13718#true} assume !(0 != ~p2~0); {13718#true} is VALID [2022-04-27 15:09:45,069 INFO L290 TraceCheckUtils]: 10: Hoare triple {13718#true} assume !(0 != ~p3~0); {13718#true} is VALID [2022-04-27 15:09:45,069 INFO L290 TraceCheckUtils]: 11: Hoare triple {13718#true} assume 0 != ~p4~0;~lk4~0 := 1; {13723#(not (= main_~p4~0 0))} is VALID [2022-04-27 15:09:45,070 INFO L290 TraceCheckUtils]: 12: Hoare triple {13723#(not (= main_~p4~0 0))} assume 0 != ~p5~0;~lk5~0 := 1; {13723#(not (= main_~p4~0 0))} is VALID [2022-04-27 15:09:45,070 INFO L290 TraceCheckUtils]: 13: Hoare triple {13723#(not (= main_~p4~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {13723#(not (= main_~p4~0 0))} is VALID [2022-04-27 15:09:45,070 INFO L290 TraceCheckUtils]: 14: Hoare triple {13723#(not (= main_~p4~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {13723#(not (= main_~p4~0 0))} is VALID [2022-04-27 15:09:45,070 INFO L290 TraceCheckUtils]: 15: Hoare triple {13723#(not (= main_~p4~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {13723#(not (= main_~p4~0 0))} is VALID [2022-04-27 15:09:45,071 INFO L290 TraceCheckUtils]: 16: Hoare triple {13723#(not (= main_~p4~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {13723#(not (= main_~p4~0 0))} is VALID [2022-04-27 15:09:45,071 INFO L290 TraceCheckUtils]: 17: Hoare triple {13723#(not (= main_~p4~0 0))} assume !(0 != ~p10~0); {13723#(not (= main_~p4~0 0))} is VALID [2022-04-27 15:09:45,071 INFO L290 TraceCheckUtils]: 18: Hoare triple {13723#(not (= main_~p4~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {13723#(not (= main_~p4~0 0))} is VALID [2022-04-27 15:09:45,072 INFO L290 TraceCheckUtils]: 19: Hoare triple {13723#(not (= main_~p4~0 0))} assume 0 != ~p12~0;~lk12~0 := 1; {13723#(not (= main_~p4~0 0))} is VALID [2022-04-27 15:09:45,072 INFO L290 TraceCheckUtils]: 20: Hoare triple {13723#(not (= main_~p4~0 0))} assume 0 != ~p13~0;~lk13~0 := 1; {13723#(not (= main_~p4~0 0))} is VALID [2022-04-27 15:09:45,072 INFO L290 TraceCheckUtils]: 21: Hoare triple {13723#(not (= main_~p4~0 0))} assume 0 != ~p14~0;~lk14~0 := 1; {13723#(not (= main_~p4~0 0))} is VALID [2022-04-27 15:09:45,073 INFO L290 TraceCheckUtils]: 22: Hoare triple {13723#(not (= main_~p4~0 0))} assume !(0 != ~p1~0); {13723#(not (= main_~p4~0 0))} is VALID [2022-04-27 15:09:45,073 INFO L290 TraceCheckUtils]: 23: Hoare triple {13723#(not (= main_~p4~0 0))} assume !(0 != ~p2~0); {13723#(not (= main_~p4~0 0))} is VALID [2022-04-27 15:09:45,073 INFO L290 TraceCheckUtils]: 24: Hoare triple {13723#(not (= main_~p4~0 0))} assume !(0 != ~p3~0); {13723#(not (= main_~p4~0 0))} is VALID [2022-04-27 15:09:45,074 INFO L290 TraceCheckUtils]: 25: Hoare triple {13723#(not (= main_~p4~0 0))} assume !(0 != ~p4~0); {13719#false} is VALID [2022-04-27 15:09:45,074 INFO L290 TraceCheckUtils]: 26: Hoare triple {13719#false} assume 0 != ~p5~0; {13719#false} is VALID [2022-04-27 15:09:45,074 INFO L290 TraceCheckUtils]: 27: Hoare triple {13719#false} assume 1 != ~lk5~0; {13719#false} is VALID [2022-04-27 15:09:45,074 INFO L290 TraceCheckUtils]: 28: Hoare triple {13719#false} assume !false; {13719#false} is VALID [2022-04-27 15:09:45,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:09:45,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:09:45,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038762887] [2022-04-27 15:09:45,074 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038762887] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:09:45,075 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:09:45,075 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:09:45,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127621442] [2022-04-27 15:09:45,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:09:45,076 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-27 15:09:45,076 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:09:45,076 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-27 15:09:45,095 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-27 15:09:45,095 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:09:45,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:09:45,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:09:45,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:09:45,096 INFO L87 Difference]: Start difference. First operand 689 states and 1207 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-27 15:09:45,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:45,379 INFO L93 Difference]: Finished difference Result 1033 states and 1805 transitions. [2022-04-27 15:09:45,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:09:45,379 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-27 15:09:45,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:09:45,379 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-27 15:09:45,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 250 transitions. [2022-04-27 15:09:45,382 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-27 15:09:45,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 250 transitions. [2022-04-27 15:09:45,384 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 250 transitions. [2022-04-27 15:09:45,552 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 250 edges. 250 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:09:45,576 INFO L225 Difference]: With dead ends: 1033 [2022-04-27 15:09:45,576 INFO L226 Difference]: Without dead ends: 699 [2022-04-27 15:09:45,576 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-27 15:09:45,577 INFO L413 NwaCegarLoop]: 137 mSDtfsCounter, 180 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 15:09:45,577 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 144 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 15:09:45,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2022-04-27 15:09:45,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 697. [2022-04-27 15:09:45,589 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:09:45,590 INFO L82 GeneralOperation]: Start isEquivalent. First operand 699 states. Second operand has 697 states, 693 states have (on average 1.7373737373737375) internal successors, (1204), 693 states have internal predecessors, (1204), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:45,591 INFO L74 IsIncluded]: Start isIncluded. First operand 699 states. Second operand has 697 states, 693 states have (on average 1.7373737373737375) internal successors, (1204), 693 states have internal predecessors, (1204), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:45,592 INFO L87 Difference]: Start difference. First operand 699 states. Second operand has 697 states, 693 states have (on average 1.7373737373737375) internal successors, (1204), 693 states have internal predecessors, (1204), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:45,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:45,614 INFO L93 Difference]: Finished difference Result 699 states and 1208 transitions. [2022-04-27 15:09:45,614 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 1208 transitions. [2022-04-27 15:09:45,615 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:09:45,615 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:09:45,617 INFO L74 IsIncluded]: Start isIncluded. First operand has 697 states, 693 states have (on average 1.7373737373737375) internal successors, (1204), 693 states have internal predecessors, (1204), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 699 states. [2022-04-27 15:09:45,618 INFO L87 Difference]: Start difference. First operand has 697 states, 693 states have (on average 1.7373737373737375) internal successors, (1204), 693 states have internal predecessors, (1204), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 699 states. [2022-04-27 15:09:45,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:45,640 INFO L93 Difference]: Finished difference Result 699 states and 1208 transitions. [2022-04-27 15:09:45,641 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 1208 transitions. [2022-04-27 15:09:45,641 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:09:45,642 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:09:45,642 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:09:45,642 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:09:45,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 697 states, 693 states have (on average 1.7373737373737375) internal successors, (1204), 693 states have internal predecessors, (1204), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:45,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 697 states and 1207 transitions. [2022-04-27 15:09:45,665 INFO L78 Accepts]: Start accepts. Automaton has 697 states and 1207 transitions. Word has length 29 [2022-04-27 15:09:45,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:09:45,665 INFO L495 AbstractCegarLoop]: Abstraction has 697 states and 1207 transitions. [2022-04-27 15:09:45,665 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-27 15:09:45,665 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 1207 transitions. [2022-04-27 15:09:45,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-27 15:09:45,666 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:09:45,666 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-27 15:09:45,666 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-27 15:09:45,667 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:09:45,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:09:45,667 INFO L85 PathProgramCache]: Analyzing trace with hash 1865103491, now seen corresponding path program 1 times [2022-04-27 15:09:45,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:09:45,667 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258920153] [2022-04-27 15:09:45,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:09:45,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:09:45,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:45,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:09:45,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:45,700 INFO L290 TraceCheckUtils]: 0: Hoare triple {16918#(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(18, 2);call #Ultimate.allocInit(12, 3); {16912#true} is VALID [2022-04-27 15:09:45,700 INFO L290 TraceCheckUtils]: 1: Hoare triple {16912#true} assume true; {16912#true} is VALID [2022-04-27 15:09:45,700 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16912#true} {16912#true} #268#return; {16912#true} is VALID [2022-04-27 15:09:45,701 INFO L272 TraceCheckUtils]: 0: Hoare triple {16912#true} call ULTIMATE.init(); {16918#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:09:45,701 INFO L290 TraceCheckUtils]: 1: Hoare triple {16918#(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(18, 2);call #Ultimate.allocInit(12, 3); {16912#true} is VALID [2022-04-27 15:09:45,701 INFO L290 TraceCheckUtils]: 2: Hoare triple {16912#true} assume true; {16912#true} is VALID [2022-04-27 15:09:45,701 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16912#true} {16912#true} #268#return; {16912#true} is VALID [2022-04-27 15:09:45,701 INFO L272 TraceCheckUtils]: 4: Hoare triple {16912#true} call #t~ret19 := main(); {16912#true} is VALID [2022-04-27 15:09:45,701 INFO L290 TraceCheckUtils]: 5: Hoare triple {16912#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;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;havoc ~cond~0; {16912#true} is VALID [2022-04-27 15:09:45,702 INFO L290 TraceCheckUtils]: 6: Hoare triple {16912#true} assume !false;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~cond~0 := #t~nondet18;havoc #t~nondet18; {16912#true} is VALID [2022-04-27 15:09:45,702 INFO L290 TraceCheckUtils]: 7: Hoare triple {16912#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;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0; {16912#true} is VALID [2022-04-27 15:09:45,702 INFO L290 TraceCheckUtils]: 8: Hoare triple {16912#true} assume !(0 != ~p1~0); {16912#true} is VALID [2022-04-27 15:09:45,702 INFO L290 TraceCheckUtils]: 9: Hoare triple {16912#true} assume !(0 != ~p2~0); {16912#true} is VALID [2022-04-27 15:09:45,702 INFO L290 TraceCheckUtils]: 10: Hoare triple {16912#true} assume !(0 != ~p3~0); {16912#true} is VALID [2022-04-27 15:09:45,702 INFO L290 TraceCheckUtils]: 11: Hoare triple {16912#true} assume !(0 != ~p4~0); {16912#true} is VALID [2022-04-27 15:09:45,702 INFO L290 TraceCheckUtils]: 12: Hoare triple {16912#true} assume 0 != ~p5~0;~lk5~0 := 1; {16917#(= main_~lk5~0 1)} is VALID [2022-04-27 15:09:45,703 INFO L290 TraceCheckUtils]: 13: Hoare triple {16917#(= main_~lk5~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {16917#(= main_~lk5~0 1)} is VALID [2022-04-27 15:09:45,703 INFO L290 TraceCheckUtils]: 14: Hoare triple {16917#(= main_~lk5~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {16917#(= main_~lk5~0 1)} is VALID [2022-04-27 15:09:45,703 INFO L290 TraceCheckUtils]: 15: Hoare triple {16917#(= main_~lk5~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {16917#(= main_~lk5~0 1)} is VALID [2022-04-27 15:09:45,703 INFO L290 TraceCheckUtils]: 16: Hoare triple {16917#(= main_~lk5~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {16917#(= main_~lk5~0 1)} is VALID [2022-04-27 15:09:45,704 INFO L290 TraceCheckUtils]: 17: Hoare triple {16917#(= main_~lk5~0 1)} assume !(0 != ~p10~0); {16917#(= main_~lk5~0 1)} is VALID [2022-04-27 15:09:45,704 INFO L290 TraceCheckUtils]: 18: Hoare triple {16917#(= main_~lk5~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {16917#(= main_~lk5~0 1)} is VALID [2022-04-27 15:09:45,704 INFO L290 TraceCheckUtils]: 19: Hoare triple {16917#(= main_~lk5~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {16917#(= main_~lk5~0 1)} is VALID [2022-04-27 15:09:45,705 INFO L290 TraceCheckUtils]: 20: Hoare triple {16917#(= main_~lk5~0 1)} assume 0 != ~p13~0;~lk13~0 := 1; {16917#(= main_~lk5~0 1)} is VALID [2022-04-27 15:09:45,705 INFO L290 TraceCheckUtils]: 21: Hoare triple {16917#(= main_~lk5~0 1)} assume 0 != ~p14~0;~lk14~0 := 1; {16917#(= main_~lk5~0 1)} is VALID [2022-04-27 15:09:45,705 INFO L290 TraceCheckUtils]: 22: Hoare triple {16917#(= main_~lk5~0 1)} assume !(0 != ~p1~0); {16917#(= main_~lk5~0 1)} is VALID [2022-04-27 15:09:45,706 INFO L290 TraceCheckUtils]: 23: Hoare triple {16917#(= main_~lk5~0 1)} assume !(0 != ~p2~0); {16917#(= main_~lk5~0 1)} is VALID [2022-04-27 15:09:45,706 INFO L290 TraceCheckUtils]: 24: Hoare triple {16917#(= main_~lk5~0 1)} assume !(0 != ~p3~0); {16917#(= main_~lk5~0 1)} is VALID [2022-04-27 15:09:45,706 INFO L290 TraceCheckUtils]: 25: Hoare triple {16917#(= main_~lk5~0 1)} assume !(0 != ~p4~0); {16917#(= main_~lk5~0 1)} is VALID [2022-04-27 15:09:45,707 INFO L290 TraceCheckUtils]: 26: Hoare triple {16917#(= main_~lk5~0 1)} assume 0 != ~p5~0; {16917#(= main_~lk5~0 1)} is VALID [2022-04-27 15:09:45,707 INFO L290 TraceCheckUtils]: 27: Hoare triple {16917#(= main_~lk5~0 1)} assume 1 != ~lk5~0; {16913#false} is VALID [2022-04-27 15:09:45,707 INFO L290 TraceCheckUtils]: 28: Hoare triple {16913#false} assume !false; {16913#false} is VALID [2022-04-27 15:09:45,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:09:45,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:09:45,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258920153] [2022-04-27 15:09:45,707 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258920153] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:09:45,707 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:09:45,708 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:09:45,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375121750] [2022-04-27 15:09:45,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:09:45,708 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-27 15:09:45,708 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:09:45,708 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-27 15:09:45,725 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-27 15:09:45,726 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:09:45,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:09:45,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:09:45,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:09:45,726 INFO L87 Difference]: Start difference. First operand 697 states and 1207 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-27 15:09:46,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:46,003 INFO L93 Difference]: Finished difference Result 1293 states and 2273 transitions. [2022-04-27 15:09:46,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:09:46,004 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-27 15:09:46,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:09:46,004 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-27 15:09:46,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 163 transitions. [2022-04-27 15:09:46,005 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-27 15:09:46,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 163 transitions. [2022-04-27 15:09:46,006 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 163 transitions. [2022-04-27 15:09:46,133 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-27 15:09:46,203 INFO L225 Difference]: With dead ends: 1293 [2022-04-27 15:09:46,203 INFO L226 Difference]: Without dead ends: 1291 [2022-04-27 15:09:46,204 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-27 15:09:46,205 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 208 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 15:09:46,205 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 98 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 15:09:46,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1291 states. [2022-04-27 15:09:46,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1291 to 969. [2022-04-27 15:09:46,223 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:09:46,225 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1291 states. Second operand has 969 states, 965 states have (on average 1.7036269430051814) internal successors, (1644), 965 states have internal predecessors, (1644), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:46,226 INFO L74 IsIncluded]: Start isIncluded. First operand 1291 states. Second operand has 969 states, 965 states have (on average 1.7036269430051814) internal successors, (1644), 965 states have internal predecessors, (1644), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:46,228 INFO L87 Difference]: Start difference. First operand 1291 states. Second operand has 969 states, 965 states have (on average 1.7036269430051814) internal successors, (1644), 965 states have internal predecessors, (1644), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:46,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:46,294 INFO L93 Difference]: Finished difference Result 1291 states and 2256 transitions. [2022-04-27 15:09:46,294 INFO L276 IsEmpty]: Start isEmpty. Operand 1291 states and 2256 transitions. [2022-04-27 15:09:46,296 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:09:46,296 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:09:46,298 INFO L74 IsIncluded]: Start isIncluded. First operand has 969 states, 965 states have (on average 1.7036269430051814) internal successors, (1644), 965 states have internal predecessors, (1644), 2 states have call successors, (2), 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 1291 states. [2022-04-27 15:09:46,299 INFO L87 Difference]: Start difference. First operand has 969 states, 965 states have (on average 1.7036269430051814) internal successors, (1644), 965 states have internal predecessors, (1644), 2 states have call successors, (2), 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 1291 states. [2022-04-27 15:09:46,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:46,367 INFO L93 Difference]: Finished difference Result 1291 states and 2256 transitions. [2022-04-27 15:09:46,367 INFO L276 IsEmpty]: Start isEmpty. Operand 1291 states and 2256 transitions. [2022-04-27 15:09:46,369 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:09:46,369 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:09:46,369 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:09:46,369 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:09:46,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 969 states, 965 states have (on average 1.7036269430051814) internal successors, (1644), 965 states have internal predecessors, (1644), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:46,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 969 states to 969 states and 1647 transitions. [2022-04-27 15:09:46,413 INFO L78 Accepts]: Start accepts. Automaton has 969 states and 1647 transitions. Word has length 29 [2022-04-27 15:09:46,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:09:46,413 INFO L495 AbstractCegarLoop]: Abstraction has 969 states and 1647 transitions. [2022-04-27 15:09:46,414 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-27 15:09:46,414 INFO L276 IsEmpty]: Start isEmpty. Operand 969 states and 1647 transitions. [2022-04-27 15:09:46,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-27 15:09:46,415 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:09:46,415 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-27 15:09:46,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-27 15:09:46,415 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:09:46,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:09:46,416 INFO L85 PathProgramCache]: Analyzing trace with hash 276755589, now seen corresponding path program 1 times [2022-04-27 15:09:46,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:09:46,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174562813] [2022-04-27 15:09:46,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:09:46,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:09:46,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:46,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:09:46,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:46,455 INFO L290 TraceCheckUtils]: 0: Hoare triple {21836#(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(18, 2);call #Ultimate.allocInit(12, 3); {21830#true} is VALID [2022-04-27 15:09:46,455 INFO L290 TraceCheckUtils]: 1: Hoare triple {21830#true} assume true; {21830#true} is VALID [2022-04-27 15:09:46,455 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {21830#true} {21830#true} #268#return; {21830#true} is VALID [2022-04-27 15:09:46,456 INFO L272 TraceCheckUtils]: 0: Hoare triple {21830#true} call ULTIMATE.init(); {21836#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:09:46,456 INFO L290 TraceCheckUtils]: 1: Hoare triple {21836#(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(18, 2);call #Ultimate.allocInit(12, 3); {21830#true} is VALID [2022-04-27 15:09:46,456 INFO L290 TraceCheckUtils]: 2: Hoare triple {21830#true} assume true; {21830#true} is VALID [2022-04-27 15:09:46,456 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21830#true} {21830#true} #268#return; {21830#true} is VALID [2022-04-27 15:09:46,456 INFO L272 TraceCheckUtils]: 4: Hoare triple {21830#true} call #t~ret19 := main(); {21830#true} is VALID [2022-04-27 15:09:46,456 INFO L290 TraceCheckUtils]: 5: Hoare triple {21830#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;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;havoc ~cond~0; {21830#true} is VALID [2022-04-27 15:09:46,457 INFO L290 TraceCheckUtils]: 6: Hoare triple {21830#true} assume !false;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~cond~0 := #t~nondet18;havoc #t~nondet18; {21830#true} is VALID [2022-04-27 15:09:46,457 INFO L290 TraceCheckUtils]: 7: Hoare triple {21830#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;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0; {21830#true} is VALID [2022-04-27 15:09:46,457 INFO L290 TraceCheckUtils]: 8: Hoare triple {21830#true} assume !(0 != ~p1~0); {21830#true} is VALID [2022-04-27 15:09:46,457 INFO L290 TraceCheckUtils]: 9: Hoare triple {21830#true} assume !(0 != ~p2~0); {21830#true} is VALID [2022-04-27 15:09:46,457 INFO L290 TraceCheckUtils]: 10: Hoare triple {21830#true} assume !(0 != ~p3~0); {21830#true} is VALID [2022-04-27 15:09:46,457 INFO L290 TraceCheckUtils]: 11: Hoare triple {21830#true} assume !(0 != ~p4~0); {21830#true} is VALID [2022-04-27 15:09:46,457 INFO L290 TraceCheckUtils]: 12: Hoare triple {21830#true} assume !(0 != ~p5~0); {21835#(= main_~p5~0 0)} is VALID [2022-04-27 15:09:46,458 INFO L290 TraceCheckUtils]: 13: Hoare triple {21835#(= main_~p5~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {21835#(= main_~p5~0 0)} is VALID [2022-04-27 15:09:46,458 INFO L290 TraceCheckUtils]: 14: Hoare triple {21835#(= main_~p5~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {21835#(= main_~p5~0 0)} is VALID [2022-04-27 15:09:46,461 INFO L290 TraceCheckUtils]: 15: Hoare triple {21835#(= main_~p5~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {21835#(= main_~p5~0 0)} is VALID [2022-04-27 15:09:46,463 INFO L290 TraceCheckUtils]: 16: Hoare triple {21835#(= main_~p5~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {21835#(= main_~p5~0 0)} is VALID [2022-04-27 15:09:46,463 INFO L290 TraceCheckUtils]: 17: Hoare triple {21835#(= main_~p5~0 0)} assume !(0 != ~p10~0); {21835#(= main_~p5~0 0)} is VALID [2022-04-27 15:09:46,463 INFO L290 TraceCheckUtils]: 18: Hoare triple {21835#(= main_~p5~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {21835#(= main_~p5~0 0)} is VALID [2022-04-27 15:09:46,464 INFO L290 TraceCheckUtils]: 19: Hoare triple {21835#(= main_~p5~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {21835#(= main_~p5~0 0)} is VALID [2022-04-27 15:09:46,464 INFO L290 TraceCheckUtils]: 20: Hoare triple {21835#(= main_~p5~0 0)} assume 0 != ~p13~0;~lk13~0 := 1; {21835#(= main_~p5~0 0)} is VALID [2022-04-27 15:09:46,464 INFO L290 TraceCheckUtils]: 21: Hoare triple {21835#(= main_~p5~0 0)} assume 0 != ~p14~0;~lk14~0 := 1; {21835#(= main_~p5~0 0)} is VALID [2022-04-27 15:09:46,465 INFO L290 TraceCheckUtils]: 22: Hoare triple {21835#(= main_~p5~0 0)} assume !(0 != ~p1~0); {21835#(= main_~p5~0 0)} is VALID [2022-04-27 15:09:46,465 INFO L290 TraceCheckUtils]: 23: Hoare triple {21835#(= main_~p5~0 0)} assume !(0 != ~p2~0); {21835#(= main_~p5~0 0)} is VALID [2022-04-27 15:09:46,465 INFO L290 TraceCheckUtils]: 24: Hoare triple {21835#(= main_~p5~0 0)} assume !(0 != ~p3~0); {21835#(= main_~p5~0 0)} is VALID [2022-04-27 15:09:46,465 INFO L290 TraceCheckUtils]: 25: Hoare triple {21835#(= main_~p5~0 0)} assume !(0 != ~p4~0); {21835#(= main_~p5~0 0)} is VALID [2022-04-27 15:09:46,466 INFO L290 TraceCheckUtils]: 26: Hoare triple {21835#(= main_~p5~0 0)} assume 0 != ~p5~0; {21831#false} is VALID [2022-04-27 15:09:46,466 INFO L290 TraceCheckUtils]: 27: Hoare triple {21831#false} assume 1 != ~lk5~0; {21831#false} is VALID [2022-04-27 15:09:46,466 INFO L290 TraceCheckUtils]: 28: Hoare triple {21831#false} assume !false; {21831#false} is VALID [2022-04-27 15:09:46,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:09:46,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:09:46,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174562813] [2022-04-27 15:09:46,466 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174562813] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:09:46,467 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:09:46,467 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:09:46,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191357525] [2022-04-27 15:09:46,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:09:46,467 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-27 15:09:46,467 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:09:46,467 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-27 15:09:46,486 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-27 15:09:46,486 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:09:46,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:09:46,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:09:46,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:09:46,487 INFO L87 Difference]: Start difference. First operand 969 states and 1647 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-27 15:09:46,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:46,935 INFO L93 Difference]: Finished difference Result 2301 states and 3937 transitions. [2022-04-27 15:09:46,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:09:46,935 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-27 15:09:46,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:09:46,935 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-27 15:09:46,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 252 transitions. [2022-04-27 15:09:46,937 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-27 15:09:46,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 252 transitions. [2022-04-27 15:09:46,938 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 252 transitions. [2022-04-27 15:09:47,135 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 252 edges. 252 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:09:47,215 INFO L225 Difference]: With dead ends: 2301 [2022-04-27 15:09:47,216 INFO L226 Difference]: Without dead ends: 1355 [2022-04-27 15:09:47,217 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-27 15:09:47,218 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 184 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 15:09:47,218 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 135 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 15:09:47,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1355 states. [2022-04-27 15:09:47,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1355 to 1353. [2022-04-27 15:09:47,243 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:09:47,245 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1355 states. Second operand has 1353 states, 1349 states have (on average 1.6990363232023722) internal successors, (2292), 1349 states have internal predecessors, (2292), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:47,247 INFO L74 IsIncluded]: Start isIncluded. First operand 1355 states. Second operand has 1353 states, 1349 states have (on average 1.6990363232023722) internal successors, (2292), 1349 states have internal predecessors, (2292), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:47,248 INFO L87 Difference]: Start difference. First operand 1355 states. Second operand has 1353 states, 1349 states have (on average 1.6990363232023722) internal successors, (2292), 1349 states have internal predecessors, (2292), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:47,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:47,321 INFO L93 Difference]: Finished difference Result 1355 states and 2296 transitions. [2022-04-27 15:09:47,322 INFO L276 IsEmpty]: Start isEmpty. Operand 1355 states and 2296 transitions. [2022-04-27 15:09:47,324 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:09:47,324 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:09:47,327 INFO L74 IsIncluded]: Start isIncluded. First operand has 1353 states, 1349 states have (on average 1.6990363232023722) internal successors, (2292), 1349 states have internal predecessors, (2292), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1355 states. [2022-04-27 15:09:47,329 INFO L87 Difference]: Start difference. First operand has 1353 states, 1349 states have (on average 1.6990363232023722) internal successors, (2292), 1349 states have internal predecessors, (2292), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1355 states. [2022-04-27 15:09:47,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:47,403 INFO L93 Difference]: Finished difference Result 1355 states and 2296 transitions. [2022-04-27 15:09:47,403 INFO L276 IsEmpty]: Start isEmpty. Operand 1355 states and 2296 transitions. [2022-04-27 15:09:47,405 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:09:47,405 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:09:47,405 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:09:47,405 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:09:47,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1353 states, 1349 states have (on average 1.6990363232023722) internal successors, (2292), 1349 states have internal predecessors, (2292), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:47,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1353 states to 1353 states and 2295 transitions. [2022-04-27 15:09:47,486 INFO L78 Accepts]: Start accepts. Automaton has 1353 states and 2295 transitions. Word has length 29 [2022-04-27 15:09:47,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:09:47,487 INFO L495 AbstractCegarLoop]: Abstraction has 1353 states and 2295 transitions. [2022-04-27 15:09:47,487 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-27 15:09:47,487 INFO L276 IsEmpty]: Start isEmpty. Operand 1353 states and 2295 transitions. [2022-04-27 15:09:47,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-27 15:09:47,488 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:09:47,488 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-27 15:09:47,488 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-27 15:09:47,489 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:09:47,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:09:47,489 INFO L85 PathProgramCache]: Analyzing trace with hash 1983846824, now seen corresponding path program 1 times [2022-04-27 15:09:47,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:09:47,489 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949746292] [2022-04-27 15:09:47,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:09:47,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:09:47,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:47,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:09:47,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:47,541 INFO L290 TraceCheckUtils]: 0: Hoare triple {28306#(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(18, 2);call #Ultimate.allocInit(12, 3); {28300#true} is VALID [2022-04-27 15:09:47,541 INFO L290 TraceCheckUtils]: 1: Hoare triple {28300#true} assume true; {28300#true} is VALID [2022-04-27 15:09:47,541 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {28300#true} {28300#true} #268#return; {28300#true} is VALID [2022-04-27 15:09:47,541 INFO L272 TraceCheckUtils]: 0: Hoare triple {28300#true} call ULTIMATE.init(); {28306#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:09:47,542 INFO L290 TraceCheckUtils]: 1: Hoare triple {28306#(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(18, 2);call #Ultimate.allocInit(12, 3); {28300#true} is VALID [2022-04-27 15:09:47,542 INFO L290 TraceCheckUtils]: 2: Hoare triple {28300#true} assume true; {28300#true} is VALID [2022-04-27 15:09:47,542 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28300#true} {28300#true} #268#return; {28300#true} is VALID [2022-04-27 15:09:47,542 INFO L272 TraceCheckUtils]: 4: Hoare triple {28300#true} call #t~ret19 := main(); {28300#true} is VALID [2022-04-27 15:09:47,542 INFO L290 TraceCheckUtils]: 5: Hoare triple {28300#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;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;havoc ~cond~0; {28300#true} is VALID [2022-04-27 15:09:47,542 INFO L290 TraceCheckUtils]: 6: Hoare triple {28300#true} assume !false;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~cond~0 := #t~nondet18;havoc #t~nondet18; {28300#true} is VALID [2022-04-27 15:09:47,542 INFO L290 TraceCheckUtils]: 7: Hoare triple {28300#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;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0; {28300#true} is VALID [2022-04-27 15:09:47,545 INFO L290 TraceCheckUtils]: 8: Hoare triple {28300#true} assume !(0 != ~p1~0); {28300#true} is VALID [2022-04-27 15:09:47,545 INFO L290 TraceCheckUtils]: 9: Hoare triple {28300#true} assume !(0 != ~p2~0); {28300#true} is VALID [2022-04-27 15:09:47,545 INFO L290 TraceCheckUtils]: 10: Hoare triple {28300#true} assume !(0 != ~p3~0); {28300#true} is VALID [2022-04-27 15:09:47,545 INFO L290 TraceCheckUtils]: 11: Hoare triple {28300#true} assume !(0 != ~p4~0); {28300#true} is VALID [2022-04-27 15:09:47,546 INFO L290 TraceCheckUtils]: 12: Hoare triple {28300#true} assume 0 != ~p5~0;~lk5~0 := 1; {28305#(not (= main_~p5~0 0))} is VALID [2022-04-27 15:09:47,546 INFO L290 TraceCheckUtils]: 13: Hoare triple {28305#(not (= main_~p5~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {28305#(not (= main_~p5~0 0))} is VALID [2022-04-27 15:09:47,546 INFO L290 TraceCheckUtils]: 14: Hoare triple {28305#(not (= main_~p5~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {28305#(not (= main_~p5~0 0))} is VALID [2022-04-27 15:09:47,547 INFO L290 TraceCheckUtils]: 15: Hoare triple {28305#(not (= main_~p5~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {28305#(not (= main_~p5~0 0))} is VALID [2022-04-27 15:09:47,547 INFO L290 TraceCheckUtils]: 16: Hoare triple {28305#(not (= main_~p5~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {28305#(not (= main_~p5~0 0))} is VALID [2022-04-27 15:09:47,547 INFO L290 TraceCheckUtils]: 17: Hoare triple {28305#(not (= main_~p5~0 0))} assume !(0 != ~p10~0); {28305#(not (= main_~p5~0 0))} is VALID [2022-04-27 15:09:47,548 INFO L290 TraceCheckUtils]: 18: Hoare triple {28305#(not (= main_~p5~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {28305#(not (= main_~p5~0 0))} is VALID [2022-04-27 15:09:47,548 INFO L290 TraceCheckUtils]: 19: Hoare triple {28305#(not (= main_~p5~0 0))} assume 0 != ~p12~0;~lk12~0 := 1; {28305#(not (= main_~p5~0 0))} is VALID [2022-04-27 15:09:47,548 INFO L290 TraceCheckUtils]: 20: Hoare triple {28305#(not (= main_~p5~0 0))} assume 0 != ~p13~0;~lk13~0 := 1; {28305#(not (= main_~p5~0 0))} is VALID [2022-04-27 15:09:47,548 INFO L290 TraceCheckUtils]: 21: Hoare triple {28305#(not (= main_~p5~0 0))} assume 0 != ~p14~0;~lk14~0 := 1; {28305#(not (= main_~p5~0 0))} is VALID [2022-04-27 15:09:47,549 INFO L290 TraceCheckUtils]: 22: Hoare triple {28305#(not (= main_~p5~0 0))} assume !(0 != ~p1~0); {28305#(not (= main_~p5~0 0))} is VALID [2022-04-27 15:09:47,549 INFO L290 TraceCheckUtils]: 23: Hoare triple {28305#(not (= main_~p5~0 0))} assume !(0 != ~p2~0); {28305#(not (= main_~p5~0 0))} is VALID [2022-04-27 15:09:47,549 INFO L290 TraceCheckUtils]: 24: Hoare triple {28305#(not (= main_~p5~0 0))} assume !(0 != ~p3~0); {28305#(not (= main_~p5~0 0))} is VALID [2022-04-27 15:09:47,550 INFO L290 TraceCheckUtils]: 25: Hoare triple {28305#(not (= main_~p5~0 0))} assume !(0 != ~p4~0); {28305#(not (= main_~p5~0 0))} is VALID [2022-04-27 15:09:47,550 INFO L290 TraceCheckUtils]: 26: Hoare triple {28305#(not (= main_~p5~0 0))} assume !(0 != ~p5~0); {28301#false} is VALID [2022-04-27 15:09:47,550 INFO L290 TraceCheckUtils]: 27: Hoare triple {28301#false} assume 0 != ~p6~0; {28301#false} is VALID [2022-04-27 15:09:47,550 INFO L290 TraceCheckUtils]: 28: Hoare triple {28301#false} assume 1 != ~lk6~0; {28301#false} is VALID [2022-04-27 15:09:47,550 INFO L290 TraceCheckUtils]: 29: Hoare triple {28301#false} assume !false; {28301#false} is VALID [2022-04-27 15:09:47,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:09:47,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:09:47,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949746292] [2022-04-27 15:09:47,552 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949746292] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:09:47,552 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:09:47,552 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:09:47,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496280683] [2022-04-27 15:09:47,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:09:47,556 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-27 15:09:47,556 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:09:47,556 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-27 15:09:47,576 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-27 15:09:47,576 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:09:47,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:09:47,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:09:47,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:09:47,577 INFO L87 Difference]: Start difference. First operand 1353 states and 2295 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-27 15:09:47,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:47,963 INFO L93 Difference]: Finished difference Result 2029 states and 3433 transitions. [2022-04-27 15:09:47,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:09:47,964 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-27 15:09:47,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:09:47,964 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-27 15:09:47,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 247 transitions. [2022-04-27 15:09:47,966 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-27 15:09:47,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 247 transitions. [2022-04-27 15:09:47,967 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 247 transitions. [2022-04-27 15:09:48,162 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 247 edges. 247 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:09:48,238 INFO L225 Difference]: With dead ends: 2029 [2022-04-27 15:09:48,238 INFO L226 Difference]: Without dead ends: 1371 [2022-04-27 15:09:48,239 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-27 15:09:48,239 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 179 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 15:09:48,240 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 141 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 15:09:48,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1371 states. [2022-04-27 15:09:48,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1371 to 1369. [2022-04-27 15:09:48,267 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:09:48,269 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1371 states. Second operand has 1369 states, 1365 states have (on average 1.6791208791208792) internal successors, (2292), 1365 states have internal predecessors, (2292), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:48,270 INFO L74 IsIncluded]: Start isIncluded. First operand 1371 states. Second operand has 1369 states, 1365 states have (on average 1.6791208791208792) internal successors, (2292), 1365 states have internal predecessors, (2292), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:48,272 INFO L87 Difference]: Start difference. First operand 1371 states. Second operand has 1369 states, 1365 states have (on average 1.6791208791208792) internal successors, (2292), 1365 states have internal predecessors, (2292), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:48,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:48,337 INFO L93 Difference]: Finished difference Result 1371 states and 2296 transitions. [2022-04-27 15:09:48,337 INFO L276 IsEmpty]: Start isEmpty. Operand 1371 states and 2296 transitions. [2022-04-27 15:09:48,340 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:09:48,341 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:09:48,343 INFO L74 IsIncluded]: Start isIncluded. First operand has 1369 states, 1365 states have (on average 1.6791208791208792) internal successors, (2292), 1365 states have internal predecessors, (2292), 2 states have call successors, (2), 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 1371 states. [2022-04-27 15:09:48,344 INFO L87 Difference]: Start difference. First operand has 1369 states, 1365 states have (on average 1.6791208791208792) internal successors, (2292), 1365 states have internal predecessors, (2292), 2 states have call successors, (2), 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 1371 states. [2022-04-27 15:09:48,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:48,412 INFO L93 Difference]: Finished difference Result 1371 states and 2296 transitions. [2022-04-27 15:09:48,412 INFO L276 IsEmpty]: Start isEmpty. Operand 1371 states and 2296 transitions. [2022-04-27 15:09:48,414 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:09:48,415 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:09:48,415 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:09:48,415 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:09:48,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1369 states, 1365 states have (on average 1.6791208791208792) internal successors, (2292), 1365 states have internal predecessors, (2292), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:48,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1369 states to 1369 states and 2295 transitions. [2022-04-27 15:09:48,492 INFO L78 Accepts]: Start accepts. Automaton has 1369 states and 2295 transitions. Word has length 30 [2022-04-27 15:09:48,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:09:48,492 INFO L495 AbstractCegarLoop]: Abstraction has 1369 states and 2295 transitions. [2022-04-27 15:09:48,492 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-27 15:09:48,492 INFO L276 IsEmpty]: Start isEmpty. Operand 1369 states and 2295 transitions. [2022-04-27 15:09:48,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-27 15:09:48,494 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:09:48,494 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-27 15:09:48,494 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-27 15:09:48,494 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:09:48,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:09:48,494 INFO L85 PathProgramCache]: Analyzing trace with hash -10297882, now seen corresponding path program 1 times [2022-04-27 15:09:48,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:09:48,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793784323] [2022-04-27 15:09:48,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:09:48,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:09:48,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:48,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:09:48,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:48,560 INFO L290 TraceCheckUtils]: 0: Hoare triple {34552#(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(18, 2);call #Ultimate.allocInit(12, 3); {34546#true} is VALID [2022-04-27 15:09:48,560 INFO L290 TraceCheckUtils]: 1: Hoare triple {34546#true} assume true; {34546#true} is VALID [2022-04-27 15:09:48,561 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {34546#true} {34546#true} #268#return; {34546#true} is VALID [2022-04-27 15:09:48,561 INFO L272 TraceCheckUtils]: 0: Hoare triple {34546#true} call ULTIMATE.init(); {34552#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:09:48,561 INFO L290 TraceCheckUtils]: 1: Hoare triple {34552#(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(18, 2);call #Ultimate.allocInit(12, 3); {34546#true} is VALID [2022-04-27 15:09:48,561 INFO L290 TraceCheckUtils]: 2: Hoare triple {34546#true} assume true; {34546#true} is VALID [2022-04-27 15:09:48,561 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34546#true} {34546#true} #268#return; {34546#true} is VALID [2022-04-27 15:09:48,561 INFO L272 TraceCheckUtils]: 4: Hoare triple {34546#true} call #t~ret19 := main(); {34546#true} is VALID [2022-04-27 15:09:48,562 INFO L290 TraceCheckUtils]: 5: Hoare triple {34546#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;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;havoc ~cond~0; {34546#true} is VALID [2022-04-27 15:09:48,562 INFO L290 TraceCheckUtils]: 6: Hoare triple {34546#true} assume !false;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~cond~0 := #t~nondet18;havoc #t~nondet18; {34546#true} is VALID [2022-04-27 15:09:48,562 INFO L290 TraceCheckUtils]: 7: Hoare triple {34546#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;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0; {34546#true} is VALID [2022-04-27 15:09:48,562 INFO L290 TraceCheckUtils]: 8: Hoare triple {34546#true} assume !(0 != ~p1~0); {34546#true} is VALID [2022-04-27 15:09:48,562 INFO L290 TraceCheckUtils]: 9: Hoare triple {34546#true} assume !(0 != ~p2~0); {34546#true} is VALID [2022-04-27 15:09:48,562 INFO L290 TraceCheckUtils]: 10: Hoare triple {34546#true} assume !(0 != ~p3~0); {34546#true} is VALID [2022-04-27 15:09:48,562 INFO L290 TraceCheckUtils]: 11: Hoare triple {34546#true} assume !(0 != ~p4~0); {34546#true} is VALID [2022-04-27 15:09:48,562 INFO L290 TraceCheckUtils]: 12: Hoare triple {34546#true} assume !(0 != ~p5~0); {34546#true} is VALID [2022-04-27 15:09:48,563 INFO L290 TraceCheckUtils]: 13: Hoare triple {34546#true} assume 0 != ~p6~0;~lk6~0 := 1; {34551#(= main_~lk6~0 1)} is VALID [2022-04-27 15:09:48,563 INFO L290 TraceCheckUtils]: 14: Hoare triple {34551#(= main_~lk6~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {34551#(= main_~lk6~0 1)} is VALID [2022-04-27 15:09:48,563 INFO L290 TraceCheckUtils]: 15: Hoare triple {34551#(= main_~lk6~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {34551#(= main_~lk6~0 1)} is VALID [2022-04-27 15:09:48,564 INFO L290 TraceCheckUtils]: 16: Hoare triple {34551#(= main_~lk6~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {34551#(= main_~lk6~0 1)} is VALID [2022-04-27 15:09:48,564 INFO L290 TraceCheckUtils]: 17: Hoare triple {34551#(= main_~lk6~0 1)} assume !(0 != ~p10~0); {34551#(= main_~lk6~0 1)} is VALID [2022-04-27 15:09:48,564 INFO L290 TraceCheckUtils]: 18: Hoare triple {34551#(= main_~lk6~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {34551#(= main_~lk6~0 1)} is VALID [2022-04-27 15:09:48,564 INFO L290 TraceCheckUtils]: 19: Hoare triple {34551#(= main_~lk6~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {34551#(= main_~lk6~0 1)} is VALID [2022-04-27 15:09:48,565 INFO L290 TraceCheckUtils]: 20: Hoare triple {34551#(= main_~lk6~0 1)} assume 0 != ~p13~0;~lk13~0 := 1; {34551#(= main_~lk6~0 1)} is VALID [2022-04-27 15:09:48,565 INFO L290 TraceCheckUtils]: 21: Hoare triple {34551#(= main_~lk6~0 1)} assume 0 != ~p14~0;~lk14~0 := 1; {34551#(= main_~lk6~0 1)} is VALID [2022-04-27 15:09:48,565 INFO L290 TraceCheckUtils]: 22: Hoare triple {34551#(= main_~lk6~0 1)} assume !(0 != ~p1~0); {34551#(= main_~lk6~0 1)} is VALID [2022-04-27 15:09:48,566 INFO L290 TraceCheckUtils]: 23: Hoare triple {34551#(= main_~lk6~0 1)} assume !(0 != ~p2~0); {34551#(= main_~lk6~0 1)} is VALID [2022-04-27 15:09:48,566 INFO L290 TraceCheckUtils]: 24: Hoare triple {34551#(= main_~lk6~0 1)} assume !(0 != ~p3~0); {34551#(= main_~lk6~0 1)} is VALID [2022-04-27 15:09:48,566 INFO L290 TraceCheckUtils]: 25: Hoare triple {34551#(= main_~lk6~0 1)} assume !(0 != ~p4~0); {34551#(= main_~lk6~0 1)} is VALID [2022-04-27 15:09:48,567 INFO L290 TraceCheckUtils]: 26: Hoare triple {34551#(= main_~lk6~0 1)} assume !(0 != ~p5~0); {34551#(= main_~lk6~0 1)} is VALID [2022-04-27 15:09:48,567 INFO L290 TraceCheckUtils]: 27: Hoare triple {34551#(= main_~lk6~0 1)} assume 0 != ~p6~0; {34551#(= main_~lk6~0 1)} is VALID [2022-04-27 15:09:48,567 INFO L290 TraceCheckUtils]: 28: Hoare triple {34551#(= main_~lk6~0 1)} assume 1 != ~lk6~0; {34547#false} is VALID [2022-04-27 15:09:48,567 INFO L290 TraceCheckUtils]: 29: Hoare triple {34547#false} assume !false; {34547#false} is VALID [2022-04-27 15:09:48,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:09:48,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:09:48,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793784323] [2022-04-27 15:09:48,568 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793784323] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:09:48,568 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:09:48,568 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:09:48,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212678785] [2022-04-27 15:09:48,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:09:48,570 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-27 15:09:48,570 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:09:48,570 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-27 15:09:48,589 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-27 15:09:48,589 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:09:48,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:09:48,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:09:48,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:09:48,590 INFO L87 Difference]: Start difference. First operand 1369 states and 2295 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-27 15:09:49,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:49,009 INFO L93 Difference]: Finished difference Result 2509 states and 4281 transitions. [2022-04-27 15:09:49,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:09:49,010 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-27 15:09:49,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:09:49,010 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-27 15:09:49,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 159 transitions. [2022-04-27 15:09:49,011 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-27 15:09:49,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 159 transitions. [2022-04-27 15:09:49,012 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 159 transitions. [2022-04-27 15:09:49,121 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 159 edges. 159 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:09:49,295 INFO L225 Difference]: With dead ends: 2509 [2022-04-27 15:09:49,295 INFO L226 Difference]: Without dead ends: 2507 [2022-04-27 15:09:49,296 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-27 15:09:49,296 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 201 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 15:09:49,296 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 97 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 15:09:49,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2507 states. [2022-04-27 15:09:49,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2507 to 1929. [2022-04-27 15:09:49,331 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:09:49,334 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2507 states. Second operand has 1929 states, 1925 states have (on average 1.6394805194805195) internal successors, (3156), 1925 states have internal predecessors, (3156), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:49,335 INFO L74 IsIncluded]: Start isIncluded. First operand 2507 states. Second operand has 1929 states, 1925 states have (on average 1.6394805194805195) internal successors, (3156), 1925 states have internal predecessors, (3156), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:49,337 INFO L87 Difference]: Start difference. First operand 2507 states. Second operand has 1929 states, 1925 states have (on average 1.6394805194805195) internal successors, (3156), 1925 states have internal predecessors, (3156), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:49,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:49,570 INFO L93 Difference]: Finished difference Result 2507 states and 4248 transitions. [2022-04-27 15:09:49,570 INFO L276 IsEmpty]: Start isEmpty. Operand 2507 states and 4248 transitions. [2022-04-27 15:09:49,573 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:09:49,573 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:09:49,576 INFO L74 IsIncluded]: Start isIncluded. First operand has 1929 states, 1925 states have (on average 1.6394805194805195) internal successors, (3156), 1925 states have internal predecessors, (3156), 2 states have call successors, (2), 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 2507 states. [2022-04-27 15:09:49,578 INFO L87 Difference]: Start difference. First operand has 1929 states, 1925 states have (on average 1.6394805194805195) internal successors, (3156), 1925 states have internal predecessors, (3156), 2 states have call successors, (2), 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 2507 states. [2022-04-27 15:09:49,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:49,767 INFO L93 Difference]: Finished difference Result 2507 states and 4248 transitions. [2022-04-27 15:09:49,767 INFO L276 IsEmpty]: Start isEmpty. Operand 2507 states and 4248 transitions. [2022-04-27 15:09:49,770 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:09:49,770 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:09:49,770 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:09:49,770 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:09:49,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1929 states, 1925 states have (on average 1.6394805194805195) internal successors, (3156), 1925 states have internal predecessors, (3156), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:49,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1929 states to 1929 states and 3159 transitions. [2022-04-27 15:09:49,869 INFO L78 Accepts]: Start accepts. Automaton has 1929 states and 3159 transitions. Word has length 30 [2022-04-27 15:09:49,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:09:49,869 INFO L495 AbstractCegarLoop]: Abstraction has 1929 states and 3159 transitions. [2022-04-27 15:09:49,869 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-27 15:09:49,869 INFO L276 IsEmpty]: Start isEmpty. Operand 1929 states and 3159 transitions. [2022-04-27 15:09:49,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-27 15:09:49,871 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:09:49,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, 1, 1] [2022-04-27 15:09:49,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-27 15:09:49,871 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:09:49,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:09:49,871 INFO L85 PathProgramCache]: Analyzing trace with hash -1598645784, now seen corresponding path program 1 times [2022-04-27 15:09:49,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:09:49,872 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308307162] [2022-04-27 15:09:49,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:09:49,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:09:49,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:49,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:09:49,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:49,908 INFO L290 TraceCheckUtils]: 0: Hoare triple {44126#(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(18, 2);call #Ultimate.allocInit(12, 3); {44120#true} is VALID [2022-04-27 15:09:49,908 INFO L290 TraceCheckUtils]: 1: Hoare triple {44120#true} assume true; {44120#true} is VALID [2022-04-27 15:09:49,909 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {44120#true} {44120#true} #268#return; {44120#true} is VALID [2022-04-27 15:09:49,909 INFO L272 TraceCheckUtils]: 0: Hoare triple {44120#true} call ULTIMATE.init(); {44126#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:09:49,909 INFO L290 TraceCheckUtils]: 1: Hoare triple {44126#(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(18, 2);call #Ultimate.allocInit(12, 3); {44120#true} is VALID [2022-04-27 15:09:49,909 INFO L290 TraceCheckUtils]: 2: Hoare triple {44120#true} assume true; {44120#true} is VALID [2022-04-27 15:09:49,909 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44120#true} {44120#true} #268#return; {44120#true} is VALID [2022-04-27 15:09:49,909 INFO L272 TraceCheckUtils]: 4: Hoare triple {44120#true} call #t~ret19 := main(); {44120#true} is VALID [2022-04-27 15:09:49,910 INFO L290 TraceCheckUtils]: 5: Hoare triple {44120#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;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;havoc ~cond~0; {44120#true} is VALID [2022-04-27 15:09:49,910 INFO L290 TraceCheckUtils]: 6: Hoare triple {44120#true} assume !false;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~cond~0 := #t~nondet18;havoc #t~nondet18; {44120#true} is VALID [2022-04-27 15:09:49,910 INFO L290 TraceCheckUtils]: 7: Hoare triple {44120#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;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0; {44120#true} is VALID [2022-04-27 15:09:49,910 INFO L290 TraceCheckUtils]: 8: Hoare triple {44120#true} assume !(0 != ~p1~0); {44120#true} is VALID [2022-04-27 15:09:49,910 INFO L290 TraceCheckUtils]: 9: Hoare triple {44120#true} assume !(0 != ~p2~0); {44120#true} is VALID [2022-04-27 15:09:49,910 INFO L290 TraceCheckUtils]: 10: Hoare triple {44120#true} assume !(0 != ~p3~0); {44120#true} is VALID [2022-04-27 15:09:49,910 INFO L290 TraceCheckUtils]: 11: Hoare triple {44120#true} assume !(0 != ~p4~0); {44120#true} is VALID [2022-04-27 15:09:49,910 INFO L290 TraceCheckUtils]: 12: Hoare triple {44120#true} assume !(0 != ~p5~0); {44120#true} is VALID [2022-04-27 15:09:49,910 INFO L290 TraceCheckUtils]: 13: Hoare triple {44120#true} assume !(0 != ~p6~0); {44125#(= main_~p6~0 0)} is VALID [2022-04-27 15:09:49,911 INFO L290 TraceCheckUtils]: 14: Hoare triple {44125#(= main_~p6~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {44125#(= main_~p6~0 0)} is VALID [2022-04-27 15:09:49,911 INFO L290 TraceCheckUtils]: 15: Hoare triple {44125#(= main_~p6~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {44125#(= main_~p6~0 0)} is VALID [2022-04-27 15:09:49,911 INFO L290 TraceCheckUtils]: 16: Hoare triple {44125#(= main_~p6~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {44125#(= main_~p6~0 0)} is VALID [2022-04-27 15:09:49,912 INFO L290 TraceCheckUtils]: 17: Hoare triple {44125#(= main_~p6~0 0)} assume !(0 != ~p10~0); {44125#(= main_~p6~0 0)} is VALID [2022-04-27 15:09:49,912 INFO L290 TraceCheckUtils]: 18: Hoare triple {44125#(= main_~p6~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {44125#(= main_~p6~0 0)} is VALID [2022-04-27 15:09:49,912 INFO L290 TraceCheckUtils]: 19: Hoare triple {44125#(= main_~p6~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {44125#(= main_~p6~0 0)} is VALID [2022-04-27 15:09:49,912 INFO L290 TraceCheckUtils]: 20: Hoare triple {44125#(= main_~p6~0 0)} assume 0 != ~p13~0;~lk13~0 := 1; {44125#(= main_~p6~0 0)} is VALID [2022-04-27 15:09:49,913 INFO L290 TraceCheckUtils]: 21: Hoare triple {44125#(= main_~p6~0 0)} assume 0 != ~p14~0;~lk14~0 := 1; {44125#(= main_~p6~0 0)} is VALID [2022-04-27 15:09:49,913 INFO L290 TraceCheckUtils]: 22: Hoare triple {44125#(= main_~p6~0 0)} assume !(0 != ~p1~0); {44125#(= main_~p6~0 0)} is VALID [2022-04-27 15:09:49,913 INFO L290 TraceCheckUtils]: 23: Hoare triple {44125#(= main_~p6~0 0)} assume !(0 != ~p2~0); {44125#(= main_~p6~0 0)} is VALID [2022-04-27 15:09:49,914 INFO L290 TraceCheckUtils]: 24: Hoare triple {44125#(= main_~p6~0 0)} assume !(0 != ~p3~0); {44125#(= main_~p6~0 0)} is VALID [2022-04-27 15:09:49,914 INFO L290 TraceCheckUtils]: 25: Hoare triple {44125#(= main_~p6~0 0)} assume !(0 != ~p4~0); {44125#(= main_~p6~0 0)} is VALID [2022-04-27 15:09:49,914 INFO L290 TraceCheckUtils]: 26: Hoare triple {44125#(= main_~p6~0 0)} assume !(0 != ~p5~0); {44125#(= main_~p6~0 0)} is VALID [2022-04-27 15:09:49,914 INFO L290 TraceCheckUtils]: 27: Hoare triple {44125#(= main_~p6~0 0)} assume 0 != ~p6~0; {44121#false} is VALID [2022-04-27 15:09:49,914 INFO L290 TraceCheckUtils]: 28: Hoare triple {44121#false} assume 1 != ~lk6~0; {44121#false} is VALID [2022-04-27 15:09:49,915 INFO L290 TraceCheckUtils]: 29: Hoare triple {44121#false} assume !false; {44121#false} is VALID [2022-04-27 15:09:49,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:09:49,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:09:49,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308307162] [2022-04-27 15:09:49,915 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308307162] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:09:49,915 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:09:49,915 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:09:49,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178404268] [2022-04-27 15:09:49,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:09:49,916 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-27 15:09:49,916 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:09:49,916 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-27 15:09:49,936 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-27 15:09:49,936 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:09:49,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:09:49,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:09:49,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:09:49,937 INFO L87 Difference]: Start difference. First operand 1929 states and 3159 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-27 15:09:50,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:50,759 INFO L93 Difference]: Finished difference Result 4557 states and 7513 transitions. [2022-04-27 15:09:50,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:09:50,759 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-27 15:09:50,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:09:50,759 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-27 15:09:50,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 249 transitions. [2022-04-27 15:09:50,761 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-27 15:09:50,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 249 transitions. [2022-04-27 15:09:50,762 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 249 transitions. [2022-04-27 15:09:50,935 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 249 edges. 249 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:09:51,145 INFO L225 Difference]: With dead ends: 4557 [2022-04-27 15:09:51,146 INFO L226 Difference]: Without dead ends: 2667 [2022-04-27 15:09:51,149 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-27 15:09:51,149 INFO L413 NwaCegarLoop]: 130 mSDtfsCounter, 178 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 15:09:51,150 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 137 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 15:09:51,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2667 states. [2022-04-27 15:09:51,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2667 to 2665. [2022-04-27 15:09:51,191 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:09:51,195 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2667 states. Second operand has 2665 states, 2661 states have (on average 1.636978579481398) internal successors, (4356), 2661 states have internal predecessors, (4356), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:51,198 INFO L74 IsIncluded]: Start isIncluded. First operand 2667 states. Second operand has 2665 states, 2661 states have (on average 1.636978579481398) internal successors, (4356), 2661 states have internal predecessors, (4356), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:51,201 INFO L87 Difference]: Start difference. First operand 2667 states. Second operand has 2665 states, 2661 states have (on average 1.636978579481398) internal successors, (4356), 2661 states have internal predecessors, (4356), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:51,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:51,397 INFO L93 Difference]: Finished difference Result 2667 states and 4360 transitions. [2022-04-27 15:09:51,397 INFO L276 IsEmpty]: Start isEmpty. Operand 2667 states and 4360 transitions. [2022-04-27 15:09:51,401 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:09:51,401 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:09:51,405 INFO L74 IsIncluded]: Start isIncluded. First operand has 2665 states, 2661 states have (on average 1.636978579481398) internal successors, (4356), 2661 states have internal predecessors, (4356), 2 states have call successors, (2), 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 2667 states. [2022-04-27 15:09:51,408 INFO L87 Difference]: Start difference. First operand has 2665 states, 2661 states have (on average 1.636978579481398) internal successors, (4356), 2661 states have internal predecessors, (4356), 2 states have call successors, (2), 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 2667 states. [2022-04-27 15:09:51,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:51,670 INFO L93 Difference]: Finished difference Result 2667 states and 4360 transitions. [2022-04-27 15:09:51,670 INFO L276 IsEmpty]: Start isEmpty. Operand 2667 states and 4360 transitions. [2022-04-27 15:09:51,673 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:09:51,674 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:09:51,674 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:09:51,674 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:09:51,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2665 states, 2661 states have (on average 1.636978579481398) internal successors, (4356), 2661 states have internal predecessors, (4356), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:51,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2665 states to 2665 states and 4359 transitions. [2022-04-27 15:09:51,975 INFO L78 Accepts]: Start accepts. Automaton has 2665 states and 4359 transitions. Word has length 30 [2022-04-27 15:09:51,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:09:51,975 INFO L495 AbstractCegarLoop]: Abstraction has 2665 states and 4359 transitions. [2022-04-27 15:09:51,975 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-27 15:09:51,976 INFO L276 IsEmpty]: Start isEmpty. Operand 2665 states and 4359 transitions. [2022-04-27 15:09:51,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-27 15:09:51,977 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:09:51,977 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-27 15:09:51,978 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-27 15:09:51,978 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:09:51,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:09:51,978 INFO L85 PathProgramCache]: Analyzing trace with hash -319020550, now seen corresponding path program 1 times [2022-04-27 15:09:51,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:09:51,979 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748566374] [2022-04-27 15:09:51,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:09:51,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:09:52,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:52,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:09:52,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:52,031 INFO L290 TraceCheckUtils]: 0: Hoare triple {56868#(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(18, 2);call #Ultimate.allocInit(12, 3); {56862#true} is VALID [2022-04-27 15:09:52,031 INFO L290 TraceCheckUtils]: 1: Hoare triple {56862#true} assume true; {56862#true} is VALID [2022-04-27 15:09:52,031 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {56862#true} {56862#true} #268#return; {56862#true} is VALID [2022-04-27 15:09:52,032 INFO L272 TraceCheckUtils]: 0: Hoare triple {56862#true} call ULTIMATE.init(); {56868#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:09:52,032 INFO L290 TraceCheckUtils]: 1: Hoare triple {56868#(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(18, 2);call #Ultimate.allocInit(12, 3); {56862#true} is VALID [2022-04-27 15:09:52,032 INFO L290 TraceCheckUtils]: 2: Hoare triple {56862#true} assume true; {56862#true} is VALID [2022-04-27 15:09:52,032 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {56862#true} {56862#true} #268#return; {56862#true} is VALID [2022-04-27 15:09:52,032 INFO L272 TraceCheckUtils]: 4: Hoare triple {56862#true} call #t~ret19 := main(); {56862#true} is VALID [2022-04-27 15:09:52,032 INFO L290 TraceCheckUtils]: 5: Hoare triple {56862#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;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;havoc ~cond~0; {56862#true} is VALID [2022-04-27 15:09:52,032 INFO L290 TraceCheckUtils]: 6: Hoare triple {56862#true} assume !false;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~cond~0 := #t~nondet18;havoc #t~nondet18; {56862#true} is VALID [2022-04-27 15:09:52,032 INFO L290 TraceCheckUtils]: 7: Hoare triple {56862#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;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0; {56862#true} is VALID [2022-04-27 15:09:52,032 INFO L290 TraceCheckUtils]: 8: Hoare triple {56862#true} assume !(0 != ~p1~0); {56862#true} is VALID [2022-04-27 15:09:52,032 INFO L290 TraceCheckUtils]: 9: Hoare triple {56862#true} assume !(0 != ~p2~0); {56862#true} is VALID [2022-04-27 15:09:52,033 INFO L290 TraceCheckUtils]: 10: Hoare triple {56862#true} assume !(0 != ~p3~0); {56862#true} is VALID [2022-04-27 15:09:52,033 INFO L290 TraceCheckUtils]: 11: Hoare triple {56862#true} assume !(0 != ~p4~0); {56862#true} is VALID [2022-04-27 15:09:52,033 INFO L290 TraceCheckUtils]: 12: Hoare triple {56862#true} assume !(0 != ~p5~0); {56862#true} is VALID [2022-04-27 15:09:52,033 INFO L290 TraceCheckUtils]: 13: Hoare triple {56862#true} assume 0 != ~p6~0;~lk6~0 := 1; {56867#(not (= main_~p6~0 0))} is VALID [2022-04-27 15:09:52,033 INFO L290 TraceCheckUtils]: 14: Hoare triple {56867#(not (= main_~p6~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {56867#(not (= main_~p6~0 0))} is VALID [2022-04-27 15:09:52,034 INFO L290 TraceCheckUtils]: 15: Hoare triple {56867#(not (= main_~p6~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {56867#(not (= main_~p6~0 0))} is VALID [2022-04-27 15:09:52,034 INFO L290 TraceCheckUtils]: 16: Hoare triple {56867#(not (= main_~p6~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {56867#(not (= main_~p6~0 0))} is VALID [2022-04-27 15:09:52,034 INFO L290 TraceCheckUtils]: 17: Hoare triple {56867#(not (= main_~p6~0 0))} assume !(0 != ~p10~0); {56867#(not (= main_~p6~0 0))} is VALID [2022-04-27 15:09:52,035 INFO L290 TraceCheckUtils]: 18: Hoare triple {56867#(not (= main_~p6~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {56867#(not (= main_~p6~0 0))} is VALID [2022-04-27 15:09:52,035 INFO L290 TraceCheckUtils]: 19: Hoare triple {56867#(not (= main_~p6~0 0))} assume 0 != ~p12~0;~lk12~0 := 1; {56867#(not (= main_~p6~0 0))} is VALID [2022-04-27 15:09:52,035 INFO L290 TraceCheckUtils]: 20: Hoare triple {56867#(not (= main_~p6~0 0))} assume 0 != ~p13~0;~lk13~0 := 1; {56867#(not (= main_~p6~0 0))} is VALID [2022-04-27 15:09:52,036 INFO L290 TraceCheckUtils]: 21: Hoare triple {56867#(not (= main_~p6~0 0))} assume 0 != ~p14~0;~lk14~0 := 1; {56867#(not (= main_~p6~0 0))} is VALID [2022-04-27 15:09:52,036 INFO L290 TraceCheckUtils]: 22: Hoare triple {56867#(not (= main_~p6~0 0))} assume !(0 != ~p1~0); {56867#(not (= main_~p6~0 0))} is VALID [2022-04-27 15:09:52,036 INFO L290 TraceCheckUtils]: 23: Hoare triple {56867#(not (= main_~p6~0 0))} assume !(0 != ~p2~0); {56867#(not (= main_~p6~0 0))} is VALID [2022-04-27 15:09:52,036 INFO L290 TraceCheckUtils]: 24: Hoare triple {56867#(not (= main_~p6~0 0))} assume !(0 != ~p3~0); {56867#(not (= main_~p6~0 0))} is VALID [2022-04-27 15:09:52,037 INFO L290 TraceCheckUtils]: 25: Hoare triple {56867#(not (= main_~p6~0 0))} assume !(0 != ~p4~0); {56867#(not (= main_~p6~0 0))} is VALID [2022-04-27 15:09:52,037 INFO L290 TraceCheckUtils]: 26: Hoare triple {56867#(not (= main_~p6~0 0))} assume !(0 != ~p5~0); {56867#(not (= main_~p6~0 0))} is VALID [2022-04-27 15:09:52,037 INFO L290 TraceCheckUtils]: 27: Hoare triple {56867#(not (= main_~p6~0 0))} assume !(0 != ~p6~0); {56863#false} is VALID [2022-04-27 15:09:52,037 INFO L290 TraceCheckUtils]: 28: Hoare triple {56863#false} assume 0 != ~p7~0; {56863#false} is VALID [2022-04-27 15:09:52,038 INFO L290 TraceCheckUtils]: 29: Hoare triple {56863#false} assume 1 != ~lk7~0; {56863#false} is VALID [2022-04-27 15:09:52,038 INFO L290 TraceCheckUtils]: 30: Hoare triple {56863#false} assume !false; {56863#false} is VALID [2022-04-27 15:09:52,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:09:52,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:09:52,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748566374] [2022-04-27 15:09:52,038 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748566374] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:09:52,038 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:09:52,038 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:09:52,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055889169] [2022-04-27 15:09:52,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:09:52,039 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-27 15:09:52,039 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:09:52,039 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-27 15:09:52,060 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-27 15:09:52,060 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:09:52,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:09:52,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:09:52,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:09:52,061 INFO L87 Difference]: Start difference. First operand 2665 states and 4359 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-27 15:09:52,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:52,737 INFO L93 Difference]: Finished difference Result 3997 states and 6521 transitions. [2022-04-27 15:09:52,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:09:52,737 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-27 15:09:52,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:09:52,737 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-27 15:09:52,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 244 transitions. [2022-04-27 15:09:52,738 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-27 15:09:52,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 244 transitions. [2022-04-27 15:09:52,739 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 244 transitions. [2022-04-27 15:09:52,905 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 244 edges. 244 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:09:53,125 INFO L225 Difference]: With dead ends: 3997 [2022-04-27 15:09:53,125 INFO L226 Difference]: Without dead ends: 2699 [2022-04-27 15:09:53,127 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-27 15:09:53,128 INFO L413 NwaCegarLoop]: 131 mSDtfsCounter, 178 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 15:09:53,128 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 138 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 15:09:53,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2699 states. [2022-04-27 15:09:53,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2699 to 2697. [2022-04-27 15:09:53,174 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:09:53,178 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2699 states. Second operand has 2697 states, 2693 states have (on average 1.617526921648719) internal successors, (4356), 2693 states have internal predecessors, (4356), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:53,181 INFO L74 IsIncluded]: Start isIncluded. First operand 2699 states. Second operand has 2697 states, 2693 states have (on average 1.617526921648719) internal successors, (4356), 2693 states have internal predecessors, (4356), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:53,184 INFO L87 Difference]: Start difference. First operand 2699 states. Second operand has 2697 states, 2693 states have (on average 1.617526921648719) internal successors, (4356), 2693 states have internal predecessors, (4356), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:53,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:53,394 INFO L93 Difference]: Finished difference Result 2699 states and 4360 transitions. [2022-04-27 15:09:53,394 INFO L276 IsEmpty]: Start isEmpty. Operand 2699 states and 4360 transitions. [2022-04-27 15:09:53,396 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:09:53,396 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:09:53,400 INFO L74 IsIncluded]: Start isIncluded. First operand has 2697 states, 2693 states have (on average 1.617526921648719) internal successors, (4356), 2693 states have internal predecessors, (4356), 2 states have call successors, (2), 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 2699 states. [2022-04-27 15:09:53,403 INFO L87 Difference]: Start difference. First operand has 2697 states, 2693 states have (on average 1.617526921648719) internal successors, (4356), 2693 states have internal predecessors, (4356), 2 states have call successors, (2), 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 2699 states. [2022-04-27 15:09:53,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:53,684 INFO L93 Difference]: Finished difference Result 2699 states and 4360 transitions. [2022-04-27 15:09:53,684 INFO L276 IsEmpty]: Start isEmpty. Operand 2699 states and 4360 transitions. [2022-04-27 15:09:53,687 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:09:53,687 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:09:53,687 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:09:53,687 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:09:53,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2697 states, 2693 states have (on average 1.617526921648719) internal successors, (4356), 2693 states have internal predecessors, (4356), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:53,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2697 states to 2697 states and 4359 transitions. [2022-04-27 15:09:53,922 INFO L78 Accepts]: Start accepts. Automaton has 2697 states and 4359 transitions. Word has length 31 [2022-04-27 15:09:53,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:09:53,922 INFO L495 AbstractCegarLoop]: Abstraction has 2697 states and 4359 transitions. [2022-04-27 15:09:53,922 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-27 15:09:53,922 INFO L276 IsEmpty]: Start isEmpty. Operand 2697 states and 4359 transitions. [2022-04-27 15:09:53,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-27 15:09:53,923 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:09:53,923 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-27 15:09:53,923 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-04-27 15:09:53,923 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:09:53,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:09:53,924 INFO L85 PathProgramCache]: Analyzing trace with hash 1981802040, now seen corresponding path program 1 times [2022-04-27 15:09:53,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:09:53,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692394573] [2022-04-27 15:09:53,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:09:53,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:09:53,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:53,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:09:53,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:53,955 INFO L290 TraceCheckUtils]: 0: Hoare triple {69146#(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(18, 2);call #Ultimate.allocInit(12, 3); {69140#true} is VALID [2022-04-27 15:09:53,955 INFO L290 TraceCheckUtils]: 1: Hoare triple {69140#true} assume true; {69140#true} is VALID [2022-04-27 15:09:53,955 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {69140#true} {69140#true} #268#return; {69140#true} is VALID [2022-04-27 15:09:53,956 INFO L272 TraceCheckUtils]: 0: Hoare triple {69140#true} call ULTIMATE.init(); {69146#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:09:53,956 INFO L290 TraceCheckUtils]: 1: Hoare triple {69146#(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(18, 2);call #Ultimate.allocInit(12, 3); {69140#true} is VALID [2022-04-27 15:09:53,956 INFO L290 TraceCheckUtils]: 2: Hoare triple {69140#true} assume true; {69140#true} is VALID [2022-04-27 15:09:53,956 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {69140#true} {69140#true} #268#return; {69140#true} is VALID [2022-04-27 15:09:53,956 INFO L272 TraceCheckUtils]: 4: Hoare triple {69140#true} call #t~ret19 := main(); {69140#true} is VALID [2022-04-27 15:09:53,956 INFO L290 TraceCheckUtils]: 5: Hoare triple {69140#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;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;havoc ~cond~0; {69140#true} is VALID [2022-04-27 15:09:53,956 INFO L290 TraceCheckUtils]: 6: Hoare triple {69140#true} assume !false;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~cond~0 := #t~nondet18;havoc #t~nondet18; {69140#true} is VALID [2022-04-27 15:09:53,956 INFO L290 TraceCheckUtils]: 7: Hoare triple {69140#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;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0; {69140#true} is VALID [2022-04-27 15:09:53,956 INFO L290 TraceCheckUtils]: 8: Hoare triple {69140#true} assume !(0 != ~p1~0); {69140#true} is VALID [2022-04-27 15:09:53,956 INFO L290 TraceCheckUtils]: 9: Hoare triple {69140#true} assume !(0 != ~p2~0); {69140#true} is VALID [2022-04-27 15:09:53,956 INFO L290 TraceCheckUtils]: 10: Hoare triple {69140#true} assume !(0 != ~p3~0); {69140#true} is VALID [2022-04-27 15:09:53,956 INFO L290 TraceCheckUtils]: 11: Hoare triple {69140#true} assume !(0 != ~p4~0); {69140#true} is VALID [2022-04-27 15:09:53,956 INFO L290 TraceCheckUtils]: 12: Hoare triple {69140#true} assume !(0 != ~p5~0); {69140#true} is VALID [2022-04-27 15:09:53,957 INFO L290 TraceCheckUtils]: 13: Hoare triple {69140#true} assume !(0 != ~p6~0); {69140#true} is VALID [2022-04-27 15:09:53,957 INFO L290 TraceCheckUtils]: 14: Hoare triple {69140#true} assume 0 != ~p7~0;~lk7~0 := 1; {69145#(= main_~lk7~0 1)} is VALID [2022-04-27 15:09:53,957 INFO L290 TraceCheckUtils]: 15: Hoare triple {69145#(= main_~lk7~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {69145#(= main_~lk7~0 1)} is VALID [2022-04-27 15:09:53,957 INFO L290 TraceCheckUtils]: 16: Hoare triple {69145#(= main_~lk7~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {69145#(= main_~lk7~0 1)} is VALID [2022-04-27 15:09:53,958 INFO L290 TraceCheckUtils]: 17: Hoare triple {69145#(= main_~lk7~0 1)} assume !(0 != ~p10~0); {69145#(= main_~lk7~0 1)} is VALID [2022-04-27 15:09:53,958 INFO L290 TraceCheckUtils]: 18: Hoare triple {69145#(= main_~lk7~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {69145#(= main_~lk7~0 1)} is VALID [2022-04-27 15:09:53,958 INFO L290 TraceCheckUtils]: 19: Hoare triple {69145#(= main_~lk7~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {69145#(= main_~lk7~0 1)} is VALID [2022-04-27 15:09:53,959 INFO L290 TraceCheckUtils]: 20: Hoare triple {69145#(= main_~lk7~0 1)} assume 0 != ~p13~0;~lk13~0 := 1; {69145#(= main_~lk7~0 1)} is VALID [2022-04-27 15:09:53,959 INFO L290 TraceCheckUtils]: 21: Hoare triple {69145#(= main_~lk7~0 1)} assume 0 != ~p14~0;~lk14~0 := 1; {69145#(= main_~lk7~0 1)} is VALID [2022-04-27 15:09:53,959 INFO L290 TraceCheckUtils]: 22: Hoare triple {69145#(= main_~lk7~0 1)} assume !(0 != ~p1~0); {69145#(= main_~lk7~0 1)} is VALID [2022-04-27 15:09:53,959 INFO L290 TraceCheckUtils]: 23: Hoare triple {69145#(= main_~lk7~0 1)} assume !(0 != ~p2~0); {69145#(= main_~lk7~0 1)} is VALID [2022-04-27 15:09:53,960 INFO L290 TraceCheckUtils]: 24: Hoare triple {69145#(= main_~lk7~0 1)} assume !(0 != ~p3~0); {69145#(= main_~lk7~0 1)} is VALID [2022-04-27 15:09:53,960 INFO L290 TraceCheckUtils]: 25: Hoare triple {69145#(= main_~lk7~0 1)} assume !(0 != ~p4~0); {69145#(= main_~lk7~0 1)} is VALID [2022-04-27 15:09:53,960 INFO L290 TraceCheckUtils]: 26: Hoare triple {69145#(= main_~lk7~0 1)} assume !(0 != ~p5~0); {69145#(= main_~lk7~0 1)} is VALID [2022-04-27 15:09:53,961 INFO L290 TraceCheckUtils]: 27: Hoare triple {69145#(= main_~lk7~0 1)} assume !(0 != ~p6~0); {69145#(= main_~lk7~0 1)} is VALID [2022-04-27 15:09:53,961 INFO L290 TraceCheckUtils]: 28: Hoare triple {69145#(= main_~lk7~0 1)} assume 0 != ~p7~0; {69145#(= main_~lk7~0 1)} is VALID [2022-04-27 15:09:53,961 INFO L290 TraceCheckUtils]: 29: Hoare triple {69145#(= main_~lk7~0 1)} assume 1 != ~lk7~0; {69141#false} is VALID [2022-04-27 15:09:53,961 INFO L290 TraceCheckUtils]: 30: Hoare triple {69141#false} assume !false; {69141#false} is VALID [2022-04-27 15:09:53,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:09:53,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:09:53,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692394573] [2022-04-27 15:09:53,962 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692394573] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:09:53,962 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:09:53,962 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:09:53,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423791651] [2022-04-27 15:09:53,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:09:53,962 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-27 15:09:53,962 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:09:53,962 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-27 15:09:53,980 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-27 15:09:53,981 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:09:53,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:09:53,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:09:53,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:09:53,981 INFO L87 Difference]: Start difference. First operand 2697 states and 4359 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-27 15:09:54,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:54,822 INFO L93 Difference]: Finished difference Result 4877 states and 8041 transitions. [2022-04-27 15:09:54,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:09:54,822 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-27 15:09:54,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:09:54,822 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-27 15:09:54,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 155 transitions. [2022-04-27 15:09:54,823 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-27 15:09:54,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 155 transitions. [2022-04-27 15:09:54,824 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 155 transitions. [2022-04-27 15:09:54,944 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 155 edges. 155 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:09:55,624 INFO L225 Difference]: With dead ends: 4877 [2022-04-27 15:09:55,624 INFO L226 Difference]: Without dead ends: 4875 [2022-04-27 15:09:55,625 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-27 15:09:55,626 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 194 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:09:55,626 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 96 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 15:09:55,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4875 states. [2022-04-27 15:09:55,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4875 to 3849. [2022-04-27 15:09:55,679 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:09:55,683 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4875 states. Second operand has 3849 states, 3845 states have (on average 1.5739921976592979) internal successors, (6052), 3845 states have internal predecessors, (6052), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:55,687 INFO L74 IsIncluded]: Start isIncluded. First operand 4875 states. Second operand has 3849 states, 3845 states have (on average 1.5739921976592979) internal successors, (6052), 3845 states have internal predecessors, (6052), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:55,690 INFO L87 Difference]: Start difference. First operand 4875 states. Second operand has 3849 states, 3845 states have (on average 1.5739921976592979) internal successors, (6052), 3845 states have internal predecessors, (6052), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:56,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:56,315 INFO L93 Difference]: Finished difference Result 4875 states and 7976 transitions. [2022-04-27 15:09:56,315 INFO L276 IsEmpty]: Start isEmpty. Operand 4875 states and 7976 transitions. [2022-04-27 15:09:56,319 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:09:56,319 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:09:56,324 INFO L74 IsIncluded]: Start isIncluded. First operand has 3849 states, 3845 states have (on average 1.5739921976592979) internal successors, (6052), 3845 states have internal predecessors, (6052), 2 states have call successors, (2), 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 4875 states. [2022-04-27 15:09:56,327 INFO L87 Difference]: Start difference. First operand has 3849 states, 3845 states have (on average 1.5739921976592979) internal successors, (6052), 3845 states have internal predecessors, (6052), 2 states have call successors, (2), 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 4875 states. [2022-04-27 15:09:57,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:57,008 INFO L93 Difference]: Finished difference Result 4875 states and 7976 transitions. [2022-04-27 15:09:57,008 INFO L276 IsEmpty]: Start isEmpty. Operand 4875 states and 7976 transitions. [2022-04-27 15:09:57,012 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:09:57,012 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:09:57,012 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:09:57,012 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:09:57,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3849 states, 3845 states have (on average 1.5739921976592979) internal successors, (6052), 3845 states have internal predecessors, (6052), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:57,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3849 states to 3849 states and 6055 transitions. [2022-04-27 15:09:57,497 INFO L78 Accepts]: Start accepts. Automaton has 3849 states and 6055 transitions. Word has length 31 [2022-04-27 15:09:57,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:09:57,497 INFO L495 AbstractCegarLoop]: Abstraction has 3849 states and 6055 transitions. [2022-04-27 15:09:57,497 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-27 15:09:57,498 INFO L276 IsEmpty]: Start isEmpty. Operand 3849 states and 6055 transitions. [2022-04-27 15:09:57,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-27 15:09:57,500 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:09:57,500 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-27 15:09:57,500 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-04-27 15:09:57,500 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:09:57,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:09:57,500 INFO L85 PathProgramCache]: Analyzing trace with hash 393454138, now seen corresponding path program 1 times [2022-04-27 15:09:57,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:09:57,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560767856] [2022-04-27 15:09:57,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:09:57,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:09:57,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:57,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:09:57,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:57,537 INFO L290 TraceCheckUtils]: 0: Hoare triple {87840#(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(18, 2);call #Ultimate.allocInit(12, 3); {87834#true} is VALID [2022-04-27 15:09:57,537 INFO L290 TraceCheckUtils]: 1: Hoare triple {87834#true} assume true; {87834#true} is VALID [2022-04-27 15:09:57,537 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {87834#true} {87834#true} #268#return; {87834#true} is VALID [2022-04-27 15:09:57,538 INFO L272 TraceCheckUtils]: 0: Hoare triple {87834#true} call ULTIMATE.init(); {87840#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:09:57,538 INFO L290 TraceCheckUtils]: 1: Hoare triple {87840#(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(18, 2);call #Ultimate.allocInit(12, 3); {87834#true} is VALID [2022-04-27 15:09:57,538 INFO L290 TraceCheckUtils]: 2: Hoare triple {87834#true} assume true; {87834#true} is VALID [2022-04-27 15:09:57,538 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {87834#true} {87834#true} #268#return; {87834#true} is VALID [2022-04-27 15:09:57,538 INFO L272 TraceCheckUtils]: 4: Hoare triple {87834#true} call #t~ret19 := main(); {87834#true} is VALID [2022-04-27 15:09:57,538 INFO L290 TraceCheckUtils]: 5: Hoare triple {87834#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;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;havoc ~cond~0; {87834#true} is VALID [2022-04-27 15:09:57,538 INFO L290 TraceCheckUtils]: 6: Hoare triple {87834#true} assume !false;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~cond~0 := #t~nondet18;havoc #t~nondet18; {87834#true} is VALID [2022-04-27 15:09:57,538 INFO L290 TraceCheckUtils]: 7: Hoare triple {87834#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;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0; {87834#true} is VALID [2022-04-27 15:09:57,538 INFO L290 TraceCheckUtils]: 8: Hoare triple {87834#true} assume !(0 != ~p1~0); {87834#true} is VALID [2022-04-27 15:09:57,539 INFO L290 TraceCheckUtils]: 9: Hoare triple {87834#true} assume !(0 != ~p2~0); {87834#true} is VALID [2022-04-27 15:09:57,539 INFO L290 TraceCheckUtils]: 10: Hoare triple {87834#true} assume !(0 != ~p3~0); {87834#true} is VALID [2022-04-27 15:09:57,539 INFO L290 TraceCheckUtils]: 11: Hoare triple {87834#true} assume !(0 != ~p4~0); {87834#true} is VALID [2022-04-27 15:09:57,539 INFO L290 TraceCheckUtils]: 12: Hoare triple {87834#true} assume !(0 != ~p5~0); {87834#true} is VALID [2022-04-27 15:09:57,539 INFO L290 TraceCheckUtils]: 13: Hoare triple {87834#true} assume !(0 != ~p6~0); {87834#true} is VALID [2022-04-27 15:09:57,539 INFO L290 TraceCheckUtils]: 14: Hoare triple {87834#true} assume !(0 != ~p7~0); {87839#(= main_~p7~0 0)} is VALID [2022-04-27 15:09:57,539 INFO L290 TraceCheckUtils]: 15: Hoare triple {87839#(= main_~p7~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {87839#(= main_~p7~0 0)} is VALID [2022-04-27 15:09:57,540 INFO L290 TraceCheckUtils]: 16: Hoare triple {87839#(= main_~p7~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {87839#(= main_~p7~0 0)} is VALID [2022-04-27 15:09:57,540 INFO L290 TraceCheckUtils]: 17: Hoare triple {87839#(= main_~p7~0 0)} assume !(0 != ~p10~0); {87839#(= main_~p7~0 0)} is VALID [2022-04-27 15:09:57,540 INFO L290 TraceCheckUtils]: 18: Hoare triple {87839#(= main_~p7~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {87839#(= main_~p7~0 0)} is VALID [2022-04-27 15:09:57,541 INFO L290 TraceCheckUtils]: 19: Hoare triple {87839#(= main_~p7~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {87839#(= main_~p7~0 0)} is VALID [2022-04-27 15:09:57,541 INFO L290 TraceCheckUtils]: 20: Hoare triple {87839#(= main_~p7~0 0)} assume 0 != ~p13~0;~lk13~0 := 1; {87839#(= main_~p7~0 0)} is VALID [2022-04-27 15:09:57,541 INFO L290 TraceCheckUtils]: 21: Hoare triple {87839#(= main_~p7~0 0)} assume 0 != ~p14~0;~lk14~0 := 1; {87839#(= main_~p7~0 0)} is VALID [2022-04-27 15:09:57,541 INFO L290 TraceCheckUtils]: 22: Hoare triple {87839#(= main_~p7~0 0)} assume !(0 != ~p1~0); {87839#(= main_~p7~0 0)} is VALID [2022-04-27 15:09:57,542 INFO L290 TraceCheckUtils]: 23: Hoare triple {87839#(= main_~p7~0 0)} assume !(0 != ~p2~0); {87839#(= main_~p7~0 0)} is VALID [2022-04-27 15:09:57,542 INFO L290 TraceCheckUtils]: 24: Hoare triple {87839#(= main_~p7~0 0)} assume !(0 != ~p3~0); {87839#(= main_~p7~0 0)} is VALID [2022-04-27 15:09:57,542 INFO L290 TraceCheckUtils]: 25: Hoare triple {87839#(= main_~p7~0 0)} assume !(0 != ~p4~0); {87839#(= main_~p7~0 0)} is VALID [2022-04-27 15:09:57,543 INFO L290 TraceCheckUtils]: 26: Hoare triple {87839#(= main_~p7~0 0)} assume !(0 != ~p5~0); {87839#(= main_~p7~0 0)} is VALID [2022-04-27 15:09:57,543 INFO L290 TraceCheckUtils]: 27: Hoare triple {87839#(= main_~p7~0 0)} assume !(0 != ~p6~0); {87839#(= main_~p7~0 0)} is VALID [2022-04-27 15:09:57,543 INFO L290 TraceCheckUtils]: 28: Hoare triple {87839#(= main_~p7~0 0)} assume 0 != ~p7~0; {87835#false} is VALID [2022-04-27 15:09:57,543 INFO L290 TraceCheckUtils]: 29: Hoare triple {87835#false} assume 1 != ~lk7~0; {87835#false} is VALID [2022-04-27 15:09:57,543 INFO L290 TraceCheckUtils]: 30: Hoare triple {87835#false} assume !false; {87835#false} is VALID [2022-04-27 15:09:57,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:09:57,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:09:57,544 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560767856] [2022-04-27 15:09:57,544 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560767856] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:09:57,544 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:09:57,544 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:09:57,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134727535] [2022-04-27 15:09:57,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:09:57,544 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-27 15:09:57,544 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:09:57,545 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-27 15:09:57,563 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-27 15:09:57,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:09:57,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:09:57,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:09:57,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:09:57,564 INFO L87 Difference]: Start difference. First operand 3849 states and 6055 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-27 15:09:59,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:59,902 INFO L93 Difference]: Finished difference Result 9037 states and 14313 transitions. [2022-04-27 15:09:59,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:09:59,902 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-27 15:09:59,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:09:59,903 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-27 15:09:59,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 246 transitions. [2022-04-27 15:09:59,904 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-27 15:09:59,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 246 transitions. [2022-04-27 15:09:59,905 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 246 transitions. [2022-04-27 15:10:00,067 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 246 edges. 246 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:00,860 INFO L225 Difference]: With dead ends: 9037 [2022-04-27 15:10:00,860 INFO L226 Difference]: Without dead ends: 5259 [2022-04-27 15:10:00,864 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-27 15:10:00,864 INFO L413 NwaCegarLoop]: 132 mSDtfsCounter, 172 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 15:10:00,865 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 139 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 15:10:00,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5259 states. [2022-04-27 15:10:00,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5259 to 5257. [2022-04-27 15:10:00,943 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:10:00,949 INFO L82 GeneralOperation]: Start isEquivalent. First operand 5259 states. Second operand has 5257 states, 5253 states have (on average 1.5724347991623835) internal successors, (8260), 5253 states have internal predecessors, (8260), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:00,954 INFO L74 IsIncluded]: Start isIncluded. First operand 5259 states. Second operand has 5257 states, 5253 states have (on average 1.5724347991623835) internal successors, (8260), 5253 states have internal predecessors, (8260), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:00,960 INFO L87 Difference]: Start difference. First operand 5259 states. Second operand has 5257 states, 5253 states have (on average 1.5724347991623835) internal successors, (8260), 5253 states have internal predecessors, (8260), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:01,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:01,790 INFO L93 Difference]: Finished difference Result 5259 states and 8264 transitions. [2022-04-27 15:10:01,790 INFO L276 IsEmpty]: Start isEmpty. Operand 5259 states and 8264 transitions. [2022-04-27 15:10:01,795 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:01,795 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:01,801 INFO L74 IsIncluded]: Start isIncluded. First operand has 5257 states, 5253 states have (on average 1.5724347991623835) internal successors, (8260), 5253 states have internal predecessors, (8260), 2 states have call successors, (2), 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 5259 states. [2022-04-27 15:10:01,806 INFO L87 Difference]: Start difference. First operand has 5257 states, 5253 states have (on average 1.5724347991623835) internal successors, (8260), 5253 states have internal predecessors, (8260), 2 states have call successors, (2), 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 5259 states. [2022-04-27 15:10:02,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:02,506 INFO L93 Difference]: Finished difference Result 5259 states and 8264 transitions. [2022-04-27 15:10:02,506 INFO L276 IsEmpty]: Start isEmpty. Operand 5259 states and 8264 transitions. [2022-04-27 15:10:02,511 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:02,511 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:02,511 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:10:02,511 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:10:02,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5257 states, 5253 states have (on average 1.5724347991623835) internal successors, (8260), 5253 states have internal predecessors, (8260), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:03,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5257 states to 5257 states and 8263 transitions. [2022-04-27 15:10:03,235 INFO L78 Accepts]: Start accepts. Automaton has 5257 states and 8263 transitions. Word has length 31 [2022-04-27 15:10:03,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:10:03,235 INFO L495 AbstractCegarLoop]: Abstraction has 5257 states and 8263 transitions. [2022-04-27 15:10:03,236 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-27 15:10:03,236 INFO L276 IsEmpty]: Start isEmpty. Operand 5257 states and 8263 transitions. [2022-04-27 15:10:03,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-27 15:10:03,238 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:10:03,238 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, 1] [2022-04-27 15:10:03,238 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-04-27 15:10:03,238 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:10:03,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:10:03,238 INFO L85 PathProgramCache]: Analyzing trace with hash 1306535229, now seen corresponding path program 1 times [2022-04-27 15:10:03,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:10:03,239 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706686611] [2022-04-27 15:10:03,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:10:03,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:10:03,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:03,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:10:03,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:03,270 INFO L290 TraceCheckUtils]: 0: Hoare triple {112998#(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(18, 2);call #Ultimate.allocInit(12, 3); {112992#true} is VALID [2022-04-27 15:10:03,270 INFO L290 TraceCheckUtils]: 1: Hoare triple {112992#true} assume true; {112992#true} is VALID [2022-04-27 15:10:03,271 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {112992#true} {112992#true} #268#return; {112992#true} is VALID [2022-04-27 15:10:03,271 INFO L272 TraceCheckUtils]: 0: Hoare triple {112992#true} call ULTIMATE.init(); {112998#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:10:03,271 INFO L290 TraceCheckUtils]: 1: Hoare triple {112998#(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(18, 2);call #Ultimate.allocInit(12, 3); {112992#true} is VALID [2022-04-27 15:10:03,271 INFO L290 TraceCheckUtils]: 2: Hoare triple {112992#true} assume true; {112992#true} is VALID [2022-04-27 15:10:03,271 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {112992#true} {112992#true} #268#return; {112992#true} is VALID [2022-04-27 15:10:03,271 INFO L272 TraceCheckUtils]: 4: Hoare triple {112992#true} call #t~ret19 := main(); {112992#true} is VALID [2022-04-27 15:10:03,271 INFO L290 TraceCheckUtils]: 5: Hoare triple {112992#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;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;havoc ~cond~0; {112992#true} is VALID [2022-04-27 15:10:03,271 INFO L290 TraceCheckUtils]: 6: Hoare triple {112992#true} assume !false;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~cond~0 := #t~nondet18;havoc #t~nondet18; {112992#true} is VALID [2022-04-27 15:10:03,272 INFO L290 TraceCheckUtils]: 7: Hoare triple {112992#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;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0; {112992#true} is VALID [2022-04-27 15:10:03,272 INFO L290 TraceCheckUtils]: 8: Hoare triple {112992#true} assume !(0 != ~p1~0); {112992#true} is VALID [2022-04-27 15:10:03,272 INFO L290 TraceCheckUtils]: 9: Hoare triple {112992#true} assume !(0 != ~p2~0); {112992#true} is VALID [2022-04-27 15:10:03,272 INFO L290 TraceCheckUtils]: 10: Hoare triple {112992#true} assume !(0 != ~p3~0); {112992#true} is VALID [2022-04-27 15:10:03,272 INFO L290 TraceCheckUtils]: 11: Hoare triple {112992#true} assume !(0 != ~p4~0); {112992#true} is VALID [2022-04-27 15:10:03,272 INFO L290 TraceCheckUtils]: 12: Hoare triple {112992#true} assume !(0 != ~p5~0); {112992#true} is VALID [2022-04-27 15:10:03,272 INFO L290 TraceCheckUtils]: 13: Hoare triple {112992#true} assume !(0 != ~p6~0); {112992#true} is VALID [2022-04-27 15:10:03,272 INFO L290 TraceCheckUtils]: 14: Hoare triple {112992#true} assume 0 != ~p7~0;~lk7~0 := 1; {112997#(not (= main_~p7~0 0))} is VALID [2022-04-27 15:10:03,273 INFO L290 TraceCheckUtils]: 15: Hoare triple {112997#(not (= main_~p7~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {112997#(not (= main_~p7~0 0))} is VALID [2022-04-27 15:10:03,273 INFO L290 TraceCheckUtils]: 16: Hoare triple {112997#(not (= main_~p7~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {112997#(not (= main_~p7~0 0))} is VALID [2022-04-27 15:10:03,273 INFO L290 TraceCheckUtils]: 17: Hoare triple {112997#(not (= main_~p7~0 0))} assume !(0 != ~p10~0); {112997#(not (= main_~p7~0 0))} is VALID [2022-04-27 15:10:03,273 INFO L290 TraceCheckUtils]: 18: Hoare triple {112997#(not (= main_~p7~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {112997#(not (= main_~p7~0 0))} is VALID [2022-04-27 15:10:03,274 INFO L290 TraceCheckUtils]: 19: Hoare triple {112997#(not (= main_~p7~0 0))} assume 0 != ~p12~0;~lk12~0 := 1; {112997#(not (= main_~p7~0 0))} is VALID [2022-04-27 15:10:03,274 INFO L290 TraceCheckUtils]: 20: Hoare triple {112997#(not (= main_~p7~0 0))} assume 0 != ~p13~0;~lk13~0 := 1; {112997#(not (= main_~p7~0 0))} is VALID [2022-04-27 15:10:03,274 INFO L290 TraceCheckUtils]: 21: Hoare triple {112997#(not (= main_~p7~0 0))} assume 0 != ~p14~0;~lk14~0 := 1; {112997#(not (= main_~p7~0 0))} is VALID [2022-04-27 15:10:03,274 INFO L290 TraceCheckUtils]: 22: Hoare triple {112997#(not (= main_~p7~0 0))} assume !(0 != ~p1~0); {112997#(not (= main_~p7~0 0))} is VALID [2022-04-27 15:10:03,275 INFO L290 TraceCheckUtils]: 23: Hoare triple {112997#(not (= main_~p7~0 0))} assume !(0 != ~p2~0); {112997#(not (= main_~p7~0 0))} is VALID [2022-04-27 15:10:03,275 INFO L290 TraceCheckUtils]: 24: Hoare triple {112997#(not (= main_~p7~0 0))} assume !(0 != ~p3~0); {112997#(not (= main_~p7~0 0))} is VALID [2022-04-27 15:10:03,275 INFO L290 TraceCheckUtils]: 25: Hoare triple {112997#(not (= main_~p7~0 0))} assume !(0 != ~p4~0); {112997#(not (= main_~p7~0 0))} is VALID [2022-04-27 15:10:03,276 INFO L290 TraceCheckUtils]: 26: Hoare triple {112997#(not (= main_~p7~0 0))} assume !(0 != ~p5~0); {112997#(not (= main_~p7~0 0))} is VALID [2022-04-27 15:10:03,276 INFO L290 TraceCheckUtils]: 27: Hoare triple {112997#(not (= main_~p7~0 0))} assume !(0 != ~p6~0); {112997#(not (= main_~p7~0 0))} is VALID [2022-04-27 15:10:03,276 INFO L290 TraceCheckUtils]: 28: Hoare triple {112997#(not (= main_~p7~0 0))} assume !(0 != ~p7~0); {112993#false} is VALID [2022-04-27 15:10:03,276 INFO L290 TraceCheckUtils]: 29: Hoare triple {112993#false} assume 0 != ~p8~0; {112993#false} is VALID [2022-04-27 15:10:03,276 INFO L290 TraceCheckUtils]: 30: Hoare triple {112993#false} assume 1 != ~lk8~0; {112993#false} is VALID [2022-04-27 15:10:03,276 INFO L290 TraceCheckUtils]: 31: Hoare triple {112993#false} assume !false; {112993#false} is VALID [2022-04-27 15:10:03,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:10:03,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:10:03,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706686611] [2022-04-27 15:10:03,277 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706686611] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:10:03,277 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:10:03,277 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:10:03,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615974473] [2022-04-27 15:10:03,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:10:03,277 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 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 32 [2022-04-27 15:10:03,278 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:10:03,278 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:03,297 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:03,298 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:10:03,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:10:03,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:10:03,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:10:03,298 INFO L87 Difference]: Start difference. First operand 5257 states and 8263 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:05,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:05,366 INFO L93 Difference]: Finished difference Result 7885 states and 12361 transitions. [2022-04-27 15:10:05,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:10:05,366 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 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 32 [2022-04-27 15:10:05,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:10:05,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:05,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 241 transitions. [2022-04-27 15:10:05,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:05,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 241 transitions. [2022-04-27 15:10:05,369 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 241 transitions. [2022-04-27 15:10:05,554 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 241 edges. 241 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:06,478 INFO L225 Difference]: With dead ends: 7885 [2022-04-27 15:10:06,478 INFO L226 Difference]: Without dead ends: 5323 [2022-04-27 15:10:06,481 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-27 15:10:06,484 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 177 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:10:06,485 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 135 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 15:10:06,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5323 states. [2022-04-27 15:10:06,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5323 to 5321. [2022-04-27 15:10:06,639 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:10:06,646 INFO L82 GeneralOperation]: Start isEquivalent. First operand 5323 states. Second operand has 5321 states, 5317 states have (on average 1.5535076170772992) internal successors, (8260), 5317 states have internal predecessors, (8260), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:06,652 INFO L74 IsIncluded]: Start isIncluded. First operand 5323 states. Second operand has 5321 states, 5317 states have (on average 1.5535076170772992) internal successors, (8260), 5317 states have internal predecessors, (8260), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:06,657 INFO L87 Difference]: Start difference. First operand 5323 states. Second operand has 5321 states, 5317 states have (on average 1.5535076170772992) internal successors, (8260), 5317 states have internal predecessors, (8260), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:07,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:07,426 INFO L93 Difference]: Finished difference Result 5323 states and 8264 transitions. [2022-04-27 15:10:07,426 INFO L276 IsEmpty]: Start isEmpty. Operand 5323 states and 8264 transitions. [2022-04-27 15:10:07,430 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:07,431 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:07,437 INFO L74 IsIncluded]: Start isIncluded. First operand has 5321 states, 5317 states have (on average 1.5535076170772992) internal successors, (8260), 5317 states have internal predecessors, (8260), 2 states have call successors, (2), 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 5323 states. [2022-04-27 15:10:07,442 INFO L87 Difference]: Start difference. First operand has 5321 states, 5317 states have (on average 1.5535076170772992) internal successors, (8260), 5317 states have internal predecessors, (8260), 2 states have call successors, (2), 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 5323 states. [2022-04-27 15:10:08,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:08,248 INFO L93 Difference]: Finished difference Result 5323 states and 8264 transitions. [2022-04-27 15:10:08,248 INFO L276 IsEmpty]: Start isEmpty. Operand 5323 states and 8264 transitions. [2022-04-27 15:10:08,253 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:08,253 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:08,253 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:10:08,253 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:10:08,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5321 states, 5317 states have (on average 1.5535076170772992) internal successors, (8260), 5317 states have internal predecessors, (8260), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:09,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5321 states to 5321 states and 8263 transitions. [2022-04-27 15:10:09,158 INFO L78 Accepts]: Start accepts. Automaton has 5321 states and 8263 transitions. Word has length 32 [2022-04-27 15:10:09,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:10:09,158 INFO L495 AbstractCegarLoop]: Abstraction has 5321 states and 8263 transitions. [2022-04-27 15:10:09,158 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:09,158 INFO L276 IsEmpty]: Start isEmpty. Operand 5321 states and 8263 transitions. [2022-04-27 15:10:09,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-27 15:10:09,160 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:10:09,161 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, 1] [2022-04-27 15:10:09,161 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-04-27 15:10:09,161 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:10:09,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:10:09,161 INFO L85 PathProgramCache]: Analyzing trace with hash -687609477, now seen corresponding path program 1 times [2022-04-27 15:10:09,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:10:09,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652695473] [2022-04-27 15:10:09,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:10:09,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:10:09,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:09,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:10:09,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:09,206 INFO L290 TraceCheckUtils]: 0: Hoare triple {137196#(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(18, 2);call #Ultimate.allocInit(12, 3); {137190#true} is VALID [2022-04-27 15:10:09,206 INFO L290 TraceCheckUtils]: 1: Hoare triple {137190#true} assume true; {137190#true} is VALID [2022-04-27 15:10:09,207 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {137190#true} {137190#true} #268#return; {137190#true} is VALID [2022-04-27 15:10:09,207 INFO L272 TraceCheckUtils]: 0: Hoare triple {137190#true} call ULTIMATE.init(); {137196#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:10:09,207 INFO L290 TraceCheckUtils]: 1: Hoare triple {137196#(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(18, 2);call #Ultimate.allocInit(12, 3); {137190#true} is VALID [2022-04-27 15:10:09,207 INFO L290 TraceCheckUtils]: 2: Hoare triple {137190#true} assume true; {137190#true} is VALID [2022-04-27 15:10:09,207 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {137190#true} {137190#true} #268#return; {137190#true} is VALID [2022-04-27 15:10:09,207 INFO L272 TraceCheckUtils]: 4: Hoare triple {137190#true} call #t~ret19 := main(); {137190#true} is VALID [2022-04-27 15:10:09,208 INFO L290 TraceCheckUtils]: 5: Hoare triple {137190#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;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;havoc ~cond~0; {137190#true} is VALID [2022-04-27 15:10:09,208 INFO L290 TraceCheckUtils]: 6: Hoare triple {137190#true} assume !false;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~cond~0 := #t~nondet18;havoc #t~nondet18; {137190#true} is VALID [2022-04-27 15:10:09,208 INFO L290 TraceCheckUtils]: 7: Hoare triple {137190#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;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0; {137190#true} is VALID [2022-04-27 15:10:09,208 INFO L290 TraceCheckUtils]: 8: Hoare triple {137190#true} assume !(0 != ~p1~0); {137190#true} is VALID [2022-04-27 15:10:09,208 INFO L290 TraceCheckUtils]: 9: Hoare triple {137190#true} assume !(0 != ~p2~0); {137190#true} is VALID [2022-04-27 15:10:09,208 INFO L290 TraceCheckUtils]: 10: Hoare triple {137190#true} assume !(0 != ~p3~0); {137190#true} is VALID [2022-04-27 15:10:09,208 INFO L290 TraceCheckUtils]: 11: Hoare triple {137190#true} assume !(0 != ~p4~0); {137190#true} is VALID [2022-04-27 15:10:09,208 INFO L290 TraceCheckUtils]: 12: Hoare triple {137190#true} assume !(0 != ~p5~0); {137190#true} is VALID [2022-04-27 15:10:09,208 INFO L290 TraceCheckUtils]: 13: Hoare triple {137190#true} assume !(0 != ~p6~0); {137190#true} is VALID [2022-04-27 15:10:09,208 INFO L290 TraceCheckUtils]: 14: Hoare triple {137190#true} assume !(0 != ~p7~0); {137190#true} is VALID [2022-04-27 15:10:09,209 INFO L290 TraceCheckUtils]: 15: Hoare triple {137190#true} assume 0 != ~p8~0;~lk8~0 := 1; {137195#(= main_~lk8~0 1)} is VALID [2022-04-27 15:10:09,209 INFO L290 TraceCheckUtils]: 16: Hoare triple {137195#(= main_~lk8~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {137195#(= main_~lk8~0 1)} is VALID [2022-04-27 15:10:09,209 INFO L290 TraceCheckUtils]: 17: Hoare triple {137195#(= main_~lk8~0 1)} assume !(0 != ~p10~0); {137195#(= main_~lk8~0 1)} is VALID [2022-04-27 15:10:09,210 INFO L290 TraceCheckUtils]: 18: Hoare triple {137195#(= main_~lk8~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {137195#(= main_~lk8~0 1)} is VALID [2022-04-27 15:10:09,212 INFO L290 TraceCheckUtils]: 19: Hoare triple {137195#(= main_~lk8~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {137195#(= main_~lk8~0 1)} is VALID [2022-04-27 15:10:09,212 INFO L290 TraceCheckUtils]: 20: Hoare triple {137195#(= main_~lk8~0 1)} assume 0 != ~p13~0;~lk13~0 := 1; {137195#(= main_~lk8~0 1)} is VALID [2022-04-27 15:10:09,212 INFO L290 TraceCheckUtils]: 21: Hoare triple {137195#(= main_~lk8~0 1)} assume 0 != ~p14~0;~lk14~0 := 1; {137195#(= main_~lk8~0 1)} is VALID [2022-04-27 15:10:09,212 INFO L290 TraceCheckUtils]: 22: Hoare triple {137195#(= main_~lk8~0 1)} assume !(0 != ~p1~0); {137195#(= main_~lk8~0 1)} is VALID [2022-04-27 15:10:09,213 INFO L290 TraceCheckUtils]: 23: Hoare triple {137195#(= main_~lk8~0 1)} assume !(0 != ~p2~0); {137195#(= main_~lk8~0 1)} is VALID [2022-04-27 15:10:09,213 INFO L290 TraceCheckUtils]: 24: Hoare triple {137195#(= main_~lk8~0 1)} assume !(0 != ~p3~0); {137195#(= main_~lk8~0 1)} is VALID [2022-04-27 15:10:09,213 INFO L290 TraceCheckUtils]: 25: Hoare triple {137195#(= main_~lk8~0 1)} assume !(0 != ~p4~0); {137195#(= main_~lk8~0 1)} is VALID [2022-04-27 15:10:09,214 INFO L290 TraceCheckUtils]: 26: Hoare triple {137195#(= main_~lk8~0 1)} assume !(0 != ~p5~0); {137195#(= main_~lk8~0 1)} is VALID [2022-04-27 15:10:09,214 INFO L290 TraceCheckUtils]: 27: Hoare triple {137195#(= main_~lk8~0 1)} assume !(0 != ~p6~0); {137195#(= main_~lk8~0 1)} is VALID [2022-04-27 15:10:09,214 INFO L290 TraceCheckUtils]: 28: Hoare triple {137195#(= main_~lk8~0 1)} assume !(0 != ~p7~0); {137195#(= main_~lk8~0 1)} is VALID [2022-04-27 15:10:09,215 INFO L290 TraceCheckUtils]: 29: Hoare triple {137195#(= main_~lk8~0 1)} assume 0 != ~p8~0; {137195#(= main_~lk8~0 1)} is VALID [2022-04-27 15:10:09,215 INFO L290 TraceCheckUtils]: 30: Hoare triple {137195#(= main_~lk8~0 1)} assume 1 != ~lk8~0; {137191#false} is VALID [2022-04-27 15:10:09,215 INFO L290 TraceCheckUtils]: 31: Hoare triple {137191#false} assume !false; {137191#false} is VALID [2022-04-27 15:10:09,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:10:09,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:10:09,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652695473] [2022-04-27 15:10:09,215 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652695473] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:10:09,215 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:10:09,216 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:10:09,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522978133] [2022-04-27 15:10:09,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:10:09,216 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 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 32 [2022-04-27 15:10:09,216 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:10:09,216 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:09,241 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:09,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:10:09,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:10:09,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:10:09,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:10:09,242 INFO L87 Difference]: Start difference. First operand 5321 states and 8263 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:12,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:12,068 INFO L93 Difference]: Finished difference Result 9485 states and 15049 transitions. [2022-04-27 15:10:12,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:10:12,069 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 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 32 [2022-04-27 15:10:12,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:10:12,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:12,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 151 transitions. [2022-04-27 15:10:12,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:12,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 151 transitions. [2022-04-27 15:10:12,071 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 151 transitions. [2022-04-27 15:10:12,194 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 151 edges. 151 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:14,798 INFO L225 Difference]: With dead ends: 9485 [2022-04-27 15:10:14,798 INFO L226 Difference]: Without dead ends: 9483 [2022-04-27 15:10:14,799 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-27 15:10:14,800 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 187 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 15:10:14,800 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 95 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 15:10:14,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9483 states. [2022-04-27 15:10:14,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9483 to 7689. [2022-04-27 15:10:14,914 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:10:14,924 INFO L82 GeneralOperation]: Start isEquivalent. First operand 9483 states. Second operand has 7689 states, 7685 states have (on average 1.5078724788549123) internal successors, (11588), 7685 states have internal predecessors, (11588), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:14,933 INFO L74 IsIncluded]: Start isIncluded. First operand 9483 states. Second operand has 7689 states, 7685 states have (on average 1.5078724788549123) internal successors, (11588), 7685 states have internal predecessors, (11588), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:14,943 INFO L87 Difference]: Start difference. First operand 9483 states. Second operand has 7689 states, 7685 states have (on average 1.5078724788549123) internal successors, (11588), 7685 states have internal predecessors, (11588), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:17,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:17,237 INFO L93 Difference]: Finished difference Result 9483 states and 14920 transitions. [2022-04-27 15:10:17,237 INFO L276 IsEmpty]: Start isEmpty. Operand 9483 states and 14920 transitions. [2022-04-27 15:10:17,244 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:17,244 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:17,251 INFO L74 IsIncluded]: Start isIncluded. First operand has 7689 states, 7685 states have (on average 1.5078724788549123) internal successors, (11588), 7685 states have internal predecessors, (11588), 2 states have call successors, (2), 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 9483 states. [2022-04-27 15:10:17,257 INFO L87 Difference]: Start difference. First operand has 7689 states, 7685 states have (on average 1.5078724788549123) internal successors, (11588), 7685 states have internal predecessors, (11588), 2 states have call successors, (2), 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 9483 states. [2022-04-27 15:10:19,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:19,872 INFO L93 Difference]: Finished difference Result 9483 states and 14920 transitions. [2022-04-27 15:10:19,872 INFO L276 IsEmpty]: Start isEmpty. Operand 9483 states and 14920 transitions. [2022-04-27 15:10:19,879 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:19,879 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:19,879 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:10:19,879 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:10:19,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7689 states, 7685 states have (on average 1.5078724788549123) internal successors, (11588), 7685 states have internal predecessors, (11588), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:21,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7689 states to 7689 states and 11591 transitions. [2022-04-27 15:10:21,716 INFO L78 Accepts]: Start accepts. Automaton has 7689 states and 11591 transitions. Word has length 32 [2022-04-27 15:10:21,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:10:21,716 INFO L495 AbstractCegarLoop]: Abstraction has 7689 states and 11591 transitions. [2022-04-27 15:10:21,716 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:21,716 INFO L276 IsEmpty]: Start isEmpty. Operand 7689 states and 11591 transitions. [2022-04-27 15:10:21,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-27 15:10:21,719 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:10:21,719 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, 1] [2022-04-27 15:10:21,719 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-04-27 15:10:21,719 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:10:21,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:10:21,720 INFO L85 PathProgramCache]: Analyzing trace with hash 2019009917, now seen corresponding path program 1 times [2022-04-27 15:10:21,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:10:21,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076384502] [2022-04-27 15:10:21,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:10:21,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:10:21,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:21,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:10:21,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:21,765 INFO L290 TraceCheckUtils]: 0: Hoare triple {173746#(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(18, 2);call #Ultimate.allocInit(12, 3); {173740#true} is VALID [2022-04-27 15:10:21,765 INFO L290 TraceCheckUtils]: 1: Hoare triple {173740#true} assume true; {173740#true} is VALID [2022-04-27 15:10:21,765 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {173740#true} {173740#true} #268#return; {173740#true} is VALID [2022-04-27 15:10:21,766 INFO L272 TraceCheckUtils]: 0: Hoare triple {173740#true} call ULTIMATE.init(); {173746#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:10:21,766 INFO L290 TraceCheckUtils]: 1: Hoare triple {173746#(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(18, 2);call #Ultimate.allocInit(12, 3); {173740#true} is VALID [2022-04-27 15:10:21,766 INFO L290 TraceCheckUtils]: 2: Hoare triple {173740#true} assume true; {173740#true} is VALID [2022-04-27 15:10:21,766 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {173740#true} {173740#true} #268#return; {173740#true} is VALID [2022-04-27 15:10:21,766 INFO L272 TraceCheckUtils]: 4: Hoare triple {173740#true} call #t~ret19 := main(); {173740#true} is VALID [2022-04-27 15:10:21,766 INFO L290 TraceCheckUtils]: 5: Hoare triple {173740#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;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;havoc ~cond~0; {173740#true} is VALID [2022-04-27 15:10:21,767 INFO L290 TraceCheckUtils]: 6: Hoare triple {173740#true} assume !false;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~cond~0 := #t~nondet18;havoc #t~nondet18; {173740#true} is VALID [2022-04-27 15:10:21,767 INFO L290 TraceCheckUtils]: 7: Hoare triple {173740#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;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0; {173740#true} is VALID [2022-04-27 15:10:21,767 INFO L290 TraceCheckUtils]: 8: Hoare triple {173740#true} assume !(0 != ~p1~0); {173740#true} is VALID [2022-04-27 15:10:21,767 INFO L290 TraceCheckUtils]: 9: Hoare triple {173740#true} assume !(0 != ~p2~0); {173740#true} is VALID [2022-04-27 15:10:21,767 INFO L290 TraceCheckUtils]: 10: Hoare triple {173740#true} assume !(0 != ~p3~0); {173740#true} is VALID [2022-04-27 15:10:21,767 INFO L290 TraceCheckUtils]: 11: Hoare triple {173740#true} assume !(0 != ~p4~0); {173740#true} is VALID [2022-04-27 15:10:21,767 INFO L290 TraceCheckUtils]: 12: Hoare triple {173740#true} assume !(0 != ~p5~0); {173740#true} is VALID [2022-04-27 15:10:21,767 INFO L290 TraceCheckUtils]: 13: Hoare triple {173740#true} assume !(0 != ~p6~0); {173740#true} is VALID [2022-04-27 15:10:21,767 INFO L290 TraceCheckUtils]: 14: Hoare triple {173740#true} assume !(0 != ~p7~0); {173740#true} is VALID [2022-04-27 15:10:21,767 INFO L290 TraceCheckUtils]: 15: Hoare triple {173740#true} assume !(0 != ~p8~0); {173745#(= main_~p8~0 0)} is VALID [2022-04-27 15:10:21,768 INFO L290 TraceCheckUtils]: 16: Hoare triple {173745#(= main_~p8~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {173745#(= main_~p8~0 0)} is VALID [2022-04-27 15:10:21,768 INFO L290 TraceCheckUtils]: 17: Hoare triple {173745#(= main_~p8~0 0)} assume !(0 != ~p10~0); {173745#(= main_~p8~0 0)} is VALID [2022-04-27 15:10:21,768 INFO L290 TraceCheckUtils]: 18: Hoare triple {173745#(= main_~p8~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {173745#(= main_~p8~0 0)} is VALID [2022-04-27 15:10:21,769 INFO L290 TraceCheckUtils]: 19: Hoare triple {173745#(= main_~p8~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {173745#(= main_~p8~0 0)} is VALID [2022-04-27 15:10:21,769 INFO L290 TraceCheckUtils]: 20: Hoare triple {173745#(= main_~p8~0 0)} assume 0 != ~p13~0;~lk13~0 := 1; {173745#(= main_~p8~0 0)} is VALID [2022-04-27 15:10:21,769 INFO L290 TraceCheckUtils]: 21: Hoare triple {173745#(= main_~p8~0 0)} assume 0 != ~p14~0;~lk14~0 := 1; {173745#(= main_~p8~0 0)} is VALID [2022-04-27 15:10:21,769 INFO L290 TraceCheckUtils]: 22: Hoare triple {173745#(= main_~p8~0 0)} assume !(0 != ~p1~0); {173745#(= main_~p8~0 0)} is VALID [2022-04-27 15:10:21,770 INFO L290 TraceCheckUtils]: 23: Hoare triple {173745#(= main_~p8~0 0)} assume !(0 != ~p2~0); {173745#(= main_~p8~0 0)} is VALID [2022-04-27 15:10:21,770 INFO L290 TraceCheckUtils]: 24: Hoare triple {173745#(= main_~p8~0 0)} assume !(0 != ~p3~0); {173745#(= main_~p8~0 0)} is VALID [2022-04-27 15:10:21,770 INFO L290 TraceCheckUtils]: 25: Hoare triple {173745#(= main_~p8~0 0)} assume !(0 != ~p4~0); {173745#(= main_~p8~0 0)} is VALID [2022-04-27 15:10:21,771 INFO L290 TraceCheckUtils]: 26: Hoare triple {173745#(= main_~p8~0 0)} assume !(0 != ~p5~0); {173745#(= main_~p8~0 0)} is VALID [2022-04-27 15:10:21,771 INFO L290 TraceCheckUtils]: 27: Hoare triple {173745#(= main_~p8~0 0)} assume !(0 != ~p6~0); {173745#(= main_~p8~0 0)} is VALID [2022-04-27 15:10:21,771 INFO L290 TraceCheckUtils]: 28: Hoare triple {173745#(= main_~p8~0 0)} assume !(0 != ~p7~0); {173745#(= main_~p8~0 0)} is VALID [2022-04-27 15:10:21,771 INFO L290 TraceCheckUtils]: 29: Hoare triple {173745#(= main_~p8~0 0)} assume 0 != ~p8~0; {173741#false} is VALID [2022-04-27 15:10:21,772 INFO L290 TraceCheckUtils]: 30: Hoare triple {173741#false} assume 1 != ~lk8~0; {173741#false} is VALID [2022-04-27 15:10:21,772 INFO L290 TraceCheckUtils]: 31: Hoare triple {173741#false} assume !false; {173741#false} is VALID [2022-04-27 15:10:21,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:10:21,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:10:21,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076384502] [2022-04-27 15:10:21,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076384502] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:10:21,772 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:10:21,772 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:10:21,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922035159] [2022-04-27 15:10:21,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:10:21,773 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 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 32 [2022-04-27 15:10:21,773 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:10:21,773 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:21,791 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:21,792 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:10:21,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:10:21,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:10:21,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:10:21,792 INFO L87 Difference]: Start difference. First operand 7689 states and 11591 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:30,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:30,578 INFO L93 Difference]: Finished difference Result 17933 states and 27209 transitions. [2022-04-27 15:10:30,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:10:30,578 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 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 32 [2022-04-27 15:10:30,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:10:30,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:30,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 243 transitions. [2022-04-27 15:10:30,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:30,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 243 transitions. [2022-04-27 15:10:30,580 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 243 transitions. [2022-04-27 15:10:30,746 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 243 edges. 243 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:33,730 INFO L225 Difference]: With dead ends: 17933 [2022-04-27 15:10:33,730 INFO L226 Difference]: Without dead ends: 10379 [2022-04-27 15:10:33,735 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-27 15:10:33,736 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 166 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 15:10:33,736 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 141 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 15:10:33,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10379 states. [2022-04-27 15:10:33,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10379 to 10377. [2022-04-27 15:10:33,909 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:10:33,920 INFO L82 GeneralOperation]: Start isEquivalent. First operand 10379 states. Second operand has 10377 states, 10373 states have (on average 1.5058324496288442) internal successors, (15620), 10373 states have internal predecessors, (15620), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:33,931 INFO L74 IsIncluded]: Start isIncluded. First operand 10379 states. Second operand has 10377 states, 10373 states have (on average 1.5058324496288442) internal successors, (15620), 10373 states have internal predecessors, (15620), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:33,945 INFO L87 Difference]: Start difference. First operand 10379 states. Second operand has 10377 states, 10373 states have (on average 1.5058324496288442) internal successors, (15620), 10373 states have internal predecessors, (15620), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:36,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:36,981 INFO L93 Difference]: Finished difference Result 10379 states and 15624 transitions. [2022-04-27 15:10:36,981 INFO L276 IsEmpty]: Start isEmpty. Operand 10379 states and 15624 transitions. [2022-04-27 15:10:36,989 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:36,990 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:37,000 INFO L74 IsIncluded]: Start isIncluded. First operand has 10377 states, 10373 states have (on average 1.5058324496288442) internal successors, (15620), 10373 states have internal predecessors, (15620), 2 states have call successors, (2), 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 10379 states. [2022-04-27 15:10:37,008 INFO L87 Difference]: Start difference. First operand has 10377 states, 10373 states have (on average 1.5058324496288442) internal successors, (15620), 10373 states have internal predecessors, (15620), 2 states have call successors, (2), 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 10379 states. [2022-04-27 15:10:39,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:39,921 INFO L93 Difference]: Finished difference Result 10379 states and 15624 transitions. [2022-04-27 15:10:39,921 INFO L276 IsEmpty]: Start isEmpty. Operand 10379 states and 15624 transitions. [2022-04-27 15:10:39,928 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:39,929 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:39,929 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:10:39,929 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:10:39,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10377 states, 10373 states have (on average 1.5058324496288442) internal successors, (15620), 10373 states have internal predecessors, (15620), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:43,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10377 states to 10377 states and 15623 transitions. [2022-04-27 15:10:43,132 INFO L78 Accepts]: Start accepts. Automaton has 10377 states and 15623 transitions. Word has length 32 [2022-04-27 15:10:43,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:10:43,132 INFO L495 AbstractCegarLoop]: Abstraction has 10377 states and 15623 transitions. [2022-04-27 15:10:43,132 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:43,132 INFO L276 IsEmpty]: Start isEmpty. Operand 10377 states and 15623 transitions. [2022-04-27 15:10:43,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-27 15:10:43,138 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:10:43,138 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, 1, 1] [2022-04-27 15:10:43,138 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-04-27 15:10:43,139 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:10:43,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:10:43,140 INFO L85 PathProgramCache]: Analyzing trace with hash 159157167, now seen corresponding path program 1 times [2022-04-27 15:10:43,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:10:43,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803720526] [2022-04-27 15:10:43,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:10:43,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:10:43,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:43,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:10:43,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:43,173 INFO L290 TraceCheckUtils]: 0: Hoare triple {223480#(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(18, 2);call #Ultimate.allocInit(12, 3); {223474#true} is VALID [2022-04-27 15:10:43,173 INFO L290 TraceCheckUtils]: 1: Hoare triple {223474#true} assume true; {223474#true} is VALID [2022-04-27 15:10:43,173 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {223474#true} {223474#true} #268#return; {223474#true} is VALID [2022-04-27 15:10:43,174 INFO L272 TraceCheckUtils]: 0: Hoare triple {223474#true} call ULTIMATE.init(); {223480#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:10:43,174 INFO L290 TraceCheckUtils]: 1: Hoare triple {223480#(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(18, 2);call #Ultimate.allocInit(12, 3); {223474#true} is VALID [2022-04-27 15:10:43,174 INFO L290 TraceCheckUtils]: 2: Hoare triple {223474#true} assume true; {223474#true} is VALID [2022-04-27 15:10:43,174 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {223474#true} {223474#true} #268#return; {223474#true} is VALID [2022-04-27 15:10:43,174 INFO L272 TraceCheckUtils]: 4: Hoare triple {223474#true} call #t~ret19 := main(); {223474#true} is VALID [2022-04-27 15:10:43,174 INFO L290 TraceCheckUtils]: 5: Hoare triple {223474#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;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;havoc ~cond~0; {223474#true} is VALID [2022-04-27 15:10:43,174 INFO L290 TraceCheckUtils]: 6: Hoare triple {223474#true} assume !false;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~cond~0 := #t~nondet18;havoc #t~nondet18; {223474#true} is VALID [2022-04-27 15:10:43,175 INFO L290 TraceCheckUtils]: 7: Hoare triple {223474#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;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0; {223474#true} is VALID [2022-04-27 15:10:43,175 INFO L290 TraceCheckUtils]: 8: Hoare triple {223474#true} assume !(0 != ~p1~0); {223474#true} is VALID [2022-04-27 15:10:43,175 INFO L290 TraceCheckUtils]: 9: Hoare triple {223474#true} assume !(0 != ~p2~0); {223474#true} is VALID [2022-04-27 15:10:43,175 INFO L290 TraceCheckUtils]: 10: Hoare triple {223474#true} assume !(0 != ~p3~0); {223474#true} is VALID [2022-04-27 15:10:43,175 INFO L290 TraceCheckUtils]: 11: Hoare triple {223474#true} assume !(0 != ~p4~0); {223474#true} is VALID [2022-04-27 15:10:43,175 INFO L290 TraceCheckUtils]: 12: Hoare triple {223474#true} assume !(0 != ~p5~0); {223474#true} is VALID [2022-04-27 15:10:43,175 INFO L290 TraceCheckUtils]: 13: Hoare triple {223474#true} assume !(0 != ~p6~0); {223474#true} is VALID [2022-04-27 15:10:43,175 INFO L290 TraceCheckUtils]: 14: Hoare triple {223474#true} assume !(0 != ~p7~0); {223474#true} is VALID [2022-04-27 15:10:43,175 INFO L290 TraceCheckUtils]: 15: Hoare triple {223474#true} assume 0 != ~p8~0;~lk8~0 := 1; {223479#(not (= main_~p8~0 0))} is VALID [2022-04-27 15:10:43,176 INFO L290 TraceCheckUtils]: 16: Hoare triple {223479#(not (= main_~p8~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {223479#(not (= main_~p8~0 0))} is VALID [2022-04-27 15:10:43,176 INFO L290 TraceCheckUtils]: 17: Hoare triple {223479#(not (= main_~p8~0 0))} assume !(0 != ~p10~0); {223479#(not (= main_~p8~0 0))} is VALID [2022-04-27 15:10:43,176 INFO L290 TraceCheckUtils]: 18: Hoare triple {223479#(not (= main_~p8~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {223479#(not (= main_~p8~0 0))} is VALID [2022-04-27 15:10:43,177 INFO L290 TraceCheckUtils]: 19: Hoare triple {223479#(not (= main_~p8~0 0))} assume 0 != ~p12~0;~lk12~0 := 1; {223479#(not (= main_~p8~0 0))} is VALID [2022-04-27 15:10:43,177 INFO L290 TraceCheckUtils]: 20: Hoare triple {223479#(not (= main_~p8~0 0))} assume 0 != ~p13~0;~lk13~0 := 1; {223479#(not (= main_~p8~0 0))} is VALID [2022-04-27 15:10:43,177 INFO L290 TraceCheckUtils]: 21: Hoare triple {223479#(not (= main_~p8~0 0))} assume 0 != ~p14~0;~lk14~0 := 1; {223479#(not (= main_~p8~0 0))} is VALID [2022-04-27 15:10:43,177 INFO L290 TraceCheckUtils]: 22: Hoare triple {223479#(not (= main_~p8~0 0))} assume !(0 != ~p1~0); {223479#(not (= main_~p8~0 0))} is VALID [2022-04-27 15:10:43,178 INFO L290 TraceCheckUtils]: 23: Hoare triple {223479#(not (= main_~p8~0 0))} assume !(0 != ~p2~0); {223479#(not (= main_~p8~0 0))} is VALID [2022-04-27 15:10:43,178 INFO L290 TraceCheckUtils]: 24: Hoare triple {223479#(not (= main_~p8~0 0))} assume !(0 != ~p3~0); {223479#(not (= main_~p8~0 0))} is VALID [2022-04-27 15:10:43,178 INFO L290 TraceCheckUtils]: 25: Hoare triple {223479#(not (= main_~p8~0 0))} assume !(0 != ~p4~0); {223479#(not (= main_~p8~0 0))} is VALID [2022-04-27 15:10:43,179 INFO L290 TraceCheckUtils]: 26: Hoare triple {223479#(not (= main_~p8~0 0))} assume !(0 != ~p5~0); {223479#(not (= main_~p8~0 0))} is VALID [2022-04-27 15:10:43,179 INFO L290 TraceCheckUtils]: 27: Hoare triple {223479#(not (= main_~p8~0 0))} assume !(0 != ~p6~0); {223479#(not (= main_~p8~0 0))} is VALID [2022-04-27 15:10:43,179 INFO L290 TraceCheckUtils]: 28: Hoare triple {223479#(not (= main_~p8~0 0))} assume !(0 != ~p7~0); {223479#(not (= main_~p8~0 0))} is VALID [2022-04-27 15:10:43,179 INFO L290 TraceCheckUtils]: 29: Hoare triple {223479#(not (= main_~p8~0 0))} assume !(0 != ~p8~0); {223475#false} is VALID [2022-04-27 15:10:43,180 INFO L290 TraceCheckUtils]: 30: Hoare triple {223475#false} assume 0 != ~p9~0; {223475#false} is VALID [2022-04-27 15:10:43,180 INFO L290 TraceCheckUtils]: 31: Hoare triple {223475#false} assume 1 != ~lk9~0; {223475#false} is VALID [2022-04-27 15:10:43,180 INFO L290 TraceCheckUtils]: 32: Hoare triple {223475#false} assume !false; {223475#false} is VALID [2022-04-27 15:10:43,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:10:43,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:10:43,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803720526] [2022-04-27 15:10:43,180 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803720526] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:10:43,180 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:10:43,180 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:10:43,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923083575] [2022-04-27 15:10:43,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:10:43,181 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 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 33 [2022-04-27 15:10:43,181 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:10:43,181 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:43,201 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:43,201 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:10:43,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:10:43,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:10:43,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:10:43,201 INFO L87 Difference]: Start difference. First operand 10377 states and 15623 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:49,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:49,792 INFO L93 Difference]: Finished difference Result 15565 states and 23369 transitions. [2022-04-27 15:10:49,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:10:49,792 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 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 33 [2022-04-27 15:10:49,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:10:49,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:49,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 238 transitions. [2022-04-27 15:10:49,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:49,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 238 transitions. [2022-04-27 15:10:49,794 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 238 transitions. [2022-04-27 15:10:49,936 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 238 edges. 238 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:53,013 INFO L225 Difference]: With dead ends: 15565 [2022-04-27 15:10:53,013 INFO L226 Difference]: Without dead ends: 10507 [2022-04-27 15:10:53,016 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-27 15:10:53,017 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 176 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:10:53,017 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 132 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 15:10:53,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10507 states. [2022-04-27 15:10:53,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10507 to 10505. [2022-04-27 15:10:53,177 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:10:53,189 INFO L82 GeneralOperation]: Start isEquivalent. First operand 10507 states. Second operand has 10505 states, 10501 states have (on average 1.4874773831063708) internal successors, (15620), 10501 states have internal predecessors, (15620), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:53,198 INFO L74 IsIncluded]: Start isIncluded. First operand 10507 states. Second operand has 10505 states, 10501 states have (on average 1.4874773831063708) internal successors, (15620), 10501 states have internal predecessors, (15620), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:53,207 INFO L87 Difference]: Start difference. First operand 10507 states. Second operand has 10505 states, 10501 states have (on average 1.4874773831063708) internal successors, (15620), 10501 states have internal predecessors, (15620), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:55,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:55,949 INFO L93 Difference]: Finished difference Result 10507 states and 15624 transitions. [2022-04-27 15:10:55,949 INFO L276 IsEmpty]: Start isEmpty. Operand 10507 states and 15624 transitions. [2022-04-27 15:10:55,955 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:55,955 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:55,965 INFO L74 IsIncluded]: Start isIncluded. First operand has 10505 states, 10501 states have (on average 1.4874773831063708) internal successors, (15620), 10501 states have internal predecessors, (15620), 2 states have call successors, (2), 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 10507 states. [2022-04-27 15:10:55,975 INFO L87 Difference]: Start difference. First operand has 10505 states, 10501 states have (on average 1.4874773831063708) internal successors, (15620), 10501 states have internal predecessors, (15620), 2 states have call successors, (2), 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 10507 states. [2022-04-27 15:10:58,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:58,713 INFO L93 Difference]: Finished difference Result 10507 states and 15624 transitions. [2022-04-27 15:10:58,714 INFO L276 IsEmpty]: Start isEmpty. Operand 10507 states and 15624 transitions. [2022-04-27 15:10:58,719 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:58,719 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:58,720 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:10:58,720 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:10:58,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10505 states, 10501 states have (on average 1.4874773831063708) internal successors, (15620), 10501 states have internal predecessors, (15620), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:11:01,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10505 states to 10505 states and 15623 transitions. [2022-04-27 15:11:01,709 INFO L78 Accepts]: Start accepts. Automaton has 10505 states and 15623 transitions. Word has length 33 [2022-04-27 15:11:01,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:11:01,709 INFO L495 AbstractCegarLoop]: Abstraction has 10505 states and 15623 transitions. [2022-04-27 15:11:01,709 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:11:01,709 INFO L276 IsEmpty]: Start isEmpty. Operand 10505 states and 15623 transitions. [2022-04-27 15:11:01,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-27 15:11:01,714 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:11:01,714 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, 1, 1] [2022-04-27 15:11:01,714 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-04-27 15:11:01,714 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:11:01,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:11:01,715 INFO L85 PathProgramCache]: Analyzing trace with hash -1834987539, now seen corresponding path program 1 times [2022-04-27 15:11:01,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:11:01,715 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986194442] [2022-04-27 15:11:01,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:11:01,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:11:01,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:11:01,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:11:01,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:11:01,746 INFO L290 TraceCheckUtils]: 0: Hoare triple {271230#(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(18, 2);call #Ultimate.allocInit(12, 3); {271224#true} is VALID [2022-04-27 15:11:01,746 INFO L290 TraceCheckUtils]: 1: Hoare triple {271224#true} assume true; {271224#true} is VALID [2022-04-27 15:11:01,746 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {271224#true} {271224#true} #268#return; {271224#true} is VALID [2022-04-27 15:11:01,747 INFO L272 TraceCheckUtils]: 0: Hoare triple {271224#true} call ULTIMATE.init(); {271230#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:11:01,747 INFO L290 TraceCheckUtils]: 1: Hoare triple {271230#(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(18, 2);call #Ultimate.allocInit(12, 3); {271224#true} is VALID [2022-04-27 15:11:01,747 INFO L290 TraceCheckUtils]: 2: Hoare triple {271224#true} assume true; {271224#true} is VALID [2022-04-27 15:11:01,747 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {271224#true} {271224#true} #268#return; {271224#true} is VALID [2022-04-27 15:11:01,747 INFO L272 TraceCheckUtils]: 4: Hoare triple {271224#true} call #t~ret19 := main(); {271224#true} is VALID [2022-04-27 15:11:01,747 INFO L290 TraceCheckUtils]: 5: Hoare triple {271224#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;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;havoc ~cond~0; {271224#true} is VALID [2022-04-27 15:11:01,747 INFO L290 TraceCheckUtils]: 6: Hoare triple {271224#true} assume !false;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~cond~0 := #t~nondet18;havoc #t~nondet18; {271224#true} is VALID [2022-04-27 15:11:01,747 INFO L290 TraceCheckUtils]: 7: Hoare triple {271224#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;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0; {271224#true} is VALID [2022-04-27 15:11:01,747 INFO L290 TraceCheckUtils]: 8: Hoare triple {271224#true} assume !(0 != ~p1~0); {271224#true} is VALID [2022-04-27 15:11:01,748 INFO L290 TraceCheckUtils]: 9: Hoare triple {271224#true} assume !(0 != ~p2~0); {271224#true} is VALID [2022-04-27 15:11:01,748 INFO L290 TraceCheckUtils]: 10: Hoare triple {271224#true} assume !(0 != ~p3~0); {271224#true} is VALID [2022-04-27 15:11:01,748 INFO L290 TraceCheckUtils]: 11: Hoare triple {271224#true} assume !(0 != ~p4~0); {271224#true} is VALID [2022-04-27 15:11:01,748 INFO L290 TraceCheckUtils]: 12: Hoare triple {271224#true} assume !(0 != ~p5~0); {271224#true} is VALID [2022-04-27 15:11:01,748 INFO L290 TraceCheckUtils]: 13: Hoare triple {271224#true} assume !(0 != ~p6~0); {271224#true} is VALID [2022-04-27 15:11:01,748 INFO L290 TraceCheckUtils]: 14: Hoare triple {271224#true} assume !(0 != ~p7~0); {271224#true} is VALID [2022-04-27 15:11:01,748 INFO L290 TraceCheckUtils]: 15: Hoare triple {271224#true} assume !(0 != ~p8~0); {271224#true} is VALID [2022-04-27 15:11:01,748 INFO L290 TraceCheckUtils]: 16: Hoare triple {271224#true} assume 0 != ~p9~0;~lk9~0 := 1; {271229#(= main_~lk9~0 1)} is VALID [2022-04-27 15:11:01,749 INFO L290 TraceCheckUtils]: 17: Hoare triple {271229#(= main_~lk9~0 1)} assume !(0 != ~p10~0); {271229#(= main_~lk9~0 1)} is VALID [2022-04-27 15:11:01,749 INFO L290 TraceCheckUtils]: 18: Hoare triple {271229#(= main_~lk9~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {271229#(= main_~lk9~0 1)} is VALID [2022-04-27 15:11:01,749 INFO L290 TraceCheckUtils]: 19: Hoare triple {271229#(= main_~lk9~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {271229#(= main_~lk9~0 1)} is VALID [2022-04-27 15:11:01,749 INFO L290 TraceCheckUtils]: 20: Hoare triple {271229#(= main_~lk9~0 1)} assume 0 != ~p13~0;~lk13~0 := 1; {271229#(= main_~lk9~0 1)} is VALID [2022-04-27 15:11:01,750 INFO L290 TraceCheckUtils]: 21: Hoare triple {271229#(= main_~lk9~0 1)} assume 0 != ~p14~0;~lk14~0 := 1; {271229#(= main_~lk9~0 1)} is VALID [2022-04-27 15:11:01,750 INFO L290 TraceCheckUtils]: 22: Hoare triple {271229#(= main_~lk9~0 1)} assume !(0 != ~p1~0); {271229#(= main_~lk9~0 1)} is VALID [2022-04-27 15:11:01,750 INFO L290 TraceCheckUtils]: 23: Hoare triple {271229#(= main_~lk9~0 1)} assume !(0 != ~p2~0); {271229#(= main_~lk9~0 1)} is VALID [2022-04-27 15:11:01,751 INFO L290 TraceCheckUtils]: 24: Hoare triple {271229#(= main_~lk9~0 1)} assume !(0 != ~p3~0); {271229#(= main_~lk9~0 1)} is VALID [2022-04-27 15:11:01,751 INFO L290 TraceCheckUtils]: 25: Hoare triple {271229#(= main_~lk9~0 1)} assume !(0 != ~p4~0); {271229#(= main_~lk9~0 1)} is VALID [2022-04-27 15:11:01,751 INFO L290 TraceCheckUtils]: 26: Hoare triple {271229#(= main_~lk9~0 1)} assume !(0 != ~p5~0); {271229#(= main_~lk9~0 1)} is VALID [2022-04-27 15:11:01,752 INFO L290 TraceCheckUtils]: 27: Hoare triple {271229#(= main_~lk9~0 1)} assume !(0 != ~p6~0); {271229#(= main_~lk9~0 1)} is VALID [2022-04-27 15:11:01,752 INFO L290 TraceCheckUtils]: 28: Hoare triple {271229#(= main_~lk9~0 1)} assume !(0 != ~p7~0); {271229#(= main_~lk9~0 1)} is VALID [2022-04-27 15:11:01,752 INFO L290 TraceCheckUtils]: 29: Hoare triple {271229#(= main_~lk9~0 1)} assume !(0 != ~p8~0); {271229#(= main_~lk9~0 1)} is VALID [2022-04-27 15:11:01,752 INFO L290 TraceCheckUtils]: 30: Hoare triple {271229#(= main_~lk9~0 1)} assume 0 != ~p9~0; {271229#(= main_~lk9~0 1)} is VALID [2022-04-27 15:11:01,753 INFO L290 TraceCheckUtils]: 31: Hoare triple {271229#(= main_~lk9~0 1)} assume 1 != ~lk9~0; {271225#false} is VALID [2022-04-27 15:11:01,761 INFO L290 TraceCheckUtils]: 32: Hoare triple {271225#false} assume !false; {271225#false} is VALID [2022-04-27 15:11:01,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:11:01,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:11:01,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986194442] [2022-04-27 15:11:01,762 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986194442] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:11:01,762 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:11:01,762 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:11:01,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142506316] [2022-04-27 15:11:01,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:11:01,763 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 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 33 [2022-04-27 15:11:01,763 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:11:01,763 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:11:01,784 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:11:01,784 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:11:01,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:11:01,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:11:01,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:11:01,785 INFO L87 Difference]: Start difference. First operand 10505 states and 15623 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:11:10,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:11:10,391 INFO L93 Difference]: Finished difference Result 18445 states and 28041 transitions. [2022-04-27 15:11:10,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:11:10,391 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 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 33 [2022-04-27 15:11:10,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:11:10,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:11:10,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 147 transitions. [2022-04-27 15:11:10,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:11:10,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 147 transitions. [2022-04-27 15:11:10,393 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 147 transitions. [2022-04-27 15:11:10,504 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 147 edges. 147 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:11:19,573 INFO L225 Difference]: With dead ends: 18445 [2022-04-27 15:11:19,573 INFO L226 Difference]: Without dead ends: 18443 [2022-04-27 15:11:19,576 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-27 15:11:19,576 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 180 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 15:11:19,576 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 94 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 15:11:19,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18443 states. [2022-04-27 15:11:19,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18443 to 15369. [2022-04-27 15:11:19,756 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:11:19,770 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18443 states. Second operand has 15369 states, 15365 states have (on average 1.4414578587699316) internal successors, (22148), 15365 states have internal predecessors, (22148), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:11:19,783 INFO L74 IsIncluded]: Start isIncluded. First operand 18443 states. Second operand has 15369 states, 15365 states have (on average 1.4414578587699316) internal successors, (22148), 15365 states have internal predecessors, (22148), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:11:19,796 INFO L87 Difference]: Start difference. First operand 18443 states. Second operand has 15369 states, 15365 states have (on average 1.4414578587699316) internal successors, (22148), 15365 states have internal predecessors, (22148), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:11:28,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:11:28,846 INFO L93 Difference]: Finished difference Result 18443 states and 27784 transitions. [2022-04-27 15:11:28,846 INFO L276 IsEmpty]: Start isEmpty. Operand 18443 states and 27784 transitions. [2022-04-27 15:11:28,858 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:11:28,858 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:11:28,872 INFO L74 IsIncluded]: Start isIncluded. First operand has 15369 states, 15365 states have (on average 1.4414578587699316) internal successors, (22148), 15365 states have internal predecessors, (22148), 2 states have call successors, (2), 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 18443 states. [2022-04-27 15:11:28,885 INFO L87 Difference]: Start difference. First operand has 15369 states, 15365 states have (on average 1.4414578587699316) internal successors, (22148), 15365 states have internal predecessors, (22148), 2 states have call successors, (2), 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 18443 states. [2022-04-27 15:11:37,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:11:37,775 INFO L93 Difference]: Finished difference Result 18443 states and 27784 transitions. [2022-04-27 15:11:37,775 INFO L276 IsEmpty]: Start isEmpty. Operand 18443 states and 27784 transitions. [2022-04-27 15:11:37,794 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:11:37,794 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:11:37,794 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:11:37,794 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:11:37,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15369 states, 15365 states have (on average 1.4414578587699316) internal successors, (22148), 15365 states have internal predecessors, (22148), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:11:43,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15369 states to 15369 states and 22151 transitions. [2022-04-27 15:11:43,890 INFO L78 Accepts]: Start accepts. Automaton has 15369 states and 22151 transitions. Word has length 33 [2022-04-27 15:11:43,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:11:43,890 INFO L495 AbstractCegarLoop]: Abstraction has 15369 states and 22151 transitions. [2022-04-27 15:11:43,890 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:11:43,891 INFO L276 IsEmpty]: Start isEmpty. Operand 15369 states and 22151 transitions. [2022-04-27 15:11:43,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-27 15:11:43,898 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:11:43,898 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, 1, 1] [2022-04-27 15:11:43,898 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-04-27 15:11:43,898 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:11:43,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:11:43,898 INFO L85 PathProgramCache]: Analyzing trace with hash 871631855, now seen corresponding path program 1 times [2022-04-27 15:11:43,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:11:43,899 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845708761] [2022-04-27 15:11:43,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:11:43,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:11:43,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:11:43,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:11:43,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:11:43,931 INFO L290 TraceCheckUtils]: 0: Hoare triple {342724#(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(18, 2);call #Ultimate.allocInit(12, 3); {342718#true} is VALID [2022-04-27 15:11:43,931 INFO L290 TraceCheckUtils]: 1: Hoare triple {342718#true} assume true; {342718#true} is VALID [2022-04-27 15:11:43,931 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {342718#true} {342718#true} #268#return; {342718#true} is VALID [2022-04-27 15:11:43,932 INFO L272 TraceCheckUtils]: 0: Hoare triple {342718#true} call ULTIMATE.init(); {342724#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:11:43,932 INFO L290 TraceCheckUtils]: 1: Hoare triple {342724#(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(18, 2);call #Ultimate.allocInit(12, 3); {342718#true} is VALID [2022-04-27 15:11:43,932 INFO L290 TraceCheckUtils]: 2: Hoare triple {342718#true} assume true; {342718#true} is VALID [2022-04-27 15:11:43,932 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {342718#true} {342718#true} #268#return; {342718#true} is VALID [2022-04-27 15:11:43,932 INFO L272 TraceCheckUtils]: 4: Hoare triple {342718#true} call #t~ret19 := main(); {342718#true} is VALID [2022-04-27 15:11:43,932 INFO L290 TraceCheckUtils]: 5: Hoare triple {342718#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;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;havoc ~cond~0; {342718#true} is VALID [2022-04-27 15:11:43,932 INFO L290 TraceCheckUtils]: 6: Hoare triple {342718#true} assume !false;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~cond~0 := #t~nondet18;havoc #t~nondet18; {342718#true} is VALID [2022-04-27 15:11:43,932 INFO L290 TraceCheckUtils]: 7: Hoare triple {342718#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;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0; {342718#true} is VALID [2022-04-27 15:11:43,933 INFO L290 TraceCheckUtils]: 8: Hoare triple {342718#true} assume !(0 != ~p1~0); {342718#true} is VALID [2022-04-27 15:11:43,933 INFO L290 TraceCheckUtils]: 9: Hoare triple {342718#true} assume !(0 != ~p2~0); {342718#true} is VALID [2022-04-27 15:11:43,933 INFO L290 TraceCheckUtils]: 10: Hoare triple {342718#true} assume !(0 != ~p3~0); {342718#true} is VALID [2022-04-27 15:11:43,933 INFO L290 TraceCheckUtils]: 11: Hoare triple {342718#true} assume !(0 != ~p4~0); {342718#true} is VALID [2022-04-27 15:11:43,933 INFO L290 TraceCheckUtils]: 12: Hoare triple {342718#true} assume !(0 != ~p5~0); {342718#true} is VALID [2022-04-27 15:11:43,933 INFO L290 TraceCheckUtils]: 13: Hoare triple {342718#true} assume !(0 != ~p6~0); {342718#true} is VALID [2022-04-27 15:11:43,933 INFO L290 TraceCheckUtils]: 14: Hoare triple {342718#true} assume !(0 != ~p7~0); {342718#true} is VALID [2022-04-27 15:11:43,933 INFO L290 TraceCheckUtils]: 15: Hoare triple {342718#true} assume !(0 != ~p8~0); {342718#true} is VALID [2022-04-27 15:11:43,933 INFO L290 TraceCheckUtils]: 16: Hoare triple {342718#true} assume !(0 != ~p9~0); {342723#(= main_~p9~0 0)} is VALID [2022-04-27 15:11:43,934 INFO L290 TraceCheckUtils]: 17: Hoare triple {342723#(= main_~p9~0 0)} assume !(0 != ~p10~0); {342723#(= main_~p9~0 0)} is VALID [2022-04-27 15:11:43,934 INFO L290 TraceCheckUtils]: 18: Hoare triple {342723#(= main_~p9~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {342723#(= main_~p9~0 0)} is VALID [2022-04-27 15:11:43,934 INFO L290 TraceCheckUtils]: 19: Hoare triple {342723#(= main_~p9~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {342723#(= main_~p9~0 0)} is VALID [2022-04-27 15:11:43,934 INFO L290 TraceCheckUtils]: 20: Hoare triple {342723#(= main_~p9~0 0)} assume 0 != ~p13~0;~lk13~0 := 1; {342723#(= main_~p9~0 0)} is VALID [2022-04-27 15:11:43,935 INFO L290 TraceCheckUtils]: 21: Hoare triple {342723#(= main_~p9~0 0)} assume 0 != ~p14~0;~lk14~0 := 1; {342723#(= main_~p9~0 0)} is VALID [2022-04-27 15:11:43,935 INFO L290 TraceCheckUtils]: 22: Hoare triple {342723#(= main_~p9~0 0)} assume !(0 != ~p1~0); {342723#(= main_~p9~0 0)} is VALID [2022-04-27 15:11:43,935 INFO L290 TraceCheckUtils]: 23: Hoare triple {342723#(= main_~p9~0 0)} assume !(0 != ~p2~0); {342723#(= main_~p9~0 0)} is VALID [2022-04-27 15:11:43,936 INFO L290 TraceCheckUtils]: 24: Hoare triple {342723#(= main_~p9~0 0)} assume !(0 != ~p3~0); {342723#(= main_~p9~0 0)} is VALID [2022-04-27 15:11:43,936 INFO L290 TraceCheckUtils]: 25: Hoare triple {342723#(= main_~p9~0 0)} assume !(0 != ~p4~0); {342723#(= main_~p9~0 0)} is VALID [2022-04-27 15:11:43,936 INFO L290 TraceCheckUtils]: 26: Hoare triple {342723#(= main_~p9~0 0)} assume !(0 != ~p5~0); {342723#(= main_~p9~0 0)} is VALID [2022-04-27 15:11:43,937 INFO L290 TraceCheckUtils]: 27: Hoare triple {342723#(= main_~p9~0 0)} assume !(0 != ~p6~0); {342723#(= main_~p9~0 0)} is VALID [2022-04-27 15:11:43,937 INFO L290 TraceCheckUtils]: 28: Hoare triple {342723#(= main_~p9~0 0)} assume !(0 != ~p7~0); {342723#(= main_~p9~0 0)} is VALID [2022-04-27 15:11:43,937 INFO L290 TraceCheckUtils]: 29: Hoare triple {342723#(= main_~p9~0 0)} assume !(0 != ~p8~0); {342723#(= main_~p9~0 0)} is VALID [2022-04-27 15:11:43,937 INFO L290 TraceCheckUtils]: 30: Hoare triple {342723#(= main_~p9~0 0)} assume 0 != ~p9~0; {342719#false} is VALID [2022-04-27 15:11:43,937 INFO L290 TraceCheckUtils]: 31: Hoare triple {342719#false} assume 1 != ~lk9~0; {342719#false} is VALID [2022-04-27 15:11:43,938 INFO L290 TraceCheckUtils]: 32: Hoare triple {342719#false} assume !false; {342719#false} is VALID [2022-04-27 15:11:43,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:11:43,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:11:43,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845708761] [2022-04-27 15:11:43,938 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845708761] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:11:43,938 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:11:43,938 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:11:43,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831021077] [2022-04-27 15:11:43,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:11:43,939 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 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 33 [2022-04-27 15:11:43,939 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:11:43,939 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:11:43,959 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:11:43,959 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:11:43,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:11:43,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:11:43,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:11:43,959 INFO L87 Difference]: Start difference. First operand 15369 states and 22151 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:12:19,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:12:19,713 INFO L93 Difference]: Finished difference Result 35597 states and 51593 transitions. [2022-04-27 15:12:19,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:12:19,713 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 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 33 [2022-04-27 15:12:19,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:12:19,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:12:19,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 240 transitions. [2022-04-27 15:12:19,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:12:19,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 240 transitions. [2022-04-27 15:12:19,715 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 240 transitions. [2022-04-27 15:12:19,868 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 240 edges. 240 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:12:30,633 INFO L225 Difference]: With dead ends: 35597 [2022-04-27 15:12:30,633 INFO L226 Difference]: Without dead ends: 20491 [2022-04-27 15:12:30,642 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-27 15:12:30,643 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 160 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 15:12:30,643 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 143 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 15:12:30,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20491 states. [2022-04-27 15:12:30,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20491 to 20489. [2022-04-27 15:12:30,878 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:12:30,901 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20491 states. Second operand has 20489 states, 20485 states have (on average 1.437344398340249) internal successors, (29444), 20485 states have internal predecessors, (29444), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:12:30,923 INFO L74 IsIncluded]: Start isIncluded. First operand 20491 states. Second operand has 20489 states, 20485 states have (on average 1.437344398340249) internal successors, (29444), 20485 states have internal predecessors, (29444), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:12:30,946 INFO L87 Difference]: Start difference. First operand 20491 states. Second operand has 20489 states, 20485 states have (on average 1.437344398340249) internal successors, (29444), 20485 states have internal predecessors, (29444), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:12:41,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:12:41,969 INFO L93 Difference]: Finished difference Result 20491 states and 29448 transitions. [2022-04-27 15:12:41,969 INFO L276 IsEmpty]: Start isEmpty. Operand 20491 states and 29448 transitions. [2022-04-27 15:12:41,983 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:12:41,983 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:12:42,006 INFO L74 IsIncluded]: Start isIncluded. First operand has 20489 states, 20485 states have (on average 1.437344398340249) internal successors, (29444), 20485 states have internal predecessors, (29444), 2 states have call successors, (2), 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 20491 states. [2022-04-27 15:12:42,028 INFO L87 Difference]: Start difference. First operand has 20489 states, 20485 states have (on average 1.437344398340249) internal successors, (29444), 20485 states have internal predecessors, (29444), 2 states have call successors, (2), 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 20491 states. [2022-04-27 15:12:53,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:12:53,077 INFO L93 Difference]: Finished difference Result 20491 states and 29448 transitions. [2022-04-27 15:12:53,077 INFO L276 IsEmpty]: Start isEmpty. Operand 20491 states and 29448 transitions. [2022-04-27 15:12:53,091 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:12:53,092 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:12:53,092 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:12:53,092 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:12:53,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20489 states, 20485 states have (on average 1.437344398340249) internal successors, (29444), 20485 states have internal predecessors, (29444), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:13:03,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20489 states to 20489 states and 29447 transitions. [2022-04-27 15:13:03,364 INFO L78 Accepts]: Start accepts. Automaton has 20489 states and 29447 transitions. Word has length 33 [2022-04-27 15:13:03,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:13:03,364 INFO L495 AbstractCegarLoop]: Abstraction has 20489 states and 29447 transitions. [2022-04-27 15:13:03,364 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:13:03,364 INFO L276 IsEmpty]: Start isEmpty. Operand 20489 states and 29447 transitions. [2022-04-27 15:13:03,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-27 15:13:03,371 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:13:03,371 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:13:03,372 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-04-27 15:13:03,372 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:13:03,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:13:03,372 INFO L85 PathProgramCache]: Analyzing trace with hash -1049824046, now seen corresponding path program 1 times [2022-04-27 15:13:03,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:13:03,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575813857] [2022-04-27 15:13:03,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:13:03,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:13:03,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:13:03,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:13:03,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:13:03,418 INFO L290 TraceCheckUtils]: 0: Hoare triple {441098#(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(18, 2);call #Ultimate.allocInit(12, 3); {441092#true} is VALID [2022-04-27 15:13:03,418 INFO L290 TraceCheckUtils]: 1: Hoare triple {441092#true} assume true; {441092#true} is VALID [2022-04-27 15:13:03,418 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {441092#true} {441092#true} #268#return; {441092#true} is VALID [2022-04-27 15:13:03,418 INFO L272 TraceCheckUtils]: 0: Hoare triple {441092#true} call ULTIMATE.init(); {441098#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:13:03,418 INFO L290 TraceCheckUtils]: 1: Hoare triple {441098#(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(18, 2);call #Ultimate.allocInit(12, 3); {441092#true} is VALID [2022-04-27 15:13:03,418 INFO L290 TraceCheckUtils]: 2: Hoare triple {441092#true} assume true; {441092#true} is VALID [2022-04-27 15:13:03,419 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {441092#true} {441092#true} #268#return; {441092#true} is VALID [2022-04-27 15:13:03,419 INFO L272 TraceCheckUtils]: 4: Hoare triple {441092#true} call #t~ret19 := main(); {441092#true} is VALID [2022-04-27 15:13:03,426 INFO L290 TraceCheckUtils]: 5: Hoare triple {441092#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;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;havoc ~cond~0; {441092#true} is VALID [2022-04-27 15:13:03,426 INFO L290 TraceCheckUtils]: 6: Hoare triple {441092#true} assume !false;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~cond~0 := #t~nondet18;havoc #t~nondet18; {441092#true} is VALID [2022-04-27 15:13:03,426 INFO L290 TraceCheckUtils]: 7: Hoare triple {441092#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;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0; {441092#true} is VALID [2022-04-27 15:13:03,426 INFO L290 TraceCheckUtils]: 8: Hoare triple {441092#true} assume !(0 != ~p1~0); {441092#true} is VALID [2022-04-27 15:13:03,426 INFO L290 TraceCheckUtils]: 9: Hoare triple {441092#true} assume !(0 != ~p2~0); {441092#true} is VALID [2022-04-27 15:13:03,426 INFO L290 TraceCheckUtils]: 10: Hoare triple {441092#true} assume !(0 != ~p3~0); {441092#true} is VALID [2022-04-27 15:13:03,426 INFO L290 TraceCheckUtils]: 11: Hoare triple {441092#true} assume !(0 != ~p4~0); {441092#true} is VALID [2022-04-27 15:13:03,426 INFO L290 TraceCheckUtils]: 12: Hoare triple {441092#true} assume !(0 != ~p5~0); {441092#true} is VALID [2022-04-27 15:13:03,427 INFO L290 TraceCheckUtils]: 13: Hoare triple {441092#true} assume !(0 != ~p6~0); {441092#true} is VALID [2022-04-27 15:13:03,427 INFO L290 TraceCheckUtils]: 14: Hoare triple {441092#true} assume !(0 != ~p7~0); {441092#true} is VALID [2022-04-27 15:13:03,427 INFO L290 TraceCheckUtils]: 15: Hoare triple {441092#true} assume !(0 != ~p8~0); {441092#true} is VALID [2022-04-27 15:13:03,427 INFO L290 TraceCheckUtils]: 16: Hoare triple {441092#true} assume 0 != ~p9~0;~lk9~0 := 1; {441097#(not (= main_~p9~0 0))} is VALID [2022-04-27 15:13:03,427 INFO L290 TraceCheckUtils]: 17: Hoare triple {441097#(not (= main_~p9~0 0))} assume !(0 != ~p10~0); {441097#(not (= main_~p9~0 0))} is VALID [2022-04-27 15:13:03,428 INFO L290 TraceCheckUtils]: 18: Hoare triple {441097#(not (= main_~p9~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {441097#(not (= main_~p9~0 0))} is VALID [2022-04-27 15:13:03,428 INFO L290 TraceCheckUtils]: 19: Hoare triple {441097#(not (= main_~p9~0 0))} assume 0 != ~p12~0;~lk12~0 := 1; {441097#(not (= main_~p9~0 0))} is VALID [2022-04-27 15:13:03,428 INFO L290 TraceCheckUtils]: 20: Hoare triple {441097#(not (= main_~p9~0 0))} assume 0 != ~p13~0;~lk13~0 := 1; {441097#(not (= main_~p9~0 0))} is VALID [2022-04-27 15:13:03,429 INFO L290 TraceCheckUtils]: 21: Hoare triple {441097#(not (= main_~p9~0 0))} assume 0 != ~p14~0;~lk14~0 := 1; {441097#(not (= main_~p9~0 0))} is VALID [2022-04-27 15:13:03,429 INFO L290 TraceCheckUtils]: 22: Hoare triple {441097#(not (= main_~p9~0 0))} assume !(0 != ~p1~0); {441097#(not (= main_~p9~0 0))} is VALID [2022-04-27 15:13:03,429 INFO L290 TraceCheckUtils]: 23: Hoare triple {441097#(not (= main_~p9~0 0))} assume !(0 != ~p2~0); {441097#(not (= main_~p9~0 0))} is VALID [2022-04-27 15:13:03,430 INFO L290 TraceCheckUtils]: 24: Hoare triple {441097#(not (= main_~p9~0 0))} assume !(0 != ~p3~0); {441097#(not (= main_~p9~0 0))} is VALID [2022-04-27 15:13:03,430 INFO L290 TraceCheckUtils]: 25: Hoare triple {441097#(not (= main_~p9~0 0))} assume !(0 != ~p4~0); {441097#(not (= main_~p9~0 0))} is VALID [2022-04-27 15:13:03,430 INFO L290 TraceCheckUtils]: 26: Hoare triple {441097#(not (= main_~p9~0 0))} assume !(0 != ~p5~0); {441097#(not (= main_~p9~0 0))} is VALID [2022-04-27 15:13:03,430 INFO L290 TraceCheckUtils]: 27: Hoare triple {441097#(not (= main_~p9~0 0))} assume !(0 != ~p6~0); {441097#(not (= main_~p9~0 0))} is VALID [2022-04-27 15:13:03,431 INFO L290 TraceCheckUtils]: 28: Hoare triple {441097#(not (= main_~p9~0 0))} assume !(0 != ~p7~0); {441097#(not (= main_~p9~0 0))} is VALID [2022-04-27 15:13:03,431 INFO L290 TraceCheckUtils]: 29: Hoare triple {441097#(not (= main_~p9~0 0))} assume !(0 != ~p8~0); {441097#(not (= main_~p9~0 0))} is VALID [2022-04-27 15:13:03,431 INFO L290 TraceCheckUtils]: 30: Hoare triple {441097#(not (= main_~p9~0 0))} assume !(0 != ~p9~0); {441093#false} is VALID [2022-04-27 15:13:03,431 INFO L290 TraceCheckUtils]: 31: Hoare triple {441093#false} assume 0 != ~p10~0; {441093#false} is VALID [2022-04-27 15:13:03,431 INFO L290 TraceCheckUtils]: 32: Hoare triple {441093#false} assume 1 != ~lk10~0; {441093#false} is VALID [2022-04-27 15:13:03,432 INFO L290 TraceCheckUtils]: 33: Hoare triple {441093#false} assume !false; {441093#false} is VALID [2022-04-27 15:13:03,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:13:03,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:13:03,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575813857] [2022-04-27 15:13:03,432 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575813857] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:13:03,432 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:13:03,432 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:13:03,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729202326] [2022-04-27 15:13:03,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:13:03,433 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 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 34 [2022-04-27 15:13:03,433 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:13:03,433 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:13:03,456 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:13:03,457 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:13:03,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:13:03,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:13:03,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:13:03,458 INFO L87 Difference]: Start difference. First operand 20489 states and 29447 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:13:29,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:13:29,049 INFO L93 Difference]: Finished difference Result 30733 states and 44041 transitions. [2022-04-27 15:13:29,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:13:29,049 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 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 34 [2022-04-27 15:13:29,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:13:29,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:13:29,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 235 transitions. [2022-04-27 15:13:29,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:13:29,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 235 transitions. [2022-04-27 15:13:29,051 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 235 transitions. [2022-04-27 15:13:29,193 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 235 edges. 235 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:13:40,900 INFO L225 Difference]: With dead ends: 30733 [2022-04-27 15:13:40,900 INFO L226 Difference]: Without dead ends: 20747 [2022-04-27 15:13:40,908 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-27 15:13:40,908 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 175 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 129 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-27 15:13:40,909 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 129 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 15:13:40,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20747 states. [2022-04-27 15:13:41,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20747 to 20745. [2022-04-27 15:13:41,185 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:13:41,211 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20747 states. Second operand has 20745 states, 20741 states have (on average 1.4196036835253845) internal successors, (29444), 20741 states have internal predecessors, (29444), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:13:41,234 INFO L74 IsIncluded]: Start isIncluded. First operand 20747 states. Second operand has 20745 states, 20741 states have (on average 1.4196036835253845) internal successors, (29444), 20741 states have internal predecessors, (29444), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:13:41,258 INFO L87 Difference]: Start difference. First operand 20747 states. Second operand has 20745 states, 20741 states have (on average 1.4196036835253845) internal successors, (29444), 20741 states have internal predecessors, (29444), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:13:51,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:13:51,525 INFO L93 Difference]: Finished difference Result 20747 states and 29448 transitions. [2022-04-27 15:13:51,525 INFO L276 IsEmpty]: Start isEmpty. Operand 20747 states and 29448 transitions. [2022-04-27 15:13:51,537 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:13:51,537 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:13:51,560 INFO L74 IsIncluded]: Start isIncluded. First operand has 20745 states, 20741 states have (on average 1.4196036835253845) internal successors, (29444), 20741 states have internal predecessors, (29444), 2 states have call successors, (2), 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 20747 states. [2022-04-27 15:13:51,582 INFO L87 Difference]: Start difference. First operand has 20745 states, 20741 states have (on average 1.4196036835253845) internal successors, (29444), 20741 states have internal predecessors, (29444), 2 states have call successors, (2), 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 20747 states. [2022-04-27 15:14:01,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:14:01,797 INFO L93 Difference]: Finished difference Result 20747 states and 29448 transitions. [2022-04-27 15:14:01,798 INFO L276 IsEmpty]: Start isEmpty. Operand 20747 states and 29448 transitions. [2022-04-27 15:14:01,809 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:14:01,809 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:14:01,809 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:14:01,809 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:14:01,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20745 states, 20741 states have (on average 1.4196036835253845) internal successors, (29444), 20741 states have internal predecessors, (29444), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:14:12,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20745 states to 20745 states and 29447 transitions. [2022-04-27 15:14:12,201 INFO L78 Accepts]: Start accepts. Automaton has 20745 states and 29447 transitions. Word has length 34 [2022-04-27 15:14:12,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:14:12,201 INFO L495 AbstractCegarLoop]: Abstraction has 20745 states and 29447 transitions. [2022-04-27 15:14:12,201 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:14:12,201 INFO L276 IsEmpty]: Start isEmpty. Operand 20745 states and 29447 transitions. [2022-04-27 15:14:12,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-27 15:14:12,207 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:14:12,207 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, 1, 1, 1] [2022-04-27 15:14:12,207 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-04-27 15:14:12,207 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:14:12,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:14:12,208 INFO L85 PathProgramCache]: Analyzing trace with hash 1250998544, now seen corresponding path program 1 times [2022-04-27 15:14:12,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:14:12,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202526963] [2022-04-27 15:14:12,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:14:12,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:14:12,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:14:12,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:14:12,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:14:12,245 INFO L290 TraceCheckUtils]: 0: Hoare triple {535376#(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(18, 2);call #Ultimate.allocInit(12, 3); {535370#true} is VALID [2022-04-27 15:14:12,245 INFO L290 TraceCheckUtils]: 1: Hoare triple {535370#true} assume true; {535370#true} is VALID [2022-04-27 15:14:12,245 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {535370#true} {535370#true} #268#return; {535370#true} is VALID [2022-04-27 15:14:12,245 INFO L272 TraceCheckUtils]: 0: Hoare triple {535370#true} call ULTIMATE.init(); {535376#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:14:12,245 INFO L290 TraceCheckUtils]: 1: Hoare triple {535376#(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(18, 2);call #Ultimate.allocInit(12, 3); {535370#true} is VALID [2022-04-27 15:14:12,246 INFO L290 TraceCheckUtils]: 2: Hoare triple {535370#true} assume true; {535370#true} is VALID [2022-04-27 15:14:12,246 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {535370#true} {535370#true} #268#return; {535370#true} is VALID [2022-04-27 15:14:12,246 INFO L272 TraceCheckUtils]: 4: Hoare triple {535370#true} call #t~ret19 := main(); {535370#true} is VALID [2022-04-27 15:14:12,246 INFO L290 TraceCheckUtils]: 5: Hoare triple {535370#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;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;havoc ~cond~0; {535370#true} is VALID [2022-04-27 15:14:12,246 INFO L290 TraceCheckUtils]: 6: Hoare triple {535370#true} assume !false;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~cond~0 := #t~nondet18;havoc #t~nondet18; {535370#true} is VALID [2022-04-27 15:14:12,246 INFO L290 TraceCheckUtils]: 7: Hoare triple {535370#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;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0; {535370#true} is VALID [2022-04-27 15:14:12,246 INFO L290 TraceCheckUtils]: 8: Hoare triple {535370#true} assume !(0 != ~p1~0); {535370#true} is VALID [2022-04-27 15:14:12,246 INFO L290 TraceCheckUtils]: 9: Hoare triple {535370#true} assume !(0 != ~p2~0); {535370#true} is VALID [2022-04-27 15:14:12,246 INFO L290 TraceCheckUtils]: 10: Hoare triple {535370#true} assume !(0 != ~p3~0); {535370#true} is VALID [2022-04-27 15:14:12,246 INFO L290 TraceCheckUtils]: 11: Hoare triple {535370#true} assume !(0 != ~p4~0); {535370#true} is VALID [2022-04-27 15:14:12,246 INFO L290 TraceCheckUtils]: 12: Hoare triple {535370#true} assume !(0 != ~p5~0); {535370#true} is VALID [2022-04-27 15:14:12,246 INFO L290 TraceCheckUtils]: 13: Hoare triple {535370#true} assume !(0 != ~p6~0); {535370#true} is VALID [2022-04-27 15:14:12,246 INFO L290 TraceCheckUtils]: 14: Hoare triple {535370#true} assume !(0 != ~p7~0); {535370#true} is VALID [2022-04-27 15:14:12,247 INFO L290 TraceCheckUtils]: 15: Hoare triple {535370#true} assume !(0 != ~p8~0); {535370#true} is VALID [2022-04-27 15:14:12,247 INFO L290 TraceCheckUtils]: 16: Hoare triple {535370#true} assume !(0 != ~p9~0); {535370#true} is VALID [2022-04-27 15:14:12,247 INFO L290 TraceCheckUtils]: 17: Hoare triple {535370#true} assume !(0 != ~p10~0); {535375#(= main_~p10~0 0)} is VALID [2022-04-27 15:14:12,247 INFO L290 TraceCheckUtils]: 18: Hoare triple {535375#(= main_~p10~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {535375#(= main_~p10~0 0)} is VALID [2022-04-27 15:14:12,248 INFO L290 TraceCheckUtils]: 19: Hoare triple {535375#(= main_~p10~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {535375#(= main_~p10~0 0)} is VALID [2022-04-27 15:14:12,248 INFO L290 TraceCheckUtils]: 20: Hoare triple {535375#(= main_~p10~0 0)} assume 0 != ~p13~0;~lk13~0 := 1; {535375#(= main_~p10~0 0)} is VALID [2022-04-27 15:14:12,248 INFO L290 TraceCheckUtils]: 21: Hoare triple {535375#(= main_~p10~0 0)} assume 0 != ~p14~0;~lk14~0 := 1; {535375#(= main_~p10~0 0)} is VALID [2022-04-27 15:14:12,249 INFO L290 TraceCheckUtils]: 22: Hoare triple {535375#(= main_~p10~0 0)} assume !(0 != ~p1~0); {535375#(= main_~p10~0 0)} is VALID [2022-04-27 15:14:12,249 INFO L290 TraceCheckUtils]: 23: Hoare triple {535375#(= main_~p10~0 0)} assume !(0 != ~p2~0); {535375#(= main_~p10~0 0)} is VALID [2022-04-27 15:14:12,249 INFO L290 TraceCheckUtils]: 24: Hoare triple {535375#(= main_~p10~0 0)} assume !(0 != ~p3~0); {535375#(= main_~p10~0 0)} is VALID [2022-04-27 15:14:12,250 INFO L290 TraceCheckUtils]: 25: Hoare triple {535375#(= main_~p10~0 0)} assume !(0 != ~p4~0); {535375#(= main_~p10~0 0)} is VALID [2022-04-27 15:14:12,250 INFO L290 TraceCheckUtils]: 26: Hoare triple {535375#(= main_~p10~0 0)} assume !(0 != ~p5~0); {535375#(= main_~p10~0 0)} is VALID [2022-04-27 15:14:12,250 INFO L290 TraceCheckUtils]: 27: Hoare triple {535375#(= main_~p10~0 0)} assume !(0 != ~p6~0); {535375#(= main_~p10~0 0)} is VALID [2022-04-27 15:14:12,251 INFO L290 TraceCheckUtils]: 28: Hoare triple {535375#(= main_~p10~0 0)} assume !(0 != ~p7~0); {535375#(= main_~p10~0 0)} is VALID [2022-04-27 15:14:12,251 INFO L290 TraceCheckUtils]: 29: Hoare triple {535375#(= main_~p10~0 0)} assume !(0 != ~p8~0); {535375#(= main_~p10~0 0)} is VALID [2022-04-27 15:14:12,251 INFO L290 TraceCheckUtils]: 30: Hoare triple {535375#(= main_~p10~0 0)} assume !(0 != ~p9~0); {535375#(= main_~p10~0 0)} is VALID [2022-04-27 15:14:12,251 INFO L290 TraceCheckUtils]: 31: Hoare triple {535375#(= main_~p10~0 0)} assume 0 != ~p10~0; {535371#false} is VALID [2022-04-27 15:14:12,252 INFO L290 TraceCheckUtils]: 32: Hoare triple {535371#false} assume 1 != ~lk10~0; {535371#false} is VALID [2022-04-27 15:14:12,252 INFO L290 TraceCheckUtils]: 33: Hoare triple {535371#false} assume !false; {535371#false} is VALID [2022-04-27 15:14:12,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:14:12,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:14:12,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202526963] [2022-04-27 15:14:12,252 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202526963] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:14:12,252 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:14:12,252 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:14:12,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764809979] [2022-04-27 15:14:12,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:14:12,253 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 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 34 [2022-04-27 15:14:12,254 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:14:12,254 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:14:12,281 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:14:12,281 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:14:12,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:14:12,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:14:12,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:14:12,282 INFO L87 Difference]: Start difference. First operand 20745 states and 29447 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:16:56,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:16:56,703 INFO L93 Difference]: Finished difference Result 60685 states and 85257 transitions. [2022-04-27 15:16:56,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:16:56,703 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 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 34 [2022-04-27 15:16:56,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:16:56,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:16:56,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 238 transitions. [2022-04-27 15:16:56,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:16:56,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 238 transitions. [2022-04-27 15:16:56,705 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 238 transitions. [2022-04-27 15:16:56,852 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 238 edges. 238 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:17:42,082 INFO L225 Difference]: With dead ends: 60685 [2022-04-27 15:17:42,083 INFO L226 Difference]: Without dead ends: 40459 [2022-04-27 15:17:42,097 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-27 15:17:42,097 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 191 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 15:17:42,098 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 111 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 15:17:42,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40459 states. [2022-04-27 15:17:42,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40459 to 40457. [2022-04-27 15:17:42,739 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:17:42,797 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40459 states. Second operand has 40457 states, 40453 states have (on average 1.3796751786023287) internal successors, (55812), 40453 states have internal predecessors, (55812), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:17:42,911 INFO L74 IsIncluded]: Start isIncluded. First operand 40459 states. Second operand has 40457 states, 40453 states have (on average 1.3796751786023287) internal successors, (55812), 40453 states have internal predecessors, (55812), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:17:42,953 INFO L87 Difference]: Start difference. First operand 40459 states. Second operand has 40457 states, 40453 states have (on average 1.3796751786023287) internal successors, (55812), 40453 states have internal predecessors, (55812), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:18:38,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:18:38,865 INFO L93 Difference]: Finished difference Result 40459 states and 55816 transitions. [2022-04-27 15:18:38,865 INFO L276 IsEmpty]: Start isEmpty. Operand 40459 states and 55816 transitions. [2022-04-27 15:18:38,891 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:18:38,891 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:18:38,927 INFO L74 IsIncluded]: Start isIncluded. First operand has 40457 states, 40453 states have (on average 1.3796751786023287) internal successors, (55812), 40453 states have internal predecessors, (55812), 2 states have call successors, (2), 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 40459 states. [2022-04-27 15:18:38,963 INFO L87 Difference]: Start difference. First operand has 40457 states, 40453 states have (on average 1.3796751786023287) internal successors, (55812), 40453 states have internal predecessors, (55812), 2 states have call successors, (2), 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 40459 states. [2022-04-27 15:19:42,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:19:42,322 INFO L93 Difference]: Finished difference Result 40459 states and 55816 transitions. [2022-04-27 15:19:42,322 INFO L276 IsEmpty]: Start isEmpty. Operand 40459 states and 55816 transitions. [2022-04-27 15:19:42,386 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:19:42,386 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:19:42,386 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:19:42,386 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:19:42,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40457 states, 40453 states have (on average 1.3796751786023287) internal successors, (55812), 40453 states have internal predecessors, (55812), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:21:07,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40457 states to 40457 states and 55815 transitions. [2022-04-27 15:21:07,046 INFO L78 Accepts]: Start accepts. Automaton has 40457 states and 55815 transitions. Word has length 34 [2022-04-27 15:21:07,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:21:07,046 INFO L495 AbstractCegarLoop]: Abstraction has 40457 states and 55815 transitions. [2022-04-27 15:21:07,046 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:21:07,046 INFO L276 IsEmpty]: Start isEmpty. Operand 40457 states and 55815 transitions. [2022-04-27 15:21:07,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-27 15:21:07,062 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:21:07,062 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, 1, 1, 1] [2022-04-27 15:21:07,062 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-04-27 15:21:07,062 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:21:07,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:21:07,062 INFO L85 PathProgramCache]: Analyzing trace with hash -1455620850, now seen corresponding path program 1 times [2022-04-27 15:21:07,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:21:07,062 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282112907] [2022-04-27 15:21:07,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:21:07,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:21:07,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:21:07,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:21:07,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:21:07,102 INFO L290 TraceCheckUtils]: 0: Hoare triple {720022#(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(18, 2);call #Ultimate.allocInit(12, 3); {720016#true} is VALID [2022-04-27 15:21:07,103 INFO L290 TraceCheckUtils]: 1: Hoare triple {720016#true} assume true; {720016#true} is VALID [2022-04-27 15:21:07,103 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {720016#true} {720016#true} #268#return; {720016#true} is VALID [2022-04-27 15:21:07,103 INFO L272 TraceCheckUtils]: 0: Hoare triple {720016#true} call ULTIMATE.init(); {720022#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:21:07,103 INFO L290 TraceCheckUtils]: 1: Hoare triple {720022#(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(18, 2);call #Ultimate.allocInit(12, 3); {720016#true} is VALID [2022-04-27 15:21:07,103 INFO L290 TraceCheckUtils]: 2: Hoare triple {720016#true} assume true; {720016#true} is VALID [2022-04-27 15:21:07,103 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {720016#true} {720016#true} #268#return; {720016#true} is VALID [2022-04-27 15:21:07,104 INFO L272 TraceCheckUtils]: 4: Hoare triple {720016#true} call #t~ret19 := main(); {720016#true} is VALID [2022-04-27 15:21:07,104 INFO L290 TraceCheckUtils]: 5: Hoare triple {720016#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;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;havoc ~cond~0; {720016#true} is VALID [2022-04-27 15:21:07,104 INFO L290 TraceCheckUtils]: 6: Hoare triple {720016#true} assume !false;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~cond~0 := #t~nondet18;havoc #t~nondet18; {720016#true} is VALID [2022-04-27 15:21:07,104 INFO L290 TraceCheckUtils]: 7: Hoare triple {720016#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;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0; {720016#true} is VALID [2022-04-27 15:21:07,104 INFO L290 TraceCheckUtils]: 8: Hoare triple {720016#true} assume !(0 != ~p1~0); {720016#true} is VALID [2022-04-27 15:21:07,104 INFO L290 TraceCheckUtils]: 9: Hoare triple {720016#true} assume !(0 != ~p2~0); {720016#true} is VALID [2022-04-27 15:21:07,104 INFO L290 TraceCheckUtils]: 10: Hoare triple {720016#true} assume !(0 != ~p3~0); {720016#true} is VALID [2022-04-27 15:21:07,104 INFO L290 TraceCheckUtils]: 11: Hoare triple {720016#true} assume !(0 != ~p4~0); {720016#true} is VALID [2022-04-27 15:21:07,104 INFO L290 TraceCheckUtils]: 12: Hoare triple {720016#true} assume !(0 != ~p5~0); {720016#true} is VALID [2022-04-27 15:21:07,104 INFO L290 TraceCheckUtils]: 13: Hoare triple {720016#true} assume !(0 != ~p6~0); {720016#true} is VALID [2022-04-27 15:21:07,104 INFO L290 TraceCheckUtils]: 14: Hoare triple {720016#true} assume !(0 != ~p7~0); {720016#true} is VALID [2022-04-27 15:21:07,104 INFO L290 TraceCheckUtils]: 15: Hoare triple {720016#true} assume !(0 != ~p8~0); {720016#true} is VALID [2022-04-27 15:21:07,104 INFO L290 TraceCheckUtils]: 16: Hoare triple {720016#true} assume !(0 != ~p9~0); {720016#true} is VALID [2022-04-27 15:21:07,105 INFO L290 TraceCheckUtils]: 17: Hoare triple {720016#true} assume 0 != ~p10~0;~lk10~0 := 1; {720021#(= main_~lk10~0 1)} is VALID [2022-04-27 15:21:07,105 INFO L290 TraceCheckUtils]: 18: Hoare triple {720021#(= main_~lk10~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {720021#(= main_~lk10~0 1)} is VALID [2022-04-27 15:21:07,105 INFO L290 TraceCheckUtils]: 19: Hoare triple {720021#(= main_~lk10~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {720021#(= main_~lk10~0 1)} is VALID [2022-04-27 15:21:07,106 INFO L290 TraceCheckUtils]: 20: Hoare triple {720021#(= main_~lk10~0 1)} assume 0 != ~p13~0;~lk13~0 := 1; {720021#(= main_~lk10~0 1)} is VALID [2022-04-27 15:21:07,106 INFO L290 TraceCheckUtils]: 21: Hoare triple {720021#(= main_~lk10~0 1)} assume 0 != ~p14~0;~lk14~0 := 1; {720021#(= main_~lk10~0 1)} is VALID [2022-04-27 15:21:07,106 INFO L290 TraceCheckUtils]: 22: Hoare triple {720021#(= main_~lk10~0 1)} assume !(0 != ~p1~0); {720021#(= main_~lk10~0 1)} is VALID [2022-04-27 15:21:07,106 INFO L290 TraceCheckUtils]: 23: Hoare triple {720021#(= main_~lk10~0 1)} assume !(0 != ~p2~0); {720021#(= main_~lk10~0 1)} is VALID [2022-04-27 15:21:07,107 INFO L290 TraceCheckUtils]: 24: Hoare triple {720021#(= main_~lk10~0 1)} assume !(0 != ~p3~0); {720021#(= main_~lk10~0 1)} is VALID [2022-04-27 15:21:07,107 INFO L290 TraceCheckUtils]: 25: Hoare triple {720021#(= main_~lk10~0 1)} assume !(0 != ~p4~0); {720021#(= main_~lk10~0 1)} is VALID [2022-04-27 15:21:07,107 INFO L290 TraceCheckUtils]: 26: Hoare triple {720021#(= main_~lk10~0 1)} assume !(0 != ~p5~0); {720021#(= main_~lk10~0 1)} is VALID [2022-04-27 15:21:07,108 INFO L290 TraceCheckUtils]: 27: Hoare triple {720021#(= main_~lk10~0 1)} assume !(0 != ~p6~0); {720021#(= main_~lk10~0 1)} is VALID [2022-04-27 15:21:07,108 INFO L290 TraceCheckUtils]: 28: Hoare triple {720021#(= main_~lk10~0 1)} assume !(0 != ~p7~0); {720021#(= main_~lk10~0 1)} is VALID [2022-04-27 15:21:07,108 INFO L290 TraceCheckUtils]: 29: Hoare triple {720021#(= main_~lk10~0 1)} assume !(0 != ~p8~0); {720021#(= main_~lk10~0 1)} is VALID [2022-04-27 15:21:07,108 INFO L290 TraceCheckUtils]: 30: Hoare triple {720021#(= main_~lk10~0 1)} assume !(0 != ~p9~0); {720021#(= main_~lk10~0 1)} is VALID [2022-04-27 15:21:07,109 INFO L290 TraceCheckUtils]: 31: Hoare triple {720021#(= main_~lk10~0 1)} assume 0 != ~p10~0; {720021#(= main_~lk10~0 1)} is VALID [2022-04-27 15:21:07,109 INFO L290 TraceCheckUtils]: 32: Hoare triple {720021#(= main_~lk10~0 1)} assume 1 != ~lk10~0; {720017#false} is VALID [2022-04-27 15:21:07,109 INFO L290 TraceCheckUtils]: 33: Hoare triple {720017#false} assume !false; {720017#false} is VALID [2022-04-27 15:21:07,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:21:07,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:21:07,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282112907] [2022-04-27 15:21:07,110 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282112907] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:21:07,110 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:21:07,110 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:21:07,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582986673] [2022-04-27 15:21:07,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:21:07,110 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 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 34 [2022-04-27 15:21:07,111 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:21:07,111 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:21:07,133 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:21:07,133 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:21:07,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:21:07,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:21:07,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:21:07,134 INFO L87 Difference]: Start difference. First operand 40457 states and 55815 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:23:02,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:23:02,474 INFO L93 Difference]: Finished difference Result 45581 states and 65033 transitions. [2022-04-27 15:23:02,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:23:02,474 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 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 34 [2022-04-27 15:23:02,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:23:02,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:23:02,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 140 transitions. [2022-04-27 15:23:02,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:23:02,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 140 transitions. [2022-04-27 15:23:02,478 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 140 transitions. [2022-04-27 15:23:02,605 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-27 15:24:03,169 INFO L225 Difference]: With dead ends: 45581 [2022-04-27 15:24:03,169 INFO L226 Difference]: Without dead ends: 45579 [2022-04-27 15:24:03,175 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-27 15:24:03,175 INFO L413 NwaCegarLoop]: 137 mSDtfsCounter, 118 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 144 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-27 15:24:03,175 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 144 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 15:24:03,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45579 states. [2022-04-27 15:24:03,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45579 to 40457. [2022-04-27 15:24:03,822 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:24:03,871 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45579 states. Second operand has 40457 states, 40453 states have (on average 1.3670185153140681) internal successors, (55300), 40453 states have internal predecessors, (55300), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:24:03,921 INFO L74 IsIncluded]: Start isIncluded. First operand 45579 states. Second operand has 40457 states, 40453 states have (on average 1.3670185153140681) internal successors, (55300), 40453 states have internal predecessors, (55300), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:24:03,965 INFO L87 Difference]: Start difference. First operand 45579 states. Second operand has 40457 states, 40453 states have (on average 1.3670185153140681) internal successors, (55300), 40453 states have internal predecessors, (55300), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)