/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_8.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 15:10:21,863 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 15:10:21,864 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 15:10:21,898 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 15:10:21,899 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 15:10:21,900 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 15:10:21,901 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 15:10:21,902 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 15:10:21,903 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 15:10:21,903 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 15:10:21,904 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 15:10:21,905 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 15:10:21,905 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 15:10:21,905 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 15:10:21,909 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 15:10:21,912 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 15:10:21,913 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 15:10:21,917 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 15:10:21,918 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 15:10:21,919 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 15:10:21,920 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 15:10:21,922 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 15:10:21,923 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 15:10:21,923 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 15:10:21,924 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 15:10:21,925 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 15:10:21,925 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 15:10:21,926 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 15:10:21,926 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 15:10:21,926 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 15:10:21,927 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 15:10:21,927 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 15:10:21,927 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 15:10:21,928 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 15:10:21,928 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 15:10:21,929 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 15:10:21,929 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 15:10:21,929 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 15:10:21,929 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 15:10:21,930 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 15:10:21,930 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 15:10:21,934 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 15:10:21,935 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:21,963 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 15:10:21,963 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 15:10:21,964 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 15:10:21,964 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 15:10:21,964 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 15:10:21,964 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 15:10:21,964 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 15:10:21,965 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 15:10:21,965 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 15:10:21,965 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 15:10:21,965 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 15:10:21,966 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 15:10:21,966 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 15:10:21,966 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 15:10:21,966 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 15:10:21,966 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 15:10:21,966 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 15:10:21,967 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 15:10:21,967 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 15:10:21,967 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 15:10:21,967 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 15:10:21,968 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 15:10:21,968 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 15:10:21,968 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 15:10:21,968 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 15:10:21,968 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 15:10:21,968 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 15:10:21,968 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 15:10:21,968 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 15:10:21,968 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 15:10:21,969 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 15:10:21,969 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 15:10:21,969 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 15:10:21,969 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:22,136 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 15:10:22,154 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 15:10:22,156 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 15:10:22,156 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 15:10:22,157 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 15:10:22,157 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_8.c [2022-04-27 15:10:22,205 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5fa32300e/5c5440cba7fb46868adfc2a333dc7a02/FLAG0f45f6521 [2022-04-27 15:10:22,571 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 15:10:22,571 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_8.c [2022-04-27 15:10:22,576 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5fa32300e/5c5440cba7fb46868adfc2a333dc7a02/FLAG0f45f6521 [2022-04-27 15:10:22,586 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5fa32300e/5c5440cba7fb46868adfc2a333dc7a02 [2022-04-27 15:10:22,588 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 15:10:22,589 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 15:10:22,589 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 15:10:22,589 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 15:10:22,592 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 15:10:22,592 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 03:10:22" (1/1) ... [2022-04-27 15:10:22,593 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5bafc80c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:10:22, skipping insertion in model container [2022-04-27 15:10:22,593 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 03:10:22" (1/1) ... [2022-04-27 15:10:22,598 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 15:10:22,610 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 15:10:22,731 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_8.c[3218,3231] [2022-04-27 15:10:22,733 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 15:10:22,739 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 15:10:22,754 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_8.c[3218,3231] [2022-04-27 15:10:22,754 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 15:10:22,763 INFO L208 MainTranslator]: Completed translation [2022-04-27 15:10:22,763 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:10:22 WrapperNode [2022-04-27 15:10:22,763 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 15:10:22,764 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 15:10:22,764 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 15:10:22,764 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 15:10:22,771 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:22" (1/1) ... [2022-04-27 15:10:22,771 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:22" (1/1) ... [2022-04-27 15:10:22,775 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:22" (1/1) ... [2022-04-27 15:10:22,775 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:22" (1/1) ... [2022-04-27 15:10:22,780 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:22" (1/1) ... [2022-04-27 15:10:22,784 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:22" (1/1) ... [2022-04-27 15:10:22,785 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:22" (1/1) ... [2022-04-27 15:10:22,786 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 15:10:22,787 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 15:10:22,787 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 15:10:22,787 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 15:10:22,788 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:10:22" (1/1) ... [2022-04-27 15:10:22,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 15:10:22,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 15:10:22,813 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:22,832 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:22,858 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 15:10:22,859 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 15:10:22,859 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 15:10:22,860 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 15:10:22,860 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 15:10:22,860 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 15:10:22,860 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 15:10:22,860 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 15:10:22,860 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 15:10:22,860 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 15:10:22,860 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 15:10:22,860 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 15:10:22,860 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 15:10:22,860 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 15:10:22,860 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 15:10:22,860 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 15:10:22,902 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 15:10:22,903 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 15:10:23,119 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 15:10:23,124 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 15:10:23,124 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 15:10:23,125 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 03:10:23 BoogieIcfgContainer [2022-04-27 15:10:23,126 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 15:10:23,127 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 15:10:23,127 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 15:10:23,140 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 15:10:23,140 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 03:10:22" (1/3) ... [2022-04-27 15:10:23,141 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a225d3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 03:10:23, skipping insertion in model container [2022-04-27 15:10:23,141 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:10:22" (2/3) ... [2022-04-27 15:10:23,141 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a225d3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 03:10:23, skipping insertion in model container [2022-04-27 15:10:23,141 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 03:10:23" (3/3) ... [2022-04-27 15:10:23,142 INFO L111 eAbstractionObserver]: Analyzing ICFG test_locks_8.c [2022-04-27 15:10:23,151 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 15:10:23,151 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 15:10:23,194 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 15:10:23,206 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@26c43b70, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@16068b12 [2022-04-27 15:10:23,206 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 15:10:23,216 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 33 states have (on average 1.8484848484848484) internal successors, (61), 34 states have internal predecessors, (61), 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:23,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-27 15:10:23,220 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:10:23,221 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:23,221 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:10:23,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:10:23,226 INFO L85 PathProgramCache]: Analyzing trace with hash 957163615, now seen corresponding path program 1 times [2022-04-27 15:10:23,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:10:23,233 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949390690] [2022-04-27 15:10:23,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:10:23,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:10:23,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:23,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:10:23,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:23,456 INFO L290 TraceCheckUtils]: 0: Hoare triple {48#(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); {42#true} is VALID [2022-04-27 15:10:23,456 INFO L290 TraceCheckUtils]: 1: Hoare triple {42#true} assume true; {42#true} is VALID [2022-04-27 15:10:23,457 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {42#true} {42#true} #166#return; {42#true} is VALID [2022-04-27 15:10:23,462 INFO L272 TraceCheckUtils]: 0: Hoare triple {42#true} call ULTIMATE.init(); {48#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:10:23,463 INFO L290 TraceCheckUtils]: 1: Hoare triple {48#(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); {42#true} is VALID [2022-04-27 15:10:23,463 INFO L290 TraceCheckUtils]: 2: Hoare triple {42#true} assume true; {42#true} is VALID [2022-04-27 15:10:23,463 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42#true} {42#true} #166#return; {42#true} is VALID [2022-04-27 15:10:23,463 INFO L272 TraceCheckUtils]: 4: Hoare triple {42#true} call #t~ret13 := main(); {42#true} is VALID [2022-04-27 15:10:23,464 INFO L290 TraceCheckUtils]: 5: Hoare triple {42#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;havoc ~cond~0; {42#true} is VALID [2022-04-27 15:10:23,464 INFO L290 TraceCheckUtils]: 6: Hoare triple {42#true} assume !false;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~cond~0 := #t~nondet12;havoc #t~nondet12; {42#true} is VALID [2022-04-27 15:10:23,464 INFO L290 TraceCheckUtils]: 7: Hoare triple {42#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0; {42#true} is VALID [2022-04-27 15:10:23,466 INFO L290 TraceCheckUtils]: 8: Hoare triple {42#true} assume 0 != ~p1~0;~lk1~0 := 1; {47#(= main_~lk1~0 1)} is VALID [2022-04-27 15:10:23,467 INFO L290 TraceCheckUtils]: 9: Hoare triple {47#(= main_~lk1~0 1)} assume !(0 != ~p2~0); {47#(= main_~lk1~0 1)} is VALID [2022-04-27 15:10:23,468 INFO L290 TraceCheckUtils]: 10: Hoare triple {47#(= main_~lk1~0 1)} assume 0 != ~p3~0;~lk3~0 := 1; {47#(= main_~lk1~0 1)} is VALID [2022-04-27 15:10:23,469 INFO L290 TraceCheckUtils]: 11: Hoare triple {47#(= main_~lk1~0 1)} assume 0 != ~p4~0;~lk4~0 := 1; {47#(= main_~lk1~0 1)} is VALID [2022-04-27 15:10:23,469 INFO L290 TraceCheckUtils]: 12: Hoare triple {47#(= main_~lk1~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {47#(= main_~lk1~0 1)} is VALID [2022-04-27 15:10:23,471 INFO L290 TraceCheckUtils]: 13: Hoare triple {47#(= main_~lk1~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {47#(= main_~lk1~0 1)} is VALID [2022-04-27 15:10:23,472 INFO L290 TraceCheckUtils]: 14: Hoare triple {47#(= main_~lk1~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {47#(= main_~lk1~0 1)} is VALID [2022-04-27 15:10:23,473 INFO L290 TraceCheckUtils]: 15: Hoare triple {47#(= main_~lk1~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {47#(= main_~lk1~0 1)} is VALID [2022-04-27 15:10:23,474 INFO L290 TraceCheckUtils]: 16: Hoare triple {47#(= main_~lk1~0 1)} assume 0 != ~p1~0; {47#(= main_~lk1~0 1)} is VALID [2022-04-27 15:10:23,475 INFO L290 TraceCheckUtils]: 17: Hoare triple {47#(= main_~lk1~0 1)} assume 1 != ~lk1~0; {43#false} is VALID [2022-04-27 15:10:23,476 INFO L290 TraceCheckUtils]: 18: Hoare triple {43#false} assume !false; {43#false} is VALID [2022-04-27 15:10:23,476 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:23,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:10:23,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949390690] [2022-04-27 15:10:23,477 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949390690] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:10:23,477 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:10:23,477 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:10:23,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374438994] [2022-04-27 15:10:23,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:10:23,482 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:23,483 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:10:23,485 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:23,523 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:23,524 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:10:23,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:10:23,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:10:23,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:10:23,548 INFO L87 Difference]: Start difference. First operand has 39 states, 33 states have (on average 1.8484848484848484) internal successors, (61), 34 states have internal predecessors, (61), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 4 states, 4 states have (on average 4.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:23,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:23,795 INFO L93 Difference]: Finished difference Result 76 states and 127 transitions. [2022-04-27 15:10:23,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:10:23,796 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:23,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:10:23,797 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:23,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 127 transitions. [2022-04-27 15:10:23,806 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:23,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 127 transitions. [2022-04-27 15:10:23,812 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 127 transitions. [2022-04-27 15:10:23,906 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 127 edges. 127 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:23,915 INFO L225 Difference]: With dead ends: 76 [2022-04-27 15:10:23,916 INFO L226 Difference]: Without dead ends: 61 [2022-04-27 15:10:23,917 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:23,920 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 140 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 15:10:23,920 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 77 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 15:10:23,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-04-27 15:10:23,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 43. [2022-04-27 15:10:23,954 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:10:23,955 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand has 43 states, 39 states have (on average 1.8205128205128205) internal successors, (71), 39 states have internal predecessors, (71), 2 states have call successors, (2), 2 states have call 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:23,956 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand has 43 states, 39 states have (on average 1.8205128205128205) internal successors, (71), 39 states have internal predecessors, (71), 2 states have call successors, (2), 2 states have call 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:23,956 INFO L87 Difference]: Start difference. First operand 61 states. Second operand has 43 states, 39 states have (on average 1.8205128205128205) internal successors, (71), 39 states have internal predecessors, (71), 2 states have call successors, (2), 2 states have call 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:23,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:23,961 INFO L93 Difference]: Finished difference Result 61 states and 105 transitions. [2022-04-27 15:10:23,961 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 105 transitions. [2022-04-27 15:10:23,962 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:23,962 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:23,962 INFO L74 IsIncluded]: Start isIncluded. First operand has 43 states, 39 states have (on average 1.8205128205128205) internal successors, (71), 39 states have internal predecessors, (71), 2 states have call successors, (2), 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 61 states. [2022-04-27 15:10:23,963 INFO L87 Difference]: Start difference. First operand has 43 states, 39 states have (on average 1.8205128205128205) internal successors, (71), 39 states have internal predecessors, (71), 2 states have call successors, (2), 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 61 states. [2022-04-27 15:10:23,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:23,968 INFO L93 Difference]: Finished difference Result 61 states and 105 transitions. [2022-04-27 15:10:23,968 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 105 transitions. [2022-04-27 15:10:23,968 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:23,968 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:23,969 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:10:23,969 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:10:23,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 39 states have (on average 1.8205128205128205) internal successors, (71), 39 states have internal predecessors, (71), 2 states have call successors, (2), 2 states have call 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:23,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 74 transitions. [2022-04-27 15:10:23,972 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 74 transitions. Word has length 19 [2022-04-27 15:10:23,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:10:23,972 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 74 transitions. [2022-04-27 15:10:23,973 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:23,973 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 74 transitions. [2022-04-27 15:10:23,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-27 15:10:23,973 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:10:23,973 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:23,973 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 15:10:23,973 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:10:23,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:10:23,974 INFO L85 PathProgramCache]: Analyzing trace with hash 1658228193, now seen corresponding path program 1 times [2022-04-27 15:10:23,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:10:23,974 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180626309] [2022-04-27 15:10:23,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:10:23,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:10:23,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:24,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:10:24,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:24,025 INFO L290 TraceCheckUtils]: 0: Hoare triple {319#(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); {313#true} is VALID [2022-04-27 15:10:24,025 INFO L290 TraceCheckUtils]: 1: Hoare triple {313#true} assume true; {313#true} is VALID [2022-04-27 15:10:24,025 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {313#true} {313#true} #166#return; {313#true} is VALID [2022-04-27 15:10:24,027 INFO L272 TraceCheckUtils]: 0: Hoare triple {313#true} call ULTIMATE.init(); {319#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:10:24,027 INFO L290 TraceCheckUtils]: 1: Hoare triple {319#(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); {313#true} is VALID [2022-04-27 15:10:24,027 INFO L290 TraceCheckUtils]: 2: Hoare triple {313#true} assume true; {313#true} is VALID [2022-04-27 15:10:24,027 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {313#true} {313#true} #166#return; {313#true} is VALID [2022-04-27 15:10:24,027 INFO L272 TraceCheckUtils]: 4: Hoare triple {313#true} call #t~ret13 := main(); {313#true} is VALID [2022-04-27 15:10:24,027 INFO L290 TraceCheckUtils]: 5: Hoare triple {313#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;havoc ~cond~0; {313#true} is VALID [2022-04-27 15:10:24,028 INFO L290 TraceCheckUtils]: 6: Hoare triple {313#true} assume !false;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~cond~0 := #t~nondet12;havoc #t~nondet12; {313#true} is VALID [2022-04-27 15:10:24,028 INFO L290 TraceCheckUtils]: 7: Hoare triple {313#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0; {313#true} is VALID [2022-04-27 15:10:24,028 INFO L290 TraceCheckUtils]: 8: Hoare triple {313#true} assume !(0 != ~p1~0); {318#(= main_~p1~0 0)} is VALID [2022-04-27 15:10:24,029 INFO L290 TraceCheckUtils]: 9: Hoare triple {318#(= main_~p1~0 0)} assume !(0 != ~p2~0); {318#(= main_~p1~0 0)} is VALID [2022-04-27 15:10:24,029 INFO L290 TraceCheckUtils]: 10: Hoare triple {318#(= main_~p1~0 0)} assume 0 != ~p3~0;~lk3~0 := 1; {318#(= main_~p1~0 0)} is VALID [2022-04-27 15:10:24,030 INFO L290 TraceCheckUtils]: 11: Hoare triple {318#(= main_~p1~0 0)} assume 0 != ~p4~0;~lk4~0 := 1; {318#(= main_~p1~0 0)} is VALID [2022-04-27 15:10:24,030 INFO L290 TraceCheckUtils]: 12: Hoare triple {318#(= main_~p1~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {318#(= main_~p1~0 0)} is VALID [2022-04-27 15:10:24,030 INFO L290 TraceCheckUtils]: 13: Hoare triple {318#(= main_~p1~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {318#(= main_~p1~0 0)} is VALID [2022-04-27 15:10:24,031 INFO L290 TraceCheckUtils]: 14: Hoare triple {318#(= main_~p1~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {318#(= main_~p1~0 0)} is VALID [2022-04-27 15:10:24,031 INFO L290 TraceCheckUtils]: 15: Hoare triple {318#(= main_~p1~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {318#(= main_~p1~0 0)} is VALID [2022-04-27 15:10:24,031 INFO L290 TraceCheckUtils]: 16: Hoare triple {318#(= main_~p1~0 0)} assume 0 != ~p1~0; {314#false} is VALID [2022-04-27 15:10:24,031 INFO L290 TraceCheckUtils]: 17: Hoare triple {314#false} assume 1 != ~lk1~0; {314#false} is VALID [2022-04-27 15:10:24,032 INFO L290 TraceCheckUtils]: 18: Hoare triple {314#false} assume !false; {314#false} is VALID [2022-04-27 15:10:24,032 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:24,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:10:24,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180626309] [2022-04-27 15:10:24,032 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180626309] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:10:24,033 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:10:24,033 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:10:24,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505646135] [2022-04-27 15:10:24,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:10:24,034 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:24,035 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:10:24,035 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:24,049 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:24,050 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:10:24,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:10:24,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:10:24,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:10:24,052 INFO L87 Difference]: Start difference. First operand 43 states and 74 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:24,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:24,264 INFO L93 Difference]: Finished difference Result 98 states and 173 transitions. [2022-04-27 15:10:24,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:10:24,265 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:24,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:10:24,265 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:24,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 156 transitions. [2022-04-27 15:10:24,269 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:24,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 156 transitions. [2022-04-27 15:10:24,272 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 156 transitions. [2022-04-27 15:10:24,386 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 156 edges. 156 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:24,388 INFO L225 Difference]: With dead ends: 98 [2022-04-27 15:10:24,388 INFO L226 Difference]: Without dead ends: 61 [2022-04-27 15:10:24,388 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:24,389 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 118 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 15:10:24,389 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 79 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 15:10:24,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-04-27 15:10:24,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59. [2022-04-27 15:10:24,394 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:10:24,394 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand has 59 states, 55 states have (on average 1.8) internal successors, (99), 55 states have internal predecessors, (99), 2 states have call successors, (2), 2 states have call 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:24,394 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand has 59 states, 55 states have (on average 1.8) internal successors, (99), 55 states have internal predecessors, (99), 2 states have call successors, (2), 2 states have call 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:24,395 INFO L87 Difference]: Start difference. First operand 61 states. Second operand has 59 states, 55 states have (on average 1.8) internal successors, (99), 55 states have internal predecessors, (99), 2 states have call successors, (2), 2 states have call 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:24,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:24,397 INFO L93 Difference]: Finished difference Result 61 states and 103 transitions. [2022-04-27 15:10:24,397 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 103 transitions. [2022-04-27 15:10:24,397 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:24,397 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:24,398 INFO L74 IsIncluded]: Start isIncluded. First operand has 59 states, 55 states have (on average 1.8) internal successors, (99), 55 states have internal predecessors, (99), 2 states have call successors, (2), 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 61 states. [2022-04-27 15:10:24,398 INFO L87 Difference]: Start difference. First operand has 59 states, 55 states have (on average 1.8) internal successors, (99), 55 states have internal predecessors, (99), 2 states have call successors, (2), 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 61 states. [2022-04-27 15:10:24,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:24,400 INFO L93 Difference]: Finished difference Result 61 states and 103 transitions. [2022-04-27 15:10:24,400 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 103 transitions. [2022-04-27 15:10:24,400 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:24,400 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:24,401 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:10:24,401 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:10:24,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 55 states have (on average 1.8) internal successors, (99), 55 states have internal predecessors, (99), 2 states have call successors, (2), 2 states have call 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:24,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 102 transitions. [2022-04-27 15:10:24,403 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 102 transitions. Word has length 19 [2022-04-27 15:10:24,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:10:24,403 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 102 transitions. [2022-04-27 15:10:24,403 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:24,403 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 102 transitions. [2022-04-27 15:10:24,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-27 15:10:24,404 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:10:24,404 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:24,404 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 15:10:24,404 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:10:24,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:10:24,405 INFO L85 PathProgramCache]: Analyzing trace with hash -392484976, now seen corresponding path program 1 times [2022-04-27 15:10:24,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:10:24,405 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396300837] [2022-04-27 15:10:24,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:10:24,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:10:24,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:24,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:10:24,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:24,449 INFO L290 TraceCheckUtils]: 0: Hoare triple {627#(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); {621#true} is VALID [2022-04-27 15:10:24,449 INFO L290 TraceCheckUtils]: 1: Hoare triple {621#true} assume true; {621#true} is VALID [2022-04-27 15:10:24,449 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {621#true} {621#true} #166#return; {621#true} is VALID [2022-04-27 15:10:24,450 INFO L272 TraceCheckUtils]: 0: Hoare triple {621#true} call ULTIMATE.init(); {627#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:10:24,450 INFO L290 TraceCheckUtils]: 1: Hoare triple {627#(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); {621#true} is VALID [2022-04-27 15:10:24,450 INFO L290 TraceCheckUtils]: 2: Hoare triple {621#true} assume true; {621#true} is VALID [2022-04-27 15:10:24,450 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {621#true} {621#true} #166#return; {621#true} is VALID [2022-04-27 15:10:24,451 INFO L272 TraceCheckUtils]: 4: Hoare triple {621#true} call #t~ret13 := main(); {621#true} is VALID [2022-04-27 15:10:24,451 INFO L290 TraceCheckUtils]: 5: Hoare triple {621#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;havoc ~cond~0; {621#true} is VALID [2022-04-27 15:10:24,451 INFO L290 TraceCheckUtils]: 6: Hoare triple {621#true} assume !false;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~cond~0 := #t~nondet12;havoc #t~nondet12; {621#true} is VALID [2022-04-27 15:10:24,451 INFO L290 TraceCheckUtils]: 7: Hoare triple {621#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0; {621#true} is VALID [2022-04-27 15:10:24,451 INFO L290 TraceCheckUtils]: 8: Hoare triple {621#true} assume 0 != ~p1~0;~lk1~0 := 1; {626#(not (= main_~p1~0 0))} is VALID [2022-04-27 15:10:24,452 INFO L290 TraceCheckUtils]: 9: Hoare triple {626#(not (= main_~p1~0 0))} assume !(0 != ~p2~0); {626#(not (= main_~p1~0 0))} is VALID [2022-04-27 15:10:24,452 INFO L290 TraceCheckUtils]: 10: Hoare triple {626#(not (= main_~p1~0 0))} assume 0 != ~p3~0;~lk3~0 := 1; {626#(not (= main_~p1~0 0))} is VALID [2022-04-27 15:10:24,452 INFO L290 TraceCheckUtils]: 11: Hoare triple {626#(not (= main_~p1~0 0))} assume 0 != ~p4~0;~lk4~0 := 1; {626#(not (= main_~p1~0 0))} is VALID [2022-04-27 15:10:24,453 INFO L290 TraceCheckUtils]: 12: Hoare triple {626#(not (= main_~p1~0 0))} assume 0 != ~p5~0;~lk5~0 := 1; {626#(not (= main_~p1~0 0))} is VALID [2022-04-27 15:10:24,453 INFO L290 TraceCheckUtils]: 13: Hoare triple {626#(not (= main_~p1~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {626#(not (= main_~p1~0 0))} is VALID [2022-04-27 15:10:24,453 INFO L290 TraceCheckUtils]: 14: Hoare triple {626#(not (= main_~p1~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {626#(not (= main_~p1~0 0))} is VALID [2022-04-27 15:10:24,454 INFO L290 TraceCheckUtils]: 15: Hoare triple {626#(not (= main_~p1~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {626#(not (= main_~p1~0 0))} is VALID [2022-04-27 15:10:24,454 INFO L290 TraceCheckUtils]: 16: Hoare triple {626#(not (= main_~p1~0 0))} assume !(0 != ~p1~0); {622#false} is VALID [2022-04-27 15:10:24,454 INFO L290 TraceCheckUtils]: 17: Hoare triple {622#false} assume 0 != ~p2~0; {622#false} is VALID [2022-04-27 15:10:24,454 INFO L290 TraceCheckUtils]: 18: Hoare triple {622#false} assume 1 != ~lk2~0; {622#false} is VALID [2022-04-27 15:10:24,455 INFO L290 TraceCheckUtils]: 19: Hoare triple {622#false} assume !false; {622#false} is VALID [2022-04-27 15:10:24,455 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:24,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:10:24,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396300837] [2022-04-27 15:10:24,455 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396300837] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:10:24,455 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:10:24,455 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:10:24,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173940870] [2022-04-27 15:10:24,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:10:24,456 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:24,456 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:10:24,456 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:24,468 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:24,468 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:10:24,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:10:24,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:10:24,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:10:24,469 INFO L87 Difference]: Start difference. First operand 59 states and 102 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:24,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:24,594 INFO L93 Difference]: Finished difference Result 91 states and 154 transitions. [2022-04-27 15:10:24,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:10:24,595 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:24,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:10:24,595 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:24,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 151 transitions. [2022-04-27 15:10:24,598 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:24,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 151 transitions. [2022-04-27 15:10:24,600 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 151 transitions. [2022-04-27 15:10:24,695 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 151 edges. 151 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:24,699 INFO L225 Difference]: With dead ends: 91 [2022-04-27 15:10:24,700 INFO L226 Difference]: Without dead ends: 64 [2022-04-27 15:10:24,701 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:24,704 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 105 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:10:24,704 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 93 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 15:10:24,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-04-27 15:10:24,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 62. [2022-04-27 15:10:24,708 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:10:24,709 INFO L82 GeneralOperation]: Start isEquivalent. First operand 64 states. Second operand has 62 states, 58 states have (on average 1.7413793103448276) internal successors, (101), 58 states have internal predecessors, (101), 2 states have call successors, (2), 2 states have call 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:24,709 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand has 62 states, 58 states have (on average 1.7413793103448276) internal successors, (101), 58 states have internal predecessors, (101), 2 states have call successors, (2), 2 states have call 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:24,709 INFO L87 Difference]: Start difference. First operand 64 states. Second operand has 62 states, 58 states have (on average 1.7413793103448276) internal successors, (101), 58 states have internal predecessors, (101), 2 states have call successors, (2), 2 states have call 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:24,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:24,711 INFO L93 Difference]: Finished difference Result 64 states and 105 transitions. [2022-04-27 15:10:24,711 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 105 transitions. [2022-04-27 15:10:24,711 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:24,711 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:24,712 INFO L74 IsIncluded]: Start isIncluded. First operand has 62 states, 58 states have (on average 1.7413793103448276) internal successors, (101), 58 states have internal predecessors, (101), 2 states have call successors, (2), 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 64 states. [2022-04-27 15:10:24,712 INFO L87 Difference]: Start difference. First operand has 62 states, 58 states have (on average 1.7413793103448276) internal successors, (101), 58 states have internal predecessors, (101), 2 states have call successors, (2), 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 64 states. [2022-04-27 15:10:24,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:24,714 INFO L93 Difference]: Finished difference Result 64 states and 105 transitions. [2022-04-27 15:10:24,714 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 105 transitions. [2022-04-27 15:10:24,714 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:24,714 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:24,714 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:10:24,714 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:10:24,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 58 states have (on average 1.7413793103448276) internal successors, (101), 58 states have internal predecessors, (101), 2 states have call successors, (2), 2 states have call 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:24,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 104 transitions. [2022-04-27 15:10:24,716 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 104 transitions. Word has length 20 [2022-04-27 15:10:24,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:10:24,716 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 104 transitions. [2022-04-27 15:10:24,717 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:24,717 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 104 transitions. [2022-04-27 15:10:24,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-27 15:10:24,717 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:10:24,717 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:24,717 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-27 15:10:24,718 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:10:24,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:10:24,718 INFO L85 PathProgramCache]: Analyzing trace with hash -134319538, now seen corresponding path program 1 times [2022-04-27 15:10:24,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:10:24,718 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550034919] [2022-04-27 15:10:24,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:10:24,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:10:24,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:24,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:10:24,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:24,758 INFO L290 TraceCheckUtils]: 0: Hoare triple {939#(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); {933#true} is VALID [2022-04-27 15:10:24,758 INFO L290 TraceCheckUtils]: 1: Hoare triple {933#true} assume true; {933#true} is VALID [2022-04-27 15:10:24,759 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {933#true} {933#true} #166#return; {933#true} is VALID [2022-04-27 15:10:24,759 INFO L272 TraceCheckUtils]: 0: Hoare triple {933#true} call ULTIMATE.init(); {939#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:10:24,759 INFO L290 TraceCheckUtils]: 1: Hoare triple {939#(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); {933#true} is VALID [2022-04-27 15:10:24,759 INFO L290 TraceCheckUtils]: 2: Hoare triple {933#true} assume true; {933#true} is VALID [2022-04-27 15:10:24,759 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {933#true} {933#true} #166#return; {933#true} is VALID [2022-04-27 15:10:24,760 INFO L272 TraceCheckUtils]: 4: Hoare triple {933#true} call #t~ret13 := main(); {933#true} is VALID [2022-04-27 15:10:24,760 INFO L290 TraceCheckUtils]: 5: Hoare triple {933#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;havoc ~cond~0; {933#true} is VALID [2022-04-27 15:10:24,760 INFO L290 TraceCheckUtils]: 6: Hoare triple {933#true} assume !false;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~cond~0 := #t~nondet12;havoc #t~nondet12; {933#true} is VALID [2022-04-27 15:10:24,760 INFO L290 TraceCheckUtils]: 7: Hoare triple {933#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0; {933#true} is VALID [2022-04-27 15:10:24,760 INFO L290 TraceCheckUtils]: 8: Hoare triple {933#true} assume !(0 != ~p1~0); {933#true} is VALID [2022-04-27 15:10:24,760 INFO L290 TraceCheckUtils]: 9: Hoare triple {933#true} assume !(0 != ~p2~0); {938#(= main_~p2~0 0)} is VALID [2022-04-27 15:10:24,761 INFO L290 TraceCheckUtils]: 10: Hoare triple {938#(= main_~p2~0 0)} assume 0 != ~p3~0;~lk3~0 := 1; {938#(= main_~p2~0 0)} is VALID [2022-04-27 15:10:24,761 INFO L290 TraceCheckUtils]: 11: Hoare triple {938#(= main_~p2~0 0)} assume 0 != ~p4~0;~lk4~0 := 1; {938#(= main_~p2~0 0)} is VALID [2022-04-27 15:10:24,761 INFO L290 TraceCheckUtils]: 12: Hoare triple {938#(= main_~p2~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {938#(= main_~p2~0 0)} is VALID [2022-04-27 15:10:24,762 INFO L290 TraceCheckUtils]: 13: Hoare triple {938#(= main_~p2~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {938#(= main_~p2~0 0)} is VALID [2022-04-27 15:10:24,762 INFO L290 TraceCheckUtils]: 14: Hoare triple {938#(= main_~p2~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {938#(= main_~p2~0 0)} is VALID [2022-04-27 15:10:24,762 INFO L290 TraceCheckUtils]: 15: Hoare triple {938#(= main_~p2~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {938#(= main_~p2~0 0)} is VALID [2022-04-27 15:10:24,762 INFO L290 TraceCheckUtils]: 16: Hoare triple {938#(= main_~p2~0 0)} assume !(0 != ~p1~0); {938#(= main_~p2~0 0)} is VALID [2022-04-27 15:10:24,763 INFO L290 TraceCheckUtils]: 17: Hoare triple {938#(= main_~p2~0 0)} assume 0 != ~p2~0; {934#false} is VALID [2022-04-27 15:10:24,763 INFO L290 TraceCheckUtils]: 18: Hoare triple {934#false} assume 1 != ~lk2~0; {934#false} is VALID [2022-04-27 15:10:24,763 INFO L290 TraceCheckUtils]: 19: Hoare triple {934#false} assume !false; {934#false} is VALID [2022-04-27 15:10:24,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:10:24,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:10:24,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550034919] [2022-04-27 15:10:24,763 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550034919] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:10:24,764 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:10:24,764 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:10:24,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413850373] [2022-04-27 15:10:24,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:10:24,764 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-27 15:10:24,764 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:10:24,764 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:24,776 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:24,776 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:10:24,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:10:24,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:10:24,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:10:24,777 INFO L87 Difference]: Start difference. First operand 62 states and 104 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:24,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:24,898 INFO L93 Difference]: Finished difference Result 166 states and 288 transitions. [2022-04-27 15:10:24,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:10:24,899 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:24,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:10:24,899 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:24,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 154 transitions. [2022-04-27 15:10:24,901 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:24,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 154 transitions. [2022-04-27 15:10:24,902 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 154 transitions. [2022-04-27 15:10:24,991 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 154 edges. 154 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:24,993 INFO L225 Difference]: With dead ends: 166 [2022-04-27 15:10:24,993 INFO L226 Difference]: Without dead ends: 113 [2022-04-27 15:10:24,993 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:24,994 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 129 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:10:24,994 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 67 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 15:10:24,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2022-04-27 15:10:24,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 111. [2022-04-27 15:10:24,999 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:10:25,000 INFO L82 GeneralOperation]: Start isEquivalent. First operand 113 states. Second operand has 111 states, 107 states have (on average 1.7383177570093458) internal successors, (186), 107 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:25,000 INFO L74 IsIncluded]: Start isIncluded. First operand 113 states. Second operand has 111 states, 107 states have (on average 1.7383177570093458) internal successors, (186), 107 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:25,000 INFO L87 Difference]: Start difference. First operand 113 states. Second operand has 111 states, 107 states have (on average 1.7383177570093458) internal successors, (186), 107 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:25,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:25,003 INFO L93 Difference]: Finished difference Result 113 states and 190 transitions. [2022-04-27 15:10:25,003 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 190 transitions. [2022-04-27 15:10:25,003 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:25,003 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:25,004 INFO L74 IsIncluded]: Start isIncluded. First operand has 111 states, 107 states have (on average 1.7383177570093458) internal successors, (186), 107 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 113 states. [2022-04-27 15:10:25,004 INFO L87 Difference]: Start difference. First operand has 111 states, 107 states have (on average 1.7383177570093458) internal successors, (186), 107 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 113 states. [2022-04-27 15:10:25,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:25,006 INFO L93 Difference]: Finished difference Result 113 states and 190 transitions. [2022-04-27 15:10:25,006 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 190 transitions. [2022-04-27 15:10:25,007 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:25,007 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:25,007 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:10:25,007 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:10:25,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 107 states have (on average 1.7383177570093458) internal successors, (186), 107 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:25,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 189 transitions. [2022-04-27 15:10:25,009 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 189 transitions. Word has length 20 [2022-04-27 15:10:25,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:10:25,010 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 189 transitions. [2022-04-27 15:10:25,010 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:25,010 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 189 transitions. [2022-04-27 15:10:25,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-27 15:10:25,010 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:10:25,010 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:25,011 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-27 15:10:25,011 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:10:25,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:10:25,011 INFO L85 PathProgramCache]: Analyzing trace with hash -835384116, now seen corresponding path program 1 times [2022-04-27 15:10:25,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:10:25,011 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625349820] [2022-04-27 15:10:25,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:10:25,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:10:25,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:25,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:10:25,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:25,044 INFO L290 TraceCheckUtils]: 0: Hoare triple {1478#(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); {1472#true} is VALID [2022-04-27 15:10:25,045 INFO L290 TraceCheckUtils]: 1: Hoare triple {1472#true} assume true; {1472#true} is VALID [2022-04-27 15:10:25,045 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1472#true} {1472#true} #166#return; {1472#true} is VALID [2022-04-27 15:10:25,045 INFO L272 TraceCheckUtils]: 0: Hoare triple {1472#true} call ULTIMATE.init(); {1478#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:10:25,045 INFO L290 TraceCheckUtils]: 1: Hoare triple {1478#(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); {1472#true} is VALID [2022-04-27 15:10:25,045 INFO L290 TraceCheckUtils]: 2: Hoare triple {1472#true} assume true; {1472#true} is VALID [2022-04-27 15:10:25,045 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1472#true} {1472#true} #166#return; {1472#true} is VALID [2022-04-27 15:10:25,046 INFO L272 TraceCheckUtils]: 4: Hoare triple {1472#true} call #t~ret13 := main(); {1472#true} is VALID [2022-04-27 15:10:25,046 INFO L290 TraceCheckUtils]: 5: Hoare triple {1472#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;havoc ~cond~0; {1472#true} is VALID [2022-04-27 15:10:25,046 INFO L290 TraceCheckUtils]: 6: Hoare triple {1472#true} assume !false;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~cond~0 := #t~nondet12;havoc #t~nondet12; {1472#true} is VALID [2022-04-27 15:10:25,046 INFO L290 TraceCheckUtils]: 7: Hoare triple {1472#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0; {1472#true} is VALID [2022-04-27 15:10:25,046 INFO L290 TraceCheckUtils]: 8: Hoare triple {1472#true} assume !(0 != ~p1~0); {1472#true} is VALID [2022-04-27 15:10:25,046 INFO L290 TraceCheckUtils]: 9: Hoare triple {1472#true} assume 0 != ~p2~0;~lk2~0 := 1; {1477#(= main_~lk2~0 1)} is VALID [2022-04-27 15:10:25,047 INFO L290 TraceCheckUtils]: 10: Hoare triple {1477#(= main_~lk2~0 1)} assume 0 != ~p3~0;~lk3~0 := 1; {1477#(= main_~lk2~0 1)} is VALID [2022-04-27 15:10:25,047 INFO L290 TraceCheckUtils]: 11: Hoare triple {1477#(= main_~lk2~0 1)} assume 0 != ~p4~0;~lk4~0 := 1; {1477#(= main_~lk2~0 1)} is VALID [2022-04-27 15:10:25,047 INFO L290 TraceCheckUtils]: 12: Hoare triple {1477#(= main_~lk2~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {1477#(= main_~lk2~0 1)} is VALID [2022-04-27 15:10:25,047 INFO L290 TraceCheckUtils]: 13: Hoare triple {1477#(= main_~lk2~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {1477#(= main_~lk2~0 1)} is VALID [2022-04-27 15:10:25,048 INFO L290 TraceCheckUtils]: 14: Hoare triple {1477#(= main_~lk2~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {1477#(= main_~lk2~0 1)} is VALID [2022-04-27 15:10:25,048 INFO L290 TraceCheckUtils]: 15: Hoare triple {1477#(= main_~lk2~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {1477#(= main_~lk2~0 1)} is VALID [2022-04-27 15:10:25,048 INFO L290 TraceCheckUtils]: 16: Hoare triple {1477#(= main_~lk2~0 1)} assume !(0 != ~p1~0); {1477#(= main_~lk2~0 1)} is VALID [2022-04-27 15:10:25,049 INFO L290 TraceCheckUtils]: 17: Hoare triple {1477#(= main_~lk2~0 1)} assume 0 != ~p2~0; {1477#(= main_~lk2~0 1)} is VALID [2022-04-27 15:10:25,049 INFO L290 TraceCheckUtils]: 18: Hoare triple {1477#(= main_~lk2~0 1)} assume 1 != ~lk2~0; {1473#false} is VALID [2022-04-27 15:10:25,049 INFO L290 TraceCheckUtils]: 19: Hoare triple {1473#false} assume !false; {1473#false} is VALID [2022-04-27 15:10:25,049 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:25,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:10:25,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625349820] [2022-04-27 15:10:25,050 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625349820] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:10:25,050 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:10:25,050 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:10:25,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936066115] [2022-04-27 15:10:25,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:10:25,050 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:25,050 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:10:25,050 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:25,061 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:25,062 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:10:25,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:10:25,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:10:25,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:10:25,062 INFO L87 Difference]: Start difference. First operand 111 states and 189 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:25,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:25,200 INFO L93 Difference]: Finished difference Result 143 states and 243 transitions. [2022-04-27 15:10:25,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:10:25,200 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:25,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:10:25,200 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:25,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 100 transitions. [2022-04-27 15:10:25,201 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:25,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 100 transitions. [2022-04-27 15:10:25,202 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 100 transitions. [2022-04-27 15:10:25,261 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:25,263 INFO L225 Difference]: With dead ends: 143 [2022-04-27 15:10:25,263 INFO L226 Difference]: Without dead ends: 141 [2022-04-27 15:10:25,263 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:25,264 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 84 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:10:25,264 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 104 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 15:10:25,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2022-04-27 15:10:25,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 111. [2022-04-27 15:10:25,269 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:10:25,269 INFO L82 GeneralOperation]: Start isEquivalent. First operand 141 states. Second operand has 111 states, 107 states have (on average 1.719626168224299) internal successors, (184), 107 states have internal predecessors, (184), 2 states have call successors, (2), 2 states have call 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:25,269 INFO L74 IsIncluded]: Start isIncluded. First operand 141 states. Second operand has 111 states, 107 states have (on average 1.719626168224299) internal successors, (184), 107 states have internal predecessors, (184), 2 states have call successors, (2), 2 states have call 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:25,270 INFO L87 Difference]: Start difference. First operand 141 states. Second operand has 111 states, 107 states have (on average 1.719626168224299) internal successors, (184), 107 states have internal predecessors, (184), 2 states have call successors, (2), 2 states have call 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:25,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:25,273 INFO L93 Difference]: Finished difference Result 141 states and 240 transitions. [2022-04-27 15:10:25,273 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 240 transitions. [2022-04-27 15:10:25,273 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:25,273 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:25,273 INFO L74 IsIncluded]: Start isIncluded. First operand has 111 states, 107 states have (on average 1.719626168224299) internal successors, (184), 107 states have internal predecessors, (184), 2 states have call successors, (2), 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 141 states. [2022-04-27 15:10:25,273 INFO L87 Difference]: Start difference. First operand has 111 states, 107 states have (on average 1.719626168224299) internal successors, (184), 107 states have internal predecessors, (184), 2 states have call successors, (2), 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 141 states. [2022-04-27 15:10:25,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:25,276 INFO L93 Difference]: Finished difference Result 141 states and 240 transitions. [2022-04-27 15:10:25,276 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 240 transitions. [2022-04-27 15:10:25,277 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:25,277 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:25,277 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:10:25,277 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:10:25,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 107 states have (on average 1.719626168224299) internal successors, (184), 107 states have internal predecessors, (184), 2 states have call successors, (2), 2 states have call 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:25,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 187 transitions. [2022-04-27 15:10:25,279 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 187 transitions. Word has length 20 [2022-04-27 15:10:25,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:10:25,279 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 187 transitions. [2022-04-27 15:10:25,280 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:25,280 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 187 transitions. [2022-04-27 15:10:25,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-27 15:10:25,280 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:10:25,280 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:25,280 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-27 15:10:25,280 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:10:25,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:10:25,280 INFO L85 PathProgramCache]: Analyzing trace with hash 131275990, now seen corresponding path program 1 times [2022-04-27 15:10:25,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:10:25,281 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219979578] [2022-04-27 15:10:25,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:10:25,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:10:25,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:25,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:10:25,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:25,312 INFO L290 TraceCheckUtils]: 0: Hoare triple {2050#(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); {2044#true} is VALID [2022-04-27 15:10:25,312 INFO L290 TraceCheckUtils]: 1: Hoare triple {2044#true} assume true; {2044#true} is VALID [2022-04-27 15:10:25,312 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2044#true} {2044#true} #166#return; {2044#true} is VALID [2022-04-27 15:10:25,312 INFO L272 TraceCheckUtils]: 0: Hoare triple {2044#true} call ULTIMATE.init(); {2050#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:10:25,312 INFO L290 TraceCheckUtils]: 1: Hoare triple {2050#(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); {2044#true} is VALID [2022-04-27 15:10:25,312 INFO L290 TraceCheckUtils]: 2: Hoare triple {2044#true} assume true; {2044#true} is VALID [2022-04-27 15:10:25,313 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2044#true} {2044#true} #166#return; {2044#true} is VALID [2022-04-27 15:10:25,313 INFO L272 TraceCheckUtils]: 4: Hoare triple {2044#true} call #t~ret13 := main(); {2044#true} is VALID [2022-04-27 15:10:25,313 INFO L290 TraceCheckUtils]: 5: Hoare triple {2044#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;havoc ~cond~0; {2044#true} is VALID [2022-04-27 15:10:25,313 INFO L290 TraceCheckUtils]: 6: Hoare triple {2044#true} assume !false;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~cond~0 := #t~nondet12;havoc #t~nondet12; {2044#true} is VALID [2022-04-27 15:10:25,313 INFO L290 TraceCheckUtils]: 7: Hoare triple {2044#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0; {2044#true} is VALID [2022-04-27 15:10:25,313 INFO L290 TraceCheckUtils]: 8: Hoare triple {2044#true} assume !(0 != ~p1~0); {2044#true} is VALID [2022-04-27 15:10:25,313 INFO L290 TraceCheckUtils]: 9: Hoare triple {2044#true} assume !(0 != ~p2~0); {2044#true} is VALID [2022-04-27 15:10:25,313 INFO L290 TraceCheckUtils]: 10: Hoare triple {2044#true} assume 0 != ~p3~0;~lk3~0 := 1; {2049#(= main_~lk3~0 1)} is VALID [2022-04-27 15:10:25,314 INFO L290 TraceCheckUtils]: 11: Hoare triple {2049#(= main_~lk3~0 1)} assume 0 != ~p4~0;~lk4~0 := 1; {2049#(= main_~lk3~0 1)} is VALID [2022-04-27 15:10:25,314 INFO L290 TraceCheckUtils]: 12: Hoare triple {2049#(= main_~lk3~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {2049#(= main_~lk3~0 1)} is VALID [2022-04-27 15:10:25,314 INFO L290 TraceCheckUtils]: 13: Hoare triple {2049#(= main_~lk3~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {2049#(= main_~lk3~0 1)} is VALID [2022-04-27 15:10:25,315 INFO L290 TraceCheckUtils]: 14: Hoare triple {2049#(= main_~lk3~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {2049#(= main_~lk3~0 1)} is VALID [2022-04-27 15:10:25,315 INFO L290 TraceCheckUtils]: 15: Hoare triple {2049#(= main_~lk3~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {2049#(= main_~lk3~0 1)} is VALID [2022-04-27 15:10:25,315 INFO L290 TraceCheckUtils]: 16: Hoare triple {2049#(= main_~lk3~0 1)} assume !(0 != ~p1~0); {2049#(= main_~lk3~0 1)} is VALID [2022-04-27 15:10:25,315 INFO L290 TraceCheckUtils]: 17: Hoare triple {2049#(= main_~lk3~0 1)} assume !(0 != ~p2~0); {2049#(= main_~lk3~0 1)} is VALID [2022-04-27 15:10:25,316 INFO L290 TraceCheckUtils]: 18: Hoare triple {2049#(= main_~lk3~0 1)} assume 0 != ~p3~0; {2049#(= main_~lk3~0 1)} is VALID [2022-04-27 15:10:25,316 INFO L290 TraceCheckUtils]: 19: Hoare triple {2049#(= main_~lk3~0 1)} assume 1 != ~lk3~0; {2045#false} is VALID [2022-04-27 15:10:25,316 INFO L290 TraceCheckUtils]: 20: Hoare triple {2045#false} assume !false; {2045#false} is VALID [2022-04-27 15:10:25,316 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:25,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:10:25,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219979578] [2022-04-27 15:10:25,316 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219979578] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:10:25,316 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:10:25,317 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:10:25,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475217265] [2022-04-27 15:10:25,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:10:25,317 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:25,317 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:10:25,317 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:25,328 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:25,328 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:10:25,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:10:25,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:10:25,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:10:25,329 INFO L87 Difference]: Start difference. First operand 111 states and 187 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:25,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:25,443 INFO L93 Difference]: Finished difference Result 203 states and 347 transitions. [2022-04-27 15:10:25,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:10:25,443 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:25,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:10:25,443 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:25,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 99 transitions. [2022-04-27 15:10:25,444 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:25,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 99 transitions. [2022-04-27 15:10:25,445 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 99 transitions. [2022-04-27 15:10:25,503 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 99 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:25,506 INFO L225 Difference]: With dead ends: 203 [2022-04-27 15:10:25,506 INFO L226 Difference]: Without dead ends: 201 [2022-04-27 15:10:25,506 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:25,508 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 120 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:10:25,521 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 64 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 15:10:25,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2022-04-27 15:10:25,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 151. [2022-04-27 15:10:25,527 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:10:25,527 INFO L82 GeneralOperation]: Start isEquivalent. First operand 201 states. Second operand has 151 states, 147 states have (on average 1.7006802721088434) internal successors, (250), 147 states have internal predecessors, (250), 2 states have call successors, (2), 2 states have call 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:25,527 INFO L74 IsIncluded]: Start isIncluded. First operand 201 states. Second operand has 151 states, 147 states have (on average 1.7006802721088434) internal successors, (250), 147 states have internal predecessors, (250), 2 states have call successors, (2), 2 states have call 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:25,528 INFO L87 Difference]: Start difference. First operand 201 states. Second operand has 151 states, 147 states have (on average 1.7006802721088434) internal successors, (250), 147 states have internal predecessors, (250), 2 states have call successors, (2), 2 states have call 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:25,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:25,532 INFO L93 Difference]: Finished difference Result 201 states and 342 transitions. [2022-04-27 15:10:25,532 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 342 transitions. [2022-04-27 15:10:25,532 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:25,532 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:25,532 INFO L74 IsIncluded]: Start isIncluded. First operand has 151 states, 147 states have (on average 1.7006802721088434) internal successors, (250), 147 states have internal predecessors, (250), 2 states have call successors, (2), 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 201 states. [2022-04-27 15:10:25,532 INFO L87 Difference]: Start difference. First operand has 151 states, 147 states have (on average 1.7006802721088434) internal successors, (250), 147 states have internal predecessors, (250), 2 states have call successors, (2), 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 201 states. [2022-04-27 15:10:25,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:25,537 INFO L93 Difference]: Finished difference Result 201 states and 342 transitions. [2022-04-27 15:10:25,537 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 342 transitions. [2022-04-27 15:10:25,537 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:25,537 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:25,537 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:10:25,537 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:10:25,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 147 states have (on average 1.7006802721088434) internal successors, (250), 147 states have internal predecessors, (250), 2 states have call successors, (2), 2 states have call 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:25,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 253 transitions. [2022-04-27 15:10:25,540 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 253 transitions. Word has length 21 [2022-04-27 15:10:25,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:10:25,540 INFO L495 AbstractCegarLoop]: Abstraction has 151 states and 253 transitions. [2022-04-27 15:10:25,540 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:25,540 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 253 transitions. [2022-04-27 15:10:25,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-27 15:10:25,541 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:10:25,541 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:25,541 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-27 15:10:25,541 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:10:25,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:10:25,541 INFO L85 PathProgramCache]: Analyzing trace with hash 832340568, now seen corresponding path program 1 times [2022-04-27 15:10:25,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:10:25,541 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019505826] [2022-04-27 15:10:25,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:10:25,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:10:25,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:25,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:10:25,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:25,586 INFO L290 TraceCheckUtils]: 0: Hoare triple {2844#(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); {2838#true} is VALID [2022-04-27 15:10:25,586 INFO L290 TraceCheckUtils]: 1: Hoare triple {2838#true} assume true; {2838#true} is VALID [2022-04-27 15:10:25,586 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2838#true} {2838#true} #166#return; {2838#true} is VALID [2022-04-27 15:10:25,586 INFO L272 TraceCheckUtils]: 0: Hoare triple {2838#true} call ULTIMATE.init(); {2844#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:10:25,587 INFO L290 TraceCheckUtils]: 1: Hoare triple {2844#(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); {2838#true} is VALID [2022-04-27 15:10:25,587 INFO L290 TraceCheckUtils]: 2: Hoare triple {2838#true} assume true; {2838#true} is VALID [2022-04-27 15:10:25,587 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2838#true} {2838#true} #166#return; {2838#true} is VALID [2022-04-27 15:10:25,588 INFO L272 TraceCheckUtils]: 4: Hoare triple {2838#true} call #t~ret13 := main(); {2838#true} is VALID [2022-04-27 15:10:25,588 INFO L290 TraceCheckUtils]: 5: Hoare triple {2838#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;havoc ~cond~0; {2838#true} is VALID [2022-04-27 15:10:25,589 INFO L290 TraceCheckUtils]: 6: Hoare triple {2838#true} assume !false;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~cond~0 := #t~nondet12;havoc #t~nondet12; {2838#true} is VALID [2022-04-27 15:10:25,589 INFO L290 TraceCheckUtils]: 7: Hoare triple {2838#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0; {2838#true} is VALID [2022-04-27 15:10:25,589 INFO L290 TraceCheckUtils]: 8: Hoare triple {2838#true} assume !(0 != ~p1~0); {2838#true} is VALID [2022-04-27 15:10:25,589 INFO L290 TraceCheckUtils]: 9: Hoare triple {2838#true} assume !(0 != ~p2~0); {2838#true} is VALID [2022-04-27 15:10:25,589 INFO L290 TraceCheckUtils]: 10: Hoare triple {2838#true} assume !(0 != ~p3~0); {2843#(= main_~p3~0 0)} is VALID [2022-04-27 15:10:25,589 INFO L290 TraceCheckUtils]: 11: Hoare triple {2843#(= main_~p3~0 0)} assume 0 != ~p4~0;~lk4~0 := 1; {2843#(= main_~p3~0 0)} is VALID [2022-04-27 15:10:25,590 INFO L290 TraceCheckUtils]: 12: Hoare triple {2843#(= main_~p3~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {2843#(= main_~p3~0 0)} is VALID [2022-04-27 15:10:25,590 INFO L290 TraceCheckUtils]: 13: Hoare triple {2843#(= main_~p3~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {2843#(= main_~p3~0 0)} is VALID [2022-04-27 15:10:25,590 INFO L290 TraceCheckUtils]: 14: Hoare triple {2843#(= main_~p3~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {2843#(= main_~p3~0 0)} is VALID [2022-04-27 15:10:25,590 INFO L290 TraceCheckUtils]: 15: Hoare triple {2843#(= main_~p3~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {2843#(= main_~p3~0 0)} is VALID [2022-04-27 15:10:25,591 INFO L290 TraceCheckUtils]: 16: Hoare triple {2843#(= main_~p3~0 0)} assume !(0 != ~p1~0); {2843#(= main_~p3~0 0)} is VALID [2022-04-27 15:10:25,591 INFO L290 TraceCheckUtils]: 17: Hoare triple {2843#(= main_~p3~0 0)} assume !(0 != ~p2~0); {2843#(= main_~p3~0 0)} is VALID [2022-04-27 15:10:25,591 INFO L290 TraceCheckUtils]: 18: Hoare triple {2843#(= main_~p3~0 0)} assume 0 != ~p3~0; {2839#false} is VALID [2022-04-27 15:10:25,591 INFO L290 TraceCheckUtils]: 19: Hoare triple {2839#false} assume 1 != ~lk3~0; {2839#false} is VALID [2022-04-27 15:10:25,591 INFO L290 TraceCheckUtils]: 20: Hoare triple {2839#false} assume !false; {2839#false} is VALID [2022-04-27 15:10:25,592 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:25,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:10:25,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019505826] [2022-04-27 15:10:25,593 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019505826] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:10:25,593 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:10:25,593 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:10:25,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344278051] [2022-04-27 15:10:25,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:10:25,593 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:25,593 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:10:25,593 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:25,604 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:25,604 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:10:25,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:10:25,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:10:25,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:10:25,605 INFO L87 Difference]: Start difference. First operand 151 states and 253 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:25,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:25,712 INFO L93 Difference]: Finished difference Result 351 states and 595 transitions. [2022-04-27 15:10:25,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:10:25,712 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:25,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:10:25,712 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:25,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 150 transitions. [2022-04-27 15:10:25,713 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:25,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 150 transitions. [2022-04-27 15:10:25,715 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 150 transitions. [2022-04-27 15:10:25,805 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 150 edges. 150 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:25,808 INFO L225 Difference]: With dead ends: 351 [2022-04-27 15:10:25,808 INFO L226 Difference]: Without dead ends: 209 [2022-04-27 15:10:25,809 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:25,810 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 106 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:10:25,810 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 83 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 15:10:25,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2022-04-27 15:10:25,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 207. [2022-04-27 15:10:25,816 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:10:25,816 INFO L82 GeneralOperation]: Start isEquivalent. First operand 209 states. Second operand has 207 states, 203 states have (on average 1.6748768472906403) internal successors, (340), 203 states have internal predecessors, (340), 2 states have call successors, (2), 2 states have call 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:25,817 INFO L74 IsIncluded]: Start isIncluded. First operand 209 states. Second operand has 207 states, 203 states have (on average 1.6748768472906403) internal successors, (340), 203 states have internal predecessors, (340), 2 states have call successors, (2), 2 states have call 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:25,817 INFO L87 Difference]: Start difference. First operand 209 states. Second operand has 207 states, 203 states have (on average 1.6748768472906403) internal successors, (340), 203 states have internal predecessors, (340), 2 states have call successors, (2), 2 states have call 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:25,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:25,821 INFO L93 Difference]: Finished difference Result 209 states and 344 transitions. [2022-04-27 15:10:25,821 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 344 transitions. [2022-04-27 15:10:25,821 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:25,821 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:25,822 INFO L74 IsIncluded]: Start isIncluded. First operand has 207 states, 203 states have (on average 1.6748768472906403) internal successors, (340), 203 states have internal predecessors, (340), 2 states have call successors, (2), 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 209 states. [2022-04-27 15:10:25,822 INFO L87 Difference]: Start difference. First operand has 207 states, 203 states have (on average 1.6748768472906403) internal successors, (340), 203 states have internal predecessors, (340), 2 states have call successors, (2), 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 209 states. [2022-04-27 15:10:25,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:25,826 INFO L93 Difference]: Finished difference Result 209 states and 344 transitions. [2022-04-27 15:10:25,826 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 344 transitions. [2022-04-27 15:10:25,826 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:25,826 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:25,827 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:10:25,827 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:10:25,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 203 states have (on average 1.6748768472906403) internal successors, (340), 203 states have internal predecessors, (340), 2 states have call successors, (2), 2 states have call 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:25,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 343 transitions. [2022-04-27 15:10:25,831 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 343 transitions. Word has length 21 [2022-04-27 15:10:25,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:10:25,831 INFO L495 AbstractCegarLoop]: Abstraction has 207 states and 343 transitions. [2022-04-27 15:10:25,831 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:25,831 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 343 transitions. [2022-04-27 15:10:25,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-27 15:10:25,832 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:10:25,832 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:10:25,832 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-27 15:10:25,832 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:10:25,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:10:25,832 INFO L85 PathProgramCache]: Analyzing trace with hash -225196893, now seen corresponding path program 1 times [2022-04-27 15:10:25,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:10:25,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004017935] [2022-04-27 15:10:25,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:10:25,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:10:25,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:25,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:10:25,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:25,871 INFO L290 TraceCheckUtils]: 0: Hoare triple {3866#(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); {3860#true} is VALID [2022-04-27 15:10:25,871 INFO L290 TraceCheckUtils]: 1: Hoare triple {3860#true} assume true; {3860#true} is VALID [2022-04-27 15:10:25,871 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3860#true} {3860#true} #166#return; {3860#true} is VALID [2022-04-27 15:10:25,871 INFO L272 TraceCheckUtils]: 0: Hoare triple {3860#true} call ULTIMATE.init(); {3866#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:10:25,871 INFO L290 TraceCheckUtils]: 1: Hoare triple {3866#(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); {3860#true} is VALID [2022-04-27 15:10:25,871 INFO L290 TraceCheckUtils]: 2: Hoare triple {3860#true} assume true; {3860#true} is VALID [2022-04-27 15:10:25,871 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3860#true} {3860#true} #166#return; {3860#true} is VALID [2022-04-27 15:10:25,871 INFO L272 TraceCheckUtils]: 4: Hoare triple {3860#true} call #t~ret13 := main(); {3860#true} is VALID [2022-04-27 15:10:25,872 INFO L290 TraceCheckUtils]: 5: Hoare triple {3860#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;havoc ~cond~0; {3860#true} is VALID [2022-04-27 15:10:25,872 INFO L290 TraceCheckUtils]: 6: Hoare triple {3860#true} assume !false;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~cond~0 := #t~nondet12;havoc #t~nondet12; {3860#true} is VALID [2022-04-27 15:10:25,872 INFO L290 TraceCheckUtils]: 7: Hoare triple {3860#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0; {3860#true} is VALID [2022-04-27 15:10:25,872 INFO L290 TraceCheckUtils]: 8: Hoare triple {3860#true} assume !(0 != ~p1~0); {3860#true} is VALID [2022-04-27 15:10:25,872 INFO L290 TraceCheckUtils]: 9: Hoare triple {3860#true} assume !(0 != ~p2~0); {3860#true} is VALID [2022-04-27 15:10:25,872 INFO L290 TraceCheckUtils]: 10: Hoare triple {3860#true} assume 0 != ~p3~0;~lk3~0 := 1; {3865#(not (= main_~p3~0 0))} is VALID [2022-04-27 15:10:25,872 INFO L290 TraceCheckUtils]: 11: Hoare triple {3865#(not (= main_~p3~0 0))} assume 0 != ~p4~0;~lk4~0 := 1; {3865#(not (= main_~p3~0 0))} is VALID [2022-04-27 15:10:25,873 INFO L290 TraceCheckUtils]: 12: Hoare triple {3865#(not (= main_~p3~0 0))} assume 0 != ~p5~0;~lk5~0 := 1; {3865#(not (= main_~p3~0 0))} is VALID [2022-04-27 15:10:25,873 INFO L290 TraceCheckUtils]: 13: Hoare triple {3865#(not (= main_~p3~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {3865#(not (= main_~p3~0 0))} is VALID [2022-04-27 15:10:25,873 INFO L290 TraceCheckUtils]: 14: Hoare triple {3865#(not (= main_~p3~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {3865#(not (= main_~p3~0 0))} is VALID [2022-04-27 15:10:25,874 INFO L290 TraceCheckUtils]: 15: Hoare triple {3865#(not (= main_~p3~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {3865#(not (= main_~p3~0 0))} is VALID [2022-04-27 15:10:25,874 INFO L290 TraceCheckUtils]: 16: Hoare triple {3865#(not (= main_~p3~0 0))} assume !(0 != ~p1~0); {3865#(not (= main_~p3~0 0))} is VALID [2022-04-27 15:10:25,874 INFO L290 TraceCheckUtils]: 17: Hoare triple {3865#(not (= main_~p3~0 0))} assume !(0 != ~p2~0); {3865#(not (= main_~p3~0 0))} is VALID [2022-04-27 15:10:25,874 INFO L290 TraceCheckUtils]: 18: Hoare triple {3865#(not (= main_~p3~0 0))} assume !(0 != ~p3~0); {3861#false} is VALID [2022-04-27 15:10:25,874 INFO L290 TraceCheckUtils]: 19: Hoare triple {3861#false} assume 0 != ~p4~0; {3861#false} is VALID [2022-04-27 15:10:25,875 INFO L290 TraceCheckUtils]: 20: Hoare triple {3861#false} assume 1 != ~lk4~0; {3861#false} is VALID [2022-04-27 15:10:25,875 INFO L290 TraceCheckUtils]: 21: Hoare triple {3861#false} assume !false; {3861#false} is VALID [2022-04-27 15:10:25,875 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:25,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:10:25,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004017935] [2022-04-27 15:10:25,875 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004017935] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:10:25,875 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:10:25,875 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:10:25,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381391859] [2022-04-27 15:10:25,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:10:25,876 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:25,876 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:10:25,876 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:25,887 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:25,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:10:25,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:10:25,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:10:25,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:10:25,888 INFO L87 Difference]: Start difference. First operand 207 states and 343 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:25,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:25,994 INFO L93 Difference]: Finished difference Result 313 states and 517 transitions. [2022-04-27 15:10:25,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:10:25,994 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:25,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:10:25,994 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:25,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 145 transitions. [2022-04-27 15:10:25,996 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:25,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 145 transitions. [2022-04-27 15:10:25,997 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 145 transitions. [2022-04-27 15:10:26,077 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 145 edges. 145 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:26,080 INFO L225 Difference]: With dead ends: 313 [2022-04-27 15:10:26,080 INFO L226 Difference]: Without dead ends: 215 [2022-04-27 15:10:26,080 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:26,081 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 103 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 87 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:26,081 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 87 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:26,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2022-04-27 15:10:26,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 213. [2022-04-27 15:10:26,086 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:10:26,087 INFO L82 GeneralOperation]: Start isEquivalent. First operand 215 states. Second operand has 213 states, 209 states have (on average 1.645933014354067) internal successors, (344), 209 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:26,087 INFO L74 IsIncluded]: Start isIncluded. First operand 215 states. Second operand has 213 states, 209 states have (on average 1.645933014354067) internal successors, (344), 209 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:26,087 INFO L87 Difference]: Start difference. First operand 215 states. Second operand has 213 states, 209 states have (on average 1.645933014354067) internal successors, (344), 209 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:26,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:26,091 INFO L93 Difference]: Finished difference Result 215 states and 348 transitions. [2022-04-27 15:10:26,091 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 348 transitions. [2022-04-27 15:10:26,091 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:26,091 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:26,091 INFO L74 IsIncluded]: Start isIncluded. First operand has 213 states, 209 states have (on average 1.645933014354067) internal successors, (344), 209 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 215 states. [2022-04-27 15:10:26,092 INFO L87 Difference]: Start difference. First operand has 213 states, 209 states have (on average 1.645933014354067) internal successors, (344), 209 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 215 states. [2022-04-27 15:10:26,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:26,112 INFO L93 Difference]: Finished difference Result 215 states and 348 transitions. [2022-04-27 15:10:26,112 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 348 transitions. [2022-04-27 15:10:26,112 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:26,112 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:26,112 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:10:26,112 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:10:26,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 209 states have (on average 1.645933014354067) internal successors, (344), 209 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:26,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 347 transitions. [2022-04-27 15:10:26,116 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 347 transitions. Word has length 22 [2022-04-27 15:10:26,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:10:26,116 INFO L495 AbstractCegarLoop]: Abstraction has 213 states and 347 transitions. [2022-04-27 15:10:26,117 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:26,117 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 347 transitions. [2022-04-27 15:10:26,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-27 15:10:26,117 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:10:26,117 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:26,117 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-27 15:10:26,117 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:10:26,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:10:26,118 INFO L85 PathProgramCache]: Analyzing trace with hash 32968545, now seen corresponding path program 1 times [2022-04-27 15:10:26,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:10:26,118 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43809689] [2022-04-27 15:10:26,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:10:26,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:10:26,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:26,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:10:26,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:26,146 INFO L290 TraceCheckUtils]: 0: Hoare triple {4868#(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); {4862#true} is VALID [2022-04-27 15:10:26,146 INFO L290 TraceCheckUtils]: 1: Hoare triple {4862#true} assume true; {4862#true} is VALID [2022-04-27 15:10:26,146 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4862#true} {4862#true} #166#return; {4862#true} is VALID [2022-04-27 15:10:26,146 INFO L272 TraceCheckUtils]: 0: Hoare triple {4862#true} call ULTIMATE.init(); {4868#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:10:26,146 INFO L290 TraceCheckUtils]: 1: Hoare triple {4868#(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); {4862#true} is VALID [2022-04-27 15:10:26,146 INFO L290 TraceCheckUtils]: 2: Hoare triple {4862#true} assume true; {4862#true} is VALID [2022-04-27 15:10:26,147 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4862#true} {4862#true} #166#return; {4862#true} is VALID [2022-04-27 15:10:26,147 INFO L272 TraceCheckUtils]: 4: Hoare triple {4862#true} call #t~ret13 := main(); {4862#true} is VALID [2022-04-27 15:10:26,147 INFO L290 TraceCheckUtils]: 5: Hoare triple {4862#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;havoc ~cond~0; {4862#true} is VALID [2022-04-27 15:10:26,147 INFO L290 TraceCheckUtils]: 6: Hoare triple {4862#true} assume !false;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~cond~0 := #t~nondet12;havoc #t~nondet12; {4862#true} is VALID [2022-04-27 15:10:26,147 INFO L290 TraceCheckUtils]: 7: Hoare triple {4862#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0; {4862#true} is VALID [2022-04-27 15:10:26,147 INFO L290 TraceCheckUtils]: 8: Hoare triple {4862#true} assume !(0 != ~p1~0); {4862#true} is VALID [2022-04-27 15:10:26,147 INFO L290 TraceCheckUtils]: 9: Hoare triple {4862#true} assume !(0 != ~p2~0); {4862#true} is VALID [2022-04-27 15:10:26,147 INFO L290 TraceCheckUtils]: 10: Hoare triple {4862#true} assume !(0 != ~p3~0); {4862#true} is VALID [2022-04-27 15:10:26,147 INFO L290 TraceCheckUtils]: 11: Hoare triple {4862#true} assume 0 != ~p4~0;~lk4~0 := 1; {4867#(= main_~lk4~0 1)} is VALID [2022-04-27 15:10:26,148 INFO L290 TraceCheckUtils]: 12: Hoare triple {4867#(= main_~lk4~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {4867#(= main_~lk4~0 1)} is VALID [2022-04-27 15:10:26,148 INFO L290 TraceCheckUtils]: 13: Hoare triple {4867#(= main_~lk4~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {4867#(= main_~lk4~0 1)} is VALID [2022-04-27 15:10:26,149 INFO L290 TraceCheckUtils]: 14: Hoare triple {4867#(= main_~lk4~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {4867#(= main_~lk4~0 1)} is VALID [2022-04-27 15:10:26,149 INFO L290 TraceCheckUtils]: 15: Hoare triple {4867#(= main_~lk4~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {4867#(= main_~lk4~0 1)} is VALID [2022-04-27 15:10:26,150 INFO L290 TraceCheckUtils]: 16: Hoare triple {4867#(= main_~lk4~0 1)} assume !(0 != ~p1~0); {4867#(= main_~lk4~0 1)} is VALID [2022-04-27 15:10:26,150 INFO L290 TraceCheckUtils]: 17: Hoare triple {4867#(= main_~lk4~0 1)} assume !(0 != ~p2~0); {4867#(= main_~lk4~0 1)} is VALID [2022-04-27 15:10:26,150 INFO L290 TraceCheckUtils]: 18: Hoare triple {4867#(= main_~lk4~0 1)} assume !(0 != ~p3~0); {4867#(= main_~lk4~0 1)} is VALID [2022-04-27 15:10:26,150 INFO L290 TraceCheckUtils]: 19: Hoare triple {4867#(= main_~lk4~0 1)} assume 0 != ~p4~0; {4867#(= main_~lk4~0 1)} is VALID [2022-04-27 15:10:26,151 INFO L290 TraceCheckUtils]: 20: Hoare triple {4867#(= main_~lk4~0 1)} assume 1 != ~lk4~0; {4863#false} is VALID [2022-04-27 15:10:26,151 INFO L290 TraceCheckUtils]: 21: Hoare triple {4863#false} assume !false; {4863#false} is VALID [2022-04-27 15:10:26,151 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:26,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:10:26,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43809689] [2022-04-27 15:10:26,151 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43809689] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:10:26,151 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:10:26,151 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:10:26,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060730085] [2022-04-27 15:10:26,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:10:26,152 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:26,152 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:10:26,152 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:26,163 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:26,163 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:10:26,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:10:26,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:10:26,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:10:26,164 INFO L87 Difference]: Start difference. First operand 213 states and 347 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:26,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:26,271 INFO L93 Difference]: Finished difference Result 381 states and 629 transitions. [2022-04-27 15:10:26,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:10:26,271 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:26,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:10:26,271 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:26,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 95 transitions. [2022-04-27 15:10:26,272 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:26,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 95 transitions. [2022-04-27 15:10:26,273 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 95 transitions. [2022-04-27 15:10:26,330 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:26,335 INFO L225 Difference]: With dead ends: 381 [2022-04-27 15:10:26,335 INFO L226 Difference]: Without dead ends: 379 [2022-04-27 15:10:26,335 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:26,336 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 113 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:10:26,336 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 63 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 15:10:26,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2022-04-27 15:10:26,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 297. [2022-04-27 15:10:26,342 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:10:26,342 INFO L82 GeneralOperation]: Start isEquivalent. First operand 379 states. Second operand has 297 states, 293 states have (on average 1.6109215017064846) internal successors, (472), 293 states have internal predecessors, (472), 2 states have call successors, (2), 2 states have call 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:26,343 INFO L74 IsIncluded]: Start isIncluded. First operand 379 states. Second operand has 297 states, 293 states have (on average 1.6109215017064846) internal successors, (472), 293 states have internal predecessors, (472), 2 states have call successors, (2), 2 states have call 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:26,343 INFO L87 Difference]: Start difference. First operand 379 states. Second operand has 297 states, 293 states have (on average 1.6109215017064846) internal successors, (472), 293 states have internal predecessors, (472), 2 states have call successors, (2), 2 states have call 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:26,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:26,350 INFO L93 Difference]: Finished difference Result 379 states and 620 transitions. [2022-04-27 15:10:26,351 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 620 transitions. [2022-04-27 15:10:26,351 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:26,351 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:26,351 INFO L74 IsIncluded]: Start isIncluded. First operand has 297 states, 293 states have (on average 1.6109215017064846) internal successors, (472), 293 states have internal predecessors, (472), 2 states have call successors, (2), 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 379 states. [2022-04-27 15:10:26,352 INFO L87 Difference]: Start difference. First operand has 297 states, 293 states have (on average 1.6109215017064846) internal successors, (472), 293 states have internal predecessors, (472), 2 states have call successors, (2), 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 379 states. [2022-04-27 15:10:26,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:26,359 INFO L93 Difference]: Finished difference Result 379 states and 620 transitions. [2022-04-27 15:10:26,359 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 620 transitions. [2022-04-27 15:10:26,359 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:26,359 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:26,359 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:10:26,359 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:10:26,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 293 states have (on average 1.6109215017064846) internal successors, (472), 293 states have internal predecessors, (472), 2 states have call successors, (2), 2 states have call 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:26,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 475 transitions. [2022-04-27 15:10:26,364 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 475 transitions. Word has length 22 [2022-04-27 15:10:26,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:10:26,365 INFO L495 AbstractCegarLoop]: Abstraction has 297 states and 475 transitions. [2022-04-27 15:10:26,365 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:26,365 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 475 transitions. [2022-04-27 15:10:26,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-27 15:10:26,365 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:10:26,365 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:26,365 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-27 15:10:26,366 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:10:26,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:10:26,366 INFO L85 PathProgramCache]: Analyzing trace with hash 734033123, now seen corresponding path program 1 times [2022-04-27 15:10:26,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:10:26,366 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597376158] [2022-04-27 15:10:26,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:10:26,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:10:26,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:26,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:10:26,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:26,391 INFO L290 TraceCheckUtils]: 0: Hoare triple {6354#(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); {6348#true} is VALID [2022-04-27 15:10:26,391 INFO L290 TraceCheckUtils]: 1: Hoare triple {6348#true} assume true; {6348#true} is VALID [2022-04-27 15:10:26,392 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6348#true} {6348#true} #166#return; {6348#true} is VALID [2022-04-27 15:10:26,392 INFO L272 TraceCheckUtils]: 0: Hoare triple {6348#true} call ULTIMATE.init(); {6354#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:10:26,392 INFO L290 TraceCheckUtils]: 1: Hoare triple {6354#(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); {6348#true} is VALID [2022-04-27 15:10:26,392 INFO L290 TraceCheckUtils]: 2: Hoare triple {6348#true} assume true; {6348#true} is VALID [2022-04-27 15:10:26,392 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6348#true} {6348#true} #166#return; {6348#true} is VALID [2022-04-27 15:10:26,392 INFO L272 TraceCheckUtils]: 4: Hoare triple {6348#true} call #t~ret13 := main(); {6348#true} is VALID [2022-04-27 15:10:26,392 INFO L290 TraceCheckUtils]: 5: Hoare triple {6348#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;havoc ~cond~0; {6348#true} is VALID [2022-04-27 15:10:26,392 INFO L290 TraceCheckUtils]: 6: Hoare triple {6348#true} assume !false;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~cond~0 := #t~nondet12;havoc #t~nondet12; {6348#true} is VALID [2022-04-27 15:10:26,392 INFO L290 TraceCheckUtils]: 7: Hoare triple {6348#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0; {6348#true} is VALID [2022-04-27 15:10:26,392 INFO L290 TraceCheckUtils]: 8: Hoare triple {6348#true} assume !(0 != ~p1~0); {6348#true} is VALID [2022-04-27 15:10:26,393 INFO L290 TraceCheckUtils]: 9: Hoare triple {6348#true} assume !(0 != ~p2~0); {6348#true} is VALID [2022-04-27 15:10:26,393 INFO L290 TraceCheckUtils]: 10: Hoare triple {6348#true} assume !(0 != ~p3~0); {6348#true} is VALID [2022-04-27 15:10:26,393 INFO L290 TraceCheckUtils]: 11: Hoare triple {6348#true} assume !(0 != ~p4~0); {6353#(= main_~p4~0 0)} is VALID [2022-04-27 15:10:26,393 INFO L290 TraceCheckUtils]: 12: Hoare triple {6353#(= main_~p4~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {6353#(= main_~p4~0 0)} is VALID [2022-04-27 15:10:26,393 INFO L290 TraceCheckUtils]: 13: Hoare triple {6353#(= main_~p4~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {6353#(= main_~p4~0 0)} is VALID [2022-04-27 15:10:26,394 INFO L290 TraceCheckUtils]: 14: Hoare triple {6353#(= main_~p4~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {6353#(= main_~p4~0 0)} is VALID [2022-04-27 15:10:26,394 INFO L290 TraceCheckUtils]: 15: Hoare triple {6353#(= main_~p4~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {6353#(= main_~p4~0 0)} is VALID [2022-04-27 15:10:26,394 INFO L290 TraceCheckUtils]: 16: Hoare triple {6353#(= main_~p4~0 0)} assume !(0 != ~p1~0); {6353#(= main_~p4~0 0)} is VALID [2022-04-27 15:10:26,394 INFO L290 TraceCheckUtils]: 17: Hoare triple {6353#(= main_~p4~0 0)} assume !(0 != ~p2~0); {6353#(= main_~p4~0 0)} is VALID [2022-04-27 15:10:26,395 INFO L290 TraceCheckUtils]: 18: Hoare triple {6353#(= main_~p4~0 0)} assume !(0 != ~p3~0); {6353#(= main_~p4~0 0)} is VALID [2022-04-27 15:10:26,395 INFO L290 TraceCheckUtils]: 19: Hoare triple {6353#(= main_~p4~0 0)} assume 0 != ~p4~0; {6349#false} is VALID [2022-04-27 15:10:26,395 INFO L290 TraceCheckUtils]: 20: Hoare triple {6349#false} assume 1 != ~lk4~0; {6349#false} is VALID [2022-04-27 15:10:26,395 INFO L290 TraceCheckUtils]: 21: Hoare triple {6349#false} assume !false; {6349#false} is VALID [2022-04-27 15:10:26,395 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:26,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:10:26,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597376158] [2022-04-27 15:10:26,395 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597376158] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:10:26,396 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:10:26,396 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:10:26,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532707471] [2022-04-27 15:10:26,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:10:26,396 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:26,396 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:10:26,396 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:26,408 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:26,408 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:10:26,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:10:26,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:10:26,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:10:26,409 INFO L87 Difference]: Start difference. First operand 297 states and 475 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:26,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:26,526 INFO L93 Difference]: Finished difference Result 685 states and 1101 transitions. [2022-04-27 15:10:26,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:10:26,526 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:26,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:10:26,527 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:26,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 147 transitions. [2022-04-27 15:10:26,529 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:26,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 147 transitions. [2022-04-27 15:10:26,529 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 147 transitions. [2022-04-27 15:10:26,608 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 147 edges. 147 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:26,620 INFO L225 Difference]: With dead ends: 685 [2022-04-27 15:10:26,620 INFO L226 Difference]: Without dead ends: 403 [2022-04-27 15:10:26,622 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:26,623 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 100 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:10:26,623 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 85 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 15:10:26,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2022-04-27 15:10:26,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 401. [2022-04-27 15:10:26,631 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:10:26,632 INFO L82 GeneralOperation]: Start isEquivalent. First operand 403 states. Second operand has 401 states, 397 states have (on average 1.5818639798488665) internal successors, (628), 397 states have internal predecessors, (628), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:26,632 INFO L74 IsIncluded]: Start isIncluded. First operand 403 states. Second operand has 401 states, 397 states have (on average 1.5818639798488665) internal successors, (628), 397 states have internal predecessors, (628), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:26,634 INFO L87 Difference]: Start difference. First operand 403 states. Second operand has 401 states, 397 states have (on average 1.5818639798488665) internal successors, (628), 397 states have internal predecessors, (628), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:26,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:26,641 INFO L93 Difference]: Finished difference Result 403 states and 632 transitions. [2022-04-27 15:10:26,641 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 632 transitions. [2022-04-27 15:10:26,642 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:26,642 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:26,643 INFO L74 IsIncluded]: Start isIncluded. First operand has 401 states, 397 states have (on average 1.5818639798488665) internal successors, (628), 397 states have internal predecessors, (628), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 403 states. [2022-04-27 15:10:26,644 INFO L87 Difference]: Start difference. First operand has 401 states, 397 states have (on average 1.5818639798488665) internal successors, (628), 397 states have internal predecessors, (628), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 403 states. [2022-04-27 15:10:26,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:26,652 INFO L93 Difference]: Finished difference Result 403 states and 632 transitions. [2022-04-27 15:10:26,652 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 632 transitions. [2022-04-27 15:10:26,652 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:26,652 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:26,652 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:10:26,652 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:10:26,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 401 states, 397 states have (on average 1.5818639798488665) internal successors, (628), 397 states have internal predecessors, (628), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:26,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 631 transitions. [2022-04-27 15:10:26,660 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 631 transitions. Word has length 22 [2022-04-27 15:10:26,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:10:26,660 INFO L495 AbstractCegarLoop]: Abstraction has 401 states and 631 transitions. [2022-04-27 15:10:26,660 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:26,660 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 631 transitions. [2022-04-27 15:10:26,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-27 15:10:26,662 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:10:26,662 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:10:26,662 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-27 15:10:26,662 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:10:26,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:10:26,663 INFO L85 PathProgramCache]: Analyzing trace with hash 1022239949, now seen corresponding path program 1 times [2022-04-27 15:10:26,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:10:26,663 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67319252] [2022-04-27 15:10:26,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:10:26,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:10:26,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:26,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:10:26,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:26,705 INFO L290 TraceCheckUtils]: 0: Hoare triple {8312#(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); {8306#true} is VALID [2022-04-27 15:10:26,705 INFO L290 TraceCheckUtils]: 1: Hoare triple {8306#true} assume true; {8306#true} is VALID [2022-04-27 15:10:26,705 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8306#true} {8306#true} #166#return; {8306#true} is VALID [2022-04-27 15:10:26,705 INFO L272 TraceCheckUtils]: 0: Hoare triple {8306#true} call ULTIMATE.init(); {8312#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:10:26,705 INFO L290 TraceCheckUtils]: 1: Hoare triple {8312#(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); {8306#true} is VALID [2022-04-27 15:10:26,705 INFO L290 TraceCheckUtils]: 2: Hoare triple {8306#true} assume true; {8306#true} is VALID [2022-04-27 15:10:26,710 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8306#true} {8306#true} #166#return; {8306#true} is VALID [2022-04-27 15:10:26,710 INFO L272 TraceCheckUtils]: 4: Hoare triple {8306#true} call #t~ret13 := main(); {8306#true} is VALID [2022-04-27 15:10:26,710 INFO L290 TraceCheckUtils]: 5: Hoare triple {8306#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;havoc ~cond~0; {8306#true} is VALID [2022-04-27 15:10:26,711 INFO L290 TraceCheckUtils]: 6: Hoare triple {8306#true} assume !false;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~cond~0 := #t~nondet12;havoc #t~nondet12; {8306#true} is VALID [2022-04-27 15:10:26,711 INFO L290 TraceCheckUtils]: 7: Hoare triple {8306#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0; {8306#true} is VALID [2022-04-27 15:10:26,711 INFO L290 TraceCheckUtils]: 8: Hoare triple {8306#true} assume !(0 != ~p1~0); {8306#true} is VALID [2022-04-27 15:10:26,711 INFO L290 TraceCheckUtils]: 9: Hoare triple {8306#true} assume !(0 != ~p2~0); {8306#true} is VALID [2022-04-27 15:10:26,711 INFO L290 TraceCheckUtils]: 10: Hoare triple {8306#true} assume !(0 != ~p3~0); {8306#true} is VALID [2022-04-27 15:10:26,711 INFO L290 TraceCheckUtils]: 11: Hoare triple {8306#true} assume 0 != ~p4~0;~lk4~0 := 1; {8311#(not (= main_~p4~0 0))} is VALID [2022-04-27 15:10:26,711 INFO L290 TraceCheckUtils]: 12: Hoare triple {8311#(not (= main_~p4~0 0))} assume 0 != ~p5~0;~lk5~0 := 1; {8311#(not (= main_~p4~0 0))} is VALID [2022-04-27 15:10:26,713 INFO L290 TraceCheckUtils]: 13: Hoare triple {8311#(not (= main_~p4~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {8311#(not (= main_~p4~0 0))} is VALID [2022-04-27 15:10:26,713 INFO L290 TraceCheckUtils]: 14: Hoare triple {8311#(not (= main_~p4~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {8311#(not (= main_~p4~0 0))} is VALID [2022-04-27 15:10:26,714 INFO L290 TraceCheckUtils]: 15: Hoare triple {8311#(not (= main_~p4~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {8311#(not (= main_~p4~0 0))} is VALID [2022-04-27 15:10:26,714 INFO L290 TraceCheckUtils]: 16: Hoare triple {8311#(not (= main_~p4~0 0))} assume !(0 != ~p1~0); {8311#(not (= main_~p4~0 0))} is VALID [2022-04-27 15:10:26,714 INFO L290 TraceCheckUtils]: 17: Hoare triple {8311#(not (= main_~p4~0 0))} assume !(0 != ~p2~0); {8311#(not (= main_~p4~0 0))} is VALID [2022-04-27 15:10:26,714 INFO L290 TraceCheckUtils]: 18: Hoare triple {8311#(not (= main_~p4~0 0))} assume !(0 != ~p3~0); {8311#(not (= main_~p4~0 0))} is VALID [2022-04-27 15:10:26,715 INFO L290 TraceCheckUtils]: 19: Hoare triple {8311#(not (= main_~p4~0 0))} assume !(0 != ~p4~0); {8307#false} is VALID [2022-04-27 15:10:26,715 INFO L290 TraceCheckUtils]: 20: Hoare triple {8307#false} assume 0 != ~p5~0; {8307#false} is VALID [2022-04-27 15:10:26,715 INFO L290 TraceCheckUtils]: 21: Hoare triple {8307#false} assume 1 != ~lk5~0; {8307#false} is VALID [2022-04-27 15:10:26,715 INFO L290 TraceCheckUtils]: 22: Hoare triple {8307#false} assume !false; {8307#false} is VALID [2022-04-27 15:10:26,715 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:26,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:10:26,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67319252] [2022-04-27 15:10:26,715 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67319252] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:10:26,715 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:10:26,715 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:10:26,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647770485] [2022-04-27 15:10:26,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:10:26,716 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-27 15:10:26,716 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:10:26,716 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:26,728 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:26,728 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:10:26,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:10:26,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:10:26,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:10:26,728 INFO L87 Difference]: Start difference. First operand 401 states and 631 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:26,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:26,837 INFO L93 Difference]: Finished difference Result 601 states and 941 transitions. [2022-04-27 15:10:26,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:10:26,837 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-27 15:10:26,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:10:26,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:26,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 142 transitions. [2022-04-27 15:10:26,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:26,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 142 transitions. [2022-04-27 15:10:26,839 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 142 transitions. [2022-04-27 15:10:26,914 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 142 edges. 142 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:26,920 INFO L225 Difference]: With dead ends: 601 [2022-04-27 15:10:26,920 INFO L226 Difference]: Without dead ends: 411 [2022-04-27 15:10:26,921 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:26,921 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 102 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:10:26,921 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 84 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 15:10:26,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2022-04-27 15:10:26,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 409. [2022-04-27 15:10:26,946 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:10:26,947 INFO L82 GeneralOperation]: Start isEquivalent. First operand 411 states. Second operand has 409 states, 405 states have (on average 1.5506172839506174) internal successors, (628), 405 states have internal predecessors, (628), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:26,947 INFO L74 IsIncluded]: Start isIncluded. First operand 411 states. Second operand has 409 states, 405 states have (on average 1.5506172839506174) internal successors, (628), 405 states have internal predecessors, (628), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:26,947 INFO L87 Difference]: Start difference. First operand 411 states. Second operand has 409 states, 405 states have (on average 1.5506172839506174) internal successors, (628), 405 states have internal predecessors, (628), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:26,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:26,956 INFO L93 Difference]: Finished difference Result 411 states and 632 transitions. [2022-04-27 15:10:26,956 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 632 transitions. [2022-04-27 15:10:26,957 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:26,957 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:26,957 INFO L74 IsIncluded]: Start isIncluded. First operand has 409 states, 405 states have (on average 1.5506172839506174) internal successors, (628), 405 states have internal predecessors, (628), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 411 states. [2022-04-27 15:10:26,957 INFO L87 Difference]: Start difference. First operand has 409 states, 405 states have (on average 1.5506172839506174) internal successors, (628), 405 states have internal predecessors, (628), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 411 states. [2022-04-27 15:10:26,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:26,964 INFO L93 Difference]: Finished difference Result 411 states and 632 transitions. [2022-04-27 15:10:26,965 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 632 transitions. [2022-04-27 15:10:26,965 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:26,965 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:26,965 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:10:26,965 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:10:26,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 409 states, 405 states have (on average 1.5506172839506174) internal successors, (628), 405 states have internal predecessors, (628), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:26,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 631 transitions. [2022-04-27 15:10:26,972 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 631 transitions. Word has length 23 [2022-04-27 15:10:26,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:10:26,973 INFO L495 AbstractCegarLoop]: Abstraction has 409 states and 631 transitions. [2022-04-27 15:10:26,973 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:26,973 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 631 transitions. [2022-04-27 15:10:26,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-27 15:10:26,973 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:10:26,973 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:10:26,973 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-27 15:10:26,973 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:10:26,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:10:26,974 INFO L85 PathProgramCache]: Analyzing trace with hash 1280405387, now seen corresponding path program 1 times [2022-04-27 15:10:26,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:10:26,974 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82440099] [2022-04-27 15:10:26,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:10:26,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:10:26,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:26,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:10:26,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:26,996 INFO L290 TraceCheckUtils]: 0: Hoare triple {10210#(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); {10204#true} is VALID [2022-04-27 15:10:26,997 INFO L290 TraceCheckUtils]: 1: Hoare triple {10204#true} assume true; {10204#true} is VALID [2022-04-27 15:10:26,997 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10204#true} {10204#true} #166#return; {10204#true} is VALID [2022-04-27 15:10:26,997 INFO L272 TraceCheckUtils]: 0: Hoare triple {10204#true} call ULTIMATE.init(); {10210#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:10:26,997 INFO L290 TraceCheckUtils]: 1: Hoare triple {10210#(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); {10204#true} is VALID [2022-04-27 15:10:26,997 INFO L290 TraceCheckUtils]: 2: Hoare triple {10204#true} assume true; {10204#true} is VALID [2022-04-27 15:10:26,997 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10204#true} {10204#true} #166#return; {10204#true} is VALID [2022-04-27 15:10:26,997 INFO L272 TraceCheckUtils]: 4: Hoare triple {10204#true} call #t~ret13 := main(); {10204#true} is VALID [2022-04-27 15:10:26,997 INFO L290 TraceCheckUtils]: 5: Hoare triple {10204#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;havoc ~cond~0; {10204#true} is VALID [2022-04-27 15:10:26,997 INFO L290 TraceCheckUtils]: 6: Hoare triple {10204#true} assume !false;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~cond~0 := #t~nondet12;havoc #t~nondet12; {10204#true} is VALID [2022-04-27 15:10:26,997 INFO L290 TraceCheckUtils]: 7: Hoare triple {10204#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0; {10204#true} is VALID [2022-04-27 15:10:26,997 INFO L290 TraceCheckUtils]: 8: Hoare triple {10204#true} assume !(0 != ~p1~0); {10204#true} is VALID [2022-04-27 15:10:26,998 INFO L290 TraceCheckUtils]: 9: Hoare triple {10204#true} assume !(0 != ~p2~0); {10204#true} is VALID [2022-04-27 15:10:26,998 INFO L290 TraceCheckUtils]: 10: Hoare triple {10204#true} assume !(0 != ~p3~0); {10204#true} is VALID [2022-04-27 15:10:26,998 INFO L290 TraceCheckUtils]: 11: Hoare triple {10204#true} assume !(0 != ~p4~0); {10204#true} is VALID [2022-04-27 15:10:26,998 INFO L290 TraceCheckUtils]: 12: Hoare triple {10204#true} assume 0 != ~p5~0;~lk5~0 := 1; {10209#(= main_~lk5~0 1)} is VALID [2022-04-27 15:10:26,998 INFO L290 TraceCheckUtils]: 13: Hoare triple {10209#(= main_~lk5~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {10209#(= main_~lk5~0 1)} is VALID [2022-04-27 15:10:26,998 INFO L290 TraceCheckUtils]: 14: Hoare triple {10209#(= main_~lk5~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {10209#(= main_~lk5~0 1)} is VALID [2022-04-27 15:10:26,999 INFO L290 TraceCheckUtils]: 15: Hoare triple {10209#(= main_~lk5~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {10209#(= main_~lk5~0 1)} is VALID [2022-04-27 15:10:26,999 INFO L290 TraceCheckUtils]: 16: Hoare triple {10209#(= main_~lk5~0 1)} assume !(0 != ~p1~0); {10209#(= main_~lk5~0 1)} is VALID [2022-04-27 15:10:26,999 INFO L290 TraceCheckUtils]: 17: Hoare triple {10209#(= main_~lk5~0 1)} assume !(0 != ~p2~0); {10209#(= main_~lk5~0 1)} is VALID [2022-04-27 15:10:26,999 INFO L290 TraceCheckUtils]: 18: Hoare triple {10209#(= main_~lk5~0 1)} assume !(0 != ~p3~0); {10209#(= main_~lk5~0 1)} is VALID [2022-04-27 15:10:27,000 INFO L290 TraceCheckUtils]: 19: Hoare triple {10209#(= main_~lk5~0 1)} assume !(0 != ~p4~0); {10209#(= main_~lk5~0 1)} is VALID [2022-04-27 15:10:27,000 INFO L290 TraceCheckUtils]: 20: Hoare triple {10209#(= main_~lk5~0 1)} assume 0 != ~p5~0; {10209#(= main_~lk5~0 1)} is VALID [2022-04-27 15:10:27,000 INFO L290 TraceCheckUtils]: 21: Hoare triple {10209#(= main_~lk5~0 1)} assume 1 != ~lk5~0; {10205#false} is VALID [2022-04-27 15:10:27,000 INFO L290 TraceCheckUtils]: 22: Hoare triple {10205#false} assume !false; {10205#false} is VALID [2022-04-27 15:10:27,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:10:27,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:10:27,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82440099] [2022-04-27 15:10:27,000 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82440099] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:10:27,001 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:10:27,001 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:10:27,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474330053] [2022-04-27 15:10:27,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:10:27,001 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-27 15:10:27,001 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:10:27,001 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:27,012 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:27,013 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:10:27,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:10:27,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:10:27,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:10:27,013 INFO L87 Difference]: Start difference. First operand 409 states and 631 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:27,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:27,123 INFO L93 Difference]: Finished difference Result 717 states and 1121 transitions. [2022-04-27 15:10:27,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:10:27,123 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-27 15:10:27,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:10:27,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:27,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 91 transitions. [2022-04-27 15:10:27,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:27,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 91 transitions. [2022-04-27 15:10:27,125 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 91 transitions. [2022-04-27 15:10:27,177 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:27,192 INFO L225 Difference]: With dead ends: 717 [2022-04-27 15:10:27,192 INFO L226 Difference]: Without dead ends: 715 [2022-04-27 15:10:27,193 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:27,193 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 106 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:10:27,193 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 62 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 15:10:27,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 715 states. [2022-04-27 15:10:27,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 715 to 585. [2022-04-27 15:10:27,203 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:10:27,203 INFO L82 GeneralOperation]: Start isEquivalent. First operand 715 states. Second operand has 585 states, 581 states have (on average 1.5077452667814113) internal successors, (876), 581 states have internal predecessors, (876), 2 states have call successors, (2), 2 states have call 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:27,204 INFO L74 IsIncluded]: Start isIncluded. First operand 715 states. Second operand has 585 states, 581 states have (on average 1.5077452667814113) internal successors, (876), 581 states have internal predecessors, (876), 2 states have call successors, (2), 2 states have call 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:27,205 INFO L87 Difference]: Start difference. First operand 715 states. Second operand has 585 states, 581 states have (on average 1.5077452667814113) internal successors, (876), 581 states have internal predecessors, (876), 2 states have call successors, (2), 2 states have call 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:27,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:27,221 INFO L93 Difference]: Finished difference Result 715 states and 1104 transitions. [2022-04-27 15:10:27,221 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 1104 transitions. [2022-04-27 15:10:27,221 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:27,221 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:27,222 INFO L74 IsIncluded]: Start isIncluded. First operand has 585 states, 581 states have (on average 1.5077452667814113) internal successors, (876), 581 states have internal predecessors, (876), 2 states have call successors, (2), 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 715 states. [2022-04-27 15:10:27,223 INFO L87 Difference]: Start difference. First operand has 585 states, 581 states have (on average 1.5077452667814113) internal successors, (876), 581 states have internal predecessors, (876), 2 states have call successors, (2), 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 715 states. [2022-04-27 15:10:27,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:27,239 INFO L93 Difference]: Finished difference Result 715 states and 1104 transitions. [2022-04-27 15:10:27,239 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 1104 transitions. [2022-04-27 15:10:27,240 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:27,240 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:27,240 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:10:27,240 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:10:27,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 585 states, 581 states have (on average 1.5077452667814113) internal successors, (876), 581 states have internal predecessors, (876), 2 states have call successors, (2), 2 states have call 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:27,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 879 transitions. [2022-04-27 15:10:27,253 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 879 transitions. Word has length 23 [2022-04-27 15:10:27,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:10:27,253 INFO L495 AbstractCegarLoop]: Abstraction has 585 states and 879 transitions. [2022-04-27 15:10:27,253 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:27,253 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 879 transitions. [2022-04-27 15:10:27,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-27 15:10:27,254 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:10:27,254 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:10:27,254 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-27 15:10:27,254 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:10:27,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:10:27,254 INFO L85 PathProgramCache]: Analyzing trace with hash 1981469965, now seen corresponding path program 1 times [2022-04-27 15:10:27,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:10:27,254 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437412436] [2022-04-27 15:10:27,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:10:27,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:10:27,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:27,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:10:27,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:27,279 INFO L290 TraceCheckUtils]: 0: Hoare triple {13016#(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); {13010#true} is VALID [2022-04-27 15:10:27,279 INFO L290 TraceCheckUtils]: 1: Hoare triple {13010#true} assume true; {13010#true} is VALID [2022-04-27 15:10:27,279 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13010#true} {13010#true} #166#return; {13010#true} is VALID [2022-04-27 15:10:27,279 INFO L272 TraceCheckUtils]: 0: Hoare triple {13010#true} call ULTIMATE.init(); {13016#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:10:27,279 INFO L290 TraceCheckUtils]: 1: Hoare triple {13016#(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); {13010#true} is VALID [2022-04-27 15:10:27,280 INFO L290 TraceCheckUtils]: 2: Hoare triple {13010#true} assume true; {13010#true} is VALID [2022-04-27 15:10:27,280 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13010#true} {13010#true} #166#return; {13010#true} is VALID [2022-04-27 15:10:27,280 INFO L272 TraceCheckUtils]: 4: Hoare triple {13010#true} call #t~ret13 := main(); {13010#true} is VALID [2022-04-27 15:10:27,280 INFO L290 TraceCheckUtils]: 5: Hoare triple {13010#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;havoc ~cond~0; {13010#true} is VALID [2022-04-27 15:10:27,280 INFO L290 TraceCheckUtils]: 6: Hoare triple {13010#true} assume !false;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~cond~0 := #t~nondet12;havoc #t~nondet12; {13010#true} is VALID [2022-04-27 15:10:27,280 INFO L290 TraceCheckUtils]: 7: Hoare triple {13010#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0; {13010#true} is VALID [2022-04-27 15:10:27,280 INFO L290 TraceCheckUtils]: 8: Hoare triple {13010#true} assume !(0 != ~p1~0); {13010#true} is VALID [2022-04-27 15:10:27,280 INFO L290 TraceCheckUtils]: 9: Hoare triple {13010#true} assume !(0 != ~p2~0); {13010#true} is VALID [2022-04-27 15:10:27,280 INFO L290 TraceCheckUtils]: 10: Hoare triple {13010#true} assume !(0 != ~p3~0); {13010#true} is VALID [2022-04-27 15:10:27,280 INFO L290 TraceCheckUtils]: 11: Hoare triple {13010#true} assume !(0 != ~p4~0); {13010#true} is VALID [2022-04-27 15:10:27,281 INFO L290 TraceCheckUtils]: 12: Hoare triple {13010#true} assume !(0 != ~p5~0); {13015#(= main_~p5~0 0)} is VALID [2022-04-27 15:10:27,281 INFO L290 TraceCheckUtils]: 13: Hoare triple {13015#(= main_~p5~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {13015#(= main_~p5~0 0)} is VALID [2022-04-27 15:10:27,281 INFO L290 TraceCheckUtils]: 14: Hoare triple {13015#(= main_~p5~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {13015#(= main_~p5~0 0)} is VALID [2022-04-27 15:10:27,282 INFO L290 TraceCheckUtils]: 15: Hoare triple {13015#(= main_~p5~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {13015#(= main_~p5~0 0)} is VALID [2022-04-27 15:10:27,282 INFO L290 TraceCheckUtils]: 16: Hoare triple {13015#(= main_~p5~0 0)} assume !(0 != ~p1~0); {13015#(= main_~p5~0 0)} is VALID [2022-04-27 15:10:27,283 INFO L290 TraceCheckUtils]: 17: Hoare triple {13015#(= main_~p5~0 0)} assume !(0 != ~p2~0); {13015#(= main_~p5~0 0)} is VALID [2022-04-27 15:10:27,283 INFO L290 TraceCheckUtils]: 18: Hoare triple {13015#(= main_~p5~0 0)} assume !(0 != ~p3~0); {13015#(= main_~p5~0 0)} is VALID [2022-04-27 15:10:27,283 INFO L290 TraceCheckUtils]: 19: Hoare triple {13015#(= main_~p5~0 0)} assume !(0 != ~p4~0); {13015#(= main_~p5~0 0)} is VALID [2022-04-27 15:10:27,283 INFO L290 TraceCheckUtils]: 20: Hoare triple {13015#(= main_~p5~0 0)} assume 0 != ~p5~0; {13011#false} is VALID [2022-04-27 15:10:27,283 INFO L290 TraceCheckUtils]: 21: Hoare triple {13011#false} assume 1 != ~lk5~0; {13011#false} is VALID [2022-04-27 15:10:27,284 INFO L290 TraceCheckUtils]: 22: Hoare triple {13011#false} assume !false; {13011#false} is VALID [2022-04-27 15:10:27,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:27,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:10:27,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437412436] [2022-04-27 15:10:27,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437412436] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:10:27,284 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:10:27,284 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:10:27,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975923399] [2022-04-27 15:10:27,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:10:27,284 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-27 15:10:27,284 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:10:27,285 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:27,296 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:27,296 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:10:27,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:10:27,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:10:27,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:10:27,296 INFO L87 Difference]: Start difference. First operand 585 states and 879 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:27,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:27,442 INFO L93 Difference]: Finished difference Result 1341 states and 2017 transitions. [2022-04-27 15:10:27,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:10:27,442 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-27 15:10:27,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:10:27,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:27,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 144 transitions. [2022-04-27 15:10:27,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:27,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 144 transitions. [2022-04-27 15:10:27,445 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 144 transitions. [2022-04-27 15:10:27,519 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 144 edges. 144 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:27,539 INFO L225 Difference]: With dead ends: 1341 [2022-04-27 15:10:27,540 INFO L226 Difference]: Without dead ends: 779 [2022-04-27 15:10:27,540 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:27,541 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 94 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:10:27,541 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 87 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 15:10:27,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 779 states. [2022-04-27 15:10:27,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 779 to 777. [2022-04-27 15:10:27,554 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:10:27,555 INFO L82 GeneralOperation]: Start isEquivalent. First operand 779 states. Second operand has 777 states, 773 states have (on average 1.4747736093143597) internal successors, (1140), 773 states have internal predecessors, (1140), 2 states have call successors, (2), 2 states have call 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:27,556 INFO L74 IsIncluded]: Start isIncluded. First operand 779 states. Second operand has 777 states, 773 states have (on average 1.4747736093143597) internal successors, (1140), 773 states have internal predecessors, (1140), 2 states have call successors, (2), 2 states have call 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:27,556 INFO L87 Difference]: Start difference. First operand 779 states. Second operand has 777 states, 773 states have (on average 1.4747736093143597) internal successors, (1140), 773 states have internal predecessors, (1140), 2 states have call successors, (2), 2 states have call 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:27,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:27,576 INFO L93 Difference]: Finished difference Result 779 states and 1144 transitions. [2022-04-27 15:10:27,576 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 1144 transitions. [2022-04-27 15:10:27,577 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:27,577 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:27,578 INFO L74 IsIncluded]: Start isIncluded. First operand has 777 states, 773 states have (on average 1.4747736093143597) internal successors, (1140), 773 states have internal predecessors, (1140), 2 states have call successors, (2), 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 779 states. [2022-04-27 15:10:27,579 INFO L87 Difference]: Start difference. First operand has 777 states, 773 states have (on average 1.4747736093143597) internal successors, (1140), 773 states have internal predecessors, (1140), 2 states have call successors, (2), 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 779 states. [2022-04-27 15:10:27,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:27,599 INFO L93 Difference]: Finished difference Result 779 states and 1144 transitions. [2022-04-27 15:10:27,599 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 1144 transitions. [2022-04-27 15:10:27,600 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:27,600 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:27,600 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:10:27,600 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:10:27,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 777 states, 773 states have (on average 1.4747736093143597) internal successors, (1140), 773 states have internal predecessors, (1140), 2 states have call successors, (2), 2 states have call 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:27,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 1143 transitions. [2022-04-27 15:10:27,621 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 1143 transitions. Word has length 23 [2022-04-27 15:10:27,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:10:27,621 INFO L495 AbstractCegarLoop]: Abstraction has 777 states and 1143 transitions. [2022-04-27 15:10:27,621 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:27,621 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 1143 transitions. [2022-04-27 15:10:27,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-27 15:10:27,622 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:10:27,622 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:10:27,622 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-27 15:10:27,622 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:10:27,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:10:27,622 INFO L85 PathProgramCache]: Analyzing trace with hash 1038076728, now seen corresponding path program 1 times [2022-04-27 15:10:27,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:10:27,622 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699712215] [2022-04-27 15:10:27,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:10:27,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:10:27,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:27,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:10:27,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:27,662 INFO L290 TraceCheckUtils]: 0: Hoare triple {16798#(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); {16792#true} is VALID [2022-04-27 15:10:27,662 INFO L290 TraceCheckUtils]: 1: Hoare triple {16792#true} assume true; {16792#true} is VALID [2022-04-27 15:10:27,662 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16792#true} {16792#true} #166#return; {16792#true} is VALID [2022-04-27 15:10:27,662 INFO L272 TraceCheckUtils]: 0: Hoare triple {16792#true} call ULTIMATE.init(); {16798#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:10:27,662 INFO L290 TraceCheckUtils]: 1: Hoare triple {16798#(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); {16792#true} is VALID [2022-04-27 15:10:27,663 INFO L290 TraceCheckUtils]: 2: Hoare triple {16792#true} assume true; {16792#true} is VALID [2022-04-27 15:10:27,663 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16792#true} {16792#true} #166#return; {16792#true} is VALID [2022-04-27 15:10:27,663 INFO L272 TraceCheckUtils]: 4: Hoare triple {16792#true} call #t~ret13 := main(); {16792#true} is VALID [2022-04-27 15:10:27,663 INFO L290 TraceCheckUtils]: 5: Hoare triple {16792#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;havoc ~cond~0; {16792#true} is VALID [2022-04-27 15:10:27,663 INFO L290 TraceCheckUtils]: 6: Hoare triple {16792#true} assume !false;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~cond~0 := #t~nondet12;havoc #t~nondet12; {16792#true} is VALID [2022-04-27 15:10:27,663 INFO L290 TraceCheckUtils]: 7: Hoare triple {16792#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0; {16792#true} is VALID [2022-04-27 15:10:27,663 INFO L290 TraceCheckUtils]: 8: Hoare triple {16792#true} assume !(0 != ~p1~0); {16792#true} is VALID [2022-04-27 15:10:27,663 INFO L290 TraceCheckUtils]: 9: Hoare triple {16792#true} assume !(0 != ~p2~0); {16792#true} is VALID [2022-04-27 15:10:27,663 INFO L290 TraceCheckUtils]: 10: Hoare triple {16792#true} assume !(0 != ~p3~0); {16792#true} is VALID [2022-04-27 15:10:27,663 INFO L290 TraceCheckUtils]: 11: Hoare triple {16792#true} assume !(0 != ~p4~0); {16792#true} is VALID [2022-04-27 15:10:27,664 INFO L290 TraceCheckUtils]: 12: Hoare triple {16792#true} assume 0 != ~p5~0;~lk5~0 := 1; {16797#(not (= main_~p5~0 0))} is VALID [2022-04-27 15:10:27,664 INFO L290 TraceCheckUtils]: 13: Hoare triple {16797#(not (= main_~p5~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {16797#(not (= main_~p5~0 0))} is VALID [2022-04-27 15:10:27,664 INFO L290 TraceCheckUtils]: 14: Hoare triple {16797#(not (= main_~p5~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {16797#(not (= main_~p5~0 0))} is VALID [2022-04-27 15:10:27,664 INFO L290 TraceCheckUtils]: 15: Hoare triple {16797#(not (= main_~p5~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {16797#(not (= main_~p5~0 0))} is VALID [2022-04-27 15:10:27,667 INFO L290 TraceCheckUtils]: 16: Hoare triple {16797#(not (= main_~p5~0 0))} assume !(0 != ~p1~0); {16797#(not (= main_~p5~0 0))} is VALID [2022-04-27 15:10:27,669 INFO L290 TraceCheckUtils]: 17: Hoare triple {16797#(not (= main_~p5~0 0))} assume !(0 != ~p2~0); {16797#(not (= main_~p5~0 0))} is VALID [2022-04-27 15:10:27,669 INFO L290 TraceCheckUtils]: 18: Hoare triple {16797#(not (= main_~p5~0 0))} assume !(0 != ~p3~0); {16797#(not (= main_~p5~0 0))} is VALID [2022-04-27 15:10:27,670 INFO L290 TraceCheckUtils]: 19: Hoare triple {16797#(not (= main_~p5~0 0))} assume !(0 != ~p4~0); {16797#(not (= main_~p5~0 0))} is VALID [2022-04-27 15:10:27,670 INFO L290 TraceCheckUtils]: 20: Hoare triple {16797#(not (= main_~p5~0 0))} assume !(0 != ~p5~0); {16793#false} is VALID [2022-04-27 15:10:27,670 INFO L290 TraceCheckUtils]: 21: Hoare triple {16793#false} assume 0 != ~p6~0; {16793#false} is VALID [2022-04-27 15:10:27,670 INFO L290 TraceCheckUtils]: 22: Hoare triple {16793#false} assume 1 != ~lk6~0; {16793#false} is VALID [2022-04-27 15:10:27,670 INFO L290 TraceCheckUtils]: 23: Hoare triple {16793#false} assume !false; {16793#false} is VALID [2022-04-27 15:10:27,670 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:27,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:10:27,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699712215] [2022-04-27 15:10:27,671 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699712215] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:10:27,671 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:10:27,671 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:10:27,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309188784] [2022-04-27 15:10:27,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:10:27,671 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-27 15:10:27,671 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:10:27,671 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:27,684 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:27,685 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:10:27,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:10:27,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:10:27,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:10:27,686 INFO L87 Difference]: Start difference. First operand 777 states and 1143 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:27,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:27,829 INFO L93 Difference]: Finished difference Result 1165 states and 1705 transitions. [2022-04-27 15:10:27,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:10:27,829 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-27 15:10:27,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:10:27,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:27,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 139 transitions. [2022-04-27 15:10:27,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:27,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 139 transitions. [2022-04-27 15:10:27,832 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 139 transitions. [2022-04-27 15:10:27,909 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 139 edges. 139 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:27,931 INFO L225 Difference]: With dead ends: 1165 [2022-04-27 15:10:27,931 INFO L226 Difference]: Without dead ends: 795 [2022-04-27 15:10:27,931 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:27,932 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 101 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:10:27,932 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 81 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 15:10:27,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 795 states. [2022-04-27 15:10:27,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 795 to 793. [2022-04-27 15:10:27,947 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:10:27,949 INFO L82 GeneralOperation]: Start isEquivalent. First operand 795 states. Second operand has 793 states, 789 states have (on average 1.4448669201520912) internal successors, (1140), 789 states have internal predecessors, (1140), 2 states have call successors, (2), 2 states have call 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:27,950 INFO L74 IsIncluded]: Start isIncluded. First operand 795 states. Second operand has 793 states, 789 states have (on average 1.4448669201520912) internal successors, (1140), 789 states have internal predecessors, (1140), 2 states have call successors, (2), 2 states have call 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:27,951 INFO L87 Difference]: Start difference. First operand 795 states. Second operand has 793 states, 789 states have (on average 1.4448669201520912) internal successors, (1140), 789 states have internal predecessors, (1140), 2 states have call successors, (2), 2 states have call 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:27,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:27,972 INFO L93 Difference]: Finished difference Result 795 states and 1144 transitions. [2022-04-27 15:10:27,972 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 1144 transitions. [2022-04-27 15:10:27,973 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:27,973 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:27,974 INFO L74 IsIncluded]: Start isIncluded. First operand has 793 states, 789 states have (on average 1.4448669201520912) internal successors, (1140), 789 states have internal predecessors, (1140), 2 states have call successors, (2), 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 795 states. [2022-04-27 15:10:27,974 INFO L87 Difference]: Start difference. First operand has 793 states, 789 states have (on average 1.4448669201520912) internal successors, (1140), 789 states have internal predecessors, (1140), 2 states have call successors, (2), 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 795 states. [2022-04-27 15:10:27,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:27,995 INFO L93 Difference]: Finished difference Result 795 states and 1144 transitions. [2022-04-27 15:10:27,995 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 1144 transitions. [2022-04-27 15:10:27,998 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:27,998 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:27,998 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:10:27,998 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:10:27,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 793 states, 789 states have (on average 1.4448669201520912) internal successors, (1140), 789 states have internal predecessors, (1140), 2 states have call successors, (2), 2 states have call 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:28,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 1143 transitions. [2022-04-27 15:10:28,022 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 1143 transitions. Word has length 24 [2022-04-27 15:10:28,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:10:28,022 INFO L495 AbstractCegarLoop]: Abstraction has 793 states and 1143 transitions. [2022-04-27 15:10:28,022 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:28,022 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 1143 transitions. [2022-04-27 15:10:28,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-27 15:10:28,023 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:10:28,023 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:10:28,023 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-27 15:10:28,023 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:10:28,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:10:28,023 INFO L85 PathProgramCache]: Analyzing trace with hash 1296242166, now seen corresponding path program 1 times [2022-04-27 15:10:28,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:10:28,023 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715855775] [2022-04-27 15:10:28,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:10:28,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:10:28,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:28,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:10:28,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:28,052 INFO L290 TraceCheckUtils]: 0: Hoare triple {20452#(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); {20446#true} is VALID [2022-04-27 15:10:28,052 INFO L290 TraceCheckUtils]: 1: Hoare triple {20446#true} assume true; {20446#true} is VALID [2022-04-27 15:10:28,052 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {20446#true} {20446#true} #166#return; {20446#true} is VALID [2022-04-27 15:10:28,053 INFO L272 TraceCheckUtils]: 0: Hoare triple {20446#true} call ULTIMATE.init(); {20452#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:10:28,053 INFO L290 TraceCheckUtils]: 1: Hoare triple {20452#(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); {20446#true} is VALID [2022-04-27 15:10:28,053 INFO L290 TraceCheckUtils]: 2: Hoare triple {20446#true} assume true; {20446#true} is VALID [2022-04-27 15:10:28,053 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20446#true} {20446#true} #166#return; {20446#true} is VALID [2022-04-27 15:10:28,053 INFO L272 TraceCheckUtils]: 4: Hoare triple {20446#true} call #t~ret13 := main(); {20446#true} is VALID [2022-04-27 15:10:28,054 INFO L290 TraceCheckUtils]: 5: Hoare triple {20446#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;havoc ~cond~0; {20446#true} is VALID [2022-04-27 15:10:28,054 INFO L290 TraceCheckUtils]: 6: Hoare triple {20446#true} assume !false;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~cond~0 := #t~nondet12;havoc #t~nondet12; {20446#true} is VALID [2022-04-27 15:10:28,054 INFO L290 TraceCheckUtils]: 7: Hoare triple {20446#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0; {20446#true} is VALID [2022-04-27 15:10:28,054 INFO L290 TraceCheckUtils]: 8: Hoare triple {20446#true} assume !(0 != ~p1~0); {20446#true} is VALID [2022-04-27 15:10:28,054 INFO L290 TraceCheckUtils]: 9: Hoare triple {20446#true} assume !(0 != ~p2~0); {20446#true} is VALID [2022-04-27 15:10:28,054 INFO L290 TraceCheckUtils]: 10: Hoare triple {20446#true} assume !(0 != ~p3~0); {20446#true} is VALID [2022-04-27 15:10:28,054 INFO L290 TraceCheckUtils]: 11: Hoare triple {20446#true} assume !(0 != ~p4~0); {20446#true} is VALID [2022-04-27 15:10:28,054 INFO L290 TraceCheckUtils]: 12: Hoare triple {20446#true} assume !(0 != ~p5~0); {20446#true} is VALID [2022-04-27 15:10:28,054 INFO L290 TraceCheckUtils]: 13: Hoare triple {20446#true} assume 0 != ~p6~0;~lk6~0 := 1; {20451#(= main_~lk6~0 1)} is VALID [2022-04-27 15:10:28,055 INFO L290 TraceCheckUtils]: 14: Hoare triple {20451#(= main_~lk6~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {20451#(= main_~lk6~0 1)} is VALID [2022-04-27 15:10:28,055 INFO L290 TraceCheckUtils]: 15: Hoare triple {20451#(= main_~lk6~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {20451#(= main_~lk6~0 1)} is VALID [2022-04-27 15:10:28,055 INFO L290 TraceCheckUtils]: 16: Hoare triple {20451#(= main_~lk6~0 1)} assume !(0 != ~p1~0); {20451#(= main_~lk6~0 1)} is VALID [2022-04-27 15:10:28,055 INFO L290 TraceCheckUtils]: 17: Hoare triple {20451#(= main_~lk6~0 1)} assume !(0 != ~p2~0); {20451#(= main_~lk6~0 1)} is VALID [2022-04-27 15:10:28,056 INFO L290 TraceCheckUtils]: 18: Hoare triple {20451#(= main_~lk6~0 1)} assume !(0 != ~p3~0); {20451#(= main_~lk6~0 1)} is VALID [2022-04-27 15:10:28,056 INFO L290 TraceCheckUtils]: 19: Hoare triple {20451#(= main_~lk6~0 1)} assume !(0 != ~p4~0); {20451#(= main_~lk6~0 1)} is VALID [2022-04-27 15:10:28,056 INFO L290 TraceCheckUtils]: 20: Hoare triple {20451#(= main_~lk6~0 1)} assume !(0 != ~p5~0); {20451#(= main_~lk6~0 1)} is VALID [2022-04-27 15:10:28,057 INFO L290 TraceCheckUtils]: 21: Hoare triple {20451#(= main_~lk6~0 1)} assume 0 != ~p6~0; {20451#(= main_~lk6~0 1)} is VALID [2022-04-27 15:10:28,057 INFO L290 TraceCheckUtils]: 22: Hoare triple {20451#(= main_~lk6~0 1)} assume 1 != ~lk6~0; {20447#false} is VALID [2022-04-27 15:10:28,057 INFO L290 TraceCheckUtils]: 23: Hoare triple {20447#false} assume !false; {20447#false} is VALID [2022-04-27 15:10:28,057 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:28,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:10:28,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715855775] [2022-04-27 15:10:28,058 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715855775] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:10:28,058 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:10:28,058 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:10:28,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899497229] [2022-04-27 15:10:28,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:10:28,058 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-27 15:10:28,058 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:10:28,058 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:28,071 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:28,071 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:10:28,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:10:28,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:10:28,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:10:28,071 INFO L87 Difference]: Start difference. First operand 793 states and 1143 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:28,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:28,216 INFO L93 Difference]: Finished difference Result 1357 states and 1977 transitions. [2022-04-27 15:10:28,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:10:28,216 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-27 15:10:28,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:10:28,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:28,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 87 transitions. [2022-04-27 15:10:28,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:28,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 87 transitions. [2022-04-27 15:10:28,220 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 87 transitions. [2022-04-27 15:10:28,269 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:28,320 INFO L225 Difference]: With dead ends: 1357 [2022-04-27 15:10:28,320 INFO L226 Difference]: Without dead ends: 1355 [2022-04-27 15:10:28,321 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:28,322 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 99 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 61 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:28,323 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 61 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:28,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1355 states. [2022-04-27 15:10:28,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1355 to 1161. [2022-04-27 15:10:28,340 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:10:28,341 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1355 states. Second operand has 1161 states, 1157 states have (on average 1.400172860847018) internal successors, (1620), 1157 states have internal predecessors, (1620), 2 states have call successors, (2), 2 states have call 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:28,343 INFO L74 IsIncluded]: Start isIncluded. First operand 1355 states. Second operand has 1161 states, 1157 states have (on average 1.400172860847018) internal successors, (1620), 1157 states have internal predecessors, (1620), 2 states have call successors, (2), 2 states have call 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:28,344 INFO L87 Difference]: Start difference. First operand 1355 states. Second operand has 1161 states, 1157 states have (on average 1.400172860847018) internal successors, (1620), 1157 states have internal predecessors, (1620), 2 states have call successors, (2), 2 states have call 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:28,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:28,392 INFO L93 Difference]: Finished difference Result 1355 states and 1944 transitions. [2022-04-27 15:10:28,392 INFO L276 IsEmpty]: Start isEmpty. Operand 1355 states and 1944 transitions. [2022-04-27 15:10:28,395 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:28,395 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:28,397 INFO L74 IsIncluded]: Start isIncluded. First operand has 1161 states, 1157 states have (on average 1.400172860847018) internal successors, (1620), 1157 states have internal predecessors, (1620), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1355 states. [2022-04-27 15:10:28,398 INFO L87 Difference]: Start difference. First operand has 1161 states, 1157 states have (on average 1.400172860847018) internal successors, (1620), 1157 states have internal predecessors, (1620), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1355 states. [2022-04-27 15:10:28,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:28,445 INFO L93 Difference]: Finished difference Result 1355 states and 1944 transitions. [2022-04-27 15:10:28,445 INFO L276 IsEmpty]: Start isEmpty. Operand 1355 states and 1944 transitions. [2022-04-27 15:10:28,449 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:28,449 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:28,449 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:10:28,449 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:10:28,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1161 states, 1157 states have (on average 1.400172860847018) internal successors, (1620), 1157 states have internal predecessors, (1620), 2 states have call successors, (2), 2 states have call 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:28,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1161 states to 1161 states and 1623 transitions. [2022-04-27 15:10:28,488 INFO L78 Accepts]: Start accepts. Automaton has 1161 states and 1623 transitions. Word has length 24 [2022-04-27 15:10:28,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:10:28,489 INFO L495 AbstractCegarLoop]: Abstraction has 1161 states and 1623 transitions. [2022-04-27 15:10:28,489 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:28,489 INFO L276 IsEmpty]: Start isEmpty. Operand 1161 states and 1623 transitions. [2022-04-27 15:10:28,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-27 15:10:28,491 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:10:28,491 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:10:28,491 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-27 15:10:28,491 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:10:28,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:10:28,491 INFO L85 PathProgramCache]: Analyzing trace with hash 1997306744, now seen corresponding path program 1 times [2022-04-27 15:10:28,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:10:28,491 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604363848] [2022-04-27 15:10:28,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:10:28,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:10:28,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:28,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:10:28,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:28,529 INFO L290 TraceCheckUtils]: 0: Hoare triple {25802#(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); {25796#true} is VALID [2022-04-27 15:10:28,530 INFO L290 TraceCheckUtils]: 1: Hoare triple {25796#true} assume true; {25796#true} is VALID [2022-04-27 15:10:28,530 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25796#true} {25796#true} #166#return; {25796#true} is VALID [2022-04-27 15:10:28,531 INFO L272 TraceCheckUtils]: 0: Hoare triple {25796#true} call ULTIMATE.init(); {25802#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:10:28,531 INFO L290 TraceCheckUtils]: 1: Hoare triple {25802#(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); {25796#true} is VALID [2022-04-27 15:10:28,531 INFO L290 TraceCheckUtils]: 2: Hoare triple {25796#true} assume true; {25796#true} is VALID [2022-04-27 15:10:28,533 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25796#true} {25796#true} #166#return; {25796#true} is VALID [2022-04-27 15:10:28,533 INFO L272 TraceCheckUtils]: 4: Hoare triple {25796#true} call #t~ret13 := main(); {25796#true} is VALID [2022-04-27 15:10:28,533 INFO L290 TraceCheckUtils]: 5: Hoare triple {25796#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;havoc ~cond~0; {25796#true} is VALID [2022-04-27 15:10:28,534 INFO L290 TraceCheckUtils]: 6: Hoare triple {25796#true} assume !false;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~cond~0 := #t~nondet12;havoc #t~nondet12; {25796#true} is VALID [2022-04-27 15:10:28,534 INFO L290 TraceCheckUtils]: 7: Hoare triple {25796#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0; {25796#true} is VALID [2022-04-27 15:10:28,534 INFO L290 TraceCheckUtils]: 8: Hoare triple {25796#true} assume !(0 != ~p1~0); {25796#true} is VALID [2022-04-27 15:10:28,534 INFO L290 TraceCheckUtils]: 9: Hoare triple {25796#true} assume !(0 != ~p2~0); {25796#true} is VALID [2022-04-27 15:10:28,535 INFO L290 TraceCheckUtils]: 10: Hoare triple {25796#true} assume !(0 != ~p3~0); {25796#true} is VALID [2022-04-27 15:10:28,535 INFO L290 TraceCheckUtils]: 11: Hoare triple {25796#true} assume !(0 != ~p4~0); {25796#true} is VALID [2022-04-27 15:10:28,537 INFO L290 TraceCheckUtils]: 12: Hoare triple {25796#true} assume !(0 != ~p5~0); {25796#true} is VALID [2022-04-27 15:10:28,537 INFO L290 TraceCheckUtils]: 13: Hoare triple {25796#true} assume !(0 != ~p6~0); {25801#(= main_~p6~0 0)} is VALID [2022-04-27 15:10:28,537 INFO L290 TraceCheckUtils]: 14: Hoare triple {25801#(= main_~p6~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {25801#(= main_~p6~0 0)} is VALID [2022-04-27 15:10:28,537 INFO L290 TraceCheckUtils]: 15: Hoare triple {25801#(= main_~p6~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {25801#(= main_~p6~0 0)} is VALID [2022-04-27 15:10:28,538 INFO L290 TraceCheckUtils]: 16: Hoare triple {25801#(= main_~p6~0 0)} assume !(0 != ~p1~0); {25801#(= main_~p6~0 0)} is VALID [2022-04-27 15:10:28,538 INFO L290 TraceCheckUtils]: 17: Hoare triple {25801#(= main_~p6~0 0)} assume !(0 != ~p2~0); {25801#(= main_~p6~0 0)} is VALID [2022-04-27 15:10:28,538 INFO L290 TraceCheckUtils]: 18: Hoare triple {25801#(= main_~p6~0 0)} assume !(0 != ~p3~0); {25801#(= main_~p6~0 0)} is VALID [2022-04-27 15:10:28,538 INFO L290 TraceCheckUtils]: 19: Hoare triple {25801#(= main_~p6~0 0)} assume !(0 != ~p4~0); {25801#(= main_~p6~0 0)} is VALID [2022-04-27 15:10:28,539 INFO L290 TraceCheckUtils]: 20: Hoare triple {25801#(= main_~p6~0 0)} assume !(0 != ~p5~0); {25801#(= main_~p6~0 0)} is VALID [2022-04-27 15:10:28,539 INFO L290 TraceCheckUtils]: 21: Hoare triple {25801#(= main_~p6~0 0)} assume 0 != ~p6~0; {25797#false} is VALID [2022-04-27 15:10:28,539 INFO L290 TraceCheckUtils]: 22: Hoare triple {25797#false} assume 1 != ~lk6~0; {25797#false} is VALID [2022-04-27 15:10:28,539 INFO L290 TraceCheckUtils]: 23: Hoare triple {25797#false} assume !false; {25797#false} is VALID [2022-04-27 15:10:28,539 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:28,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:10:28,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604363848] [2022-04-27 15:10:28,541 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604363848] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:10:28,541 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:10:28,541 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:10:28,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768397139] [2022-04-27 15:10:28,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:10:28,541 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-27 15:10:28,541 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:10:28,541 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:28,554 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:28,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:10:28,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:10:28,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:10:28,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:10:28,554 INFO L87 Difference]: Start difference. First operand 1161 states and 1623 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:28,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:28,842 INFO L93 Difference]: Finished difference Result 2637 states and 3673 transitions. [2022-04-27 15:10:28,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:10:28,843 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-27 15:10:28,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:10:28,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:28,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 141 transitions. [2022-04-27 15:10:28,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:28,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 141 transitions. [2022-04-27 15:10:28,845 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 141 transitions. [2022-04-27 15:10:28,918 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 141 edges. 141 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:28,980 INFO L225 Difference]: With dead ends: 2637 [2022-04-27 15:10:28,980 INFO L226 Difference]: Without dead ends: 1515 [2022-04-27 15:10:28,981 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:28,982 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 88 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:10:28,982 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 89 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 15:10:28,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1515 states. [2022-04-27 15:10:29,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1515 to 1513. [2022-04-27 15:10:29,006 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:10:29,007 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1515 states. Second operand has 1513 states, 1509 states have (on average 1.359840954274354) internal successors, (2052), 1509 states have internal predecessors, (2052), 2 states have call successors, (2), 2 states have call 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:29,008 INFO L74 IsIncluded]: Start isIncluded. First operand 1515 states. Second operand has 1513 states, 1509 states have (on average 1.359840954274354) internal successors, (2052), 1509 states have internal predecessors, (2052), 2 states have call successors, (2), 2 states have call 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:29,009 INFO L87 Difference]: Start difference. First operand 1515 states. Second operand has 1513 states, 1509 states have (on average 1.359840954274354) internal successors, (2052), 1509 states have internal predecessors, (2052), 2 states have call successors, (2), 2 states have call 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:29,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:29,067 INFO L93 Difference]: Finished difference Result 1515 states and 2056 transitions. [2022-04-27 15:10:29,067 INFO L276 IsEmpty]: Start isEmpty. Operand 1515 states and 2056 transitions. [2022-04-27 15:10:29,068 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:29,068 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:29,070 INFO L74 IsIncluded]: Start isIncluded. First operand has 1513 states, 1509 states have (on average 1.359840954274354) internal successors, (2052), 1509 states have internal predecessors, (2052), 2 states have call successors, (2), 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 1515 states. [2022-04-27 15:10:29,071 INFO L87 Difference]: Start difference. First operand has 1513 states, 1509 states have (on average 1.359840954274354) internal successors, (2052), 1509 states have internal predecessors, (2052), 2 states have call successors, (2), 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 1515 states. [2022-04-27 15:10:29,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:29,128 INFO L93 Difference]: Finished difference Result 1515 states and 2056 transitions. [2022-04-27 15:10:29,128 INFO L276 IsEmpty]: Start isEmpty. Operand 1515 states and 2056 transitions. [2022-04-27 15:10:29,130 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:29,130 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:29,130 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:10:29,130 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:10:29,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1513 states, 1509 states have (on average 1.359840954274354) internal successors, (2052), 1509 states have internal predecessors, (2052), 2 states have call successors, (2), 2 states have call 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:29,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1513 states to 1513 states and 2055 transitions. [2022-04-27 15:10:29,192 INFO L78 Accepts]: Start accepts. Automaton has 1513 states and 2055 transitions. Word has length 24 [2022-04-27 15:10:29,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:10:29,192 INFO L495 AbstractCegarLoop]: Abstraction has 1513 states and 2055 transitions. [2022-04-27 15:10:29,192 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:29,192 INFO L276 IsEmpty]: Start isEmpty. Operand 1513 states and 2055 transitions. [2022-04-27 15:10:29,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-27 15:10:29,193 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:10:29,193 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:10:29,194 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-27 15:10:29,194 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:10:29,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:10:29,194 INFO L85 PathProgramCache]: Analyzing trace with hash 1529017218, now seen corresponding path program 1 times [2022-04-27 15:10:29,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:10:29,194 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304272084] [2022-04-27 15:10:29,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:10:29,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:10:29,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:29,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:10:29,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:29,218 INFO L290 TraceCheckUtils]: 0: Hoare triple {33168#(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); {33162#true} is VALID [2022-04-27 15:10:29,218 INFO L290 TraceCheckUtils]: 1: Hoare triple {33162#true} assume true; {33162#true} is VALID [2022-04-27 15:10:29,219 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {33162#true} {33162#true} #166#return; {33162#true} is VALID [2022-04-27 15:10:29,219 INFO L272 TraceCheckUtils]: 0: Hoare triple {33162#true} call ULTIMATE.init(); {33168#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:10:29,219 INFO L290 TraceCheckUtils]: 1: Hoare triple {33168#(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); {33162#true} is VALID [2022-04-27 15:10:29,219 INFO L290 TraceCheckUtils]: 2: Hoare triple {33162#true} assume true; {33162#true} is VALID [2022-04-27 15:10:29,219 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33162#true} {33162#true} #166#return; {33162#true} is VALID [2022-04-27 15:10:29,219 INFO L272 TraceCheckUtils]: 4: Hoare triple {33162#true} call #t~ret13 := main(); {33162#true} is VALID [2022-04-27 15:10:29,219 INFO L290 TraceCheckUtils]: 5: Hoare triple {33162#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;havoc ~cond~0; {33162#true} is VALID [2022-04-27 15:10:29,219 INFO L290 TraceCheckUtils]: 6: Hoare triple {33162#true} assume !false;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~cond~0 := #t~nondet12;havoc #t~nondet12; {33162#true} is VALID [2022-04-27 15:10:29,219 INFO L290 TraceCheckUtils]: 7: Hoare triple {33162#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0; {33162#true} is VALID [2022-04-27 15:10:29,219 INFO L290 TraceCheckUtils]: 8: Hoare triple {33162#true} assume !(0 != ~p1~0); {33162#true} is VALID [2022-04-27 15:10:29,219 INFO L290 TraceCheckUtils]: 9: Hoare triple {33162#true} assume !(0 != ~p2~0); {33162#true} is VALID [2022-04-27 15:10:29,220 INFO L290 TraceCheckUtils]: 10: Hoare triple {33162#true} assume !(0 != ~p3~0); {33162#true} is VALID [2022-04-27 15:10:29,220 INFO L290 TraceCheckUtils]: 11: Hoare triple {33162#true} assume !(0 != ~p4~0); {33162#true} is VALID [2022-04-27 15:10:29,220 INFO L290 TraceCheckUtils]: 12: Hoare triple {33162#true} assume !(0 != ~p5~0); {33162#true} is VALID [2022-04-27 15:10:29,220 INFO L290 TraceCheckUtils]: 13: Hoare triple {33162#true} assume 0 != ~p6~0;~lk6~0 := 1; {33167#(not (= main_~p6~0 0))} is VALID [2022-04-27 15:10:29,221 INFO L290 TraceCheckUtils]: 14: Hoare triple {33167#(not (= main_~p6~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {33167#(not (= main_~p6~0 0))} is VALID [2022-04-27 15:10:29,221 INFO L290 TraceCheckUtils]: 15: Hoare triple {33167#(not (= main_~p6~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {33167#(not (= main_~p6~0 0))} is VALID [2022-04-27 15:10:29,221 INFO L290 TraceCheckUtils]: 16: Hoare triple {33167#(not (= main_~p6~0 0))} assume !(0 != ~p1~0); {33167#(not (= main_~p6~0 0))} is VALID [2022-04-27 15:10:29,221 INFO L290 TraceCheckUtils]: 17: Hoare triple {33167#(not (= main_~p6~0 0))} assume !(0 != ~p2~0); {33167#(not (= main_~p6~0 0))} is VALID [2022-04-27 15:10:29,222 INFO L290 TraceCheckUtils]: 18: Hoare triple {33167#(not (= main_~p6~0 0))} assume !(0 != ~p3~0); {33167#(not (= main_~p6~0 0))} is VALID [2022-04-27 15:10:29,222 INFO L290 TraceCheckUtils]: 19: Hoare triple {33167#(not (= main_~p6~0 0))} assume !(0 != ~p4~0); {33167#(not (= main_~p6~0 0))} is VALID [2022-04-27 15:10:29,222 INFO L290 TraceCheckUtils]: 20: Hoare triple {33167#(not (= main_~p6~0 0))} assume !(0 != ~p5~0); {33167#(not (= main_~p6~0 0))} is VALID [2022-04-27 15:10:29,222 INFO L290 TraceCheckUtils]: 21: Hoare triple {33167#(not (= main_~p6~0 0))} assume !(0 != ~p6~0); {33163#false} is VALID [2022-04-27 15:10:29,222 INFO L290 TraceCheckUtils]: 22: Hoare triple {33163#false} assume 0 != ~p7~0; {33163#false} is VALID [2022-04-27 15:10:29,222 INFO L290 TraceCheckUtils]: 23: Hoare triple {33163#false} assume 1 != ~lk7~0; {33163#false} is VALID [2022-04-27 15:10:29,222 INFO L290 TraceCheckUtils]: 24: Hoare triple {33163#false} assume !false; {33163#false} is VALID [2022-04-27 15:10:29,223 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:29,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:10:29,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304272084] [2022-04-27 15:10:29,223 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [304272084] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:10:29,223 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:10:29,223 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:10:29,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069760616] [2022-04-27 15:10:29,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:10:29,223 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-27 15:10:29,223 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:10:29,223 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:29,235 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:29,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:10:29,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:10:29,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:10:29,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:10:29,236 INFO L87 Difference]: Start difference. First operand 1513 states and 2055 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:29,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:29,464 INFO L93 Difference]: Finished difference Result 2269 states and 3065 transitions. [2022-04-27 15:10:29,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:10:29,464 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-27 15:10:29,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:10:29,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:29,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 136 transitions. [2022-04-27 15:10:29,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:29,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 136 transitions. [2022-04-27 15:10:29,466 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 136 transitions. [2022-04-27 15:10:29,536 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 136 edges. 136 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:29,606 INFO L225 Difference]: With dead ends: 2269 [2022-04-27 15:10:29,606 INFO L226 Difference]: Without dead ends: 1547 [2022-04-27 15:10:29,607 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:29,608 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 100 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:10:29,608 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 78 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 15:10:29,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1547 states. [2022-04-27 15:10:29,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1547 to 1545. [2022-04-27 15:10:29,631 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:10:29,633 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1547 states. Second operand has 1545 states, 1541 states have (on average 1.3316028552887735) internal successors, (2052), 1541 states have internal predecessors, (2052), 2 states have call successors, (2), 2 states have call 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:29,634 INFO L74 IsIncluded]: Start isIncluded. First operand 1547 states. Second operand has 1545 states, 1541 states have (on average 1.3316028552887735) internal successors, (2052), 1541 states have internal predecessors, (2052), 2 states have call successors, (2), 2 states have call 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:29,635 INFO L87 Difference]: Start difference. First operand 1547 states. Second operand has 1545 states, 1541 states have (on average 1.3316028552887735) internal successors, (2052), 1541 states have internal predecessors, (2052), 2 states have call successors, (2), 2 states have call 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:29,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:29,698 INFO L93 Difference]: Finished difference Result 1547 states and 2056 transitions. [2022-04-27 15:10:29,698 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2056 transitions. [2022-04-27 15:10:29,699 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:29,699 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:29,701 INFO L74 IsIncluded]: Start isIncluded. First operand has 1545 states, 1541 states have (on average 1.3316028552887735) internal successors, (2052), 1541 states have internal predecessors, (2052), 2 states have call successors, (2), 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 1547 states. [2022-04-27 15:10:29,702 INFO L87 Difference]: Start difference. First operand has 1545 states, 1541 states have (on average 1.3316028552887735) internal successors, (2052), 1541 states have internal predecessors, (2052), 2 states have call successors, (2), 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 1547 states. [2022-04-27 15:10:29,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:29,767 INFO L93 Difference]: Finished difference Result 1547 states and 2056 transitions. [2022-04-27 15:10:29,767 INFO L276 IsEmpty]: Start isEmpty. Operand 1547 states and 2056 transitions. [2022-04-27 15:10:29,768 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:29,768 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:29,768 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:10:29,768 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:10:29,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1545 states, 1541 states have (on average 1.3316028552887735) internal successors, (2052), 1541 states have internal predecessors, (2052), 2 states have call successors, (2), 2 states have call 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:29,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1545 states to 1545 states and 2055 transitions. [2022-04-27 15:10:29,838 INFO L78 Accepts]: Start accepts. Automaton has 1545 states and 2055 transitions. Word has length 25 [2022-04-27 15:10:29,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:10:29,838 INFO L495 AbstractCegarLoop]: Abstraction has 1545 states and 2055 transitions. [2022-04-27 15:10:29,838 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:29,838 INFO L276 IsEmpty]: Start isEmpty. Operand 1545 states and 2055 transitions. [2022-04-27 15:10:29,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-27 15:10:29,861 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:10:29,861 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:10:29,861 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-04-27 15:10:29,861 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:10:29,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:10:29,862 INFO L85 PathProgramCache]: Analyzing trace with hash 1787182656, now seen corresponding path program 1 times [2022-04-27 15:10:29,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:10:29,862 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143528711] [2022-04-27 15:10:29,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:10:29,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:10:29,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:29,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:10:29,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:29,892 INFO L290 TraceCheckUtils]: 0: Hoare triple {40262#(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); {40256#true} is VALID [2022-04-27 15:10:29,892 INFO L290 TraceCheckUtils]: 1: Hoare triple {40256#true} assume true; {40256#true} is VALID [2022-04-27 15:10:29,892 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {40256#true} {40256#true} #166#return; {40256#true} is VALID [2022-04-27 15:10:29,893 INFO L272 TraceCheckUtils]: 0: Hoare triple {40256#true} call ULTIMATE.init(); {40262#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:10:29,893 INFO L290 TraceCheckUtils]: 1: Hoare triple {40262#(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); {40256#true} is VALID [2022-04-27 15:10:29,893 INFO L290 TraceCheckUtils]: 2: Hoare triple {40256#true} assume true; {40256#true} is VALID [2022-04-27 15:10:29,893 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40256#true} {40256#true} #166#return; {40256#true} is VALID [2022-04-27 15:10:29,893 INFO L272 TraceCheckUtils]: 4: Hoare triple {40256#true} call #t~ret13 := main(); {40256#true} is VALID [2022-04-27 15:10:29,893 INFO L290 TraceCheckUtils]: 5: Hoare triple {40256#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;havoc ~cond~0; {40256#true} is VALID [2022-04-27 15:10:29,893 INFO L290 TraceCheckUtils]: 6: Hoare triple {40256#true} assume !false;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~cond~0 := #t~nondet12;havoc #t~nondet12; {40256#true} is VALID [2022-04-27 15:10:29,893 INFO L290 TraceCheckUtils]: 7: Hoare triple {40256#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0; {40256#true} is VALID [2022-04-27 15:10:29,893 INFO L290 TraceCheckUtils]: 8: Hoare triple {40256#true} assume !(0 != ~p1~0); {40256#true} is VALID [2022-04-27 15:10:29,893 INFO L290 TraceCheckUtils]: 9: Hoare triple {40256#true} assume !(0 != ~p2~0); {40256#true} is VALID [2022-04-27 15:10:29,893 INFO L290 TraceCheckUtils]: 10: Hoare triple {40256#true} assume !(0 != ~p3~0); {40256#true} is VALID [2022-04-27 15:10:29,893 INFO L290 TraceCheckUtils]: 11: Hoare triple {40256#true} assume !(0 != ~p4~0); {40256#true} is VALID [2022-04-27 15:10:29,893 INFO L290 TraceCheckUtils]: 12: Hoare triple {40256#true} assume !(0 != ~p5~0); {40256#true} is VALID [2022-04-27 15:10:29,893 INFO L290 TraceCheckUtils]: 13: Hoare triple {40256#true} assume !(0 != ~p6~0); {40256#true} is VALID [2022-04-27 15:10:29,894 INFO L290 TraceCheckUtils]: 14: Hoare triple {40256#true} assume 0 != ~p7~0;~lk7~0 := 1; {40261#(= main_~lk7~0 1)} is VALID [2022-04-27 15:10:29,894 INFO L290 TraceCheckUtils]: 15: Hoare triple {40261#(= main_~lk7~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {40261#(= main_~lk7~0 1)} is VALID [2022-04-27 15:10:29,894 INFO L290 TraceCheckUtils]: 16: Hoare triple {40261#(= main_~lk7~0 1)} assume !(0 != ~p1~0); {40261#(= main_~lk7~0 1)} is VALID [2022-04-27 15:10:29,895 INFO L290 TraceCheckUtils]: 17: Hoare triple {40261#(= main_~lk7~0 1)} assume !(0 != ~p2~0); {40261#(= main_~lk7~0 1)} is VALID [2022-04-27 15:10:29,895 INFO L290 TraceCheckUtils]: 18: Hoare triple {40261#(= main_~lk7~0 1)} assume !(0 != ~p3~0); {40261#(= main_~lk7~0 1)} is VALID [2022-04-27 15:10:29,895 INFO L290 TraceCheckUtils]: 19: Hoare triple {40261#(= main_~lk7~0 1)} assume !(0 != ~p4~0); {40261#(= main_~lk7~0 1)} is VALID [2022-04-27 15:10:29,895 INFO L290 TraceCheckUtils]: 20: Hoare triple {40261#(= main_~lk7~0 1)} assume !(0 != ~p5~0); {40261#(= main_~lk7~0 1)} is VALID [2022-04-27 15:10:29,896 INFO L290 TraceCheckUtils]: 21: Hoare triple {40261#(= main_~lk7~0 1)} assume !(0 != ~p6~0); {40261#(= main_~lk7~0 1)} is VALID [2022-04-27 15:10:29,896 INFO L290 TraceCheckUtils]: 22: Hoare triple {40261#(= main_~lk7~0 1)} assume 0 != ~p7~0; {40261#(= main_~lk7~0 1)} is VALID [2022-04-27 15:10:29,896 INFO L290 TraceCheckUtils]: 23: Hoare triple {40261#(= main_~lk7~0 1)} assume 1 != ~lk7~0; {40257#false} is VALID [2022-04-27 15:10:29,896 INFO L290 TraceCheckUtils]: 24: Hoare triple {40257#false} assume !false; {40257#false} is VALID [2022-04-27 15:10:29,897 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:29,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:10:29,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143528711] [2022-04-27 15:10:29,897 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143528711] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:10:29,897 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:10:29,897 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:10:29,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006427921] [2022-04-27 15:10:29,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:10:29,897 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-27 15:10:29,897 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:10:29,898 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:29,909 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:29,910 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:10:29,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:10:29,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:10:29,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:10:29,910 INFO L87 Difference]: Start difference. First operand 1545 states and 2055 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:30,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:30,194 INFO L93 Difference]: Finished difference Result 2573 states and 3433 transitions. [2022-04-27 15:10:30,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:10:30,194 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-27 15:10:30,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:10:30,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:30,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 83 transitions. [2022-04-27 15:10:30,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:30,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 83 transitions. [2022-04-27 15:10:30,195 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 83 transitions. [2022-04-27 15:10:30,250 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:30,438 INFO L225 Difference]: With dead ends: 2573 [2022-04-27 15:10:30,439 INFO L226 Difference]: Without dead ends: 2571 [2022-04-27 15:10:30,455 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:30,456 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 92 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:10:30,457 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 60 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 15:10:30,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2571 states. [2022-04-27 15:10:30,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2571 to 2313. [2022-04-27 15:10:30,497 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:10:30,499 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2571 states. Second operand has 2313 states, 2309 states have (on average 1.2906019922044174) internal successors, (2980), 2309 states have internal predecessors, (2980), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:30,501 INFO L74 IsIncluded]: Start isIncluded. First operand 2571 states. Second operand has 2313 states, 2309 states have (on average 1.2906019922044174) internal successors, (2980), 2309 states have internal predecessors, (2980), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:30,502 INFO L87 Difference]: Start difference. First operand 2571 states. Second operand has 2313 states, 2309 states have (on average 1.2906019922044174) internal successors, (2980), 2309 states have internal predecessors, (2980), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:30,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:30,658 INFO L93 Difference]: Finished difference Result 2571 states and 3368 transitions. [2022-04-27 15:10:30,658 INFO L276 IsEmpty]: Start isEmpty. Operand 2571 states and 3368 transitions. [2022-04-27 15:10:30,660 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:30,660 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:30,663 INFO L74 IsIncluded]: Start isIncluded. First operand has 2313 states, 2309 states have (on average 1.2906019922044174) internal successors, (2980), 2309 states have internal predecessors, (2980), 2 states have call successors, (2), 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 2571 states. [2022-04-27 15:10:30,664 INFO L87 Difference]: Start difference. First operand has 2313 states, 2309 states have (on average 1.2906019922044174) internal successors, (2980), 2309 states have internal predecessors, (2980), 2 states have call successors, (2), 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 2571 states. [2022-04-27 15:10:30,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:30,821 INFO L93 Difference]: Finished difference Result 2571 states and 3368 transitions. [2022-04-27 15:10:30,821 INFO L276 IsEmpty]: Start isEmpty. Operand 2571 states and 3368 transitions. [2022-04-27 15:10:30,823 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:30,823 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:30,823 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:10:30,823 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:10:30,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2313 states, 2309 states have (on average 1.2906019922044174) internal successors, (2980), 2309 states have internal predecessors, (2980), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:30,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2313 states to 2313 states and 2983 transitions. [2022-04-27 15:10:30,966 INFO L78 Accepts]: Start accepts. Automaton has 2313 states and 2983 transitions. Word has length 25 [2022-04-27 15:10:30,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:10:30,966 INFO L495 AbstractCegarLoop]: Abstraction has 2313 states and 2983 transitions. [2022-04-27 15:10:30,967 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:30,967 INFO L276 IsEmpty]: Start isEmpty. Operand 2313 states and 2983 transitions. [2022-04-27 15:10:30,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-27 15:10:30,968 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:10:30,968 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:10:30,969 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-04-27 15:10:30,969 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:10:30,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:10:30,969 INFO L85 PathProgramCache]: Analyzing trace with hash -1806720062, now seen corresponding path program 1 times [2022-04-27 15:10:30,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:10:30,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57996857] [2022-04-27 15:10:30,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:10:30,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:10:30,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:30,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:10:30,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:30,989 INFO L290 TraceCheckUtils]: 0: Hoare triple {50508#(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); {50502#true} is VALID [2022-04-27 15:10:30,989 INFO L290 TraceCheckUtils]: 1: Hoare triple {50502#true} assume true; {50502#true} is VALID [2022-04-27 15:10:30,989 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {50502#true} {50502#true} #166#return; {50502#true} is VALID [2022-04-27 15:10:30,990 INFO L272 TraceCheckUtils]: 0: Hoare triple {50502#true} call ULTIMATE.init(); {50508#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:10:30,990 INFO L290 TraceCheckUtils]: 1: Hoare triple {50508#(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); {50502#true} is VALID [2022-04-27 15:10:30,990 INFO L290 TraceCheckUtils]: 2: Hoare triple {50502#true} assume true; {50502#true} is VALID [2022-04-27 15:10:30,990 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {50502#true} {50502#true} #166#return; {50502#true} is VALID [2022-04-27 15:10:30,990 INFO L272 TraceCheckUtils]: 4: Hoare triple {50502#true} call #t~ret13 := main(); {50502#true} is VALID [2022-04-27 15:10:30,990 INFO L290 TraceCheckUtils]: 5: Hoare triple {50502#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;havoc ~cond~0; {50502#true} is VALID [2022-04-27 15:10:30,990 INFO L290 TraceCheckUtils]: 6: Hoare triple {50502#true} assume !false;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~cond~0 := #t~nondet12;havoc #t~nondet12; {50502#true} is VALID [2022-04-27 15:10:30,990 INFO L290 TraceCheckUtils]: 7: Hoare triple {50502#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0; {50502#true} is VALID [2022-04-27 15:10:30,990 INFO L290 TraceCheckUtils]: 8: Hoare triple {50502#true} assume !(0 != ~p1~0); {50502#true} is VALID [2022-04-27 15:10:30,990 INFO L290 TraceCheckUtils]: 9: Hoare triple {50502#true} assume !(0 != ~p2~0); {50502#true} is VALID [2022-04-27 15:10:30,990 INFO L290 TraceCheckUtils]: 10: Hoare triple {50502#true} assume !(0 != ~p3~0); {50502#true} is VALID [2022-04-27 15:10:30,990 INFO L290 TraceCheckUtils]: 11: Hoare triple {50502#true} assume !(0 != ~p4~0); {50502#true} is VALID [2022-04-27 15:10:30,990 INFO L290 TraceCheckUtils]: 12: Hoare triple {50502#true} assume !(0 != ~p5~0); {50502#true} is VALID [2022-04-27 15:10:30,990 INFO L290 TraceCheckUtils]: 13: Hoare triple {50502#true} assume !(0 != ~p6~0); {50502#true} is VALID [2022-04-27 15:10:30,990 INFO L290 TraceCheckUtils]: 14: Hoare triple {50502#true} assume !(0 != ~p7~0); {50507#(= main_~p7~0 0)} is VALID [2022-04-27 15:10:30,991 INFO L290 TraceCheckUtils]: 15: Hoare triple {50507#(= main_~p7~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {50507#(= main_~p7~0 0)} is VALID [2022-04-27 15:10:30,991 INFO L290 TraceCheckUtils]: 16: Hoare triple {50507#(= main_~p7~0 0)} assume !(0 != ~p1~0); {50507#(= main_~p7~0 0)} is VALID [2022-04-27 15:10:30,991 INFO L290 TraceCheckUtils]: 17: Hoare triple {50507#(= main_~p7~0 0)} assume !(0 != ~p2~0); {50507#(= main_~p7~0 0)} is VALID [2022-04-27 15:10:30,991 INFO L290 TraceCheckUtils]: 18: Hoare triple {50507#(= main_~p7~0 0)} assume !(0 != ~p3~0); {50507#(= main_~p7~0 0)} is VALID [2022-04-27 15:10:30,992 INFO L290 TraceCheckUtils]: 19: Hoare triple {50507#(= main_~p7~0 0)} assume !(0 != ~p4~0); {50507#(= main_~p7~0 0)} is VALID [2022-04-27 15:10:30,992 INFO L290 TraceCheckUtils]: 20: Hoare triple {50507#(= main_~p7~0 0)} assume !(0 != ~p5~0); {50507#(= main_~p7~0 0)} is VALID [2022-04-27 15:10:30,992 INFO L290 TraceCheckUtils]: 21: Hoare triple {50507#(= main_~p7~0 0)} assume !(0 != ~p6~0); {50507#(= main_~p7~0 0)} is VALID [2022-04-27 15:10:30,992 INFO L290 TraceCheckUtils]: 22: Hoare triple {50507#(= main_~p7~0 0)} assume 0 != ~p7~0; {50503#false} is VALID [2022-04-27 15:10:30,992 INFO L290 TraceCheckUtils]: 23: Hoare triple {50503#false} assume 1 != ~lk7~0; {50503#false} is VALID [2022-04-27 15:10:30,992 INFO L290 TraceCheckUtils]: 24: Hoare triple {50503#false} assume !false; {50503#false} is VALID [2022-04-27 15:10:30,993 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:30,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:10:30,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57996857] [2022-04-27 15:10:30,993 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57996857] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:10:30,993 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:10:30,993 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:10:30,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44654038] [2022-04-27 15:10:30,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:10:30,993 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-27 15:10:30,993 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:10:30,993 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:31,006 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:31,006 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:10:31,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:10:31,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:10:31,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:10:31,006 INFO L87 Difference]: Start difference. First operand 2313 states and 2983 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:31,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:31,798 INFO L93 Difference]: Finished difference Result 5197 states and 6633 transitions. [2022-04-27 15:10:31,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:10:31,798 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-27 15:10:31,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:10:31,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:31,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 138 transitions. [2022-04-27 15:10:31,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:31,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 138 transitions. [2022-04-27 15:10:31,800 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 138 transitions. [2022-04-27 15:10:31,870 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 138 edges. 138 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:32,096 INFO L225 Difference]: With dead ends: 5197 [2022-04-27 15:10:32,096 INFO L226 Difference]: Without dead ends: 2955 [2022-04-27 15:10:32,098 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:32,099 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 82 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:10:32,099 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 91 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 15:10:32,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2955 states. [2022-04-27 15:10:32,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2955 to 2953. [2022-04-27 15:10:32,142 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:10:32,145 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2955 states. Second operand has 2953 states, 2949 states have (on average 1.2383858935232281) internal successors, (3652), 2949 states have internal predecessors, (3652), 2 states have call successors, (2), 2 states have call 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:32,146 INFO L74 IsIncluded]: Start isIncluded. First operand 2955 states. Second operand has 2953 states, 2949 states have (on average 1.2383858935232281) internal successors, (3652), 2949 states have internal predecessors, (3652), 2 states have call successors, (2), 2 states have call 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:32,148 INFO L87 Difference]: Start difference. First operand 2955 states. Second operand has 2953 states, 2949 states have (on average 1.2383858935232281) internal successors, (3652), 2949 states have internal predecessors, (3652), 2 states have call successors, (2), 2 states have call 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:32,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:32,348 INFO L93 Difference]: Finished difference Result 2955 states and 3656 transitions. [2022-04-27 15:10:32,348 INFO L276 IsEmpty]: Start isEmpty. Operand 2955 states and 3656 transitions. [2022-04-27 15:10:32,351 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:32,351 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:32,353 INFO L74 IsIncluded]: Start isIncluded. First operand has 2953 states, 2949 states have (on average 1.2383858935232281) internal successors, (3652), 2949 states have internal predecessors, (3652), 2 states have call successors, (2), 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 2955 states. [2022-04-27 15:10:32,355 INFO L87 Difference]: Start difference. First operand has 2953 states, 2949 states have (on average 1.2383858935232281) internal successors, (3652), 2949 states have internal predecessors, (3652), 2 states have call successors, (2), 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 2955 states. [2022-04-27 15:10:32,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:32,557 INFO L93 Difference]: Finished difference Result 2955 states and 3656 transitions. [2022-04-27 15:10:32,557 INFO L276 IsEmpty]: Start isEmpty. Operand 2955 states and 3656 transitions. [2022-04-27 15:10:32,559 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:32,559 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:32,559 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:10:32,559 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:10:32,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2953 states, 2949 states have (on average 1.2383858935232281) internal successors, (3652), 2949 states have internal predecessors, (3652), 2 states have call successors, (2), 2 states have call 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:32,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2953 states to 2953 states and 3655 transitions. [2022-04-27 15:10:32,850 INFO L78 Accepts]: Start accepts. Automaton has 2953 states and 3655 transitions. Word has length 25 [2022-04-27 15:10:32,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:10:32,850 INFO L495 AbstractCegarLoop]: Abstraction has 2953 states and 3655 transitions. [2022-04-27 15:10:32,850 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:32,850 INFO L276 IsEmpty]: Start isEmpty. Operand 2953 states and 3655 transitions. [2022-04-27 15:10:32,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-27 15:10:32,852 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:10:32,852 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:10:32,852 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-04-27 15:10:32,852 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:10:32,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:10:32,853 INFO L85 PathProgramCache]: Analyzing trace with hash -431696435, now seen corresponding path program 1 times [2022-04-27 15:10:32,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:10:32,853 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880903501] [2022-04-27 15:10:32,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:10:32,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:10:32,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:32,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:10:32,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:32,875 INFO L290 TraceCheckUtils]: 0: Hoare triple {64914#(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); {64908#true} is VALID [2022-04-27 15:10:32,875 INFO L290 TraceCheckUtils]: 1: Hoare triple {64908#true} assume true; {64908#true} is VALID [2022-04-27 15:10:32,875 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {64908#true} {64908#true} #166#return; {64908#true} is VALID [2022-04-27 15:10:32,875 INFO L272 TraceCheckUtils]: 0: Hoare triple {64908#true} call ULTIMATE.init(); {64914#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:10:32,875 INFO L290 TraceCheckUtils]: 1: Hoare triple {64914#(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); {64908#true} is VALID [2022-04-27 15:10:32,875 INFO L290 TraceCheckUtils]: 2: Hoare triple {64908#true} assume true; {64908#true} is VALID [2022-04-27 15:10:32,875 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {64908#true} {64908#true} #166#return; {64908#true} is VALID [2022-04-27 15:10:32,875 INFO L272 TraceCheckUtils]: 4: Hoare triple {64908#true} call #t~ret13 := main(); {64908#true} is VALID [2022-04-27 15:10:32,875 INFO L290 TraceCheckUtils]: 5: Hoare triple {64908#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;havoc ~cond~0; {64908#true} is VALID [2022-04-27 15:10:32,875 INFO L290 TraceCheckUtils]: 6: Hoare triple {64908#true} assume !false;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~cond~0 := #t~nondet12;havoc #t~nondet12; {64908#true} is VALID [2022-04-27 15:10:32,875 INFO L290 TraceCheckUtils]: 7: Hoare triple {64908#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0; {64908#true} is VALID [2022-04-27 15:10:32,876 INFO L290 TraceCheckUtils]: 8: Hoare triple {64908#true} assume !(0 != ~p1~0); {64908#true} is VALID [2022-04-27 15:10:32,876 INFO L290 TraceCheckUtils]: 9: Hoare triple {64908#true} assume !(0 != ~p2~0); {64908#true} is VALID [2022-04-27 15:10:32,876 INFO L290 TraceCheckUtils]: 10: Hoare triple {64908#true} assume !(0 != ~p3~0); {64908#true} is VALID [2022-04-27 15:10:32,876 INFO L290 TraceCheckUtils]: 11: Hoare triple {64908#true} assume !(0 != ~p4~0); {64908#true} is VALID [2022-04-27 15:10:32,876 INFO L290 TraceCheckUtils]: 12: Hoare triple {64908#true} assume !(0 != ~p5~0); {64908#true} is VALID [2022-04-27 15:10:32,876 INFO L290 TraceCheckUtils]: 13: Hoare triple {64908#true} assume !(0 != ~p6~0); {64908#true} is VALID [2022-04-27 15:10:32,876 INFO L290 TraceCheckUtils]: 14: Hoare triple {64908#true} assume 0 != ~p7~0;~lk7~0 := 1; {64913#(not (= main_~p7~0 0))} is VALID [2022-04-27 15:10:32,876 INFO L290 TraceCheckUtils]: 15: Hoare triple {64913#(not (= main_~p7~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {64913#(not (= main_~p7~0 0))} is VALID [2022-04-27 15:10:32,876 INFO L290 TraceCheckUtils]: 16: Hoare triple {64913#(not (= main_~p7~0 0))} assume !(0 != ~p1~0); {64913#(not (= main_~p7~0 0))} is VALID [2022-04-27 15:10:32,877 INFO L290 TraceCheckUtils]: 17: Hoare triple {64913#(not (= main_~p7~0 0))} assume !(0 != ~p2~0); {64913#(not (= main_~p7~0 0))} is VALID [2022-04-27 15:10:32,877 INFO L290 TraceCheckUtils]: 18: Hoare triple {64913#(not (= main_~p7~0 0))} assume !(0 != ~p3~0); {64913#(not (= main_~p7~0 0))} is VALID [2022-04-27 15:10:32,878 INFO L290 TraceCheckUtils]: 19: Hoare triple {64913#(not (= main_~p7~0 0))} assume !(0 != ~p4~0); {64913#(not (= main_~p7~0 0))} is VALID [2022-04-27 15:10:32,879 INFO L290 TraceCheckUtils]: 20: Hoare triple {64913#(not (= main_~p7~0 0))} assume !(0 != ~p5~0); {64913#(not (= main_~p7~0 0))} is VALID [2022-04-27 15:10:32,880 INFO L290 TraceCheckUtils]: 21: Hoare triple {64913#(not (= main_~p7~0 0))} assume !(0 != ~p6~0); {64913#(not (= main_~p7~0 0))} is VALID [2022-04-27 15:10:32,880 INFO L290 TraceCheckUtils]: 22: Hoare triple {64913#(not (= main_~p7~0 0))} assume !(0 != ~p7~0); {64909#false} is VALID [2022-04-27 15:10:32,880 INFO L290 TraceCheckUtils]: 23: Hoare triple {64909#false} assume 0 != ~p8~0; {64909#false} is VALID [2022-04-27 15:10:32,880 INFO L290 TraceCheckUtils]: 24: Hoare triple {64909#false} assume 1 != ~lk8~0; {64909#false} is VALID [2022-04-27 15:10:32,880 INFO L290 TraceCheckUtils]: 25: Hoare triple {64909#false} assume !false; {64909#false} is VALID [2022-04-27 15:10:32,880 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:32,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:10:32,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880903501] [2022-04-27 15:10:32,880 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880903501] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:10:32,880 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:10:32,881 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:10:32,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487183095] [2022-04-27 15:10:32,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:10:32,881 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-27 15:10:32,881 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:10:32,881 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:32,893 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:32,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:10:32,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:10:32,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:10:32,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:10:32,894 INFO L87 Difference]: Start difference. First operand 2953 states and 3655 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:33,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:33,557 INFO L93 Difference]: Finished difference Result 4429 states and 5449 transitions. [2022-04-27 15:10:33,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:10:33,558 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-27 15:10:33,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:10:33,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:33,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 133 transitions. [2022-04-27 15:10:33,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:33,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 133 transitions. [2022-04-27 15:10:33,561 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 133 transitions. [2022-04-27 15:10:33,615 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 133 edges. 133 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:33,862 INFO L225 Difference]: With dead ends: 4429 [2022-04-27 15:10:33,862 INFO L226 Difference]: Without dead ends: 3019 [2022-04-27 15:10:33,864 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:10:33,864 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 99 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:10:33,864 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 75 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 15:10:33,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3019 states. [2022-04-27 15:10:33,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3019 to 3017. [2022-04-27 15:10:33,907 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:10:33,910 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3019 states. Second operand has 3017 states, 3013 states have (on average 1.2120809824095586) internal successors, (3652), 3013 states have internal predecessors, (3652), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:33,911 INFO L74 IsIncluded]: Start isIncluded. First operand 3019 states. Second operand has 3017 states, 3013 states have (on average 1.2120809824095586) internal successors, (3652), 3013 states have internal predecessors, (3652), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:33,913 INFO L87 Difference]: Start difference. First operand 3019 states. Second operand has 3017 states, 3013 states have (on average 1.2120809824095586) internal successors, (3652), 3013 states have internal predecessors, (3652), 2 states have call successors, (2), 2 states have call 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:34,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:34,134 INFO L93 Difference]: Finished difference Result 3019 states and 3656 transitions. [2022-04-27 15:10:34,134 INFO L276 IsEmpty]: Start isEmpty. Operand 3019 states and 3656 transitions. [2022-04-27 15:10:34,136 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:34,136 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:34,139 INFO L74 IsIncluded]: Start isIncluded. First operand has 3017 states, 3013 states have (on average 1.2120809824095586) internal successors, (3652), 3013 states have internal predecessors, (3652), 2 states have call successors, (2), 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 3019 states. [2022-04-27 15:10:34,141 INFO L87 Difference]: Start difference. First operand has 3017 states, 3013 states have (on average 1.2120809824095586) internal successors, (3652), 3013 states have internal predecessors, (3652), 2 states have call successors, (2), 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 3019 states. [2022-04-27 15:10:34,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:34,360 INFO L93 Difference]: Finished difference Result 3019 states and 3656 transitions. [2022-04-27 15:10:34,361 INFO L276 IsEmpty]: Start isEmpty. Operand 3019 states and 3656 transitions. [2022-04-27 15:10:34,363 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:34,363 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:34,363 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:10:34,363 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:10:34,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3017 states, 3013 states have (on average 1.2120809824095586) internal successors, (3652), 3013 states have internal predecessors, (3652), 2 states have call successors, (2), 2 states have call 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:34,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3017 states to 3017 states and 3655 transitions. [2022-04-27 15:10:34,606 INFO L78 Accepts]: Start accepts. Automaton has 3017 states and 3655 transitions. Word has length 26 [2022-04-27 15:10:34,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:10:34,607 INFO L495 AbstractCegarLoop]: Abstraction has 3017 states and 3655 transitions. [2022-04-27 15:10:34,607 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:34,607 INFO L276 IsEmpty]: Start isEmpty. Operand 3017 states and 3655 transitions. [2022-04-27 15:10:34,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-27 15:10:34,608 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:10:34,608 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:10:34,609 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-04-27 15:10:34,609 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:10:34,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:10:34,609 INFO L85 PathProgramCache]: Analyzing trace with hash -173530997, now seen corresponding path program 1 times [2022-04-27 15:10:34,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:10:34,609 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637609987] [2022-04-27 15:10:34,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:10:34,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:10:34,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:34,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:10:34,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:34,637 INFO L290 TraceCheckUtils]: 0: Hoare triple {78744#(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); {78738#true} is VALID [2022-04-27 15:10:34,637 INFO L290 TraceCheckUtils]: 1: Hoare triple {78738#true} assume true; {78738#true} is VALID [2022-04-27 15:10:34,637 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {78738#true} {78738#true} #166#return; {78738#true} is VALID [2022-04-27 15:10:34,637 INFO L272 TraceCheckUtils]: 0: Hoare triple {78738#true} call ULTIMATE.init(); {78744#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:10:34,637 INFO L290 TraceCheckUtils]: 1: Hoare triple {78744#(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); {78738#true} is VALID [2022-04-27 15:10:34,637 INFO L290 TraceCheckUtils]: 2: Hoare triple {78738#true} assume true; {78738#true} is VALID [2022-04-27 15:10:34,637 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {78738#true} {78738#true} #166#return; {78738#true} is VALID [2022-04-27 15:10:34,637 INFO L272 TraceCheckUtils]: 4: Hoare triple {78738#true} call #t~ret13 := main(); {78738#true} is VALID [2022-04-27 15:10:34,637 INFO L290 TraceCheckUtils]: 5: Hoare triple {78738#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;havoc ~cond~0; {78738#true} is VALID [2022-04-27 15:10:34,637 INFO L290 TraceCheckUtils]: 6: Hoare triple {78738#true} assume !false;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~cond~0 := #t~nondet12;havoc #t~nondet12; {78738#true} is VALID [2022-04-27 15:10:34,637 INFO L290 TraceCheckUtils]: 7: Hoare triple {78738#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0; {78738#true} is VALID [2022-04-27 15:10:34,638 INFO L290 TraceCheckUtils]: 8: Hoare triple {78738#true} assume !(0 != ~p1~0); {78738#true} is VALID [2022-04-27 15:10:34,638 INFO L290 TraceCheckUtils]: 9: Hoare triple {78738#true} assume !(0 != ~p2~0); {78738#true} is VALID [2022-04-27 15:10:34,638 INFO L290 TraceCheckUtils]: 10: Hoare triple {78738#true} assume !(0 != ~p3~0); {78738#true} is VALID [2022-04-27 15:10:34,638 INFO L290 TraceCheckUtils]: 11: Hoare triple {78738#true} assume !(0 != ~p4~0); {78738#true} is VALID [2022-04-27 15:10:34,638 INFO L290 TraceCheckUtils]: 12: Hoare triple {78738#true} assume !(0 != ~p5~0); {78738#true} is VALID [2022-04-27 15:10:34,638 INFO L290 TraceCheckUtils]: 13: Hoare triple {78738#true} assume !(0 != ~p6~0); {78738#true} is VALID [2022-04-27 15:10:34,638 INFO L290 TraceCheckUtils]: 14: Hoare triple {78738#true} assume !(0 != ~p7~0); {78738#true} is VALID [2022-04-27 15:10:34,638 INFO L290 TraceCheckUtils]: 15: Hoare triple {78738#true} assume 0 != ~p8~0;~lk8~0 := 1; {78743#(= main_~lk8~0 1)} is VALID [2022-04-27 15:10:34,638 INFO L290 TraceCheckUtils]: 16: Hoare triple {78743#(= main_~lk8~0 1)} assume !(0 != ~p1~0); {78743#(= main_~lk8~0 1)} is VALID [2022-04-27 15:10:34,639 INFO L290 TraceCheckUtils]: 17: Hoare triple {78743#(= main_~lk8~0 1)} assume !(0 != ~p2~0); {78743#(= main_~lk8~0 1)} is VALID [2022-04-27 15:10:34,639 INFO L290 TraceCheckUtils]: 18: Hoare triple {78743#(= main_~lk8~0 1)} assume !(0 != ~p3~0); {78743#(= main_~lk8~0 1)} is VALID [2022-04-27 15:10:34,639 INFO L290 TraceCheckUtils]: 19: Hoare triple {78743#(= main_~lk8~0 1)} assume !(0 != ~p4~0); {78743#(= main_~lk8~0 1)} is VALID [2022-04-27 15:10:34,639 INFO L290 TraceCheckUtils]: 20: Hoare triple {78743#(= main_~lk8~0 1)} assume !(0 != ~p5~0); {78743#(= main_~lk8~0 1)} is VALID [2022-04-27 15:10:34,640 INFO L290 TraceCheckUtils]: 21: Hoare triple {78743#(= main_~lk8~0 1)} assume !(0 != ~p6~0); {78743#(= main_~lk8~0 1)} is VALID [2022-04-27 15:10:34,640 INFO L290 TraceCheckUtils]: 22: Hoare triple {78743#(= main_~lk8~0 1)} assume !(0 != ~p7~0); {78743#(= main_~lk8~0 1)} is VALID [2022-04-27 15:10:34,640 INFO L290 TraceCheckUtils]: 23: Hoare triple {78743#(= main_~lk8~0 1)} assume 0 != ~p8~0; {78743#(= main_~lk8~0 1)} is VALID [2022-04-27 15:10:34,640 INFO L290 TraceCheckUtils]: 24: Hoare triple {78743#(= main_~lk8~0 1)} assume 1 != ~lk8~0; {78739#false} is VALID [2022-04-27 15:10:34,640 INFO L290 TraceCheckUtils]: 25: Hoare triple {78739#false} assume !false; {78739#false} is VALID [2022-04-27 15:10:34,640 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:34,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:10:34,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637609987] [2022-04-27 15:10:34,641 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637609987] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:10:34,641 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:10:34,641 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:10:34,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711850875] [2022-04-27 15:10:34,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:10:34,641 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-27 15:10:34,641 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:10:34,641 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:34,662 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:34,662 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:10:34,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:10:34,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:10:34,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:10:34,662 INFO L87 Difference]: Start difference. First operand 3017 states and 3655 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:35,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:35,404 INFO L93 Difference]: Finished difference Result 4875 states and 5832 transitions. [2022-04-27 15:10:35,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:10:35,404 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-27 15:10:35,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:10:35,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:35,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 78 transitions. [2022-04-27 15:10:35,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:35,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 78 transitions. [2022-04-27 15:10:35,406 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 78 transitions. [2022-04-27 15:10:35,467 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:36,114 INFO L225 Difference]: With dead ends: 4875 [2022-04-27 15:10:36,114 INFO L226 Difference]: Without dead ends: 4873 [2022-04-27 15:10:36,119 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:36,120 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 84 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:10:36,120 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 58 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 15:10:36,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4873 states. [2022-04-27 15:10:36,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4873 to 4617. [2022-04-27 15:10:36,174 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:10:36,177 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4873 states. Second operand has 4617 states, 4613 states have (on average 1.1801430739215262) internal successors, (5444), 4613 states have internal predecessors, (5444), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:36,179 INFO L74 IsIncluded]: Start isIncluded. First operand 4873 states. Second operand has 4617 states, 4613 states have (on average 1.1801430739215262) internal successors, (5444), 4613 states have internal predecessors, (5444), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:36,181 INFO L87 Difference]: Start difference. First operand 4873 states. Second operand has 4617 states, 4613 states have (on average 1.1801430739215262) internal successors, (5444), 4613 states have internal predecessors, (5444), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:36,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:36,775 INFO L93 Difference]: Finished difference Result 4873 states and 5703 transitions. [2022-04-27 15:10:36,775 INFO L276 IsEmpty]: Start isEmpty. Operand 4873 states and 5703 transitions. [2022-04-27 15:10:36,780 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:36,780 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:36,783 INFO L74 IsIncluded]: Start isIncluded. First operand has 4617 states, 4613 states have (on average 1.1801430739215262) internal successors, (5444), 4613 states have internal predecessors, (5444), 2 states have call successors, (2), 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 4873 states. [2022-04-27 15:10:36,786 INFO L87 Difference]: Start difference. First operand has 4617 states, 4613 states have (on average 1.1801430739215262) internal successors, (5444), 4613 states have internal predecessors, (5444), 2 states have call successors, (2), 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 4873 states. [2022-04-27 15:10:37,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:37,382 INFO L93 Difference]: Finished difference Result 4873 states and 5703 transitions. [2022-04-27 15:10:37,382 INFO L276 IsEmpty]: Start isEmpty. Operand 4873 states and 5703 transitions. [2022-04-27 15:10:37,392 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:37,392 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:37,392 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:10:37,392 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:10:37,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4617 states, 4613 states have (on average 1.1801430739215262) internal successors, (5444), 4613 states have internal predecessors, (5444), 2 states have call successors, (2), 2 states have call 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:37,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4617 states to 4617 states and 5447 transitions. [2022-04-27 15:10:37,966 INFO L78 Accepts]: Start accepts. Automaton has 4617 states and 5447 transitions. Word has length 26 [2022-04-27 15:10:37,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:10:37,966 INFO L495 AbstractCegarLoop]: Abstraction has 4617 states and 5447 transitions. [2022-04-27 15:10:37,966 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:37,966 INFO L276 IsEmpty]: Start isEmpty. Operand 4617 states and 5447 transitions. [2022-04-27 15:10:37,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-27 15:10:37,970 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:10:37,970 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:10:37,970 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-04-27 15:10:37,970 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:10:37,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:10:37,970 INFO L85 PathProgramCache]: Analyzing trace with hash 527533581, now seen corresponding path program 1 times [2022-04-27 15:10:37,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:10:37,970 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273789563] [2022-04-27 15:10:37,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:10:37,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:10:37,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:38,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:10:38,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:38,014 INFO L290 TraceCheckUtils]: 0: Hoare triple {98391#(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); {98385#true} is VALID [2022-04-27 15:10:38,014 INFO L290 TraceCheckUtils]: 1: Hoare triple {98385#true} assume true; {98385#true} is VALID [2022-04-27 15:10:38,015 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {98385#true} {98385#true} #166#return; {98385#true} is VALID [2022-04-27 15:10:38,015 INFO L272 TraceCheckUtils]: 0: Hoare triple {98385#true} call ULTIMATE.init(); {98391#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:10:38,015 INFO L290 TraceCheckUtils]: 1: Hoare triple {98391#(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); {98385#true} is VALID [2022-04-27 15:10:38,015 INFO L290 TraceCheckUtils]: 2: Hoare triple {98385#true} assume true; {98385#true} is VALID [2022-04-27 15:10:38,015 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {98385#true} {98385#true} #166#return; {98385#true} is VALID [2022-04-27 15:10:38,015 INFO L272 TraceCheckUtils]: 4: Hoare triple {98385#true} call #t~ret13 := main(); {98385#true} is VALID [2022-04-27 15:10:38,015 INFO L290 TraceCheckUtils]: 5: Hoare triple {98385#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;havoc ~cond~0; {98385#true} is VALID [2022-04-27 15:10:38,015 INFO L290 TraceCheckUtils]: 6: Hoare triple {98385#true} assume !false;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~cond~0 := #t~nondet12;havoc #t~nondet12; {98385#true} is VALID [2022-04-27 15:10:38,015 INFO L290 TraceCheckUtils]: 7: Hoare triple {98385#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0; {98385#true} is VALID [2022-04-27 15:10:38,015 INFO L290 TraceCheckUtils]: 8: Hoare triple {98385#true} assume !(0 != ~p1~0); {98385#true} is VALID [2022-04-27 15:10:38,015 INFO L290 TraceCheckUtils]: 9: Hoare triple {98385#true} assume !(0 != ~p2~0); {98385#true} is VALID [2022-04-27 15:10:38,015 INFO L290 TraceCheckUtils]: 10: Hoare triple {98385#true} assume !(0 != ~p3~0); {98385#true} is VALID [2022-04-27 15:10:38,015 INFO L290 TraceCheckUtils]: 11: Hoare triple {98385#true} assume !(0 != ~p4~0); {98385#true} is VALID [2022-04-27 15:10:38,016 INFO L290 TraceCheckUtils]: 12: Hoare triple {98385#true} assume !(0 != ~p5~0); {98385#true} is VALID [2022-04-27 15:10:38,016 INFO L290 TraceCheckUtils]: 13: Hoare triple {98385#true} assume !(0 != ~p6~0); {98385#true} is VALID [2022-04-27 15:10:38,016 INFO L290 TraceCheckUtils]: 14: Hoare triple {98385#true} assume !(0 != ~p7~0); {98385#true} is VALID [2022-04-27 15:10:38,016 INFO L290 TraceCheckUtils]: 15: Hoare triple {98385#true} assume !(0 != ~p8~0); {98390#(= main_~p8~0 0)} is VALID [2022-04-27 15:10:38,016 INFO L290 TraceCheckUtils]: 16: Hoare triple {98390#(= main_~p8~0 0)} assume !(0 != ~p1~0); {98390#(= main_~p8~0 0)} is VALID [2022-04-27 15:10:38,016 INFO L290 TraceCheckUtils]: 17: Hoare triple {98390#(= main_~p8~0 0)} assume !(0 != ~p2~0); {98390#(= main_~p8~0 0)} is VALID [2022-04-27 15:10:38,017 INFO L290 TraceCheckUtils]: 18: Hoare triple {98390#(= main_~p8~0 0)} assume !(0 != ~p3~0); {98390#(= main_~p8~0 0)} is VALID [2022-04-27 15:10:38,017 INFO L290 TraceCheckUtils]: 19: Hoare triple {98390#(= main_~p8~0 0)} assume !(0 != ~p4~0); {98390#(= main_~p8~0 0)} is VALID [2022-04-27 15:10:38,017 INFO L290 TraceCheckUtils]: 20: Hoare triple {98390#(= main_~p8~0 0)} assume !(0 != ~p5~0); {98390#(= main_~p8~0 0)} is VALID [2022-04-27 15:10:38,017 INFO L290 TraceCheckUtils]: 21: Hoare triple {98390#(= main_~p8~0 0)} assume !(0 != ~p6~0); {98390#(= main_~p8~0 0)} is VALID [2022-04-27 15:10:38,018 INFO L290 TraceCheckUtils]: 22: Hoare triple {98390#(= main_~p8~0 0)} assume !(0 != ~p7~0); {98390#(= main_~p8~0 0)} is VALID [2022-04-27 15:10:38,018 INFO L290 TraceCheckUtils]: 23: Hoare triple {98390#(= main_~p8~0 0)} assume 0 != ~p8~0; {98386#false} is VALID [2022-04-27 15:10:38,018 INFO L290 TraceCheckUtils]: 24: Hoare triple {98386#false} assume 1 != ~lk8~0; {98386#false} is VALID [2022-04-27 15:10:38,018 INFO L290 TraceCheckUtils]: 25: Hoare triple {98386#false} assume !false; {98386#false} is VALID [2022-04-27 15:10:38,018 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:38,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:10:38,018 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273789563] [2022-04-27 15:10:38,018 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273789563] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:10:38,018 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:10:38,018 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:10:38,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005564270] [2022-04-27 15:10:38,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:10:38,019 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-27 15:10:38,019 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:10:38,019 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:38,033 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:38,033 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:10:38,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:10:38,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:10:38,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:10:38,034 INFO L87 Difference]: Start difference. First operand 4617 states and 5447 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:40,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:40,985 INFO L93 Difference]: Finished difference Result 10249 states and 11847 transitions. [2022-04-27 15:10:40,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:10:40,985 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-27 15:10:40,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:10:40,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:40,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 133 transitions. [2022-04-27 15:10:40,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:40,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 133 transitions. [2022-04-27 15:10:40,988 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 133 transitions. [2022-04-27 15:10:41,115 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 133 edges. 133 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:41,115 INFO L225 Difference]: With dead ends: 10249 [2022-04-27 15:10:41,116 INFO L226 Difference]: Without dead ends: 0 [2022-04-27 15:10:41,123 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:41,123 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 73 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:10:41,123 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 92 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 15:10:41,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-27 15:10:41,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-27 15:10:41,124 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:10:41,124 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:41,124 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:41,124 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:41,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:41,124 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 15:10:41,124 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 15:10:41,124 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:41,124 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:41,124 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:41,124 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:41,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:41,124 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 15:10:41,124 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 15:10:41,125 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:41,125 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:41,125 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:10:41,125 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:10:41,125 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:41,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-27 15:10:41,125 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 26 [2022-04-27 15:10:41,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:10:41,125 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-27 15:10:41,125 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:41,125 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 15:10:41,125 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:41,127 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 15:10:41,127 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-04-27 15:10:41,128 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-27 15:10:49,623 WARN L232 SmtUtils]: Spent 8.47s on a formula simplification that was a NOOP. DAG size: 1069 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-04-27 15:10:49,653 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 3) no Hoare annotation was computed. [2022-04-27 15:10:49,653 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 3) no Hoare annotation was computed. [2022-04-27 15:10:49,654 INFO L899 garLoopResultBuilder]: For program point reach_errorFINAL(line 3) no Hoare annotation was computed. [2022-04-27 15:10:49,654 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-27 15:10:49,654 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:49,654 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-27 15:10:49,654 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-27 15:10:49,654 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-27 15:10:49,654 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-27 15:10:49,654 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-27 15:10:49,654 INFO L899 garLoopResultBuilder]: For program point L93(line 93) no Hoare annotation was computed. [2022-04-27 15:10:49,654 INFO L899 garLoopResultBuilder]: For program point mainEXIT(lines 6 137) no Hoare annotation was computed. [2022-04-27 15:10:49,654 INFO L899 garLoopResultBuilder]: For program point L118(line 118) no Hoare annotation was computed. [2022-04-27 15:10:49,654 INFO L899 garLoopResultBuilder]: For program point L102-1(lines 35 132) no Hoare annotation was computed. [2022-04-27 15:10:49,654 INFO L902 garLoopResultBuilder]: At program point L127-1(lines 35 132) the Hoare annotation is: true [2022-04-27 15:10:49,654 INFO L899 garLoopResultBuilder]: For program point L86-1(lines 35 132) no Hoare annotation was computed. [2022-04-27 15:10:49,654 INFO L899 garLoopResultBuilder]: For program point L78-1(lines 35 132) no Hoare annotation was computed. [2022-04-27 15:10:49,654 INFO L899 garLoopResultBuilder]: For program point L103(line 103) no Hoare annotation was computed. [2022-04-27 15:10:49,654 INFO L899 garLoopResultBuilder]: For program point L37(lines 37 39) no Hoare annotation was computed. [2022-04-27 15:10:49,654 INFO L899 garLoopResultBuilder]: For program point L70-1(lines 35 132) no Hoare annotation was computed. [2022-04-27 15:10:49,654 INFO L899 garLoopResultBuilder]: For program point L128(line 128) no Hoare annotation was computed. [2022-04-27 15:10:49,654 INFO L895 garLoopResultBuilder]: At program point L128-1(lines 7 137) the Hoare annotation is: false [2022-04-27 15:10:49,654 INFO L899 garLoopResultBuilder]: For program point L62-1(lines 35 132) no Hoare annotation was computed. [2022-04-27 15:10:49,655 INFO L899 garLoopResultBuilder]: For program point L112-1(lines 35 132) no Hoare annotation was computed. [2022-04-27 15:10:49,655 INFO L899 garLoopResultBuilder]: For program point mainFINAL(lines 6 137) no Hoare annotation was computed. [2022-04-27 15:10:49,655 INFO L899 garLoopResultBuilder]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 135) no Hoare annotation was computed. [2022-04-27 15:10:49,655 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 6 137) the Hoare annotation is: true [2022-04-27 15:10:49,655 INFO L899 garLoopResultBuilder]: For program point L113(line 113) no Hoare annotation was computed. [2022-04-27 15:10:49,655 INFO L899 garLoopResultBuilder]: For program point L97-1(lines 35 132) no Hoare annotation was computed. [2022-04-27 15:10:49,655 INFO L899 garLoopResultBuilder]: For program point L122-1(lines 35 132) no Hoare annotation was computed. [2022-04-27 15:10:49,655 INFO L899 garLoopResultBuilder]: For program point L98(line 98) no Hoare annotation was computed. [2022-04-27 15:10:49,655 INFO L899 garLoopResultBuilder]: For program point L123(line 123) no Hoare annotation was computed. [2022-04-27 15:10:49,655 INFO L899 garLoopResultBuilder]: For program point L82-1(lines 35 132) no Hoare annotation was computed. [2022-04-27 15:10:49,655 INFO L899 garLoopResultBuilder]: For program point L107-1(lines 35 132) no Hoare annotation was computed. [2022-04-27 15:10:49,655 INFO L899 garLoopResultBuilder]: For program point L74-1(lines 35 132) no Hoare annotation was computed. [2022-04-27 15:10:49,655 INFO L899 garLoopResultBuilder]: For program point L66-1(lines 35 132) no Hoare annotation was computed. [2022-04-27 15:10:49,655 INFO L899 garLoopResultBuilder]: For program point L58(lines 58 60) no Hoare annotation was computed. [2022-04-27 15:10:49,655 INFO L899 garLoopResultBuilder]: For program point L58-2(lines 35 132) no Hoare annotation was computed. [2022-04-27 15:10:49,655 INFO L899 garLoopResultBuilder]: For program point L108(line 108) no Hoare annotation was computed. [2022-04-27 15:10:49,655 INFO L902 garLoopResultBuilder]: At program point L133(lines 7 137) the Hoare annotation is: true [2022-04-27 15:10:49,655 INFO L899 garLoopResultBuilder]: For program point L92-1(lines 35 132) no Hoare annotation was computed. [2022-04-27 15:10:49,655 INFO L899 garLoopResultBuilder]: For program point L117-1(lines 35 132) no Hoare annotation was computed. [2022-04-27 15:10:49,657 INFO L356 BasicCegarLoop]: Path program 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:49,659 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 15:10:49,661 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-27 15:10:49,661 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 15:10:49,661 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-27 15:10:49,661 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 15:10:49,661 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 15:10:49,661 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2022-04-27 15:10:49,661 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-27 15:10:49,662 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 15:10:49,662 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 15:10:49,662 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2022-04-27 15:10:49,662 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2022-04-27 15:10:49,662 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 15:10:49,662 WARN L170 areAnnotationChecker]: L58 has no Hoare annotation [2022-04-27 15:10:49,662 WARN L170 areAnnotationChecker]: L58 has no Hoare annotation [2022-04-27 15:10:49,662 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-27 15:10:49,662 WARN L170 areAnnotationChecker]: L58-2 has no Hoare annotation [2022-04-27 15:10:49,662 WARN L170 areAnnotationChecker]: L58-2 has no Hoare annotation [2022-04-27 15:10:49,662 WARN L170 areAnnotationChecker]: L62-1 has no Hoare annotation [2022-04-27 15:10:49,662 WARN L170 areAnnotationChecker]: L62-1 has no Hoare annotation [2022-04-27 15:10:49,662 WARN L170 areAnnotationChecker]: L66-1 has no Hoare annotation [2022-04-27 15:10:49,662 WARN L170 areAnnotationChecker]: L66-1 has no Hoare annotation [2022-04-27 15:10:49,662 WARN L170 areAnnotationChecker]: L70-1 has no Hoare annotation [2022-04-27 15:10:49,662 WARN L170 areAnnotationChecker]: L70-1 has no Hoare annotation [2022-04-27 15:10:49,662 WARN L170 areAnnotationChecker]: L74-1 has no Hoare annotation [2022-04-27 15:10:49,662 WARN L170 areAnnotationChecker]: L74-1 has no Hoare annotation [2022-04-27 15:10:49,662 WARN L170 areAnnotationChecker]: L78-1 has no Hoare annotation [2022-04-27 15:10:49,662 WARN L170 areAnnotationChecker]: L78-1 has no Hoare annotation [2022-04-27 15:10:49,662 WARN L170 areAnnotationChecker]: L82-1 has no Hoare annotation [2022-04-27 15:10:49,662 WARN L170 areAnnotationChecker]: L82-1 has no Hoare annotation [2022-04-27 15:10:49,662 WARN L170 areAnnotationChecker]: L86-1 has no Hoare annotation [2022-04-27 15:10:49,662 WARN L170 areAnnotationChecker]: L86-1 has no Hoare annotation [2022-04-27 15:10:49,662 WARN L170 areAnnotationChecker]: L93 has no Hoare annotation [2022-04-27 15:10:49,662 WARN L170 areAnnotationChecker]: L93 has no Hoare annotation [2022-04-27 15:10:49,662 WARN L170 areAnnotationChecker]: L92-1 has no Hoare annotation [2022-04-27 15:10:49,662 WARN L170 areAnnotationChecker]: L92-1 has no Hoare annotation [2022-04-27 15:10:49,662 WARN L170 areAnnotationChecker]: mainErr0ASSERT_VIOLATIONERROR_FUNCTION has no Hoare annotation [2022-04-27 15:10:49,662 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 15:10:49,662 WARN L170 areAnnotationChecker]: L98 has no Hoare annotation [2022-04-27 15:10:49,662 WARN L170 areAnnotationChecker]: L98 has no Hoare annotation [2022-04-27 15:10:49,662 WARN L170 areAnnotationChecker]: L97-1 has no Hoare annotation [2022-04-27 15:10:49,663 WARN L170 areAnnotationChecker]: L97-1 has no Hoare annotation [2022-04-27 15:10:49,663 WARN L170 areAnnotationChecker]: L103 has no Hoare annotation [2022-04-27 15:10:49,663 WARN L170 areAnnotationChecker]: L103 has no Hoare annotation [2022-04-27 15:10:49,663 WARN L170 areAnnotationChecker]: L102-1 has no Hoare annotation [2022-04-27 15:10:49,663 WARN L170 areAnnotationChecker]: L102-1 has no Hoare annotation [2022-04-27 15:10:49,663 WARN L170 areAnnotationChecker]: L108 has no Hoare annotation [2022-04-27 15:10:49,663 WARN L170 areAnnotationChecker]: L108 has no Hoare annotation [2022-04-27 15:10:49,663 WARN L170 areAnnotationChecker]: L107-1 has no Hoare annotation [2022-04-27 15:10:49,663 WARN L170 areAnnotationChecker]: L107-1 has no Hoare annotation [2022-04-27 15:10:49,663 WARN L170 areAnnotationChecker]: L113 has no Hoare annotation [2022-04-27 15:10:49,663 WARN L170 areAnnotationChecker]: L113 has no Hoare annotation [2022-04-27 15:10:49,663 WARN L170 areAnnotationChecker]: L112-1 has no Hoare annotation [2022-04-27 15:10:49,663 WARN L170 areAnnotationChecker]: L112-1 has no Hoare annotation [2022-04-27 15:10:49,663 WARN L170 areAnnotationChecker]: L118 has no Hoare annotation [2022-04-27 15:10:49,663 WARN L170 areAnnotationChecker]: L118 has no Hoare annotation [2022-04-27 15:10:49,663 WARN L170 areAnnotationChecker]: L117-1 has no Hoare annotation [2022-04-27 15:10:49,663 WARN L170 areAnnotationChecker]: L117-1 has no Hoare annotation [2022-04-27 15:10:49,663 WARN L170 areAnnotationChecker]: L123 has no Hoare annotation [2022-04-27 15:10:49,663 WARN L170 areAnnotationChecker]: L123 has no Hoare annotation [2022-04-27 15:10:49,663 WARN L170 areAnnotationChecker]: L122-1 has no Hoare annotation [2022-04-27 15:10:49,663 WARN L170 areAnnotationChecker]: L122-1 has no Hoare annotation [2022-04-27 15:10:49,663 WARN L170 areAnnotationChecker]: L128 has no Hoare annotation [2022-04-27 15:10:49,663 WARN L170 areAnnotationChecker]: L128 has no Hoare annotation [2022-04-27 15:10:49,663 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:49,667 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 03:10:49 BoogieIcfgContainer [2022-04-27 15:10:49,667 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 15:10:49,668 INFO L158 Benchmark]: Toolchain (without parser) took 27078.85ms. Allocated memory was 183.5MB in the beginning and 467.7MB in the end (delta: 284.2MB). Free memory was 155.1MB in the beginning and 382.8MB in the end (delta: -227.6MB). Peak memory consumption was 290.7MB. Max. memory is 8.0GB. [2022-04-27 15:10:49,668 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 183.5MB. Free memory is still 144.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 15:10:49,668 INFO L158 Benchmark]: CACSL2BoogieTranslator took 173.94ms. Allocated memory is still 183.5MB. Free memory was 154.8MB in the beginning and 155.2MB in the end (delta: -440.4kB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2022-04-27 15:10:49,668 INFO L158 Benchmark]: Boogie Preprocessor took 22.46ms. Allocated memory is still 183.5MB. Free memory was 155.2MB in the beginning and 153.7MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-27 15:10:49,668 INFO L158 Benchmark]: RCFGBuilder took 338.85ms. Allocated memory is still 183.5MB. Free memory was 153.1MB in the beginning and 139.5MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-04-27 15:10:49,668 INFO L158 Benchmark]: TraceAbstraction took 26540.32ms. Allocated memory was 183.5MB in the beginning and 467.7MB in the end (delta: 284.2MB). Free memory was 139.0MB in the beginning and 382.8MB in the end (delta: -243.8MB). Peak memory consumption was 276.0MB. Max. memory is 8.0GB. [2022-04-27 15:10:49,680 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.10ms. Allocated memory is still 183.5MB. Free memory is still 144.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 173.94ms. Allocated memory is still 183.5MB. Free memory was 154.8MB in the beginning and 155.2MB in the end (delta: -440.4kB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * Boogie Preprocessor took 22.46ms. Allocated memory is still 183.5MB. Free memory was 155.2MB in the beginning and 153.7MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 338.85ms. Allocated memory is still 183.5MB. Free memory was 153.1MB in the beginning and 139.5MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * TraceAbstraction took 26540.32ms. Allocated memory was 183.5MB in the beginning and 467.7MB in the end (delta: 284.2MB). Free memory was 139.0MB in the beginning and 382.8MB in the end (delta: -243.8MB). Peak memory consumption was 276.0MB. 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: 135]: 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, 42 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 26.5s, OverallIterations: 22, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 11.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 8.5s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2238 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2238 mSDsluCounter, 1720 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 156 mSDsCounter, 52 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1083 IncrementalHoareTripleChecker+Invalid, 1135 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 52 mSolverCounterUnsat, 1564 mSDtfsCounter, 1083 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 154 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4617occurred in iteration=21, InterpolantAutomatonStates: 88, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 5.0s AutomataMinimizationTime, 22 MinimizatonAttempts, 1044 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 266 NumberOfFragments, 13 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 8.5s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 500 NumberOfCodeBlocks, 500 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 478 ConstructedInterpolants, 0 QuantifiedInterpolants, 1026 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 22 InterpolantComputations, 22 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: 35]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2022-04-27 15:10:49,706 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...