/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_6.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 15:10:14,420 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 15:10:14,421 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 15:10:14,453 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 15:10:14,453 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 15:10:14,454 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 15:10:14,455 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 15:10:14,456 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 15:10:14,457 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 15:10:14,458 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 15:10:14,458 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 15:10:14,459 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 15:10:14,459 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 15:10:14,460 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 15:10:14,460 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 15:10:14,461 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 15:10:14,461 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 15:10:14,462 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 15:10:14,463 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 15:10:14,464 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 15:10:14,465 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 15:10:14,466 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 15:10:14,466 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 15:10:14,467 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 15:10:14,467 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 15:10:14,469 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 15:10:14,469 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 15:10:14,469 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 15:10:14,470 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 15:10:14,470 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 15:10:14,470 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 15:10:14,470 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 15:10:14,471 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 15:10:14,471 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 15:10:14,472 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 15:10:14,472 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 15:10:14,472 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 15:10:14,473 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 15:10:14,473 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 15:10:14,473 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 15:10:14,473 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 15:10:14,475 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 15:10:14,476 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:10:14,489 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 15:10:14,489 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 15:10:14,489 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 15:10:14,489 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 15:10:14,490 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 15:10:14,490 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 15:10:14,490 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 15:10:14,490 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 15:10:14,490 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 15:10:14,490 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 15:10:14,491 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 15:10:14,491 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 15:10:14,491 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 15:10:14,494 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 15:10:14,494 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 15:10:14,495 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 15:10:14,495 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 15:10:14,495 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 15:10:14,495 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 15:10:14,495 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 15:10:14,495 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 15:10:14,495 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 15:10:14,495 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 15:10:14,495 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 15:10:14,496 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 15:10:14,496 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 15:10:14,496 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 15:10:14,496 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 15:10:14,496 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 15:10:14,496 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 15:10:14,497 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 15:10:14,497 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 15:10:14,497 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 15:10:14,497 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:10:14,644 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 15:10:14,659 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 15:10:14,661 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 15:10:14,661 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 15:10:14,662 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 15:10:14,663 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_6.c [2022-04-27 15:10:14,699 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f4eb81034/42c2b10e19f841f49df301deb23a88bf/FLAG99fc1a8e8 [2022-04-27 15:10:15,006 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 15:10:15,006 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_6.c [2022-04-27 15:10:15,013 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f4eb81034/42c2b10e19f841f49df301deb23a88bf/FLAG99fc1a8e8 [2022-04-27 15:10:15,433 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f4eb81034/42c2b10e19f841f49df301deb23a88bf [2022-04-27 15:10:15,435 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 15:10:15,436 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 15:10:15,438 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 15:10:15,439 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 15:10:15,441 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 15:10:15,441 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 03:10:15" (1/1) ... [2022-04-27 15:10:15,443 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d68c23f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:10:15, skipping insertion in model container [2022-04-27 15:10:15,443 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 03:10:15" (1/1) ... [2022-04-27 15:10:15,447 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 15:10:15,459 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 15:10:15,575 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_6.c[2544,2557] [2022-04-27 15:10:15,577 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 15:10:15,582 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 15:10:15,594 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_6.c[2544,2557] [2022-04-27 15:10:15,595 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 15:10:15,603 INFO L208 MainTranslator]: Completed translation [2022-04-27 15:10:15,603 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:10:15 WrapperNode [2022-04-27 15:10:15,603 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 15:10:15,604 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 15:10:15,604 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 15:10:15,604 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 15:10:15,610 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:10:15" (1/1) ... [2022-04-27 15:10:15,610 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:10:15" (1/1) ... [2022-04-27 15:10:15,614 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:10:15" (1/1) ... [2022-04-27 15:10:15,614 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:10:15" (1/1) ... [2022-04-27 15:10:15,618 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:10:15" (1/1) ... [2022-04-27 15:10:15,621 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:10:15" (1/1) ... [2022-04-27 15:10:15,622 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:10:15" (1/1) ... [2022-04-27 15:10:15,629 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 15:10:15,630 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 15:10:15,630 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 15:10:15,630 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 15:10:15,630 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:10:15" (1/1) ... [2022-04-27 15:10:15,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 15:10:15,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 15:10:15,657 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:10:15,664 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:10:15,680 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 15:10:15,681 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 15:10:15,681 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 15:10:15,681 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 15:10:15,681 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 15:10:15,681 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 15:10:15,681 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 15:10:15,681 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 15:10:15,681 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 15:10:15,681 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 15:10:15,681 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 15:10:15,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 15:10:15,681 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 15:10:15,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 15:10:15,682 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 15:10:15,682 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 15:10:15,721 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 15:10:15,722 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 15:10:15,850 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 15:10:15,855 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 15:10:15,855 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 15:10:15,856 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 03:10:15 BoogieIcfgContainer [2022-04-27 15:10:15,856 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 15:10:15,857 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 15:10:15,857 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 15:10:15,859 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 15:10:15,859 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 03:10:15" (1/3) ... [2022-04-27 15:10:15,860 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37589cf3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 03:10:15, skipping insertion in model container [2022-04-27 15:10:15,860 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:10:15" (2/3) ... [2022-04-27 15:10:15,860 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37589cf3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 03:10:15, skipping insertion in model container [2022-04-27 15:10:15,860 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 03:10:15" (3/3) ... [2022-04-27 15:10:15,861 INFO L111 eAbstractionObserver]: Analyzing ICFG test_locks_6.c [2022-04-27 15:10:15,870 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 15:10:15,870 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 15:10:15,898 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 15:10:15,902 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@73070523, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@60cdef42 [2022-04-27 15:10:15,903 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 15:10:15,908 INFO L276 IsEmpty]: Start isEmpty. Operand has 33 states, 27 states have (on average 1.8148148148148149) internal successors, (49), 28 states have internal predecessors, (49), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 15:10:15,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-27 15:10:15,913 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:10:15,913 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:10:15,914 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:10:15,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:10:15,917 INFO L85 PathProgramCache]: Analyzing trace with hash 1747552289, now seen corresponding path program 1 times [2022-04-27 15:10:15,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:10:15,923 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819126524] [2022-04-27 15:10:15,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:10:15,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:10:16,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:16,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:10:16,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:16,065 INFO L290 TraceCheckUtils]: 0: Hoare triple {42#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {36#true} is VALID [2022-04-27 15:10:16,065 INFO L290 TraceCheckUtils]: 1: Hoare triple {36#true} assume true; {36#true} is VALID [2022-04-27 15:10:16,065 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {36#true} {36#true} #132#return; {36#true} is VALID [2022-04-27 15:10:16,066 INFO L272 TraceCheckUtils]: 0: Hoare triple {36#true} call ULTIMATE.init(); {42#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:10:16,067 INFO L290 TraceCheckUtils]: 1: Hoare triple {42#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {36#true} is VALID [2022-04-27 15:10:16,067 INFO L290 TraceCheckUtils]: 2: Hoare triple {36#true} assume true; {36#true} is VALID [2022-04-27 15:10:16,067 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36#true} {36#true} #132#return; {36#true} is VALID [2022-04-27 15:10:16,067 INFO L272 TraceCheckUtils]: 4: Hoare triple {36#true} call #t~ret11 := main(); {36#true} is VALID [2022-04-27 15:10:16,067 INFO L290 TraceCheckUtils]: 5: Hoare triple {36#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;havoc ~cond~0; {36#true} is VALID [2022-04-27 15:10:16,068 INFO L290 TraceCheckUtils]: 6: Hoare triple {36#true} assume !false;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~cond~0 := #t~nondet10;havoc #t~nondet10; {36#true} is VALID [2022-04-27 15:10:16,068 INFO L290 TraceCheckUtils]: 7: Hoare triple {36#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0; {36#true} is VALID [2022-04-27 15:10:16,068 INFO L290 TraceCheckUtils]: 8: Hoare triple {36#true} assume 0 != ~p1~0;~lk1~0 := 1; {41#(= main_~lk1~0 1)} is VALID [2022-04-27 15:10:16,069 INFO L290 TraceCheckUtils]: 9: Hoare triple {41#(= main_~lk1~0 1)} assume !(0 != ~p2~0); {41#(= main_~lk1~0 1)} is VALID [2022-04-27 15:10:16,069 INFO L290 TraceCheckUtils]: 10: Hoare triple {41#(= main_~lk1~0 1)} assume 0 != ~p3~0;~lk3~0 := 1; {41#(= main_~lk1~0 1)} is VALID [2022-04-27 15:10:16,070 INFO L290 TraceCheckUtils]: 11: Hoare triple {41#(= main_~lk1~0 1)} assume 0 != ~p4~0;~lk4~0 := 1; {41#(= main_~lk1~0 1)} is VALID [2022-04-27 15:10:16,070 INFO L290 TraceCheckUtils]: 12: Hoare triple {41#(= main_~lk1~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {41#(= main_~lk1~0 1)} is VALID [2022-04-27 15:10:16,071 INFO L290 TraceCheckUtils]: 13: Hoare triple {41#(= main_~lk1~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {41#(= main_~lk1~0 1)} is VALID [2022-04-27 15:10:16,071 INFO L290 TraceCheckUtils]: 14: Hoare triple {41#(= main_~lk1~0 1)} assume 0 != ~p1~0; {41#(= main_~lk1~0 1)} is VALID [2022-04-27 15:10:16,071 INFO L290 TraceCheckUtils]: 15: Hoare triple {41#(= main_~lk1~0 1)} assume 1 != ~lk1~0; {37#false} is VALID [2022-04-27 15:10:16,072 INFO L290 TraceCheckUtils]: 16: Hoare triple {37#false} assume !false; {37#false} is VALID [2022-04-27 15:10:16,072 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:16,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:10:16,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819126524] [2022-04-27 15:10:16,073 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819126524] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:10:16,073 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:10:16,073 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:10:16,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740457850] [2022-04-27 15:10:16,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:10:16,078 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-27 15:10:16,079 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:10:16,081 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:16,098 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:16,098 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:10:16,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:10:16,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:10:16,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:10:16,113 INFO L87 Difference]: Start difference. First operand has 33 states, 27 states have (on average 1.8148148148148149) internal successors, (49), 28 states have internal predecessors, (49), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:16,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:16,270 INFO L93 Difference]: Finished difference Result 64 states and 103 transitions. [2022-04-27 15:10:16,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:10:16,270 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-27 15:10:16,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:10:16,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:16,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 103 transitions. [2022-04-27 15:10:16,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:16,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 103 transitions. [2022-04-27 15:10:16,281 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 103 transitions. [2022-04-27 15:10:16,361 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:16,367 INFO L225 Difference]: With dead ends: 64 [2022-04-27 15:10:16,368 INFO L226 Difference]: Without dead ends: 49 [2022-04-27 15:10:16,369 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:16,372 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 106 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:10:16,372 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 65 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 15:10:16,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-04-27 15:10:16,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 35. [2022-04-27 15:10:16,391 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:10:16,392 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand has 35 states, 31 states have (on average 1.7741935483870968) internal successors, (55), 31 states have internal predecessors, (55), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:16,393 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand has 35 states, 31 states have (on average 1.7741935483870968) internal successors, (55), 31 states have internal predecessors, (55), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:16,393 INFO L87 Difference]: Start difference. First operand 49 states. Second operand has 35 states, 31 states have (on average 1.7741935483870968) internal successors, (55), 31 states have internal predecessors, (55), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:16,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:16,396 INFO L93 Difference]: Finished difference Result 49 states and 81 transitions. [2022-04-27 15:10:16,396 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 81 transitions. [2022-04-27 15:10:16,397 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:16,397 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:16,397 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 31 states have (on average 1.7741935483870968) internal successors, (55), 31 states have internal predecessors, (55), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 49 states. [2022-04-27 15:10:16,397 INFO L87 Difference]: Start difference. First operand has 35 states, 31 states have (on average 1.7741935483870968) internal successors, (55), 31 states have internal predecessors, (55), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 49 states. [2022-04-27 15:10:16,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:16,400 INFO L93 Difference]: Finished difference Result 49 states and 81 transitions. [2022-04-27 15:10:16,400 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 81 transitions. [2022-04-27 15:10:16,401 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:16,401 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:16,401 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:10:16,401 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:10:16,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 31 states have (on average 1.7741935483870968) internal successors, (55), 31 states have internal predecessors, (55), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:16,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 58 transitions. [2022-04-27 15:10:16,403 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 58 transitions. Word has length 17 [2022-04-27 15:10:16,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:10:16,404 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 58 transitions. [2022-04-27 15:10:16,404 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:16,404 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 58 transitions. [2022-04-27 15:10:16,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-27 15:10:16,404 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:10:16,405 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:10:16,405 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 15:10:16,405 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:10:16,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:10:16,406 INFO L85 PathProgramCache]: Analyzing trace with hash -1867356637, now seen corresponding path program 1 times [2022-04-27 15:10:16,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:10:16,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776132573] [2022-04-27 15:10:16,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:10:16,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:10:16,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:16,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:10:16,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:16,488 INFO L290 TraceCheckUtils]: 0: Hoare triple {269#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {263#true} is VALID [2022-04-27 15:10:16,489 INFO L290 TraceCheckUtils]: 1: Hoare triple {263#true} assume true; {263#true} is VALID [2022-04-27 15:10:16,489 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {263#true} {263#true} #132#return; {263#true} is VALID [2022-04-27 15:10:16,490 INFO L272 TraceCheckUtils]: 0: Hoare triple {263#true} call ULTIMATE.init(); {269#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:10:16,490 INFO L290 TraceCheckUtils]: 1: Hoare triple {269#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {263#true} is VALID [2022-04-27 15:10:16,490 INFO L290 TraceCheckUtils]: 2: Hoare triple {263#true} assume true; {263#true} is VALID [2022-04-27 15:10:16,490 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {263#true} {263#true} #132#return; {263#true} is VALID [2022-04-27 15:10:16,490 INFO L272 TraceCheckUtils]: 4: Hoare triple {263#true} call #t~ret11 := main(); {263#true} is VALID [2022-04-27 15:10:16,491 INFO L290 TraceCheckUtils]: 5: Hoare triple {263#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;havoc ~cond~0; {263#true} is VALID [2022-04-27 15:10:16,491 INFO L290 TraceCheckUtils]: 6: Hoare triple {263#true} assume !false;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~cond~0 := #t~nondet10;havoc #t~nondet10; {263#true} is VALID [2022-04-27 15:10:16,492 INFO L290 TraceCheckUtils]: 7: Hoare triple {263#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0; {263#true} is VALID [2022-04-27 15:10:16,492 INFO L290 TraceCheckUtils]: 8: Hoare triple {263#true} assume !(0 != ~p1~0); {268#(= main_~p1~0 0)} is VALID [2022-04-27 15:10:16,493 INFO L290 TraceCheckUtils]: 9: Hoare triple {268#(= main_~p1~0 0)} assume !(0 != ~p2~0); {268#(= main_~p1~0 0)} is VALID [2022-04-27 15:10:16,493 INFO L290 TraceCheckUtils]: 10: Hoare triple {268#(= main_~p1~0 0)} assume 0 != ~p3~0;~lk3~0 := 1; {268#(= main_~p1~0 0)} is VALID [2022-04-27 15:10:16,494 INFO L290 TraceCheckUtils]: 11: Hoare triple {268#(= main_~p1~0 0)} assume 0 != ~p4~0;~lk4~0 := 1; {268#(= main_~p1~0 0)} is VALID [2022-04-27 15:10:16,494 INFO L290 TraceCheckUtils]: 12: Hoare triple {268#(= main_~p1~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {268#(= main_~p1~0 0)} is VALID [2022-04-27 15:10:16,495 INFO L290 TraceCheckUtils]: 13: Hoare triple {268#(= main_~p1~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {268#(= main_~p1~0 0)} is VALID [2022-04-27 15:10:16,495 INFO L290 TraceCheckUtils]: 14: Hoare triple {268#(= main_~p1~0 0)} assume 0 != ~p1~0; {264#false} is VALID [2022-04-27 15:10:16,495 INFO L290 TraceCheckUtils]: 15: Hoare triple {264#false} assume 1 != ~lk1~0; {264#false} is VALID [2022-04-27 15:10:16,495 INFO L290 TraceCheckUtils]: 16: Hoare triple {264#false} assume !false; {264#false} is VALID [2022-04-27 15:10:16,496 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:16,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:10:16,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776132573] [2022-04-27 15:10:16,496 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776132573] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:10:16,496 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:10:16,496 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:10:16,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359632842] [2022-04-27 15:10:16,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:10:16,498 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-27 15:10:16,498 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:10:16,498 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:16,510 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:16,510 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:10:16,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:10:16,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:10:16,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:10:16,511 INFO L87 Difference]: Start difference. First operand 35 states and 58 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:16,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:16,665 INFO L93 Difference]: Finished difference Result 78 states and 133 transitions. [2022-04-27 15:10:16,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:10:16,666 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-27 15:10:16,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:10:16,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:16,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 120 transitions. [2022-04-27 15:10:16,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:16,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 120 transitions. [2022-04-27 15:10:16,672 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 120 transitions. [2022-04-27 15:10:16,770 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 120 edges. 120 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:16,771 INFO L225 Difference]: With dead ends: 78 [2022-04-27 15:10:16,771 INFO L226 Difference]: Without dead ends: 49 [2022-04-27 15:10:16,772 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:16,773 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 88 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:10:16,773 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 63 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 15:10:16,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-04-27 15:10:16,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2022-04-27 15:10:16,777 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:10:16,777 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand has 47 states, 43 states have (on average 1.744186046511628) internal successors, (75), 43 states have internal predecessors, (75), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:16,777 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand has 47 states, 43 states have (on average 1.744186046511628) internal successors, (75), 43 states have internal predecessors, (75), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:16,778 INFO L87 Difference]: Start difference. First operand 49 states. Second operand has 47 states, 43 states have (on average 1.744186046511628) internal successors, (75), 43 states have internal predecessors, (75), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:16,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:16,779 INFO L93 Difference]: Finished difference Result 49 states and 79 transitions. [2022-04-27 15:10:16,780 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 79 transitions. [2022-04-27 15:10:16,780 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:16,780 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:16,780 INFO L74 IsIncluded]: Start isIncluded. First operand has 47 states, 43 states have (on average 1.744186046511628) internal successors, (75), 43 states have internal predecessors, (75), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 49 states. [2022-04-27 15:10:16,781 INFO L87 Difference]: Start difference. First operand has 47 states, 43 states have (on average 1.744186046511628) internal successors, (75), 43 states have internal predecessors, (75), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 49 states. [2022-04-27 15:10:16,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:16,782 INFO L93 Difference]: Finished difference Result 49 states and 79 transitions. [2022-04-27 15:10:16,782 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 79 transitions. [2022-04-27 15:10:16,783 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:16,783 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:16,783 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:10:16,783 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:10:16,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 43 states have (on average 1.744186046511628) internal successors, (75), 43 states have internal predecessors, (75), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:16,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 78 transitions. [2022-04-27 15:10:16,785 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 78 transitions. Word has length 17 [2022-04-27 15:10:16,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:10:16,785 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 78 transitions. [2022-04-27 15:10:16,785 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:16,785 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 78 transitions. [2022-04-27 15:10:16,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-27 15:10:16,786 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:10:16,786 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:10:16,786 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 15:10:16,786 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:10:16,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:10:16,787 INFO L85 PathProgramCache]: Analyzing trace with hash -1660239210, now seen corresponding path program 1 times [2022-04-27 15:10:16,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:10:16,790 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100851291] [2022-04-27 15:10:16,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:10:16,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:10:16,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:16,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:10:16,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:16,851 INFO L290 TraceCheckUtils]: 0: Hoare triple {521#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {515#true} is VALID [2022-04-27 15:10:16,851 INFO L290 TraceCheckUtils]: 1: Hoare triple {515#true} assume true; {515#true} is VALID [2022-04-27 15:10:16,851 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {515#true} {515#true} #132#return; {515#true} is VALID [2022-04-27 15:10:16,852 INFO L272 TraceCheckUtils]: 0: Hoare triple {515#true} call ULTIMATE.init(); {521#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:10:16,852 INFO L290 TraceCheckUtils]: 1: Hoare triple {521#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {515#true} is VALID [2022-04-27 15:10:16,852 INFO L290 TraceCheckUtils]: 2: Hoare triple {515#true} assume true; {515#true} is VALID [2022-04-27 15:10:16,852 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {515#true} {515#true} #132#return; {515#true} is VALID [2022-04-27 15:10:16,852 INFO L272 TraceCheckUtils]: 4: Hoare triple {515#true} call #t~ret11 := main(); {515#true} is VALID [2022-04-27 15:10:16,853 INFO L290 TraceCheckUtils]: 5: Hoare triple {515#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;havoc ~cond~0; {515#true} is VALID [2022-04-27 15:10:16,853 INFO L290 TraceCheckUtils]: 6: Hoare triple {515#true} assume !false;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~cond~0 := #t~nondet10;havoc #t~nondet10; {515#true} is VALID [2022-04-27 15:10:16,853 INFO L290 TraceCheckUtils]: 7: Hoare triple {515#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0; {515#true} is VALID [2022-04-27 15:10:16,854 INFO L290 TraceCheckUtils]: 8: Hoare triple {515#true} assume 0 != ~p1~0;~lk1~0 := 1; {520#(not (= main_~p1~0 0))} is VALID [2022-04-27 15:10:16,854 INFO L290 TraceCheckUtils]: 9: Hoare triple {520#(not (= main_~p1~0 0))} assume !(0 != ~p2~0); {520#(not (= main_~p1~0 0))} is VALID [2022-04-27 15:10:16,855 INFO L290 TraceCheckUtils]: 10: Hoare triple {520#(not (= main_~p1~0 0))} assume 0 != ~p3~0;~lk3~0 := 1; {520#(not (= main_~p1~0 0))} is VALID [2022-04-27 15:10:16,855 INFO L290 TraceCheckUtils]: 11: Hoare triple {520#(not (= main_~p1~0 0))} assume 0 != ~p4~0;~lk4~0 := 1; {520#(not (= main_~p1~0 0))} is VALID [2022-04-27 15:10:16,855 INFO L290 TraceCheckUtils]: 12: Hoare triple {520#(not (= main_~p1~0 0))} assume 0 != ~p5~0;~lk5~0 := 1; {520#(not (= main_~p1~0 0))} is VALID [2022-04-27 15:10:16,856 INFO L290 TraceCheckUtils]: 13: Hoare triple {520#(not (= main_~p1~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {520#(not (= main_~p1~0 0))} is VALID [2022-04-27 15:10:16,857 INFO L290 TraceCheckUtils]: 14: Hoare triple {520#(not (= main_~p1~0 0))} assume !(0 != ~p1~0); {516#false} is VALID [2022-04-27 15:10:16,858 INFO L290 TraceCheckUtils]: 15: Hoare triple {516#false} assume 0 != ~p2~0; {516#false} is VALID [2022-04-27 15:10:16,858 INFO L290 TraceCheckUtils]: 16: Hoare triple {516#false} assume 1 != ~lk2~0; {516#false} is VALID [2022-04-27 15:10:16,858 INFO L290 TraceCheckUtils]: 17: Hoare triple {516#false} assume !false; {516#false} is VALID [2022-04-27 15:10:16,859 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:16,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:10:16,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100851291] [2022-04-27 15:10:16,859 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100851291] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:10:16,859 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:10:16,859 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:10:16,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242264351] [2022-04-27 15:10:16,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:10:16,860 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-27 15:10:16,860 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:10:16,860 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:16,872 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:16,872 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:10:16,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:10:16,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:10:16,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:10:16,873 INFO L87 Difference]: Start difference. First operand 47 states and 78 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:16,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:16,983 INFO L93 Difference]: Finished difference Result 73 states and 118 transitions. [2022-04-27 15:10:16,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:10:16,983 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-27 15:10:16,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:10:16,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:16,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 115 transitions. [2022-04-27 15:10:16,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:16,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 115 transitions. [2022-04-27 15:10:16,994 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 115 transitions. [2022-04-27 15:10:17,060 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 115 edges. 115 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:17,062 INFO L225 Difference]: With dead ends: 73 [2022-04-27 15:10:17,062 INFO L226 Difference]: Without dead ends: 52 [2022-04-27 15:10:17,062 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:17,063 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 79 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:10:17,063 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 73 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 15:10:17,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-04-27 15:10:17,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 50. [2022-04-27 15:10:17,067 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:10:17,067 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand has 50 states, 46 states have (on average 1.673913043478261) internal successors, (77), 46 states have internal predecessors, (77), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:17,067 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand has 50 states, 46 states have (on average 1.673913043478261) internal successors, (77), 46 states have internal predecessors, (77), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:17,068 INFO L87 Difference]: Start difference. First operand 52 states. Second operand has 50 states, 46 states have (on average 1.673913043478261) internal successors, (77), 46 states have internal predecessors, (77), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:17,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:17,071 INFO L93 Difference]: Finished difference Result 52 states and 81 transitions. [2022-04-27 15:10:17,071 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 81 transitions. [2022-04-27 15:10:17,072 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:17,073 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:17,073 INFO L74 IsIncluded]: Start isIncluded. First operand has 50 states, 46 states have (on average 1.673913043478261) internal successors, (77), 46 states have internal predecessors, (77), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 52 states. [2022-04-27 15:10:17,073 INFO L87 Difference]: Start difference. First operand has 50 states, 46 states have (on average 1.673913043478261) internal successors, (77), 46 states have internal predecessors, (77), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 52 states. [2022-04-27 15:10:17,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:17,076 INFO L93 Difference]: Finished difference Result 52 states and 81 transitions. [2022-04-27 15:10:17,076 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 81 transitions. [2022-04-27 15:10:17,077 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:17,077 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:17,077 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:10:17,077 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:10:17,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 46 states have (on average 1.673913043478261) internal successors, (77), 46 states have internal predecessors, (77), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:17,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 80 transitions. [2022-04-27 15:10:17,078 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 80 transitions. Word has length 18 [2022-04-27 15:10:17,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:10:17,079 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 80 transitions. [2022-04-27 15:10:17,079 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:17,079 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 80 transitions. [2022-04-27 15:10:17,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-27 15:10:17,079 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:10:17,079 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:10:17,079 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-27 15:10:17,080 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:10:17,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:10:17,080 INFO L85 PathProgramCache]: Analyzing trace with hash -2053266220, now seen corresponding path program 1 times [2022-04-27 15:10:17,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:10:17,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110161926] [2022-04-27 15:10:17,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:10:17,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:10:17,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:17,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:10:17,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:17,122 INFO L290 TraceCheckUtils]: 0: Hoare triple {779#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {773#true} is VALID [2022-04-27 15:10:17,122 INFO L290 TraceCheckUtils]: 1: Hoare triple {773#true} assume true; {773#true} is VALID [2022-04-27 15:10:17,122 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {773#true} {773#true} #132#return; {773#true} is VALID [2022-04-27 15:10:17,123 INFO L272 TraceCheckUtils]: 0: Hoare triple {773#true} call ULTIMATE.init(); {779#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:10:17,123 INFO L290 TraceCheckUtils]: 1: Hoare triple {779#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {773#true} is VALID [2022-04-27 15:10:17,123 INFO L290 TraceCheckUtils]: 2: Hoare triple {773#true} assume true; {773#true} is VALID [2022-04-27 15:10:17,123 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {773#true} {773#true} #132#return; {773#true} is VALID [2022-04-27 15:10:17,123 INFO L272 TraceCheckUtils]: 4: Hoare triple {773#true} call #t~ret11 := main(); {773#true} is VALID [2022-04-27 15:10:17,123 INFO L290 TraceCheckUtils]: 5: Hoare triple {773#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;havoc ~cond~0; {773#true} is VALID [2022-04-27 15:10:17,123 INFO L290 TraceCheckUtils]: 6: Hoare triple {773#true} assume !false;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~cond~0 := #t~nondet10;havoc #t~nondet10; {773#true} is VALID [2022-04-27 15:10:17,124 INFO L290 TraceCheckUtils]: 7: Hoare triple {773#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0; {773#true} is VALID [2022-04-27 15:10:17,124 INFO L290 TraceCheckUtils]: 8: Hoare triple {773#true} assume !(0 != ~p1~0); {773#true} is VALID [2022-04-27 15:10:17,124 INFO L290 TraceCheckUtils]: 9: Hoare triple {773#true} assume !(0 != ~p2~0); {778#(= main_~p2~0 0)} is VALID [2022-04-27 15:10:17,124 INFO L290 TraceCheckUtils]: 10: Hoare triple {778#(= main_~p2~0 0)} assume 0 != ~p3~0;~lk3~0 := 1; {778#(= main_~p2~0 0)} is VALID [2022-04-27 15:10:17,124 INFO L290 TraceCheckUtils]: 11: Hoare triple {778#(= main_~p2~0 0)} assume 0 != ~p4~0;~lk4~0 := 1; {778#(= main_~p2~0 0)} is VALID [2022-04-27 15:10:17,125 INFO L290 TraceCheckUtils]: 12: Hoare triple {778#(= main_~p2~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {778#(= main_~p2~0 0)} is VALID [2022-04-27 15:10:17,125 INFO L290 TraceCheckUtils]: 13: Hoare triple {778#(= main_~p2~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {778#(= main_~p2~0 0)} is VALID [2022-04-27 15:10:17,125 INFO L290 TraceCheckUtils]: 14: Hoare triple {778#(= main_~p2~0 0)} assume !(0 != ~p1~0); {778#(= main_~p2~0 0)} is VALID [2022-04-27 15:10:17,126 INFO L290 TraceCheckUtils]: 15: Hoare triple {778#(= main_~p2~0 0)} assume 0 != ~p2~0; {774#false} is VALID [2022-04-27 15:10:17,126 INFO L290 TraceCheckUtils]: 16: Hoare triple {774#false} assume 1 != ~lk2~0; {774#false} is VALID [2022-04-27 15:10:17,126 INFO L290 TraceCheckUtils]: 17: Hoare triple {774#false} assume !false; {774#false} is VALID [2022-04-27 15:10:17,126 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:17,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:10:17,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110161926] [2022-04-27 15:10:17,126 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110161926] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:10:17,126 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:10:17,126 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:10:17,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524240628] [2022-04-27 15:10:17,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:10:17,127 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-27 15:10:17,127 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:10:17,127 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:17,137 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:17,137 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:10:17,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:10:17,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:10:17,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:10:17,137 INFO L87 Difference]: Start difference. First operand 50 states and 80 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:17,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:17,229 INFO L93 Difference]: Finished difference Result 130 states and 216 transitions. [2022-04-27 15:10:17,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:10:17,230 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-27 15:10:17,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:10:17,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:17,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 118 transitions. [2022-04-27 15:10:17,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:17,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 118 transitions. [2022-04-27 15:10:17,233 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 118 transitions. [2022-04-27 15:10:17,301 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 118 edges. 118 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:17,303 INFO L225 Difference]: With dead ends: 130 [2022-04-27 15:10:17,303 INFO L226 Difference]: Without dead ends: 89 [2022-04-27 15:10:17,303 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:17,304 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 95 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:10:17,304 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 55 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 15:10:17,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-04-27 15:10:17,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 87. [2022-04-27 15:10:17,309 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:10:17,309 INFO L82 GeneralOperation]: Start isEquivalent. First operand 89 states. Second operand has 87 states, 83 states have (on average 1.6626506024096386) internal successors, (138), 83 states have internal predecessors, (138), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:17,309 INFO L74 IsIncluded]: Start isIncluded. First operand 89 states. Second operand has 87 states, 83 states have (on average 1.6626506024096386) internal successors, (138), 83 states have internal predecessors, (138), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:17,309 INFO L87 Difference]: Start difference. First operand 89 states. Second operand has 87 states, 83 states have (on average 1.6626506024096386) internal successors, (138), 83 states have internal predecessors, (138), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:17,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:17,312 INFO L93 Difference]: Finished difference Result 89 states and 142 transitions. [2022-04-27 15:10:17,312 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 142 transitions. [2022-04-27 15:10:17,312 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:17,312 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:17,312 INFO L74 IsIncluded]: Start isIncluded. First operand has 87 states, 83 states have (on average 1.6626506024096386) internal successors, (138), 83 states have internal predecessors, (138), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 89 states. [2022-04-27 15:10:17,313 INFO L87 Difference]: Start difference. First operand has 87 states, 83 states have (on average 1.6626506024096386) internal successors, (138), 83 states have internal predecessors, (138), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 89 states. [2022-04-27 15:10:17,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:17,315 INFO L93 Difference]: Finished difference Result 89 states and 142 transitions. [2022-04-27 15:10:17,315 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 142 transitions. [2022-04-27 15:10:17,315 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:17,315 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:17,315 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:10:17,315 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:10:17,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 83 states have (on average 1.6626506024096386) internal successors, (138), 83 states have internal predecessors, (138), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:17,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 141 transitions. [2022-04-27 15:10:17,318 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 141 transitions. Word has length 18 [2022-04-27 15:10:17,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:10:17,318 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 141 transitions. [2022-04-27 15:10:17,318 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:17,318 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 141 transitions. [2022-04-27 15:10:17,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-27 15:10:17,318 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:10:17,318 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:10:17,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-27 15:10:17,319 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:10:17,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:10:17,319 INFO L85 PathProgramCache]: Analyzing trace with hash 1561642706, now seen corresponding path program 1 times [2022-04-27 15:10:17,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:10:17,319 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154434804] [2022-04-27 15:10:17,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:10:17,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:10:17,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:17,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:10:17,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:17,349 INFO L290 TraceCheckUtils]: 0: Hoare triple {1210#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {1204#true} is VALID [2022-04-27 15:10:17,349 INFO L290 TraceCheckUtils]: 1: Hoare triple {1204#true} assume true; {1204#true} is VALID [2022-04-27 15:10:17,349 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1204#true} {1204#true} #132#return; {1204#true} is VALID [2022-04-27 15:10:17,354 INFO L272 TraceCheckUtils]: 0: Hoare triple {1204#true} call ULTIMATE.init(); {1210#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:10:17,354 INFO L290 TraceCheckUtils]: 1: Hoare triple {1210#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {1204#true} is VALID [2022-04-27 15:10:17,354 INFO L290 TraceCheckUtils]: 2: Hoare triple {1204#true} assume true; {1204#true} is VALID [2022-04-27 15:10:17,354 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1204#true} {1204#true} #132#return; {1204#true} is VALID [2022-04-27 15:10:17,354 INFO L272 TraceCheckUtils]: 4: Hoare triple {1204#true} call #t~ret11 := main(); {1204#true} is VALID [2022-04-27 15:10:17,355 INFO L290 TraceCheckUtils]: 5: Hoare triple {1204#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;havoc ~cond~0; {1204#true} is VALID [2022-04-27 15:10:17,355 INFO L290 TraceCheckUtils]: 6: Hoare triple {1204#true} assume !false;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~cond~0 := #t~nondet10;havoc #t~nondet10; {1204#true} is VALID [2022-04-27 15:10:17,355 INFO L290 TraceCheckUtils]: 7: Hoare triple {1204#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0; {1204#true} is VALID [2022-04-27 15:10:17,355 INFO L290 TraceCheckUtils]: 8: Hoare triple {1204#true} assume !(0 != ~p1~0); {1204#true} is VALID [2022-04-27 15:10:17,355 INFO L290 TraceCheckUtils]: 9: Hoare triple {1204#true} assume 0 != ~p2~0;~lk2~0 := 1; {1209#(= main_~lk2~0 1)} is VALID [2022-04-27 15:10:17,356 INFO L290 TraceCheckUtils]: 10: Hoare triple {1209#(= main_~lk2~0 1)} assume 0 != ~p3~0;~lk3~0 := 1; {1209#(= main_~lk2~0 1)} is VALID [2022-04-27 15:10:17,356 INFO L290 TraceCheckUtils]: 11: Hoare triple {1209#(= main_~lk2~0 1)} assume 0 != ~p4~0;~lk4~0 := 1; {1209#(= main_~lk2~0 1)} is VALID [2022-04-27 15:10:17,356 INFO L290 TraceCheckUtils]: 12: Hoare triple {1209#(= main_~lk2~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {1209#(= main_~lk2~0 1)} is VALID [2022-04-27 15:10:17,356 INFO L290 TraceCheckUtils]: 13: Hoare triple {1209#(= main_~lk2~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {1209#(= main_~lk2~0 1)} is VALID [2022-04-27 15:10:17,357 INFO L290 TraceCheckUtils]: 14: Hoare triple {1209#(= main_~lk2~0 1)} assume !(0 != ~p1~0); {1209#(= main_~lk2~0 1)} is VALID [2022-04-27 15:10:17,360 INFO L290 TraceCheckUtils]: 15: Hoare triple {1209#(= main_~lk2~0 1)} assume 0 != ~p2~0; {1209#(= main_~lk2~0 1)} is VALID [2022-04-27 15:10:17,360 INFO L290 TraceCheckUtils]: 16: Hoare triple {1209#(= main_~lk2~0 1)} assume 1 != ~lk2~0; {1205#false} is VALID [2022-04-27 15:10:17,360 INFO L290 TraceCheckUtils]: 17: Hoare triple {1205#false} assume !false; {1205#false} is VALID [2022-04-27 15:10:17,360 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:17,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:10:17,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154434804] [2022-04-27 15:10:17,361 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1154434804] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:10:17,361 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:10:17,361 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:10:17,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084915019] [2022-04-27 15:10:17,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:10:17,361 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-27 15:10:17,361 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:10:17,362 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:17,371 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:17,371 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:10:17,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:10:17,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:10:17,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:10:17,372 INFO L87 Difference]: Start difference. First operand 87 states and 141 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:17,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:17,460 INFO L93 Difference]: Finished difference Result 111 states and 179 transitions. [2022-04-27 15:10:17,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:10:17,460 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-27 15:10:17,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:10:17,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:17,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 76 transitions. [2022-04-27 15:10:17,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:17,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 76 transitions. [2022-04-27 15:10:17,463 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 76 transitions. [2022-04-27 15:10:17,548 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:17,550 INFO L225 Difference]: With dead ends: 111 [2022-04-27 15:10:17,550 INFO L226 Difference]: Without dead ends: 109 [2022-04-27 15:10:17,550 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:17,551 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 62 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:10:17,551 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 80 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 15:10:17,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-04-27 15:10:17,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 87. [2022-04-27 15:10:17,556 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:10:17,556 INFO L82 GeneralOperation]: Start isEquivalent. First operand 109 states. Second operand has 87 states, 83 states have (on average 1.6385542168674698) internal successors, (136), 83 states have internal predecessors, (136), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:17,556 INFO L74 IsIncluded]: Start isIncluded. First operand 109 states. Second operand has 87 states, 83 states have (on average 1.6385542168674698) internal successors, (136), 83 states have internal predecessors, (136), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:17,556 INFO L87 Difference]: Start difference. First operand 109 states. Second operand has 87 states, 83 states have (on average 1.6385542168674698) internal successors, (136), 83 states have internal predecessors, (136), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:17,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:17,559 INFO L93 Difference]: Finished difference Result 109 states and 176 transitions. [2022-04-27 15:10:17,559 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 176 transitions. [2022-04-27 15:10:17,559 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:17,559 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:17,559 INFO L74 IsIncluded]: Start isIncluded. First operand has 87 states, 83 states have (on average 1.6385542168674698) internal successors, (136), 83 states have internal predecessors, (136), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 109 states. [2022-04-27 15:10:17,560 INFO L87 Difference]: Start difference. First operand has 87 states, 83 states have (on average 1.6385542168674698) internal successors, (136), 83 states have internal predecessors, (136), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 109 states. [2022-04-27 15:10:17,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:17,562 INFO L93 Difference]: Finished difference Result 109 states and 176 transitions. [2022-04-27 15:10:17,562 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 176 transitions. [2022-04-27 15:10:17,563 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:17,563 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:17,563 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:10:17,563 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:10:17,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 83 states have (on average 1.6385542168674698) internal successors, (136), 83 states have internal predecessors, (136), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:17,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 139 transitions. [2022-04-27 15:10:17,565 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 139 transitions. Word has length 18 [2022-04-27 15:10:17,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:10:17,565 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 139 transitions. [2022-04-27 15:10:17,565 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:17,565 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 139 transitions. [2022-04-27 15:10:17,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-27 15:10:17,566 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:10:17,566 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:10:17,566 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-27 15:10:17,566 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:10:17,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:10:17,566 INFO L85 PathProgramCache]: Analyzing trace with hash 773471640, now seen corresponding path program 1 times [2022-04-27 15:10:17,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:10:17,567 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943542439] [2022-04-27 15:10:17,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:10:17,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:10:17,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:17,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:10:17,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:17,594 INFO L290 TraceCheckUtils]: 0: Hoare triple {1662#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {1656#true} is VALID [2022-04-27 15:10:17,595 INFO L290 TraceCheckUtils]: 1: Hoare triple {1656#true} assume true; {1656#true} is VALID [2022-04-27 15:10:17,595 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1656#true} {1656#true} #132#return; {1656#true} is VALID [2022-04-27 15:10:17,595 INFO L272 TraceCheckUtils]: 0: Hoare triple {1656#true} call ULTIMATE.init(); {1662#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:10:17,595 INFO L290 TraceCheckUtils]: 1: Hoare triple {1662#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {1656#true} is VALID [2022-04-27 15:10:17,595 INFO L290 TraceCheckUtils]: 2: Hoare triple {1656#true} assume true; {1656#true} is VALID [2022-04-27 15:10:17,596 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1656#true} {1656#true} #132#return; {1656#true} is VALID [2022-04-27 15:10:17,596 INFO L272 TraceCheckUtils]: 4: Hoare triple {1656#true} call #t~ret11 := main(); {1656#true} is VALID [2022-04-27 15:10:17,596 INFO L290 TraceCheckUtils]: 5: Hoare triple {1656#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;havoc ~cond~0; {1656#true} is VALID [2022-04-27 15:10:17,596 INFO L290 TraceCheckUtils]: 6: Hoare triple {1656#true} assume !false;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~cond~0 := #t~nondet10;havoc #t~nondet10; {1656#true} is VALID [2022-04-27 15:10:17,596 INFO L290 TraceCheckUtils]: 7: Hoare triple {1656#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0; {1656#true} is VALID [2022-04-27 15:10:17,596 INFO L290 TraceCheckUtils]: 8: Hoare triple {1656#true} assume !(0 != ~p1~0); {1656#true} is VALID [2022-04-27 15:10:17,596 INFO L290 TraceCheckUtils]: 9: Hoare triple {1656#true} assume !(0 != ~p2~0); {1656#true} is VALID [2022-04-27 15:10:17,596 INFO L290 TraceCheckUtils]: 10: Hoare triple {1656#true} assume 0 != ~p3~0;~lk3~0 := 1; {1661#(= main_~lk3~0 1)} is VALID [2022-04-27 15:10:17,597 INFO L290 TraceCheckUtils]: 11: Hoare triple {1661#(= main_~lk3~0 1)} assume 0 != ~p4~0;~lk4~0 := 1; {1661#(= main_~lk3~0 1)} is VALID [2022-04-27 15:10:17,597 INFO L290 TraceCheckUtils]: 12: Hoare triple {1661#(= main_~lk3~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {1661#(= main_~lk3~0 1)} is VALID [2022-04-27 15:10:17,597 INFO L290 TraceCheckUtils]: 13: Hoare triple {1661#(= main_~lk3~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {1661#(= main_~lk3~0 1)} is VALID [2022-04-27 15:10:17,597 INFO L290 TraceCheckUtils]: 14: Hoare triple {1661#(= main_~lk3~0 1)} assume !(0 != ~p1~0); {1661#(= main_~lk3~0 1)} is VALID [2022-04-27 15:10:17,598 INFO L290 TraceCheckUtils]: 15: Hoare triple {1661#(= main_~lk3~0 1)} assume !(0 != ~p2~0); {1661#(= main_~lk3~0 1)} is VALID [2022-04-27 15:10:17,598 INFO L290 TraceCheckUtils]: 16: Hoare triple {1661#(= main_~lk3~0 1)} assume 0 != ~p3~0; {1661#(= main_~lk3~0 1)} is VALID [2022-04-27 15:10:17,598 INFO L290 TraceCheckUtils]: 17: Hoare triple {1661#(= main_~lk3~0 1)} assume 1 != ~lk3~0; {1657#false} is VALID [2022-04-27 15:10:17,598 INFO L290 TraceCheckUtils]: 18: Hoare triple {1657#false} assume !false; {1657#false} is VALID [2022-04-27 15:10:17,606 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:17,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:10:17,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943542439] [2022-04-27 15:10:17,606 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943542439] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:10:17,606 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:10:17,606 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:10:17,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788894369] [2022-04-27 15:10:17,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:10:17,607 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-27 15:10:17,607 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:10:17,607 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:17,616 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:17,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:10:17,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:10:17,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:10:17,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:10:17,617 INFO L87 Difference]: Start difference. First operand 87 states and 139 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:17,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:17,702 INFO L93 Difference]: Finished difference Result 155 states and 251 transitions. [2022-04-27 15:10:17,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:10:17,702 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-27 15:10:17,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:10:17,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:17,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 75 transitions. [2022-04-27 15:10:17,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:17,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 75 transitions. [2022-04-27 15:10:17,705 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 75 transitions. [2022-04-27 15:10:17,753 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:17,755 INFO L225 Difference]: With dead ends: 155 [2022-04-27 15:10:17,755 INFO L226 Difference]: Without dead ends: 153 [2022-04-27 15:10:17,755 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:17,758 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 86 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:10:17,761 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 52 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 15:10:17,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2022-04-27 15:10:17,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 119. [2022-04-27 15:10:17,776 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:10:17,777 INFO L82 GeneralOperation]: Start isEquivalent. First operand 153 states. Second operand has 119 states, 115 states have (on average 1.617391304347826) internal successors, (186), 115 states have internal predecessors, (186), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:17,777 INFO L74 IsIncluded]: Start isIncluded. First operand 153 states. Second operand has 119 states, 115 states have (on average 1.617391304347826) internal successors, (186), 115 states have internal predecessors, (186), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:17,777 INFO L87 Difference]: Start difference. First operand 153 states. Second operand has 119 states, 115 states have (on average 1.617391304347826) internal successors, (186), 115 states have internal predecessors, (186), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:17,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:17,781 INFO L93 Difference]: Finished difference Result 153 states and 246 transitions. [2022-04-27 15:10:17,781 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 246 transitions. [2022-04-27 15:10:17,782 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:17,782 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:17,782 INFO L74 IsIncluded]: Start isIncluded. First operand has 119 states, 115 states have (on average 1.617391304347826) internal successors, (186), 115 states have internal predecessors, (186), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 153 states. [2022-04-27 15:10:17,782 INFO L87 Difference]: Start difference. First operand has 119 states, 115 states have (on average 1.617391304347826) internal successors, (186), 115 states have internal predecessors, (186), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 153 states. [2022-04-27 15:10:17,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:17,786 INFO L93 Difference]: Finished difference Result 153 states and 246 transitions. [2022-04-27 15:10:17,786 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 246 transitions. [2022-04-27 15:10:17,787 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:17,787 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:17,787 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:10:17,787 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:10:17,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 115 states have (on average 1.617391304347826) internal successors, (186), 115 states have internal predecessors, (186), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:17,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 189 transitions. [2022-04-27 15:10:17,790 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 189 transitions. Word has length 19 [2022-04-27 15:10:17,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:10:17,790 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 189 transitions. [2022-04-27 15:10:17,790 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:17,790 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 189 transitions. [2022-04-27 15:10:17,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-27 15:10:17,790 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:10:17,791 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:10:17,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-27 15:10:17,791 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:10:17,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:10:17,791 INFO L85 PathProgramCache]: Analyzing trace with hash 1453530010, now seen corresponding path program 1 times [2022-04-27 15:10:17,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:10:17,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013709791] [2022-04-27 15:10:17,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:10:17,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:10:17,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:17,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:10:17,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:17,834 INFO L290 TraceCheckUtils]: 0: Hoare triple {2280#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {2274#true} is VALID [2022-04-27 15:10:17,834 INFO L290 TraceCheckUtils]: 1: Hoare triple {2274#true} assume true; {2274#true} is VALID [2022-04-27 15:10:17,834 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2274#true} {2274#true} #132#return; {2274#true} is VALID [2022-04-27 15:10:17,835 INFO L272 TraceCheckUtils]: 0: Hoare triple {2274#true} call ULTIMATE.init(); {2280#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:10:17,835 INFO L290 TraceCheckUtils]: 1: Hoare triple {2280#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {2274#true} is VALID [2022-04-27 15:10:17,835 INFO L290 TraceCheckUtils]: 2: Hoare triple {2274#true} assume true; {2274#true} is VALID [2022-04-27 15:10:17,835 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2274#true} {2274#true} #132#return; {2274#true} is VALID [2022-04-27 15:10:17,835 INFO L272 TraceCheckUtils]: 4: Hoare triple {2274#true} call #t~ret11 := main(); {2274#true} is VALID [2022-04-27 15:10:17,835 INFO L290 TraceCheckUtils]: 5: Hoare triple {2274#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;havoc ~cond~0; {2274#true} is VALID [2022-04-27 15:10:17,835 INFO L290 TraceCheckUtils]: 6: Hoare triple {2274#true} assume !false;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~cond~0 := #t~nondet10;havoc #t~nondet10; {2274#true} is VALID [2022-04-27 15:10:17,836 INFO L290 TraceCheckUtils]: 7: Hoare triple {2274#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0; {2274#true} is VALID [2022-04-27 15:10:17,836 INFO L290 TraceCheckUtils]: 8: Hoare triple {2274#true} assume !(0 != ~p1~0); {2274#true} is VALID [2022-04-27 15:10:17,836 INFO L290 TraceCheckUtils]: 9: Hoare triple {2274#true} assume !(0 != ~p2~0); {2274#true} is VALID [2022-04-27 15:10:17,836 INFO L290 TraceCheckUtils]: 10: Hoare triple {2274#true} assume !(0 != ~p3~0); {2279#(= main_~p3~0 0)} is VALID [2022-04-27 15:10:17,836 INFO L290 TraceCheckUtils]: 11: Hoare triple {2279#(= main_~p3~0 0)} assume 0 != ~p4~0;~lk4~0 := 1; {2279#(= main_~p3~0 0)} is VALID [2022-04-27 15:10:17,837 INFO L290 TraceCheckUtils]: 12: Hoare triple {2279#(= main_~p3~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {2279#(= main_~p3~0 0)} is VALID [2022-04-27 15:10:17,837 INFO L290 TraceCheckUtils]: 13: Hoare triple {2279#(= main_~p3~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {2279#(= main_~p3~0 0)} is VALID [2022-04-27 15:10:17,837 INFO L290 TraceCheckUtils]: 14: Hoare triple {2279#(= main_~p3~0 0)} assume !(0 != ~p1~0); {2279#(= main_~p3~0 0)} is VALID [2022-04-27 15:10:17,837 INFO L290 TraceCheckUtils]: 15: Hoare triple {2279#(= main_~p3~0 0)} assume !(0 != ~p2~0); {2279#(= main_~p3~0 0)} is VALID [2022-04-27 15:10:17,838 INFO L290 TraceCheckUtils]: 16: Hoare triple {2279#(= main_~p3~0 0)} assume 0 != ~p3~0; {2275#false} is VALID [2022-04-27 15:10:17,838 INFO L290 TraceCheckUtils]: 17: Hoare triple {2275#false} assume 1 != ~lk3~0; {2275#false} is VALID [2022-04-27 15:10:17,838 INFO L290 TraceCheckUtils]: 18: Hoare triple {2275#false} assume !false; {2275#false} is VALID [2022-04-27 15:10:17,838 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:17,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:10:17,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013709791] [2022-04-27 15:10:17,838 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013709791] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:10:17,838 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:10:17,838 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:10:17,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620111496] [2022-04-27 15:10:17,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:10:17,839 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-27 15:10:17,839 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:10:17,839 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:17,848 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:17,848 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:10:17,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:10:17,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:10:17,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:10:17,849 INFO L87 Difference]: Start difference. First operand 119 states and 189 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:17,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:17,941 INFO L93 Difference]: Finished difference Result 271 states and 435 transitions. [2022-04-27 15:10:17,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:10:17,942 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-27 15:10:17,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:10:17,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:17,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 114 transitions. [2022-04-27 15:10:17,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:17,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 114 transitions. [2022-04-27 15:10:17,944 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 114 transitions. [2022-04-27 15:10:18,016 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:18,018 INFO L225 Difference]: With dead ends: 271 [2022-04-27 15:10:18,018 INFO L226 Difference]: Without dead ends: 161 [2022-04-27 15:10:18,019 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:10:18,020 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 76 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:10:18,020 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 67 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 15:10:18,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2022-04-27 15:10:18,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 159. [2022-04-27 15:10:18,032 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:10:18,033 INFO L82 GeneralOperation]: Start isEquivalent. First operand 161 states. Second operand has 159 states, 155 states have (on average 1.5741935483870968) internal successors, (244), 155 states have internal predecessors, (244), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:18,033 INFO L74 IsIncluded]: Start isIncluded. First operand 161 states. Second operand has 159 states, 155 states have (on average 1.5741935483870968) internal successors, (244), 155 states have internal predecessors, (244), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:18,033 INFO L87 Difference]: Start difference. First operand 161 states. Second operand has 159 states, 155 states have (on average 1.5741935483870968) internal successors, (244), 155 states have internal predecessors, (244), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:18,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:18,036 INFO L93 Difference]: Finished difference Result 161 states and 248 transitions. [2022-04-27 15:10:18,036 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 248 transitions. [2022-04-27 15:10:18,036 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:18,036 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:18,037 INFO L74 IsIncluded]: Start isIncluded. First operand has 159 states, 155 states have (on average 1.5741935483870968) internal successors, (244), 155 states have internal predecessors, (244), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 161 states. [2022-04-27 15:10:18,037 INFO L87 Difference]: Start difference. First operand has 159 states, 155 states have (on average 1.5741935483870968) internal successors, (244), 155 states have internal predecessors, (244), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 161 states. [2022-04-27 15:10:18,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:18,040 INFO L93 Difference]: Finished difference Result 161 states and 248 transitions. [2022-04-27 15:10:18,040 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 248 transitions. [2022-04-27 15:10:18,040 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:18,040 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:18,040 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:10:18,040 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:10:18,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 155 states have (on average 1.5741935483870968) internal successors, (244), 155 states have internal predecessors, (244), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:18,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 247 transitions. [2022-04-27 15:10:18,043 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 247 transitions. Word has length 19 [2022-04-27 15:10:18,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:10:18,043 INFO L495 AbstractCegarLoop]: Abstraction has 159 states and 247 transitions. [2022-04-27 15:10:18,043 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:18,044 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 247 transitions. [2022-04-27 15:10:18,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-27 15:10:18,044 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:10:18,044 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:10:18,044 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-27 15:10:18,044 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:10:18,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:10:18,045 INFO L85 PathProgramCache]: Analyzing trace with hash -1791967575, now seen corresponding path program 1 times [2022-04-27 15:10:18,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:10:18,045 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981262151] [2022-04-27 15:10:18,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:10:18,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:10:18,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:18,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:10:18,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:18,109 INFO L290 TraceCheckUtils]: 0: Hoare triple {3078#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {3072#true} is VALID [2022-04-27 15:10:18,109 INFO L290 TraceCheckUtils]: 1: Hoare triple {3072#true} assume true; {3072#true} is VALID [2022-04-27 15:10:18,109 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3072#true} {3072#true} #132#return; {3072#true} is VALID [2022-04-27 15:10:18,110 INFO L272 TraceCheckUtils]: 0: Hoare triple {3072#true} call ULTIMATE.init(); {3078#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:10:18,110 INFO L290 TraceCheckUtils]: 1: Hoare triple {3078#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {3072#true} is VALID [2022-04-27 15:10:18,110 INFO L290 TraceCheckUtils]: 2: Hoare triple {3072#true} assume true; {3072#true} is VALID [2022-04-27 15:10:18,110 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3072#true} {3072#true} #132#return; {3072#true} is VALID [2022-04-27 15:10:18,110 INFO L272 TraceCheckUtils]: 4: Hoare triple {3072#true} call #t~ret11 := main(); {3072#true} is VALID [2022-04-27 15:10:18,110 INFO L290 TraceCheckUtils]: 5: Hoare triple {3072#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;havoc ~cond~0; {3072#true} is VALID [2022-04-27 15:10:18,110 INFO L290 TraceCheckUtils]: 6: Hoare triple {3072#true} assume !false;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~cond~0 := #t~nondet10;havoc #t~nondet10; {3072#true} is VALID [2022-04-27 15:10:18,110 INFO L290 TraceCheckUtils]: 7: Hoare triple {3072#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0; {3072#true} is VALID [2022-04-27 15:10:18,110 INFO L290 TraceCheckUtils]: 8: Hoare triple {3072#true} assume !(0 != ~p1~0); {3072#true} is VALID [2022-04-27 15:10:18,110 INFO L290 TraceCheckUtils]: 9: Hoare triple {3072#true} assume !(0 != ~p2~0); {3072#true} is VALID [2022-04-27 15:10:18,111 INFO L290 TraceCheckUtils]: 10: Hoare triple {3072#true} assume 0 != ~p3~0;~lk3~0 := 1; {3077#(not (= main_~p3~0 0))} is VALID [2022-04-27 15:10:18,111 INFO L290 TraceCheckUtils]: 11: Hoare triple {3077#(not (= main_~p3~0 0))} assume 0 != ~p4~0;~lk4~0 := 1; {3077#(not (= main_~p3~0 0))} is VALID [2022-04-27 15:10:18,111 INFO L290 TraceCheckUtils]: 12: Hoare triple {3077#(not (= main_~p3~0 0))} assume 0 != ~p5~0;~lk5~0 := 1; {3077#(not (= main_~p3~0 0))} is VALID [2022-04-27 15:10:18,111 INFO L290 TraceCheckUtils]: 13: Hoare triple {3077#(not (= main_~p3~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {3077#(not (= main_~p3~0 0))} is VALID [2022-04-27 15:10:18,112 INFO L290 TraceCheckUtils]: 14: Hoare triple {3077#(not (= main_~p3~0 0))} assume !(0 != ~p1~0); {3077#(not (= main_~p3~0 0))} is VALID [2022-04-27 15:10:18,112 INFO L290 TraceCheckUtils]: 15: Hoare triple {3077#(not (= main_~p3~0 0))} assume !(0 != ~p2~0); {3077#(not (= main_~p3~0 0))} is VALID [2022-04-27 15:10:18,112 INFO L290 TraceCheckUtils]: 16: Hoare triple {3077#(not (= main_~p3~0 0))} assume !(0 != ~p3~0); {3073#false} is VALID [2022-04-27 15:10:18,112 INFO L290 TraceCheckUtils]: 17: Hoare triple {3073#false} assume 0 != ~p4~0; {3073#false} is VALID [2022-04-27 15:10:18,112 INFO L290 TraceCheckUtils]: 18: Hoare triple {3073#false} assume 1 != ~lk4~0; {3073#false} is VALID [2022-04-27 15:10:18,112 INFO L290 TraceCheckUtils]: 19: Hoare triple {3073#false} assume !false; {3073#false} is VALID [2022-04-27 15:10:18,112 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:18,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:10:18,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981262151] [2022-04-27 15:10:18,113 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981262151] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:10:18,113 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:10:18,113 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:10:18,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067223545] [2022-04-27 15:10:18,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:10:18,113 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-27 15:10:18,113 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:10:18,113 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:18,124 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:18,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:10:18,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:10:18,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:10:18,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:10:18,125 INFO L87 Difference]: Start difference. First operand 159 states and 247 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:18,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:18,237 INFO L93 Difference]: Finished difference Result 241 states and 373 transitions. [2022-04-27 15:10:18,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:10:18,237 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-27 15:10:18,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:10:18,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:18,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 109 transitions. [2022-04-27 15:10:18,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:18,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 109 transitions. [2022-04-27 15:10:18,239 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 109 transitions. [2022-04-27 15:10:18,303 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 109 edges. 109 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:18,305 INFO L225 Difference]: With dead ends: 241 [2022-04-27 15:10:18,305 INFO L226 Difference]: Without dead ends: 167 [2022-04-27 15:10:18,305 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:10:18,306 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 77 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:10:18,306 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 67 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 15:10:18,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2022-04-27 15:10:18,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 165. [2022-04-27 15:10:18,309 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:10:18,310 INFO L82 GeneralOperation]: Start isEquivalent. First operand 167 states. Second operand has 165 states, 161 states have (on average 1.5403726708074534) internal successors, (248), 161 states have internal predecessors, (248), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:18,310 INFO L74 IsIncluded]: Start isIncluded. First operand 167 states. Second operand has 165 states, 161 states have (on average 1.5403726708074534) internal successors, (248), 161 states have internal predecessors, (248), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:18,310 INFO L87 Difference]: Start difference. First operand 167 states. Second operand has 165 states, 161 states have (on average 1.5403726708074534) internal successors, (248), 161 states have internal predecessors, (248), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:18,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:18,313 INFO L93 Difference]: Finished difference Result 167 states and 252 transitions. [2022-04-27 15:10:18,313 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 252 transitions. [2022-04-27 15:10:18,313 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:18,314 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:18,314 INFO L74 IsIncluded]: Start isIncluded. First operand has 165 states, 161 states have (on average 1.5403726708074534) internal successors, (248), 161 states have internal predecessors, (248), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 167 states. [2022-04-27 15:10:18,314 INFO L87 Difference]: Start difference. First operand has 165 states, 161 states have (on average 1.5403726708074534) internal successors, (248), 161 states have internal predecessors, (248), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 167 states. [2022-04-27 15:10:18,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:18,317 INFO L93 Difference]: Finished difference Result 167 states and 252 transitions. [2022-04-27 15:10:18,317 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 252 transitions. [2022-04-27 15:10:18,317 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:18,317 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:18,317 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:10:18,317 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:10:18,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 161 states have (on average 1.5403726708074534) internal successors, (248), 161 states have internal predecessors, (248), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:18,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 251 transitions. [2022-04-27 15:10:18,321 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 251 transitions. Word has length 20 [2022-04-27 15:10:18,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:10:18,321 INFO L495 AbstractCegarLoop]: Abstraction has 165 states and 251 transitions. [2022-04-27 15:10:18,321 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:18,322 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 251 transitions. [2022-04-27 15:10:18,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-27 15:10:18,322 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:10:18,322 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:10:18,322 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-27 15:10:18,322 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:10:18,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:10:18,322 INFO L85 PathProgramCache]: Analyzing trace with hash 2109972711, now seen corresponding path program 1 times [2022-04-27 15:10:18,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:10:18,323 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768546380] [2022-04-27 15:10:18,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:10:18,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:10:18,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:18,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:10:18,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:18,351 INFO L290 TraceCheckUtils]: 0: Hoare triple {3864#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {3858#true} is VALID [2022-04-27 15:10:18,351 INFO L290 TraceCheckUtils]: 1: Hoare triple {3858#true} assume true; {3858#true} is VALID [2022-04-27 15:10:18,351 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3858#true} {3858#true} #132#return; {3858#true} is VALID [2022-04-27 15:10:18,352 INFO L272 TraceCheckUtils]: 0: Hoare triple {3858#true} call ULTIMATE.init(); {3864#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:10:18,352 INFO L290 TraceCheckUtils]: 1: Hoare triple {3864#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {3858#true} is VALID [2022-04-27 15:10:18,352 INFO L290 TraceCheckUtils]: 2: Hoare triple {3858#true} assume true; {3858#true} is VALID [2022-04-27 15:10:18,352 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3858#true} {3858#true} #132#return; {3858#true} is VALID [2022-04-27 15:10:18,352 INFO L272 TraceCheckUtils]: 4: Hoare triple {3858#true} call #t~ret11 := main(); {3858#true} is VALID [2022-04-27 15:10:18,352 INFO L290 TraceCheckUtils]: 5: Hoare triple {3858#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;havoc ~cond~0; {3858#true} is VALID [2022-04-27 15:10:18,352 INFO L290 TraceCheckUtils]: 6: Hoare triple {3858#true} assume !false;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~cond~0 := #t~nondet10;havoc #t~nondet10; {3858#true} is VALID [2022-04-27 15:10:18,352 INFO L290 TraceCheckUtils]: 7: Hoare triple {3858#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0; {3858#true} is VALID [2022-04-27 15:10:18,352 INFO L290 TraceCheckUtils]: 8: Hoare triple {3858#true} assume !(0 != ~p1~0); {3858#true} is VALID [2022-04-27 15:10:18,352 INFO L290 TraceCheckUtils]: 9: Hoare triple {3858#true} assume !(0 != ~p2~0); {3858#true} is VALID [2022-04-27 15:10:18,352 INFO L290 TraceCheckUtils]: 10: Hoare triple {3858#true} assume !(0 != ~p3~0); {3858#true} is VALID [2022-04-27 15:10:18,359 INFO L290 TraceCheckUtils]: 11: Hoare triple {3858#true} assume 0 != ~p4~0;~lk4~0 := 1; {3863#(= main_~lk4~0 1)} is VALID [2022-04-27 15:10:18,359 INFO L290 TraceCheckUtils]: 12: Hoare triple {3863#(= main_~lk4~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {3863#(= main_~lk4~0 1)} is VALID [2022-04-27 15:10:18,360 INFO L290 TraceCheckUtils]: 13: Hoare triple {3863#(= main_~lk4~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {3863#(= main_~lk4~0 1)} is VALID [2022-04-27 15:10:18,360 INFO L290 TraceCheckUtils]: 14: Hoare triple {3863#(= main_~lk4~0 1)} assume !(0 != ~p1~0); {3863#(= main_~lk4~0 1)} is VALID [2022-04-27 15:10:18,360 INFO L290 TraceCheckUtils]: 15: Hoare triple {3863#(= main_~lk4~0 1)} assume !(0 != ~p2~0); {3863#(= main_~lk4~0 1)} is VALID [2022-04-27 15:10:18,360 INFO L290 TraceCheckUtils]: 16: Hoare triple {3863#(= main_~lk4~0 1)} assume !(0 != ~p3~0); {3863#(= main_~lk4~0 1)} is VALID [2022-04-27 15:10:18,361 INFO L290 TraceCheckUtils]: 17: Hoare triple {3863#(= main_~lk4~0 1)} assume 0 != ~p4~0; {3863#(= main_~lk4~0 1)} is VALID [2022-04-27 15:10:18,361 INFO L290 TraceCheckUtils]: 18: Hoare triple {3863#(= main_~lk4~0 1)} assume 1 != ~lk4~0; {3859#false} is VALID [2022-04-27 15:10:18,361 INFO L290 TraceCheckUtils]: 19: Hoare triple {3859#false} assume !false; {3859#false} is VALID [2022-04-27 15:10:18,361 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:18,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:10:18,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768546380] [2022-04-27 15:10:18,361 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768546380] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:10:18,362 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:10:18,362 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:10:18,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581928559] [2022-04-27 15:10:18,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:10:18,362 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-27 15:10:18,362 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:10:18,362 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:18,373 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:18,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:10:18,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:10:18,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:10:18,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:10:18,373 INFO L87 Difference]: Start difference. First operand 165 states and 251 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:18,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:18,454 INFO L93 Difference]: Finished difference Result 285 states and 437 transitions. [2022-04-27 15:10:18,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:10:18,454 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-27 15:10:18,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:10:18,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:18,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 71 transitions. [2022-04-27 15:10:18,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:18,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 71 transitions. [2022-04-27 15:10:18,456 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 71 transitions. [2022-04-27 15:10:18,496 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:18,499 INFO L225 Difference]: With dead ends: 285 [2022-04-27 15:10:18,499 INFO L226 Difference]: Without dead ends: 283 [2022-04-27 15:10:18,499 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:18,500 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 79 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:10:18,500 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 51 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 15:10:18,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2022-04-27 15:10:18,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 233. [2022-04-27 15:10:18,504 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:10:18,505 INFO L82 GeneralOperation]: Start isEquivalent. First operand 283 states. Second operand has 233 states, 229 states have (on average 1.502183406113537) internal successors, (344), 229 states have internal predecessors, (344), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:18,505 INFO L74 IsIncluded]: Start isIncluded. First operand 283 states. Second operand has 233 states, 229 states have (on average 1.502183406113537) internal successors, (344), 229 states have internal predecessors, (344), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:18,505 INFO L87 Difference]: Start difference. First operand 283 states. Second operand has 233 states, 229 states have (on average 1.502183406113537) internal successors, (344), 229 states have internal predecessors, (344), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:18,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:18,510 INFO L93 Difference]: Finished difference Result 283 states and 428 transitions. [2022-04-27 15:10:18,510 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 428 transitions. [2022-04-27 15:10:18,510 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:18,510 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:18,510 INFO L74 IsIncluded]: Start isIncluded. First operand has 233 states, 229 states have (on average 1.502183406113537) internal successors, (344), 229 states have internal predecessors, (344), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 283 states. [2022-04-27 15:10:18,511 INFO L87 Difference]: Start difference. First operand has 233 states, 229 states have (on average 1.502183406113537) internal successors, (344), 229 states have internal predecessors, (344), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 283 states. [2022-04-27 15:10:18,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:18,515 INFO L93 Difference]: Finished difference Result 283 states and 428 transitions. [2022-04-27 15:10:18,515 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 428 transitions. [2022-04-27 15:10:18,515 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:18,515 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:18,515 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:10:18,515 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:10:18,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 229 states have (on average 1.502183406113537) internal successors, (344), 229 states have internal predecessors, (344), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:18,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 347 transitions. [2022-04-27 15:10:18,519 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 347 transitions. Word has length 20 [2022-04-27 15:10:18,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:10:18,519 INFO L495 AbstractCegarLoop]: Abstraction has 233 states and 347 transitions. [2022-04-27 15:10:18,519 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:18,519 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 347 transitions. [2022-04-27 15:10:18,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-27 15:10:18,520 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:10:18,520 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:10:18,520 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-27 15:10:18,520 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:10:18,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:10:18,520 INFO L85 PathProgramCache]: Analyzing trace with hash -1504936215, now seen corresponding path program 1 times [2022-04-27 15:10:18,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:10:18,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158386920] [2022-04-27 15:10:18,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:10:18,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:10:18,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:18,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:10:18,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:18,553 INFO L290 TraceCheckUtils]: 0: Hoare triple {4998#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {4992#true} is VALID [2022-04-27 15:10:18,553 INFO L290 TraceCheckUtils]: 1: Hoare triple {4992#true} assume true; {4992#true} is VALID [2022-04-27 15:10:18,553 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4992#true} {4992#true} #132#return; {4992#true} is VALID [2022-04-27 15:10:18,555 INFO L272 TraceCheckUtils]: 0: Hoare triple {4992#true} call ULTIMATE.init(); {4998#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:10:18,555 INFO L290 TraceCheckUtils]: 1: Hoare triple {4998#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {4992#true} is VALID [2022-04-27 15:10:18,555 INFO L290 TraceCheckUtils]: 2: Hoare triple {4992#true} assume true; {4992#true} is VALID [2022-04-27 15:10:18,555 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4992#true} {4992#true} #132#return; {4992#true} is VALID [2022-04-27 15:10:18,557 INFO L272 TraceCheckUtils]: 4: Hoare triple {4992#true} call #t~ret11 := main(); {4992#true} is VALID [2022-04-27 15:10:18,557 INFO L290 TraceCheckUtils]: 5: Hoare triple {4992#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;havoc ~cond~0; {4992#true} is VALID [2022-04-27 15:10:18,557 INFO L290 TraceCheckUtils]: 6: Hoare triple {4992#true} assume !false;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~cond~0 := #t~nondet10;havoc #t~nondet10; {4992#true} is VALID [2022-04-27 15:10:18,558 INFO L290 TraceCheckUtils]: 7: Hoare triple {4992#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0; {4992#true} is VALID [2022-04-27 15:10:18,558 INFO L290 TraceCheckUtils]: 8: Hoare triple {4992#true} assume !(0 != ~p1~0); {4992#true} is VALID [2022-04-27 15:10:18,558 INFO L290 TraceCheckUtils]: 9: Hoare triple {4992#true} assume !(0 != ~p2~0); {4992#true} is VALID [2022-04-27 15:10:18,558 INFO L290 TraceCheckUtils]: 10: Hoare triple {4992#true} assume !(0 != ~p3~0); {4992#true} is VALID [2022-04-27 15:10:18,558 INFO L290 TraceCheckUtils]: 11: Hoare triple {4992#true} assume !(0 != ~p4~0); {4997#(= main_~p4~0 0)} is VALID [2022-04-27 15:10:18,558 INFO L290 TraceCheckUtils]: 12: Hoare triple {4997#(= main_~p4~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {4997#(= main_~p4~0 0)} is VALID [2022-04-27 15:10:18,558 INFO L290 TraceCheckUtils]: 13: Hoare triple {4997#(= main_~p4~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {4997#(= main_~p4~0 0)} is VALID [2022-04-27 15:10:18,559 INFO L290 TraceCheckUtils]: 14: Hoare triple {4997#(= main_~p4~0 0)} assume !(0 != ~p1~0); {4997#(= main_~p4~0 0)} is VALID [2022-04-27 15:10:18,559 INFO L290 TraceCheckUtils]: 15: Hoare triple {4997#(= main_~p4~0 0)} assume !(0 != ~p2~0); {4997#(= main_~p4~0 0)} is VALID [2022-04-27 15:10:18,559 INFO L290 TraceCheckUtils]: 16: Hoare triple {4997#(= main_~p4~0 0)} assume !(0 != ~p3~0); {4997#(= main_~p4~0 0)} is VALID [2022-04-27 15:10:18,559 INFO L290 TraceCheckUtils]: 17: Hoare triple {4997#(= main_~p4~0 0)} assume 0 != ~p4~0; {4993#false} is VALID [2022-04-27 15:10:18,560 INFO L290 TraceCheckUtils]: 18: Hoare triple {4993#false} assume 1 != ~lk4~0; {4993#false} is VALID [2022-04-27 15:10:18,560 INFO L290 TraceCheckUtils]: 19: Hoare triple {4993#false} assume !false; {4993#false} is VALID [2022-04-27 15:10:18,560 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:18,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:10:18,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158386920] [2022-04-27 15:10:18,560 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158386920] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:10:18,560 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:10:18,560 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:10:18,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855841856] [2022-04-27 15:10:18,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:10:18,561 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-27 15:10:18,561 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:10:18,561 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:18,571 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:18,571 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:10:18,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:10:18,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:10:18,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:10:18,571 INFO L87 Difference]: Start difference. First operand 233 states and 347 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:18,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:18,674 INFO L93 Difference]: Finished difference Result 525 states and 781 transitions. [2022-04-27 15:10:18,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:10:18,674 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-27 15:10:18,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:10:18,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:18,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 111 transitions. [2022-04-27 15:10:18,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:18,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 111 transitions. [2022-04-27 15:10:18,676 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 111 transitions. [2022-04-27 15:10:18,736 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:18,739 INFO L225 Difference]: With dead ends: 525 [2022-04-27 15:10:18,740 INFO L226 Difference]: Without dead ends: 307 [2022-04-27 15:10:18,740 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:18,741 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 70 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:10:18,741 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 69 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 15:10:18,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2022-04-27 15:10:18,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 305. [2022-04-27 15:10:18,746 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:10:18,747 INFO L82 GeneralOperation]: Start isEquivalent. First operand 307 states. Second operand has 305 states, 301 states have (on average 1.4485049833887043) internal successors, (436), 301 states have internal predecessors, (436), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:18,747 INFO L74 IsIncluded]: Start isIncluded. First operand 307 states. Second operand has 305 states, 301 states have (on average 1.4485049833887043) internal successors, (436), 301 states have internal predecessors, (436), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:18,747 INFO L87 Difference]: Start difference. First operand 307 states. Second operand has 305 states, 301 states have (on average 1.4485049833887043) internal successors, (436), 301 states have internal predecessors, (436), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:18,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:18,752 INFO L93 Difference]: Finished difference Result 307 states and 440 transitions. [2022-04-27 15:10:18,752 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 440 transitions. [2022-04-27 15:10:18,752 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:18,752 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:18,753 INFO L74 IsIncluded]: Start isIncluded. First operand has 305 states, 301 states have (on average 1.4485049833887043) internal successors, (436), 301 states have internal predecessors, (436), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 307 states. [2022-04-27 15:10:18,753 INFO L87 Difference]: Start difference. First operand has 305 states, 301 states have (on average 1.4485049833887043) internal successors, (436), 301 states have internal predecessors, (436), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 307 states. [2022-04-27 15:10:18,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:18,757 INFO L93 Difference]: Finished difference Result 307 states and 440 transitions. [2022-04-27 15:10:18,758 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 440 transitions. [2022-04-27 15:10:18,758 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:18,758 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:18,758 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:10:18,758 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:10:18,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 301 states have (on average 1.4485049833887043) internal successors, (436), 301 states have internal predecessors, (436), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:18,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 439 transitions. [2022-04-27 15:10:18,763 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 439 transitions. Word has length 20 [2022-04-27 15:10:18,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:10:18,763 INFO L495 AbstractCegarLoop]: Abstraction has 305 states and 439 transitions. [2022-04-27 15:10:18,763 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:18,763 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 439 transitions. [2022-04-27 15:10:18,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-27 15:10:18,763 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:10:18,763 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:10:18,764 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-27 15:10:18,764 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:10:18,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:10:18,764 INFO L85 PathProgramCache]: Analyzing trace with hash 984860303, now seen corresponding path program 1 times [2022-04-27 15:10:18,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:10:18,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809415853] [2022-04-27 15:10:18,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:10:18,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:10:18,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:18,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:10:18,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:18,791 INFO L290 TraceCheckUtils]: 0: Hoare triple {6508#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {6502#true} is VALID [2022-04-27 15:10:18,791 INFO L290 TraceCheckUtils]: 1: Hoare triple {6502#true} assume true; {6502#true} is VALID [2022-04-27 15:10:18,791 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6502#true} {6502#true} #132#return; {6502#true} is VALID [2022-04-27 15:10:18,791 INFO L272 TraceCheckUtils]: 0: Hoare triple {6502#true} call ULTIMATE.init(); {6508#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:10:18,791 INFO L290 TraceCheckUtils]: 1: Hoare triple {6508#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {6502#true} is VALID [2022-04-27 15:10:18,791 INFO L290 TraceCheckUtils]: 2: Hoare triple {6502#true} assume true; {6502#true} is VALID [2022-04-27 15:10:18,791 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6502#true} {6502#true} #132#return; {6502#true} is VALID [2022-04-27 15:10:18,791 INFO L272 TraceCheckUtils]: 4: Hoare triple {6502#true} call #t~ret11 := main(); {6502#true} is VALID [2022-04-27 15:10:18,792 INFO L290 TraceCheckUtils]: 5: Hoare triple {6502#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;havoc ~cond~0; {6502#true} is VALID [2022-04-27 15:10:18,792 INFO L290 TraceCheckUtils]: 6: Hoare triple {6502#true} assume !false;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~cond~0 := #t~nondet10;havoc #t~nondet10; {6502#true} is VALID [2022-04-27 15:10:18,792 INFO L290 TraceCheckUtils]: 7: Hoare triple {6502#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0; {6502#true} is VALID [2022-04-27 15:10:18,792 INFO L290 TraceCheckUtils]: 8: Hoare triple {6502#true} assume !(0 != ~p1~0); {6502#true} is VALID [2022-04-27 15:10:18,793 INFO L290 TraceCheckUtils]: 9: Hoare triple {6502#true} assume !(0 != ~p2~0); {6502#true} is VALID [2022-04-27 15:10:18,793 INFO L290 TraceCheckUtils]: 10: Hoare triple {6502#true} assume !(0 != ~p3~0); {6502#true} is VALID [2022-04-27 15:10:18,793 INFO L290 TraceCheckUtils]: 11: Hoare triple {6502#true} assume 0 != ~p4~0;~lk4~0 := 1; {6507#(not (= main_~p4~0 0))} is VALID [2022-04-27 15:10:18,793 INFO L290 TraceCheckUtils]: 12: Hoare triple {6507#(not (= main_~p4~0 0))} assume 0 != ~p5~0;~lk5~0 := 1; {6507#(not (= main_~p4~0 0))} is VALID [2022-04-27 15:10:18,794 INFO L290 TraceCheckUtils]: 13: Hoare triple {6507#(not (= main_~p4~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {6507#(not (= main_~p4~0 0))} is VALID [2022-04-27 15:10:18,794 INFO L290 TraceCheckUtils]: 14: Hoare triple {6507#(not (= main_~p4~0 0))} assume !(0 != ~p1~0); {6507#(not (= main_~p4~0 0))} is VALID [2022-04-27 15:10:18,795 INFO L290 TraceCheckUtils]: 15: Hoare triple {6507#(not (= main_~p4~0 0))} assume !(0 != ~p2~0); {6507#(not (= main_~p4~0 0))} is VALID [2022-04-27 15:10:18,795 INFO L290 TraceCheckUtils]: 16: Hoare triple {6507#(not (= main_~p4~0 0))} assume !(0 != ~p3~0); {6507#(not (= main_~p4~0 0))} is VALID [2022-04-27 15:10:18,795 INFO L290 TraceCheckUtils]: 17: Hoare triple {6507#(not (= main_~p4~0 0))} assume !(0 != ~p4~0); {6503#false} is VALID [2022-04-27 15:10:18,795 INFO L290 TraceCheckUtils]: 18: Hoare triple {6503#false} assume 0 != ~p5~0; {6503#false} is VALID [2022-04-27 15:10:18,795 INFO L290 TraceCheckUtils]: 19: Hoare triple {6503#false} assume 1 != ~lk5~0; {6503#false} is VALID [2022-04-27 15:10:18,795 INFO L290 TraceCheckUtils]: 20: Hoare triple {6503#false} assume !false; {6503#false} is VALID [2022-04-27 15:10:18,796 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:18,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:10:18,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809415853] [2022-04-27 15:10:18,796 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809415853] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:10:18,796 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:10:18,796 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:10:18,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449580402] [2022-04-27 15:10:18,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:10:18,796 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-27 15:10:18,797 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:10:18,797 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:18,807 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:18,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:10:18,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:10:18,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:10:18,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:10:18,808 INFO L87 Difference]: Start difference. First operand 305 states and 439 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:18,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:18,899 INFO L93 Difference]: Finished difference Result 457 states and 653 transitions. [2022-04-27 15:10:18,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:10:18,899 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-27 15:10:18,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:10:18,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:18,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 106 transitions. [2022-04-27 15:10:18,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:18,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 106 transitions. [2022-04-27 15:10:18,901 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 106 transitions. [2022-04-27 15:10:18,961 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:18,965 INFO L225 Difference]: With dead ends: 457 [2022-04-27 15:10:18,965 INFO L226 Difference]: Without dead ends: 315 [2022-04-27 15:10:18,966 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:18,966 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 76 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:10:18,966 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 64 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 15:10:18,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2022-04-27 15:10:18,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 313. [2022-04-27 15:10:18,972 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:10:18,972 INFO L82 GeneralOperation]: Start isEquivalent. First operand 315 states. Second operand has 313 states, 309 states have (on average 1.4110032362459546) internal successors, (436), 309 states have internal predecessors, (436), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:18,972 INFO L74 IsIncluded]: Start isIncluded. First operand 315 states. Second operand has 313 states, 309 states have (on average 1.4110032362459546) internal successors, (436), 309 states have internal predecessors, (436), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:18,973 INFO L87 Difference]: Start difference. First operand 315 states. Second operand has 313 states, 309 states have (on average 1.4110032362459546) internal successors, (436), 309 states have internal predecessors, (436), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:18,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:18,977 INFO L93 Difference]: Finished difference Result 315 states and 440 transitions. [2022-04-27 15:10:18,977 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 440 transitions. [2022-04-27 15:10:18,978 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:18,978 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:18,978 INFO L74 IsIncluded]: Start isIncluded. First operand has 313 states, 309 states have (on average 1.4110032362459546) internal successors, (436), 309 states have internal predecessors, (436), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 315 states. [2022-04-27 15:10:18,979 INFO L87 Difference]: Start difference. First operand has 313 states, 309 states have (on average 1.4110032362459546) internal successors, (436), 309 states have internal predecessors, (436), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 315 states. [2022-04-27 15:10:18,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:18,990 INFO L93 Difference]: Finished difference Result 315 states and 440 transitions. [2022-04-27 15:10:18,990 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 440 transitions. [2022-04-27 15:10:18,991 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:18,991 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:18,991 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:10:18,991 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:10:18,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 309 states have (on average 1.4110032362459546) internal successors, (436), 309 states have internal predecessors, (436), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:18,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 439 transitions. [2022-04-27 15:10:18,996 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 439 transitions. Word has length 21 [2022-04-27 15:10:18,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:10:18,996 INFO L495 AbstractCegarLoop]: Abstraction has 313 states and 439 transitions. [2022-04-27 15:10:18,996 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:18,996 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 439 transitions. [2022-04-27 15:10:18,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-27 15:10:18,998 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:10:18,998 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:10:18,998 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-27 15:10:18,999 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:10:18,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:10:18,999 INFO L85 PathProgramCache]: Analyzing trace with hash 591833293, now seen corresponding path program 1 times [2022-04-27 15:10:18,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:10:18,999 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291670954] [2022-04-27 15:10:18,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:10:18,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:10:19,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:19,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:10:19,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:19,046 INFO L290 TraceCheckUtils]: 0: Hoare triple {7974#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {7968#true} is VALID [2022-04-27 15:10:19,046 INFO L290 TraceCheckUtils]: 1: Hoare triple {7968#true} assume true; {7968#true} is VALID [2022-04-27 15:10:19,046 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7968#true} {7968#true} #132#return; {7968#true} is VALID [2022-04-27 15:10:19,046 INFO L272 TraceCheckUtils]: 0: Hoare triple {7968#true} call ULTIMATE.init(); {7974#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:10:19,046 INFO L290 TraceCheckUtils]: 1: Hoare triple {7974#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {7968#true} is VALID [2022-04-27 15:10:19,047 INFO L290 TraceCheckUtils]: 2: Hoare triple {7968#true} assume true; {7968#true} is VALID [2022-04-27 15:10:19,047 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7968#true} {7968#true} #132#return; {7968#true} is VALID [2022-04-27 15:10:19,047 INFO L272 TraceCheckUtils]: 4: Hoare triple {7968#true} call #t~ret11 := main(); {7968#true} is VALID [2022-04-27 15:10:19,047 INFO L290 TraceCheckUtils]: 5: Hoare triple {7968#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;havoc ~cond~0; {7968#true} is VALID [2022-04-27 15:10:19,050 INFO L290 TraceCheckUtils]: 6: Hoare triple {7968#true} assume !false;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~cond~0 := #t~nondet10;havoc #t~nondet10; {7968#true} is VALID [2022-04-27 15:10:19,050 INFO L290 TraceCheckUtils]: 7: Hoare triple {7968#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0; {7968#true} is VALID [2022-04-27 15:10:19,059 INFO L290 TraceCheckUtils]: 8: Hoare triple {7968#true} assume !(0 != ~p1~0); {7968#true} is VALID [2022-04-27 15:10:19,059 INFO L290 TraceCheckUtils]: 9: Hoare triple {7968#true} assume !(0 != ~p2~0); {7968#true} is VALID [2022-04-27 15:10:19,059 INFO L290 TraceCheckUtils]: 10: Hoare triple {7968#true} assume !(0 != ~p3~0); {7968#true} is VALID [2022-04-27 15:10:19,059 INFO L290 TraceCheckUtils]: 11: Hoare triple {7968#true} assume !(0 != ~p4~0); {7968#true} is VALID [2022-04-27 15:10:19,067 INFO L290 TraceCheckUtils]: 12: Hoare triple {7968#true} assume 0 != ~p5~0;~lk5~0 := 1; {7973#(= main_~lk5~0 1)} is VALID [2022-04-27 15:10:19,067 INFO L290 TraceCheckUtils]: 13: Hoare triple {7973#(= main_~lk5~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {7973#(= main_~lk5~0 1)} is VALID [2022-04-27 15:10:19,068 INFO L290 TraceCheckUtils]: 14: Hoare triple {7973#(= main_~lk5~0 1)} assume !(0 != ~p1~0); {7973#(= main_~lk5~0 1)} is VALID [2022-04-27 15:10:19,068 INFO L290 TraceCheckUtils]: 15: Hoare triple {7973#(= main_~lk5~0 1)} assume !(0 != ~p2~0); {7973#(= main_~lk5~0 1)} is VALID [2022-04-27 15:10:19,068 INFO L290 TraceCheckUtils]: 16: Hoare triple {7973#(= main_~lk5~0 1)} assume !(0 != ~p3~0); {7973#(= main_~lk5~0 1)} is VALID [2022-04-27 15:10:19,069 INFO L290 TraceCheckUtils]: 17: Hoare triple {7973#(= main_~lk5~0 1)} assume !(0 != ~p4~0); {7973#(= main_~lk5~0 1)} is VALID [2022-04-27 15:10:19,069 INFO L290 TraceCheckUtils]: 18: Hoare triple {7973#(= main_~lk5~0 1)} assume 0 != ~p5~0; {7973#(= main_~lk5~0 1)} is VALID [2022-04-27 15:10:19,069 INFO L290 TraceCheckUtils]: 19: Hoare triple {7973#(= main_~lk5~0 1)} assume 1 != ~lk5~0; {7969#false} is VALID [2022-04-27 15:10:19,069 INFO L290 TraceCheckUtils]: 20: Hoare triple {7969#false} assume !false; {7969#false} is VALID [2022-04-27 15:10:19,069 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:19,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:10:19,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291670954] [2022-04-27 15:10:19,070 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291670954] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:10:19,070 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:10:19,070 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:10:19,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275350600] [2022-04-27 15:10:19,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:10:19,070 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-27 15:10:19,070 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:10:19,070 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:19,080 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:19,081 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:10:19,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:10:19,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:10:19,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:10:19,081 INFO L87 Difference]: Start difference. First operand 313 states and 439 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:19,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:19,164 INFO L93 Difference]: Finished difference Result 525 states and 737 transitions. [2022-04-27 15:10:19,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:10:19,164 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-27 15:10:19,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:10:19,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:19,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 67 transitions. [2022-04-27 15:10:19,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:19,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 67 transitions. [2022-04-27 15:10:19,165 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 67 transitions. [2022-04-27 15:10:19,202 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:19,211 INFO L225 Difference]: With dead ends: 525 [2022-04-27 15:10:19,212 INFO L226 Difference]: Without dead ends: 523 [2022-04-27 15:10:19,212 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:19,212 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 72 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:10:19,212 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 50 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 15:10:19,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2022-04-27 15:10:19,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 457. [2022-04-27 15:10:19,219 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:10:19,220 INFO L82 GeneralOperation]: Start isEquivalent. First operand 523 states. Second operand has 457 states, 453 states have (on average 1.3686534216335542) internal successors, (620), 453 states have internal predecessors, (620), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:19,221 INFO L74 IsIncluded]: Start isIncluded. First operand 523 states. Second operand has 457 states, 453 states have (on average 1.3686534216335542) internal successors, (620), 453 states have internal predecessors, (620), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:19,221 INFO L87 Difference]: Start difference. First operand 523 states. Second operand has 457 states, 453 states have (on average 1.3686534216335542) internal successors, (620), 453 states have internal predecessors, (620), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:19,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:19,230 INFO L93 Difference]: Finished difference Result 523 states and 720 transitions. [2022-04-27 15:10:19,231 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 720 transitions. [2022-04-27 15:10:19,231 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:19,231 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:19,232 INFO L74 IsIncluded]: Start isIncluded. First operand has 457 states, 453 states have (on average 1.3686534216335542) internal successors, (620), 453 states have internal predecessors, (620), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 523 states. [2022-04-27 15:10:19,232 INFO L87 Difference]: Start difference. First operand has 457 states, 453 states have (on average 1.3686534216335542) internal successors, (620), 453 states have internal predecessors, (620), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 523 states. [2022-04-27 15:10:19,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:19,242 INFO L93 Difference]: Finished difference Result 523 states and 720 transitions. [2022-04-27 15:10:19,242 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 720 transitions. [2022-04-27 15:10:19,243 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:19,243 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:19,243 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:10:19,243 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:10:19,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 457 states, 453 states have (on average 1.3686534216335542) internal successors, (620), 453 states have internal predecessors, (620), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:19,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 623 transitions. [2022-04-27 15:10:19,251 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 623 transitions. Word has length 21 [2022-04-27 15:10:19,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:10:19,251 INFO L495 AbstractCegarLoop]: Abstraction has 457 states and 623 transitions. [2022-04-27 15:10:19,251 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:19,251 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 623 transitions. [2022-04-27 15:10:19,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-27 15:10:19,252 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:10:19,252 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:10:19,252 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-27 15:10:19,252 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:10:19,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:10:19,253 INFO L85 PathProgramCache]: Analyzing trace with hash 1271891663, now seen corresponding path program 1 times [2022-04-27 15:10:19,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:10:19,253 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841053496] [2022-04-27 15:10:19,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:10:19,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:10:19,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:19,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:10:19,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:19,280 INFO L290 TraceCheckUtils]: 0: Hoare triple {10076#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {10070#true} is VALID [2022-04-27 15:10:19,280 INFO L290 TraceCheckUtils]: 1: Hoare triple {10070#true} assume true; {10070#true} is VALID [2022-04-27 15:10:19,280 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10070#true} {10070#true} #132#return; {10070#true} is VALID [2022-04-27 15:10:19,281 INFO L272 TraceCheckUtils]: 0: Hoare triple {10070#true} call ULTIMATE.init(); {10076#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:10:19,281 INFO L290 TraceCheckUtils]: 1: Hoare triple {10076#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {10070#true} is VALID [2022-04-27 15:10:19,281 INFO L290 TraceCheckUtils]: 2: Hoare triple {10070#true} assume true; {10070#true} is VALID [2022-04-27 15:10:19,281 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10070#true} {10070#true} #132#return; {10070#true} is VALID [2022-04-27 15:10:19,281 INFO L272 TraceCheckUtils]: 4: Hoare triple {10070#true} call #t~ret11 := main(); {10070#true} is VALID [2022-04-27 15:10:19,281 INFO L290 TraceCheckUtils]: 5: Hoare triple {10070#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;havoc ~cond~0; {10070#true} is VALID [2022-04-27 15:10:19,281 INFO L290 TraceCheckUtils]: 6: Hoare triple {10070#true} assume !false;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~cond~0 := #t~nondet10;havoc #t~nondet10; {10070#true} is VALID [2022-04-27 15:10:19,281 INFO L290 TraceCheckUtils]: 7: Hoare triple {10070#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0; {10070#true} is VALID [2022-04-27 15:10:19,281 INFO L290 TraceCheckUtils]: 8: Hoare triple {10070#true} assume !(0 != ~p1~0); {10070#true} is VALID [2022-04-27 15:10:19,281 INFO L290 TraceCheckUtils]: 9: Hoare triple {10070#true} assume !(0 != ~p2~0); {10070#true} is VALID [2022-04-27 15:10:19,281 INFO L290 TraceCheckUtils]: 10: Hoare triple {10070#true} assume !(0 != ~p3~0); {10070#true} is VALID [2022-04-27 15:10:19,281 INFO L290 TraceCheckUtils]: 11: Hoare triple {10070#true} assume !(0 != ~p4~0); {10070#true} is VALID [2022-04-27 15:10:19,282 INFO L290 TraceCheckUtils]: 12: Hoare triple {10070#true} assume !(0 != ~p5~0); {10075#(= main_~p5~0 0)} is VALID [2022-04-27 15:10:19,282 INFO L290 TraceCheckUtils]: 13: Hoare triple {10075#(= main_~p5~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {10075#(= main_~p5~0 0)} is VALID [2022-04-27 15:10:19,282 INFO L290 TraceCheckUtils]: 14: Hoare triple {10075#(= main_~p5~0 0)} assume !(0 != ~p1~0); {10075#(= main_~p5~0 0)} is VALID [2022-04-27 15:10:19,282 INFO L290 TraceCheckUtils]: 15: Hoare triple {10075#(= main_~p5~0 0)} assume !(0 != ~p2~0); {10075#(= main_~p5~0 0)} is VALID [2022-04-27 15:10:19,283 INFO L290 TraceCheckUtils]: 16: Hoare triple {10075#(= main_~p5~0 0)} assume !(0 != ~p3~0); {10075#(= main_~p5~0 0)} is VALID [2022-04-27 15:10:19,283 INFO L290 TraceCheckUtils]: 17: Hoare triple {10075#(= main_~p5~0 0)} assume !(0 != ~p4~0); {10075#(= main_~p5~0 0)} is VALID [2022-04-27 15:10:19,284 INFO L290 TraceCheckUtils]: 18: Hoare triple {10075#(= main_~p5~0 0)} assume 0 != ~p5~0; {10071#false} is VALID [2022-04-27 15:10:19,284 INFO L290 TraceCheckUtils]: 19: Hoare triple {10071#false} assume 1 != ~lk5~0; {10071#false} is VALID [2022-04-27 15:10:19,284 INFO L290 TraceCheckUtils]: 20: Hoare triple {10071#false} assume !false; {10071#false} is VALID [2022-04-27 15:10:19,284 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:19,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:10:19,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841053496] [2022-04-27 15:10:19,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841053496] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:10:19,284 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:10:19,284 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:10:19,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279527636] [2022-04-27 15:10:19,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:10:19,285 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-27 15:10:19,285 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:10:19,285 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:19,295 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:19,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:10:19,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:10:19,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:10:19,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:10:19,296 INFO L87 Difference]: Start difference. First operand 457 states and 623 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:19,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:19,408 INFO L93 Difference]: Finished difference Result 1021 states and 1377 transitions. [2022-04-27 15:10:19,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:10:19,408 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-27 15:10:19,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:10:19,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:19,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 108 transitions. [2022-04-27 15:10:19,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:19,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 108 transitions. [2022-04-27 15:10:19,410 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 108 transitions. [2022-04-27 15:10:19,468 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:19,479 INFO L225 Difference]: With dead ends: 1021 [2022-04-27 15:10:19,479 INFO L226 Difference]: Without dead ends: 587 [2022-04-27 15:10:19,480 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:19,481 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 64 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:10:19,483 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 71 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 15:10:19,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2022-04-27 15:10:19,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 585. [2022-04-27 15:10:19,493 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:10:19,494 INFO L82 GeneralOperation]: Start isEquivalent. First operand 587 states. Second operand has 585 states, 581 states have (on average 1.3012048192771084) internal successors, (756), 581 states have internal predecessors, (756), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:19,500 INFO L74 IsIncluded]: Start isIncluded. First operand 587 states. Second operand has 585 states, 581 states have (on average 1.3012048192771084) internal successors, (756), 581 states have internal predecessors, (756), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:19,501 INFO L87 Difference]: Start difference. First operand 587 states. Second operand has 585 states, 581 states have (on average 1.3012048192771084) internal successors, (756), 581 states have internal predecessors, (756), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:19,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:19,512 INFO L93 Difference]: Finished difference Result 587 states and 760 transitions. [2022-04-27 15:10:19,512 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 760 transitions. [2022-04-27 15:10:19,513 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:19,513 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:19,513 INFO L74 IsIncluded]: Start isIncluded. First operand has 585 states, 581 states have (on average 1.3012048192771084) internal successors, (756), 581 states have internal predecessors, (756), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 587 states. [2022-04-27 15:10:19,514 INFO L87 Difference]: Start difference. First operand has 585 states, 581 states have (on average 1.3012048192771084) internal successors, (756), 581 states have internal predecessors, (756), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 587 states. [2022-04-27 15:10:19,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:19,525 INFO L93 Difference]: Finished difference Result 587 states and 760 transitions. [2022-04-27 15:10:19,525 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 760 transitions. [2022-04-27 15:10:19,526 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:19,526 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:19,526 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:10:19,526 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:10:19,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 585 states, 581 states have (on average 1.3012048192771084) internal successors, (756), 581 states have internal predecessors, (756), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:19,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 759 transitions. [2022-04-27 15:10:19,538 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 759 transitions. Word has length 21 [2022-04-27 15:10:19,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:10:19,538 INFO L495 AbstractCegarLoop]: Abstraction has 585 states and 759 transitions. [2022-04-27 15:10:19,538 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:19,539 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 759 transitions. [2022-04-27 15:10:19,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-27 15:10:19,540 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:10:19,540 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:10:19,540 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-27 15:10:19,540 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:10:19,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:10:19,540 INFO L85 PathProgramCache]: Analyzing trace with hash 1167178942, now seen corresponding path program 1 times [2022-04-27 15:10:19,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:10:19,541 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506691738] [2022-04-27 15:10:19,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:10:19,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:10:19,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:19,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:10:19,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:19,569 INFO L290 TraceCheckUtils]: 0: Hoare triple {12962#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {12956#true} is VALID [2022-04-27 15:10:19,569 INFO L290 TraceCheckUtils]: 1: Hoare triple {12956#true} assume true; {12956#true} is VALID [2022-04-27 15:10:19,569 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12956#true} {12956#true} #132#return; {12956#true} is VALID [2022-04-27 15:10:19,569 INFO L272 TraceCheckUtils]: 0: Hoare triple {12956#true} call ULTIMATE.init(); {12962#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:10:19,569 INFO L290 TraceCheckUtils]: 1: Hoare triple {12962#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {12956#true} is VALID [2022-04-27 15:10:19,569 INFO L290 TraceCheckUtils]: 2: Hoare triple {12956#true} assume true; {12956#true} is VALID [2022-04-27 15:10:19,569 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12956#true} {12956#true} #132#return; {12956#true} is VALID [2022-04-27 15:10:19,570 INFO L272 TraceCheckUtils]: 4: Hoare triple {12956#true} call #t~ret11 := main(); {12956#true} is VALID [2022-04-27 15:10:19,570 INFO L290 TraceCheckUtils]: 5: Hoare triple {12956#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;havoc ~cond~0; {12956#true} is VALID [2022-04-27 15:10:19,570 INFO L290 TraceCheckUtils]: 6: Hoare triple {12956#true} assume !false;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~cond~0 := #t~nondet10;havoc #t~nondet10; {12956#true} is VALID [2022-04-27 15:10:19,570 INFO L290 TraceCheckUtils]: 7: Hoare triple {12956#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0; {12956#true} is VALID [2022-04-27 15:10:19,570 INFO L290 TraceCheckUtils]: 8: Hoare triple {12956#true} assume !(0 != ~p1~0); {12956#true} is VALID [2022-04-27 15:10:19,570 INFO L290 TraceCheckUtils]: 9: Hoare triple {12956#true} assume !(0 != ~p2~0); {12956#true} is VALID [2022-04-27 15:10:19,570 INFO L290 TraceCheckUtils]: 10: Hoare triple {12956#true} assume !(0 != ~p3~0); {12956#true} is VALID [2022-04-27 15:10:19,570 INFO L290 TraceCheckUtils]: 11: Hoare triple {12956#true} assume !(0 != ~p4~0); {12956#true} is VALID [2022-04-27 15:10:19,570 INFO L290 TraceCheckUtils]: 12: Hoare triple {12956#true} assume 0 != ~p5~0;~lk5~0 := 1; {12961#(not (= main_~p5~0 0))} is VALID [2022-04-27 15:10:19,570 INFO L290 TraceCheckUtils]: 13: Hoare triple {12961#(not (= main_~p5~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {12961#(not (= main_~p5~0 0))} is VALID [2022-04-27 15:10:19,571 INFO L290 TraceCheckUtils]: 14: Hoare triple {12961#(not (= main_~p5~0 0))} assume !(0 != ~p1~0); {12961#(not (= main_~p5~0 0))} is VALID [2022-04-27 15:10:19,571 INFO L290 TraceCheckUtils]: 15: Hoare triple {12961#(not (= main_~p5~0 0))} assume !(0 != ~p2~0); {12961#(not (= main_~p5~0 0))} is VALID [2022-04-27 15:10:19,571 INFO L290 TraceCheckUtils]: 16: Hoare triple {12961#(not (= main_~p5~0 0))} assume !(0 != ~p3~0); {12961#(not (= main_~p5~0 0))} is VALID [2022-04-27 15:10:19,571 INFO L290 TraceCheckUtils]: 17: Hoare triple {12961#(not (= main_~p5~0 0))} assume !(0 != ~p4~0); {12961#(not (= main_~p5~0 0))} is VALID [2022-04-27 15:10:19,572 INFO L290 TraceCheckUtils]: 18: Hoare triple {12961#(not (= main_~p5~0 0))} assume !(0 != ~p5~0); {12957#false} is VALID [2022-04-27 15:10:19,572 INFO L290 TraceCheckUtils]: 19: Hoare triple {12957#false} assume 0 != ~p6~0; {12957#false} is VALID [2022-04-27 15:10:19,573 INFO L290 TraceCheckUtils]: 20: Hoare triple {12957#false} assume 1 != ~lk6~0; {12957#false} is VALID [2022-04-27 15:10:19,573 INFO L290 TraceCheckUtils]: 21: Hoare triple {12957#false} assume !false; {12957#false} is VALID [2022-04-27 15:10:19,574 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:19,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:10:19,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506691738] [2022-04-27 15:10:19,574 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506691738] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:10:19,574 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:10:19,574 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:10:19,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971541105] [2022-04-27 15:10:19,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:10:19,578 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-27 15:10:19,578 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:10:19,578 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:19,589 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:19,589 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:10:19,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:10:19,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:10:19,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:10:19,589 INFO L87 Difference]: Start difference. First operand 585 states and 759 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:19,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:19,686 INFO L93 Difference]: Finished difference Result 877 states and 1129 transitions. [2022-04-27 15:10:19,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:10:19,686 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-27 15:10:19,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:10:19,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:19,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 103 transitions. [2022-04-27 15:10:19,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:19,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 103 transitions. [2022-04-27 15:10:19,688 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 103 transitions. [2022-04-27 15:10:19,743 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:19,755 INFO L225 Difference]: With dead ends: 877 [2022-04-27 15:10:19,755 INFO L226 Difference]: Without dead ends: 603 [2022-04-27 15:10:19,755 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:19,756 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 75 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:10:19,756 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 61 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 15:10:19,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2022-04-27 15:10:19,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 601. [2022-04-27 15:10:19,766 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:10:19,767 INFO L82 GeneralOperation]: Start isEquivalent. First operand 603 states. Second operand has 601 states, 597 states have (on average 1.2663316582914572) internal successors, (756), 597 states have internal predecessors, (756), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:19,767 INFO L74 IsIncluded]: Start isIncluded. First operand 603 states. Second operand has 601 states, 597 states have (on average 1.2663316582914572) internal successors, (756), 597 states have internal predecessors, (756), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:19,768 INFO L87 Difference]: Start difference. First operand 603 states. Second operand has 601 states, 597 states have (on average 1.2663316582914572) internal successors, (756), 597 states have internal predecessors, (756), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:19,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:19,780 INFO L93 Difference]: Finished difference Result 603 states and 760 transitions. [2022-04-27 15:10:19,780 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 760 transitions. [2022-04-27 15:10:19,781 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:19,781 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:19,782 INFO L74 IsIncluded]: Start isIncluded. First operand has 601 states, 597 states have (on average 1.2663316582914572) internal successors, (756), 597 states have internal predecessors, (756), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 603 states. [2022-04-27 15:10:19,782 INFO L87 Difference]: Start difference. First operand has 601 states, 597 states have (on average 1.2663316582914572) internal successors, (756), 597 states have internal predecessors, (756), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 603 states. [2022-04-27 15:10:19,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:19,794 INFO L93 Difference]: Finished difference Result 603 states and 760 transitions. [2022-04-27 15:10:19,794 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 760 transitions. [2022-04-27 15:10:19,795 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:19,795 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:19,795 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:10:19,795 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:10:19,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 601 states, 597 states have (on average 1.2663316582914572) internal successors, (756), 597 states have internal predecessors, (756), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:19,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 759 transitions. [2022-04-27 15:10:19,807 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 759 transitions. Word has length 22 [2022-04-27 15:10:19,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:10:19,807 INFO L495 AbstractCegarLoop]: Abstraction has 601 states and 759 transitions. [2022-04-27 15:10:19,807 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:19,808 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 759 transitions. [2022-04-27 15:10:19,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-27 15:10:19,808 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:10:19,808 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:10:19,808 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-27 15:10:19,808 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:10:19,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:10:19,809 INFO L85 PathProgramCache]: Analyzing trace with hash 774151932, now seen corresponding path program 1 times [2022-04-27 15:10:19,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:10:19,809 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367729925] [2022-04-27 15:10:19,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:10:19,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:10:19,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:19,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:10:19,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:19,846 INFO L290 TraceCheckUtils]: 0: Hoare triple {15752#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {15746#true} is VALID [2022-04-27 15:10:19,847 INFO L290 TraceCheckUtils]: 1: Hoare triple {15746#true} assume true; {15746#true} is VALID [2022-04-27 15:10:19,847 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {15746#true} {15746#true} #132#return; {15746#true} is VALID [2022-04-27 15:10:19,847 INFO L272 TraceCheckUtils]: 0: Hoare triple {15746#true} call ULTIMATE.init(); {15752#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:10:19,847 INFO L290 TraceCheckUtils]: 1: Hoare triple {15752#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {15746#true} is VALID [2022-04-27 15:10:19,847 INFO L290 TraceCheckUtils]: 2: Hoare triple {15746#true} assume true; {15746#true} is VALID [2022-04-27 15:10:19,847 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15746#true} {15746#true} #132#return; {15746#true} is VALID [2022-04-27 15:10:19,848 INFO L272 TraceCheckUtils]: 4: Hoare triple {15746#true} call #t~ret11 := main(); {15746#true} is VALID [2022-04-27 15:10:19,848 INFO L290 TraceCheckUtils]: 5: Hoare triple {15746#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;havoc ~cond~0; {15746#true} is VALID [2022-04-27 15:10:19,848 INFO L290 TraceCheckUtils]: 6: Hoare triple {15746#true} assume !false;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~cond~0 := #t~nondet10;havoc #t~nondet10; {15746#true} is VALID [2022-04-27 15:10:19,848 INFO L290 TraceCheckUtils]: 7: Hoare triple {15746#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0; {15746#true} is VALID [2022-04-27 15:10:19,848 INFO L290 TraceCheckUtils]: 8: Hoare triple {15746#true} assume !(0 != ~p1~0); {15746#true} is VALID [2022-04-27 15:10:19,848 INFO L290 TraceCheckUtils]: 9: Hoare triple {15746#true} assume !(0 != ~p2~0); {15746#true} is VALID [2022-04-27 15:10:19,848 INFO L290 TraceCheckUtils]: 10: Hoare triple {15746#true} assume !(0 != ~p3~0); {15746#true} is VALID [2022-04-27 15:10:19,848 INFO L290 TraceCheckUtils]: 11: Hoare triple {15746#true} assume !(0 != ~p4~0); {15746#true} is VALID [2022-04-27 15:10:19,848 INFO L290 TraceCheckUtils]: 12: Hoare triple {15746#true} assume !(0 != ~p5~0); {15746#true} is VALID [2022-04-27 15:10:19,848 INFO L290 TraceCheckUtils]: 13: Hoare triple {15746#true} assume 0 != ~p6~0;~lk6~0 := 1; {15751#(= main_~lk6~0 1)} is VALID [2022-04-27 15:10:19,848 INFO L290 TraceCheckUtils]: 14: Hoare triple {15751#(= main_~lk6~0 1)} assume !(0 != ~p1~0); {15751#(= main_~lk6~0 1)} is VALID [2022-04-27 15:10:19,849 INFO L290 TraceCheckUtils]: 15: Hoare triple {15751#(= main_~lk6~0 1)} assume !(0 != ~p2~0); {15751#(= main_~lk6~0 1)} is VALID [2022-04-27 15:10:19,853 INFO L290 TraceCheckUtils]: 16: Hoare triple {15751#(= main_~lk6~0 1)} assume !(0 != ~p3~0); {15751#(= main_~lk6~0 1)} is VALID [2022-04-27 15:10:19,853 INFO L290 TraceCheckUtils]: 17: Hoare triple {15751#(= main_~lk6~0 1)} assume !(0 != ~p4~0); {15751#(= main_~lk6~0 1)} is VALID [2022-04-27 15:10:19,854 INFO L290 TraceCheckUtils]: 18: Hoare triple {15751#(= main_~lk6~0 1)} assume !(0 != ~p5~0); {15751#(= main_~lk6~0 1)} is VALID [2022-04-27 15:10:19,854 INFO L290 TraceCheckUtils]: 19: Hoare triple {15751#(= main_~lk6~0 1)} assume 0 != ~p6~0; {15751#(= main_~lk6~0 1)} is VALID [2022-04-27 15:10:19,854 INFO L290 TraceCheckUtils]: 20: Hoare triple {15751#(= main_~lk6~0 1)} assume 1 != ~lk6~0; {15747#false} is VALID [2022-04-27 15:10:19,854 INFO L290 TraceCheckUtils]: 21: Hoare triple {15747#false} assume !false; {15747#false} is VALID [2022-04-27 15:10:19,854 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:19,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:10:19,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367729925] [2022-04-27 15:10:19,854 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367729925] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:10:19,855 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:10:19,855 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:10:19,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315168032] [2022-04-27 15:10:19,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:10:19,855 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-27 15:10:19,855 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:10:19,855 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:19,866 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:19,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:10:19,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:10:19,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:10:19,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:10:19,867 INFO L87 Difference]: Start difference. First operand 601 states and 759 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:19,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:19,967 INFO L93 Difference]: Finished difference Result 971 states and 1208 transitions. [2022-04-27 15:10:19,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:10:19,967 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-27 15:10:19,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:10:19,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:19,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 62 transitions. [2022-04-27 15:10:19,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:19,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 62 transitions. [2022-04-27 15:10:19,970 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 62 transitions. [2022-04-27 15:10:20,013 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:20,041 INFO L225 Difference]: With dead ends: 971 [2022-04-27 15:10:20,041 INFO L226 Difference]: Without dead ends: 969 [2022-04-27 15:10:20,042 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:20,043 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 64 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:10:20,044 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 48 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 15:10:20,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 969 states. [2022-04-27 15:10:20,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 969 to 905. [2022-04-27 15:10:20,056 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:10:20,058 INFO L82 GeneralOperation]: Start isEquivalent. First operand 969 states. Second operand has 905 states, 901 states have (on average 1.2297447280799112) internal successors, (1108), 901 states have internal predecessors, (1108), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:20,060 INFO L74 IsIncluded]: Start isIncluded. First operand 969 states. Second operand has 905 states, 901 states have (on average 1.2297447280799112) internal successors, (1108), 901 states have internal predecessors, (1108), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:20,061 INFO L87 Difference]: Start difference. First operand 969 states. Second operand has 905 states, 901 states have (on average 1.2297447280799112) internal successors, (1108), 901 states have internal predecessors, (1108), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:20,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:20,087 INFO L93 Difference]: Finished difference Result 969 states and 1175 transitions. [2022-04-27 15:10:20,088 INFO L276 IsEmpty]: Start isEmpty. Operand 969 states and 1175 transitions. [2022-04-27 15:10:20,089 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:20,089 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:20,090 INFO L74 IsIncluded]: Start isIncluded. First operand has 905 states, 901 states have (on average 1.2297447280799112) internal successors, (1108), 901 states have internal predecessors, (1108), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 969 states. [2022-04-27 15:10:20,090 INFO L87 Difference]: Start difference. First operand has 905 states, 901 states have (on average 1.2297447280799112) internal successors, (1108), 901 states have internal predecessors, (1108), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 969 states. [2022-04-27 15:10:20,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:20,117 INFO L93 Difference]: Finished difference Result 969 states and 1175 transitions. [2022-04-27 15:10:20,117 INFO L276 IsEmpty]: Start isEmpty. Operand 969 states and 1175 transitions. [2022-04-27 15:10:20,118 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:20,118 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:20,118 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:10:20,118 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:10:20,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 905 states, 901 states have (on average 1.2297447280799112) internal successors, (1108), 901 states have internal predecessors, (1108), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:20,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1111 transitions. [2022-04-27 15:10:20,145 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 1111 transitions. Word has length 22 [2022-04-27 15:10:20,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:10:20,145 INFO L495 AbstractCegarLoop]: Abstraction has 905 states and 1111 transitions. [2022-04-27 15:10:20,145 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:20,145 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1111 transitions. [2022-04-27 15:10:20,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-27 15:10:20,146 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:10:20,146 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:10:20,146 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-27 15:10:20,147 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:10:20,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:10:20,147 INFO L85 PathProgramCache]: Analyzing trace with hash 1454210302, now seen corresponding path program 1 times [2022-04-27 15:10:20,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:10:20,147 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692558786] [2022-04-27 15:10:20,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:10:20,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:10:20,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:20,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:10:20,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:20,178 INFO L290 TraceCheckUtils]: 0: Hoare triple {19687#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {19681#true} is VALID [2022-04-27 15:10:20,178 INFO L290 TraceCheckUtils]: 1: Hoare triple {19681#true} assume true; {19681#true} is VALID [2022-04-27 15:10:20,178 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {19681#true} {19681#true} #132#return; {19681#true} is VALID [2022-04-27 15:10:20,179 INFO L272 TraceCheckUtils]: 0: Hoare triple {19681#true} call ULTIMATE.init(); {19687#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:10:20,179 INFO L290 TraceCheckUtils]: 1: Hoare triple {19687#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {19681#true} is VALID [2022-04-27 15:10:20,179 INFO L290 TraceCheckUtils]: 2: Hoare triple {19681#true} assume true; {19681#true} is VALID [2022-04-27 15:10:20,179 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19681#true} {19681#true} #132#return; {19681#true} is VALID [2022-04-27 15:10:20,179 INFO L272 TraceCheckUtils]: 4: Hoare triple {19681#true} call #t~ret11 := main(); {19681#true} is VALID [2022-04-27 15:10:20,179 INFO L290 TraceCheckUtils]: 5: Hoare triple {19681#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;havoc ~cond~0; {19681#true} is VALID [2022-04-27 15:10:20,179 INFO L290 TraceCheckUtils]: 6: Hoare triple {19681#true} assume !false;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~cond~0 := #t~nondet10;havoc #t~nondet10; {19681#true} is VALID [2022-04-27 15:10:20,179 INFO L290 TraceCheckUtils]: 7: Hoare triple {19681#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0; {19681#true} is VALID [2022-04-27 15:10:20,179 INFO L290 TraceCheckUtils]: 8: Hoare triple {19681#true} assume !(0 != ~p1~0); {19681#true} is VALID [2022-04-27 15:10:20,179 INFO L290 TraceCheckUtils]: 9: Hoare triple {19681#true} assume !(0 != ~p2~0); {19681#true} is VALID [2022-04-27 15:10:20,179 INFO L290 TraceCheckUtils]: 10: Hoare triple {19681#true} assume !(0 != ~p3~0); {19681#true} is VALID [2022-04-27 15:10:20,179 INFO L290 TraceCheckUtils]: 11: Hoare triple {19681#true} assume !(0 != ~p4~0); {19681#true} is VALID [2022-04-27 15:10:20,179 INFO L290 TraceCheckUtils]: 12: Hoare triple {19681#true} assume !(0 != ~p5~0); {19681#true} is VALID [2022-04-27 15:10:20,180 INFO L290 TraceCheckUtils]: 13: Hoare triple {19681#true} assume !(0 != ~p6~0); {19686#(= main_~p6~0 0)} is VALID [2022-04-27 15:10:20,180 INFO L290 TraceCheckUtils]: 14: Hoare triple {19686#(= main_~p6~0 0)} assume !(0 != ~p1~0); {19686#(= main_~p6~0 0)} is VALID [2022-04-27 15:10:20,180 INFO L290 TraceCheckUtils]: 15: Hoare triple {19686#(= main_~p6~0 0)} assume !(0 != ~p2~0); {19686#(= main_~p6~0 0)} is VALID [2022-04-27 15:10:20,180 INFO L290 TraceCheckUtils]: 16: Hoare triple {19686#(= main_~p6~0 0)} assume !(0 != ~p3~0); {19686#(= main_~p6~0 0)} is VALID [2022-04-27 15:10:20,181 INFO L290 TraceCheckUtils]: 17: Hoare triple {19686#(= main_~p6~0 0)} assume !(0 != ~p4~0); {19686#(= main_~p6~0 0)} is VALID [2022-04-27 15:10:20,181 INFO L290 TraceCheckUtils]: 18: Hoare triple {19686#(= main_~p6~0 0)} assume !(0 != ~p5~0); {19686#(= main_~p6~0 0)} is VALID [2022-04-27 15:10:20,181 INFO L290 TraceCheckUtils]: 19: Hoare triple {19686#(= main_~p6~0 0)} assume 0 != ~p6~0; {19682#false} is VALID [2022-04-27 15:10:20,181 INFO L290 TraceCheckUtils]: 20: Hoare triple {19682#false} assume 1 != ~lk6~0; {19682#false} is VALID [2022-04-27 15:10:20,181 INFO L290 TraceCheckUtils]: 21: Hoare triple {19682#false} assume !false; {19682#false} is VALID [2022-04-27 15:10:20,181 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:20,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:10:20,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692558786] [2022-04-27 15:10:20,183 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692558786] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:10:20,183 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:10:20,183 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:10:20,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636940093] [2022-04-27 15:10:20,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:10:20,183 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-27 15:10:20,183 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:10:20,184 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:20,194 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:20,194 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:10:20,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:10:20,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:10:20,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:10:20,195 INFO L87 Difference]: Start difference. First operand 905 states and 1111 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:20,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:20,378 INFO L93 Difference]: Finished difference Result 1993 states and 2391 transitions. [2022-04-27 15:10:20,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:10:20,378 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-27 15:10:20,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:10:20,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:20,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 103 transitions. [2022-04-27 15:10:20,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:20,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 103 transitions. [2022-04-27 15:10:20,380 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 103 transitions. [2022-04-27 15:10:20,437 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:20,437 INFO L225 Difference]: With dead ends: 1993 [2022-04-27 15:10:20,437 INFO L226 Difference]: Without dead ends: 0 [2022-04-27 15:10:20,439 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:20,439 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 55 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:10:20,439 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 72 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 15:10:20,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-27 15:10:20,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-27 15:10:20,440 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:10:20,440 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 15:10:20,440 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 15:10:20,440 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 15:10:20,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:20,440 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 15:10:20,440 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 15:10:20,440 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:20,440 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:20,440 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-27 15:10:20,440 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-27 15:10:20,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:20,441 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 15:10:20,441 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 15:10:20,441 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:20,441 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:20,441 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:10:20,441 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:10:20,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 15:10:20,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-27 15:10:20,441 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 22 [2022-04-27 15:10:20,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:10:20,441 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-27 15:10:20,441 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:20,441 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 15:10:20,441 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:20,443 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 15:10:20,443 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-27 15:10:20,444 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-27 15:10:21,148 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 3) no Hoare annotation was computed. [2022-04-27 15:10:21,148 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 3) no Hoare annotation was computed. [2022-04-27 15:10:21,148 INFO L899 garLoopResultBuilder]: For program point reach_errorFINAL(line 3) no Hoare annotation was computed. [2022-04-27 15:10:21,148 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-27 15:10:21,148 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-27 15:10:21,148 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-27 15:10:21,148 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-27 15:10:21,148 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-27 15:10:21,148 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-27 15:10:21,148 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-27 15:10:21,149 INFO L899 garLoopResultBuilder]: For program point L60-1(lines 29 104) no Hoare annotation was computed. [2022-04-27 15:10:21,149 INFO L899 garLoopResultBuilder]: For program point mainEXIT(lines 6 109) no Hoare annotation was computed. [2022-04-27 15:10:21,149 INFO L899 garLoopResultBuilder]: For program point L85(line 85) no Hoare annotation was computed. [2022-04-27 15:10:21,149 INFO L899 garLoopResultBuilder]: For program point L52-1(lines 29 104) no Hoare annotation was computed. [2022-04-27 15:10:21,149 INFO L899 garLoopResultBuilder]: For program point L94-1(lines 29 104) no Hoare annotation was computed. [2022-04-27 15:10:21,149 INFO L899 garLoopResultBuilder]: For program point L95(line 95) no Hoare annotation was computed. [2022-04-27 15:10:21,149 INFO L899 garLoopResultBuilder]: For program point L79-1(lines 29 104) no Hoare annotation was computed. [2022-04-27 15:10:21,149 INFO L899 garLoopResultBuilder]: For program point mainFINAL(lines 6 109) no Hoare annotation was computed. [2022-04-27 15:10:21,149 INFO L899 garLoopResultBuilder]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 107) no Hoare annotation was computed. [2022-04-27 15:10:21,149 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 6 109) the Hoare annotation is: true [2022-04-27 15:10:21,149 INFO L899 garLoopResultBuilder]: For program point L80(line 80) no Hoare annotation was computed. [2022-04-27 15:10:21,149 INFO L902 garLoopResultBuilder]: At program point L105(lines 7 109) the Hoare annotation is: true [2022-04-27 15:10:21,149 INFO L899 garLoopResultBuilder]: For program point L31(lines 31 33) no Hoare annotation was computed. [2022-04-27 15:10:21,149 INFO L899 garLoopResultBuilder]: For program point L64-1(lines 29 104) no Hoare annotation was computed. [2022-04-27 15:10:21,149 INFO L899 garLoopResultBuilder]: For program point L89-1(lines 29 104) no Hoare annotation was computed. [2022-04-27 15:10:21,149 INFO L899 garLoopResultBuilder]: For program point L56-1(lines 29 104) no Hoare annotation was computed. [2022-04-27 15:10:21,149 INFO L899 garLoopResultBuilder]: For program point L48(lines 48 50) no Hoare annotation was computed. [2022-04-27 15:10:21,149 INFO L899 garLoopResultBuilder]: For program point L48-2(lines 29 104) no Hoare annotation was computed. [2022-04-27 15:10:21,149 INFO L899 garLoopResultBuilder]: For program point L90(line 90) no Hoare annotation was computed. [2022-04-27 15:10:21,149 INFO L899 garLoopResultBuilder]: For program point L74-1(lines 29 104) no Hoare annotation was computed. [2022-04-27 15:10:21,149 INFO L902 garLoopResultBuilder]: At program point L99-1(lines 29 104) the Hoare annotation is: true [2022-04-27 15:10:21,149 INFO L899 garLoopResultBuilder]: For program point L75(line 75) no Hoare annotation was computed. [2022-04-27 15:10:21,150 INFO L899 garLoopResultBuilder]: For program point L100(line 100) no Hoare annotation was computed. [2022-04-27 15:10:21,150 INFO L895 garLoopResultBuilder]: At program point L100-1(lines 7 109) the Hoare annotation is: false [2022-04-27 15:10:21,150 INFO L899 garLoopResultBuilder]: For program point L84-1(lines 29 104) no Hoare annotation was computed. [2022-04-27 15:10:21,150 INFO L899 garLoopResultBuilder]: For program point L68-1(lines 29 104) no Hoare annotation was computed. [2022-04-27 15:10:21,152 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:10:21,153 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 15:10:21,155 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-27 15:10:21,155 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 15:10:21,156 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-27 15:10:21,156 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 15:10:21,156 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 15:10:21,156 WARN L170 areAnnotationChecker]: L31 has no Hoare annotation [2022-04-27 15:10:21,156 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-27 15:10:21,156 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 15:10:21,156 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 15:10:21,156 WARN L170 areAnnotationChecker]: L31 has no Hoare annotation [2022-04-27 15:10:21,156 WARN L170 areAnnotationChecker]: L31 has no Hoare annotation [2022-04-27 15:10:21,156 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 15:10:21,156 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2022-04-27 15:10:21,156 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2022-04-27 15:10:21,156 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-27 15:10:21,156 WARN L170 areAnnotationChecker]: L48-2 has no Hoare annotation [2022-04-27 15:10:21,156 WARN L170 areAnnotationChecker]: L48-2 has no Hoare annotation [2022-04-27 15:10:21,156 WARN L170 areAnnotationChecker]: L52-1 has no Hoare annotation [2022-04-27 15:10:21,156 WARN L170 areAnnotationChecker]: L52-1 has no Hoare annotation [2022-04-27 15:10:21,156 WARN L170 areAnnotationChecker]: L56-1 has no Hoare annotation [2022-04-27 15:10:21,156 WARN L170 areAnnotationChecker]: L56-1 has no Hoare annotation [2022-04-27 15:10:21,156 WARN L170 areAnnotationChecker]: L60-1 has no Hoare annotation [2022-04-27 15:10:21,156 WARN L170 areAnnotationChecker]: L60-1 has no Hoare annotation [2022-04-27 15:10:21,156 WARN L170 areAnnotationChecker]: L64-1 has no Hoare annotation [2022-04-27 15:10:21,156 WARN L170 areAnnotationChecker]: L64-1 has no Hoare annotation [2022-04-27 15:10:21,156 WARN L170 areAnnotationChecker]: L68-1 has no Hoare annotation [2022-04-27 15:10:21,156 WARN L170 areAnnotationChecker]: L68-1 has no Hoare annotation [2022-04-27 15:10:21,156 WARN L170 areAnnotationChecker]: L75 has no Hoare annotation [2022-04-27 15:10:21,156 WARN L170 areAnnotationChecker]: L75 has no Hoare annotation [2022-04-27 15:10:21,156 WARN L170 areAnnotationChecker]: L74-1 has no Hoare annotation [2022-04-27 15:10:21,156 WARN L170 areAnnotationChecker]: L74-1 has no Hoare annotation [2022-04-27 15:10:21,157 WARN L170 areAnnotationChecker]: mainErr0ASSERT_VIOLATIONERROR_FUNCTION has no Hoare annotation [2022-04-27 15:10:21,157 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 15:10:21,157 WARN L170 areAnnotationChecker]: L80 has no Hoare annotation [2022-04-27 15:10:21,157 WARN L170 areAnnotationChecker]: L80 has no Hoare annotation [2022-04-27 15:10:21,157 WARN L170 areAnnotationChecker]: L79-1 has no Hoare annotation [2022-04-27 15:10:21,157 WARN L170 areAnnotationChecker]: L79-1 has no Hoare annotation [2022-04-27 15:10:21,157 WARN L170 areAnnotationChecker]: L85 has no Hoare annotation [2022-04-27 15:10:21,157 WARN L170 areAnnotationChecker]: L85 has no Hoare annotation [2022-04-27 15:10:21,157 WARN L170 areAnnotationChecker]: L84-1 has no Hoare annotation [2022-04-27 15:10:21,157 WARN L170 areAnnotationChecker]: L84-1 has no Hoare annotation [2022-04-27 15:10:21,157 WARN L170 areAnnotationChecker]: L90 has no Hoare annotation [2022-04-27 15:10:21,157 WARN L170 areAnnotationChecker]: L90 has no Hoare annotation [2022-04-27 15:10:21,157 WARN L170 areAnnotationChecker]: L89-1 has no Hoare annotation [2022-04-27 15:10:21,157 WARN L170 areAnnotationChecker]: L89-1 has no Hoare annotation [2022-04-27 15:10:21,157 WARN L170 areAnnotationChecker]: L95 has no Hoare annotation [2022-04-27 15:10:21,157 WARN L170 areAnnotationChecker]: L95 has no Hoare annotation [2022-04-27 15:10:21,157 WARN L170 areAnnotationChecker]: L94-1 has no Hoare annotation [2022-04-27 15:10:21,157 WARN L170 areAnnotationChecker]: L94-1 has no Hoare annotation [2022-04-27 15:10:21,157 WARN L170 areAnnotationChecker]: L100 has no Hoare annotation [2022-04-27 15:10:21,157 WARN L170 areAnnotationChecker]: L100 has no Hoare annotation [2022-04-27 15:10:21,157 INFO L163 areAnnotationChecker]: CFG has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-27 15:10:21,161 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 03:10:21 BoogieIcfgContainer [2022-04-27 15:10:21,161 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 15:10:21,162 INFO L158 Benchmark]: Toolchain (without parser) took 5726.08ms. Allocated memory was 183.5MB in the beginning and 264.2MB in the end (delta: 80.7MB). Free memory was 133.3MB in the beginning and 221.3MB in the end (delta: -88.0MB). Peak memory consumption was 127.6MB. Max. memory is 8.0GB. [2022-04-27 15:10:21,162 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 183.5MB. Free memory is still 149.2MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 15:10:21,162 INFO L158 Benchmark]: CACSL2BoogieTranslator took 164.73ms. Allocated memory is still 183.5MB. Free memory was 133.1MB in the beginning and 158.2MB in the end (delta: -25.0MB). Peak memory consumption was 13.1MB. Max. memory is 8.0GB. [2022-04-27 15:10:21,162 INFO L158 Benchmark]: Boogie Preprocessor took 25.41ms. Allocated memory is still 183.5MB. Free memory was 158.2MB in the beginning and 156.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-27 15:10:21,162 INFO L158 Benchmark]: RCFGBuilder took 226.62ms. Allocated memory is still 183.5MB. Free memory was 156.6MB in the beginning and 144.5MB in the end (delta: 12.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-27 15:10:21,162 INFO L158 Benchmark]: TraceAbstraction took 5304.00ms. Allocated memory was 183.5MB in the beginning and 264.2MB in the end (delta: 80.7MB). Free memory was 144.0MB in the beginning and 221.3MB in the end (delta: -77.3MB). Peak memory consumption was 138.7MB. Max. memory is 8.0GB. [2022-04-27 15:10:21,163 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 183.5MB. Free memory is still 149.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 164.73ms. Allocated memory is still 183.5MB. Free memory was 133.1MB in the beginning and 158.2MB in the end (delta: -25.0MB). Peak memory consumption was 13.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 25.41ms. Allocated memory is still 183.5MB. Free memory was 158.2MB in the beginning and 156.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 226.62ms. Allocated memory is still 183.5MB. Free memory was 156.6MB in the beginning and 144.5MB in the end (delta: 12.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 5304.00ms. Allocated memory was 183.5MB in the beginning and 264.2MB in the end (delta: 80.7MB). Free memory was 144.0MB in the beginning and 221.3MB in the end (delta: -77.3MB). Peak memory consumption was 138.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 107]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 36 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.3s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.7s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1224 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1224 mSDsluCounter, 1008 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 114 mSDsCounter, 38 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 614 IncrementalHoareTripleChecker+Invalid, 652 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 38 mSolverCounterUnsat, 894 mSDtfsCounter, 614 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 112 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=905occurred in iteration=15, InterpolantAutomatonStates: 64, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 16 MinimizatonAttempts, 268 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 74 NumberOfFragments, 13 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.7s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 315 NumberOfCodeBlocks, 315 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 299 ConstructedInterpolants, 0 QuantifiedInterpolants, 623 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 7]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 29]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2022-04-27 15:10:21,187 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...