/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_10.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 15:09:00,793 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 15:09:00,795 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 15:09:00,838 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 15:09:00,838 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 15:09:00,839 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 15:09:00,845 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 15:09:00,850 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 15:09:00,852 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 15:09:00,857 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 15:09:00,858 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 15:09:00,858 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 15:09:00,859 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 15:09:00,859 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 15:09:00,860 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 15:09:00,861 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 15:09:00,861 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 15:09:00,862 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 15:09:00,863 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 15:09:00,864 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 15:09:00,865 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 15:09:00,867 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 15:09:00,869 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 15:09:00,870 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 15:09:00,871 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 15:09:00,881 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 15:09:00,881 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 15:09:00,882 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 15:09:00,882 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 15:09:00,882 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 15:09:00,883 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 15:09:00,883 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 15:09:00,883 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 15:09:00,884 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 15:09:00,885 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 15:09:00,885 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 15:09:00,885 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 15:09:00,886 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 15:09:00,886 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 15:09:00,886 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 15:09:00,887 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 15:09:00,893 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 15:09:00,893 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2022-04-27 15:09:00,910 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 15:09:00,910 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 15:09:00,910 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 15:09:00,910 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 15:09:00,911 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 15:09:00,911 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 15:09:00,912 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 15:09:00,912 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 15:09:00,912 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 15:09:00,912 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 15:09:00,912 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 15:09:00,912 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 15:09:00,912 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 15:09:00,912 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 15:09:00,913 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 15:09:00,913 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 15:09:00,913 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 15:09:00,913 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 15:09:00,913 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 15:09:00,913 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 15:09:00,913 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 15:09:00,913 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 15:09:00,914 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 15:09:00,914 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 15:09:00,914 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 15:09:00,914 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 15:09:00,914 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 15:09:00,914 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 15:09:00,914 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 15:09:00,914 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 15:09:00,914 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 15:09:00,915 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 15:09:00,915 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 15:09:00,917 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-27 15:09:01,123 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 15:09:01,142 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 15:09:01,144 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 15:09:01,145 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 15:09:01,146 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 15:09:01,147 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_10.c [2022-04-27 15:09:01,203 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/05fc17d34/a01187111c14499cac8c53e4d4c1e463/FLAG875eed477 [2022-04-27 15:09:01,578 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 15:09:01,578 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_10.c [2022-04-27 15:09:01,583 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/05fc17d34/a01187111c14499cac8c53e4d4c1e463/FLAG875eed477 [2022-04-27 15:09:01,986 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/05fc17d34/a01187111c14499cac8c53e4d4c1e463 [2022-04-27 15:09:01,987 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 15:09:01,989 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 15:09:01,990 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 15:09:01,990 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 15:09:01,993 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 15:09:01,994 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 03:09:01" (1/1) ... [2022-04-27 15:09:01,995 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3bb59a08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:09:01, skipping insertion in model container [2022-04-27 15:09:01,995 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 03:09:01" (1/1) ... [2022-04-27 15:09:02,001 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 15:09:02,021 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 15:09:02,187 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_10.c[3901,3914] [2022-04-27 15:09:02,190 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 15:09:02,197 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 15:09:02,218 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_10.c[3901,3914] [2022-04-27 15:09:02,219 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 15:09:02,229 INFO L208 MainTranslator]: Completed translation [2022-04-27 15:09:02,230 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:09:02 WrapperNode [2022-04-27 15:09:02,230 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 15:09:02,231 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 15:09:02,231 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 15:09:02,231 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 15:09:02,240 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:09:02" (1/1) ... [2022-04-27 15:09:02,240 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:09:02" (1/1) ... [2022-04-27 15:09:02,245 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:09:02" (1/1) ... [2022-04-27 15:09:02,245 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:09:02" (1/1) ... [2022-04-27 15:09:02,252 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:09:02" (1/1) ... [2022-04-27 15:09:02,258 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:09:02" (1/1) ... [2022-04-27 15:09:02,260 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:09:02" (1/1) ... [2022-04-27 15:09:02,261 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 15:09:02,262 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 15:09:02,262 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 15:09:02,263 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 15:09:02,263 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:09:02" (1/1) ... [2022-04-27 15:09:02,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 15:09:02,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 15:09:02,297 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-27 15:09:02,299 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-27 15:09:02,322 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 15:09:02,322 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 15:09:02,322 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 15:09:02,323 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 15:09:02,324 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 15:09:02,324 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 15:09:02,324 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 15:09:02,325 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 15:09:02,325 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-27 15:09:02,325 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 15:09:02,325 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 15:09:02,325 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 15:09:02,325 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 15:09:02,325 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 15:09:02,325 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 15:09:02,325 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 15:09:02,387 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 15:09:02,388 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 15:09:02,608 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 15:09:02,614 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 15:09:02,614 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 15:09:02,616 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 03:09:02 BoogieIcfgContainer [2022-04-27 15:09:02,616 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 15:09:02,617 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 15:09:02,617 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 15:09:02,620 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 15:09:02,621 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 03:09:01" (1/3) ... [2022-04-27 15:09:02,621 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@212cb38b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 03:09:02, skipping insertion in model container [2022-04-27 15:09:02,621 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:09:02" (2/3) ... [2022-04-27 15:09:02,622 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@212cb38b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 03:09:02, skipping insertion in model container [2022-04-27 15:09:02,622 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 03:09:02" (3/3) ... [2022-04-27 15:09:02,623 INFO L111 eAbstractionObserver]: Analyzing ICFG test_locks_10.c [2022-04-27 15:09:02,635 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 15:09:02,635 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 15:09:02,674 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 15:09:02,680 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@42ced973, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@533b3d49 [2022-04-27 15:09:02,680 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 15:09:02,688 INFO L276 IsEmpty]: Start isEmpty. Operand has 45 states, 39 states have (on average 1.8717948717948718) internal successors, (73), 40 states have internal predecessors, (73), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 15:09:02,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-27 15:09:02,694 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:09:02,694 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:09:02,695 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:09:02,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:09:02,699 INFO L85 PathProgramCache]: Analyzing trace with hash -1465526181, now seen corresponding path program 1 times [2022-04-27 15:09:02,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:09:02,707 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869523697] [2022-04-27 15:09:02,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:09:02,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:09:02,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:02,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:09:02,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:02,975 INFO L290 TraceCheckUtils]: 0: Hoare triple {54#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {48#true} is VALID [2022-04-27 15:09:02,975 INFO L290 TraceCheckUtils]: 1: Hoare triple {48#true} assume true; {48#true} is VALID [2022-04-27 15:09:02,976 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {48#true} {48#true} #200#return; {48#true} is VALID [2022-04-27 15:09:02,977 INFO L272 TraceCheckUtils]: 0: Hoare triple {48#true} call ULTIMATE.init(); {54#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:09:02,978 INFO L290 TraceCheckUtils]: 1: Hoare triple {54#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {48#true} is VALID [2022-04-27 15:09:02,978 INFO L290 TraceCheckUtils]: 2: Hoare triple {48#true} assume true; {48#true} is VALID [2022-04-27 15:09:02,978 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {48#true} {48#true} #200#return; {48#true} is VALID [2022-04-27 15:09:02,979 INFO L272 TraceCheckUtils]: 4: Hoare triple {48#true} call #t~ret15 := main(); {48#true} is VALID [2022-04-27 15:09:02,980 INFO L290 TraceCheckUtils]: 5: Hoare triple {48#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;havoc ~cond~0; {48#true} is VALID [2022-04-27 15:09:02,980 INFO L290 TraceCheckUtils]: 6: Hoare triple {48#true} assume !false;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~cond~0 := #t~nondet14;havoc #t~nondet14; {48#true} is VALID [2022-04-27 15:09:02,980 INFO L290 TraceCheckUtils]: 7: Hoare triple {48#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0; {48#true} is VALID [2022-04-27 15:09:02,981 INFO L290 TraceCheckUtils]: 8: Hoare triple {48#true} assume 0 != ~p1~0;~lk1~0 := 1; {53#(= main_~lk1~0 1)} is VALID [2022-04-27 15:09:02,982 INFO L290 TraceCheckUtils]: 9: Hoare triple {53#(= main_~lk1~0 1)} assume !(0 != ~p2~0); {53#(= main_~lk1~0 1)} is VALID [2022-04-27 15:09:02,983 INFO L290 TraceCheckUtils]: 10: Hoare triple {53#(= main_~lk1~0 1)} assume 0 != ~p3~0;~lk3~0 := 1; {53#(= main_~lk1~0 1)} is VALID [2022-04-27 15:09:02,983 INFO L290 TraceCheckUtils]: 11: Hoare triple {53#(= main_~lk1~0 1)} assume 0 != ~p4~0;~lk4~0 := 1; {53#(= main_~lk1~0 1)} is VALID [2022-04-27 15:09:02,984 INFO L290 TraceCheckUtils]: 12: Hoare triple {53#(= main_~lk1~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {53#(= main_~lk1~0 1)} is VALID [2022-04-27 15:09:02,985 INFO L290 TraceCheckUtils]: 13: Hoare triple {53#(= main_~lk1~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {53#(= main_~lk1~0 1)} is VALID [2022-04-27 15:09:02,985 INFO L290 TraceCheckUtils]: 14: Hoare triple {53#(= main_~lk1~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {53#(= main_~lk1~0 1)} is VALID [2022-04-27 15:09:02,986 INFO L290 TraceCheckUtils]: 15: Hoare triple {53#(= main_~lk1~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {53#(= main_~lk1~0 1)} is VALID [2022-04-27 15:09:02,986 INFO L290 TraceCheckUtils]: 16: Hoare triple {53#(= main_~lk1~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {53#(= main_~lk1~0 1)} is VALID [2022-04-27 15:09:02,992 INFO L290 TraceCheckUtils]: 17: Hoare triple {53#(= main_~lk1~0 1)} assume !(0 != ~p10~0); {53#(= main_~lk1~0 1)} is VALID [2022-04-27 15:09:02,993 INFO L290 TraceCheckUtils]: 18: Hoare triple {53#(= main_~lk1~0 1)} assume 0 != ~p1~0; {53#(= main_~lk1~0 1)} is VALID [2022-04-27 15:09:02,994 INFO L290 TraceCheckUtils]: 19: Hoare triple {53#(= main_~lk1~0 1)} assume 1 != ~lk1~0; {49#false} is VALID [2022-04-27 15:09:02,994 INFO L290 TraceCheckUtils]: 20: Hoare triple {49#false} assume !false; {49#false} is VALID [2022-04-27 15:09:02,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:09:02,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:09:02,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869523697] [2022-04-27 15:09:02,997 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869523697] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:09:02,997 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:09:02,998 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:09:03,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402506786] [2022-04-27 15:09:03,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:09:03,005 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:09:03,007 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:09:03,011 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:09:03,056 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:09:03,056 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:09:03,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:09:03,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:09:03,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:09:03,085 INFO L87 Difference]: Start difference. First operand has 45 states, 39 states have (on average 1.8717948717948718) internal successors, (73), 40 states have internal predecessors, (73), 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.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:09:03,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:03,439 INFO L93 Difference]: Finished difference Result 88 states and 151 transitions. [2022-04-27 15:09:03,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:09:03,439 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:09:03,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:09:03,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:03,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 151 transitions. [2022-04-27 15:09:03,467 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:09:03,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 151 transitions. [2022-04-27 15:09:03,477 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 151 transitions. [2022-04-27 15:09:03,621 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:09:03,635 INFO L225 Difference]: With dead ends: 88 [2022-04-27 15:09:03,635 INFO L226 Difference]: Without dead ends: 73 [2022-04-27 15:09:03,639 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:09:03,642 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 174 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 15:09:03,643 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 89 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 15:09:03,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-04-27 15:09:03,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 51. [2022-04-27 15:09:03,684 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:09:03,685 INFO L82 GeneralOperation]: Start isEquivalent. First operand 73 states. Second operand has 51 states, 47 states have (on average 1.851063829787234) internal successors, (87), 47 states have internal predecessors, (87), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:03,686 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand has 51 states, 47 states have (on average 1.851063829787234) internal successors, (87), 47 states have internal predecessors, (87), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:03,687 INFO L87 Difference]: Start difference. First operand 73 states. Second operand has 51 states, 47 states have (on average 1.851063829787234) internal successors, (87), 47 states have internal predecessors, (87), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:03,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:03,692 INFO L93 Difference]: Finished difference Result 73 states and 129 transitions. [2022-04-27 15:09:03,693 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 129 transitions. [2022-04-27 15:09:03,693 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:09:03,693 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:09:03,694 INFO L74 IsIncluded]: Start isIncluded. First operand has 51 states, 47 states have (on average 1.851063829787234) internal successors, (87), 47 states have internal predecessors, (87), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 73 states. [2022-04-27 15:09:03,695 INFO L87 Difference]: Start difference. First operand has 51 states, 47 states have (on average 1.851063829787234) internal successors, (87), 47 states have internal predecessors, (87), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 73 states. [2022-04-27 15:09:03,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:03,700 INFO L93 Difference]: Finished difference Result 73 states and 129 transitions. [2022-04-27 15:09:03,700 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 129 transitions. [2022-04-27 15:09:03,701 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:09:03,701 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:09:03,701 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:09:03,701 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:09:03,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 47 states have (on average 1.851063829787234) internal successors, (87), 47 states have internal predecessors, (87), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:03,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 90 transitions. [2022-04-27 15:09:03,706 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 90 transitions. Word has length 21 [2022-04-27 15:09:03,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:09:03,706 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 90 transitions. [2022-04-27 15:09:03,706 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:09:03,707 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 90 transitions. [2022-04-27 15:09:03,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-27 15:09:03,707 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:09:03,707 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:09:03,708 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 15:09:03,708 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:09:03,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:09:03,709 INFO L85 PathProgramCache]: Analyzing trace with hash -2052332195, now seen corresponding path program 1 times [2022-04-27 15:09:03,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:09:03,709 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968440706] [2022-04-27 15:09:03,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:09:03,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:09:03,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:03,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:09:03,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:03,791 INFO L290 TraceCheckUtils]: 0: Hoare triple {369#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {363#true} is VALID [2022-04-27 15:09:03,792 INFO L290 TraceCheckUtils]: 1: Hoare triple {363#true} assume true; {363#true} is VALID [2022-04-27 15:09:03,792 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {363#true} {363#true} #200#return; {363#true} is VALID [2022-04-27 15:09:03,793 INFO L272 TraceCheckUtils]: 0: Hoare triple {363#true} call ULTIMATE.init(); {369#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:09:03,793 INFO L290 TraceCheckUtils]: 1: Hoare triple {369#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {363#true} is VALID [2022-04-27 15:09:03,793 INFO L290 TraceCheckUtils]: 2: Hoare triple {363#true} assume true; {363#true} is VALID [2022-04-27 15:09:03,793 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {363#true} {363#true} #200#return; {363#true} is VALID [2022-04-27 15:09:03,793 INFO L272 TraceCheckUtils]: 4: Hoare triple {363#true} call #t~ret15 := main(); {363#true} is VALID [2022-04-27 15:09:03,794 INFO L290 TraceCheckUtils]: 5: Hoare triple {363#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;havoc ~cond~0; {363#true} is VALID [2022-04-27 15:09:03,794 INFO L290 TraceCheckUtils]: 6: Hoare triple {363#true} assume !false;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~cond~0 := #t~nondet14;havoc #t~nondet14; {363#true} is VALID [2022-04-27 15:09:03,794 INFO L290 TraceCheckUtils]: 7: Hoare triple {363#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0; {363#true} is VALID [2022-04-27 15:09:03,794 INFO L290 TraceCheckUtils]: 8: Hoare triple {363#true} assume !(0 != ~p1~0); {368#(= main_~p1~0 0)} is VALID [2022-04-27 15:09:03,795 INFO L290 TraceCheckUtils]: 9: Hoare triple {368#(= main_~p1~0 0)} assume !(0 != ~p2~0); {368#(= main_~p1~0 0)} is VALID [2022-04-27 15:09:03,795 INFO L290 TraceCheckUtils]: 10: Hoare triple {368#(= main_~p1~0 0)} assume 0 != ~p3~0;~lk3~0 := 1; {368#(= main_~p1~0 0)} is VALID [2022-04-27 15:09:03,796 INFO L290 TraceCheckUtils]: 11: Hoare triple {368#(= main_~p1~0 0)} assume 0 != ~p4~0;~lk4~0 := 1; {368#(= main_~p1~0 0)} is VALID [2022-04-27 15:09:03,796 INFO L290 TraceCheckUtils]: 12: Hoare triple {368#(= main_~p1~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {368#(= main_~p1~0 0)} is VALID [2022-04-27 15:09:03,797 INFO L290 TraceCheckUtils]: 13: Hoare triple {368#(= main_~p1~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {368#(= main_~p1~0 0)} is VALID [2022-04-27 15:09:03,797 INFO L290 TraceCheckUtils]: 14: Hoare triple {368#(= main_~p1~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {368#(= main_~p1~0 0)} is VALID [2022-04-27 15:09:03,797 INFO L290 TraceCheckUtils]: 15: Hoare triple {368#(= main_~p1~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {368#(= main_~p1~0 0)} is VALID [2022-04-27 15:09:03,798 INFO L290 TraceCheckUtils]: 16: Hoare triple {368#(= main_~p1~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {368#(= main_~p1~0 0)} is VALID [2022-04-27 15:09:03,798 INFO L290 TraceCheckUtils]: 17: Hoare triple {368#(= main_~p1~0 0)} assume !(0 != ~p10~0); {368#(= main_~p1~0 0)} is VALID [2022-04-27 15:09:03,799 INFO L290 TraceCheckUtils]: 18: Hoare triple {368#(= main_~p1~0 0)} assume 0 != ~p1~0; {364#false} is VALID [2022-04-27 15:09:03,799 INFO L290 TraceCheckUtils]: 19: Hoare triple {364#false} assume 1 != ~lk1~0; {364#false} is VALID [2022-04-27 15:09:03,799 INFO L290 TraceCheckUtils]: 20: Hoare triple {364#false} assume !false; {364#false} is VALID [2022-04-27 15:09:03,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:09:03,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:09:03,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968440706] [2022-04-27 15:09:03,800 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968440706] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:09:03,800 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:09:03,800 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:09:03,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242186482] [2022-04-27 15:09:03,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:09:03,802 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:09:03,802 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:09:03,802 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:09:03,828 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:09:03,829 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:09:03,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:09:03,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:09:03,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:09:03,830 INFO L87 Difference]: Start difference. First operand 51 states and 90 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:09:04,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:04,053 INFO L93 Difference]: Finished difference Result 118 states and 213 transitions. [2022-04-27 15:09:04,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:09:04,053 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:09:04,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:09:04,054 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:09:04,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 192 transitions. [2022-04-27 15:09:04,059 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:09:04,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 192 transitions. [2022-04-27 15:09:04,061 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 192 transitions. [2022-04-27 15:09:04,238 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 192 edges. 192 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:09:04,243 INFO L225 Difference]: With dead ends: 118 [2022-04-27 15:09:04,243 INFO L226 Difference]: Without dead ends: 73 [2022-04-27 15:09:04,247 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:09:04,250 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 148 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 15:09:04,251 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 95 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 15:09:04,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-04-27 15:09:04,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 71. [2022-04-27 15:09:04,263 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:09:04,264 INFO L82 GeneralOperation]: Start isEquivalent. First operand 73 states. Second operand has 71 states, 67 states have (on average 1.835820895522388) internal successors, (123), 67 states have internal predecessors, (123), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:04,264 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand has 71 states, 67 states have (on average 1.835820895522388) internal successors, (123), 67 states have internal predecessors, (123), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:04,264 INFO L87 Difference]: Start difference. First operand 73 states. Second operand has 71 states, 67 states have (on average 1.835820895522388) internal successors, (123), 67 states have internal predecessors, (123), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:04,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:04,267 INFO L93 Difference]: Finished difference Result 73 states and 127 transitions. [2022-04-27 15:09:04,268 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 127 transitions. [2022-04-27 15:09:04,268 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:09:04,268 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:09:04,269 INFO L74 IsIncluded]: Start isIncluded. First operand has 71 states, 67 states have (on average 1.835820895522388) internal successors, (123), 67 states have internal predecessors, (123), 2 states have call successors, (2), 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 73 states. [2022-04-27 15:09:04,269 INFO L87 Difference]: Start difference. First operand has 71 states, 67 states have (on average 1.835820895522388) internal successors, (123), 67 states have internal predecessors, (123), 2 states have call successors, (2), 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 73 states. [2022-04-27 15:09:04,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:04,275 INFO L93 Difference]: Finished difference Result 73 states and 127 transitions. [2022-04-27 15:09:04,275 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 127 transitions. [2022-04-27 15:09:04,277 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:09:04,278 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:09:04,278 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:09:04,278 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:09:04,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 67 states have (on average 1.835820895522388) internal successors, (123), 67 states have internal predecessors, (123), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:04,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 126 transitions. [2022-04-27 15:09:04,284 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 126 transitions. Word has length 21 [2022-04-27 15:09:04,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:09:04,285 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 126 transitions. [2022-04-27 15:09:04,286 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:09:04,286 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 126 transitions. [2022-04-27 15:09:04,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-27 15:09:04,292 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:09:04,292 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:09:04,292 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 15:09:04,292 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:09:04,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:09:04,294 INFO L85 PathProgramCache]: Analyzing trace with hash 1813542028, now seen corresponding path program 1 times [2022-04-27 15:09:04,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:09:04,295 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176065659] [2022-04-27 15:09:04,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:09:04,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:09:04,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:04,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:09:04,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:04,398 INFO L290 TraceCheckUtils]: 0: Hoare triple {733#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {727#true} is VALID [2022-04-27 15:09:04,398 INFO L290 TraceCheckUtils]: 1: Hoare triple {727#true} assume true; {727#true} is VALID [2022-04-27 15:09:04,398 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {727#true} {727#true} #200#return; {727#true} is VALID [2022-04-27 15:09:04,399 INFO L272 TraceCheckUtils]: 0: Hoare triple {727#true} call ULTIMATE.init(); {733#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:09:04,399 INFO L290 TraceCheckUtils]: 1: Hoare triple {733#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {727#true} is VALID [2022-04-27 15:09:04,399 INFO L290 TraceCheckUtils]: 2: Hoare triple {727#true} assume true; {727#true} is VALID [2022-04-27 15:09:04,400 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {727#true} {727#true} #200#return; {727#true} is VALID [2022-04-27 15:09:04,400 INFO L272 TraceCheckUtils]: 4: Hoare triple {727#true} call #t~ret15 := main(); {727#true} is VALID [2022-04-27 15:09:04,400 INFO L290 TraceCheckUtils]: 5: Hoare triple {727#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;havoc ~cond~0; {727#true} is VALID [2022-04-27 15:09:04,400 INFO L290 TraceCheckUtils]: 6: Hoare triple {727#true} assume !false;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~cond~0 := #t~nondet14;havoc #t~nondet14; {727#true} is VALID [2022-04-27 15:09:04,400 INFO L290 TraceCheckUtils]: 7: Hoare triple {727#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0; {727#true} is VALID [2022-04-27 15:09:04,401 INFO L290 TraceCheckUtils]: 8: Hoare triple {727#true} assume 0 != ~p1~0;~lk1~0 := 1; {732#(not (= main_~p1~0 0))} is VALID [2022-04-27 15:09:04,401 INFO L290 TraceCheckUtils]: 9: Hoare triple {732#(not (= main_~p1~0 0))} assume !(0 != ~p2~0); {732#(not (= main_~p1~0 0))} is VALID [2022-04-27 15:09:04,402 INFO L290 TraceCheckUtils]: 10: Hoare triple {732#(not (= main_~p1~0 0))} assume 0 != ~p3~0;~lk3~0 := 1; {732#(not (= main_~p1~0 0))} is VALID [2022-04-27 15:09:04,407 INFO L290 TraceCheckUtils]: 11: Hoare triple {732#(not (= main_~p1~0 0))} assume 0 != ~p4~0;~lk4~0 := 1; {732#(not (= main_~p1~0 0))} is VALID [2022-04-27 15:09:04,407 INFO L290 TraceCheckUtils]: 12: Hoare triple {732#(not (= main_~p1~0 0))} assume 0 != ~p5~0;~lk5~0 := 1; {732#(not (= main_~p1~0 0))} is VALID [2022-04-27 15:09:04,407 INFO L290 TraceCheckUtils]: 13: Hoare triple {732#(not (= main_~p1~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {732#(not (= main_~p1~0 0))} is VALID [2022-04-27 15:09:04,408 INFO L290 TraceCheckUtils]: 14: Hoare triple {732#(not (= main_~p1~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {732#(not (= main_~p1~0 0))} is VALID [2022-04-27 15:09:04,408 INFO L290 TraceCheckUtils]: 15: Hoare triple {732#(not (= main_~p1~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {732#(not (= main_~p1~0 0))} is VALID [2022-04-27 15:09:04,408 INFO L290 TraceCheckUtils]: 16: Hoare triple {732#(not (= main_~p1~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {732#(not (= main_~p1~0 0))} is VALID [2022-04-27 15:09:04,409 INFO L290 TraceCheckUtils]: 17: Hoare triple {732#(not (= main_~p1~0 0))} assume !(0 != ~p10~0); {732#(not (= main_~p1~0 0))} is VALID [2022-04-27 15:09:04,409 INFO L290 TraceCheckUtils]: 18: Hoare triple {732#(not (= main_~p1~0 0))} assume !(0 != ~p1~0); {728#false} is VALID [2022-04-27 15:09:04,409 INFO L290 TraceCheckUtils]: 19: Hoare triple {728#false} assume 0 != ~p2~0; {728#false} is VALID [2022-04-27 15:09:04,409 INFO L290 TraceCheckUtils]: 20: Hoare triple {728#false} assume 1 != ~lk2~0; {728#false} is VALID [2022-04-27 15:09:04,410 INFO L290 TraceCheckUtils]: 21: Hoare triple {728#false} assume !false; {728#false} is VALID [2022-04-27 15:09:04,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:09:04,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:09:04,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176065659] [2022-04-27 15:09:04,410 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176065659] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:09:04,410 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:09:04,411 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:09:04,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462332425] [2022-04-27 15:09:04,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:09:04,411 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:09:04,412 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:09:04,412 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:09:04,429 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:09:04,429 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:09:04,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:09:04,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:09:04,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:09:04,430 INFO L87 Difference]: Start difference. First operand 71 states and 126 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:09:04,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:04,612 INFO L93 Difference]: Finished difference Result 109 states and 190 transitions. [2022-04-27 15:09:04,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:09:04,615 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:09:04,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:09:04,615 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:09:04,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 187 transitions. [2022-04-27 15:09:04,618 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:09:04,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 187 transitions. [2022-04-27 15:09:04,621 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 187 transitions. [2022-04-27 15:09:04,777 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 187 edges. 187 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:09:04,779 INFO L225 Difference]: With dead ends: 109 [2022-04-27 15:09:04,779 INFO L226 Difference]: Without dead ends: 76 [2022-04-27 15:09:04,779 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:09:04,780 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 131 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:09:04,781 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 113 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 15:09:04,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-04-27 15:09:04,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 74. [2022-04-27 15:09:04,786 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:09:04,786 INFO L82 GeneralOperation]: Start isEquivalent. First operand 76 states. Second operand has 74 states, 70 states have (on average 1.7857142857142858) internal successors, (125), 70 states have internal predecessors, (125), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:04,786 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand has 74 states, 70 states have (on average 1.7857142857142858) internal successors, (125), 70 states have internal predecessors, (125), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:04,787 INFO L87 Difference]: Start difference. First operand 76 states. Second operand has 74 states, 70 states have (on average 1.7857142857142858) internal successors, (125), 70 states have internal predecessors, (125), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:04,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:04,789 INFO L93 Difference]: Finished difference Result 76 states and 129 transitions. [2022-04-27 15:09:04,789 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 129 transitions. [2022-04-27 15:09:04,790 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:09:04,790 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:09:04,790 INFO L74 IsIncluded]: Start isIncluded. First operand has 74 states, 70 states have (on average 1.7857142857142858) internal successors, (125), 70 states have internal predecessors, (125), 2 states have call successors, (2), 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 76 states. [2022-04-27 15:09:04,790 INFO L87 Difference]: Start difference. First operand has 74 states, 70 states have (on average 1.7857142857142858) internal successors, (125), 70 states have internal predecessors, (125), 2 states have call successors, (2), 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 76 states. [2022-04-27 15:09:04,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:04,793 INFO L93 Difference]: Finished difference Result 76 states and 129 transitions. [2022-04-27 15:09:04,793 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 129 transitions. [2022-04-27 15:09:04,793 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:09:04,793 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:09:04,793 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:09:04,794 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:09:04,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 70 states have (on average 1.7857142857142858) internal successors, (125), 70 states have internal predecessors, (125), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:04,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 128 transitions. [2022-04-27 15:09:04,796 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 128 transitions. Word has length 22 [2022-04-27 15:09:04,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:09:04,796 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 128 transitions. [2022-04-27 15:09:04,797 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:09:04,797 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 128 transitions. [2022-04-27 15:09:04,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-27 15:09:04,797 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:09:04,797 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:09:04,797 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-27 15:09:04,797 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:09:04,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:09:04,798 INFO L85 PathProgramCache]: Analyzing trace with hash 802424778, now seen corresponding path program 1 times [2022-04-27 15:09:04,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:09:04,798 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927311885] [2022-04-27 15:09:04,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:09:04,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:09:04,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:04,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:09:04,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:04,846 INFO L290 TraceCheckUtils]: 0: Hoare triple {1099#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {1093#true} is VALID [2022-04-27 15:09:04,846 INFO L290 TraceCheckUtils]: 1: Hoare triple {1093#true} assume true; {1093#true} is VALID [2022-04-27 15:09:04,846 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1093#true} {1093#true} #200#return; {1093#true} is VALID [2022-04-27 15:09:04,847 INFO L272 TraceCheckUtils]: 0: Hoare triple {1093#true} call ULTIMATE.init(); {1099#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:09:04,847 INFO L290 TraceCheckUtils]: 1: Hoare triple {1099#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {1093#true} is VALID [2022-04-27 15:09:04,847 INFO L290 TraceCheckUtils]: 2: Hoare triple {1093#true} assume true; {1093#true} is VALID [2022-04-27 15:09:04,847 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1093#true} {1093#true} #200#return; {1093#true} is VALID [2022-04-27 15:09:04,848 INFO L272 TraceCheckUtils]: 4: Hoare triple {1093#true} call #t~ret15 := main(); {1093#true} is VALID [2022-04-27 15:09:04,848 INFO L290 TraceCheckUtils]: 5: Hoare triple {1093#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;havoc ~cond~0; {1093#true} is VALID [2022-04-27 15:09:04,848 INFO L290 TraceCheckUtils]: 6: Hoare triple {1093#true} assume !false;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~cond~0 := #t~nondet14;havoc #t~nondet14; {1093#true} is VALID [2022-04-27 15:09:04,848 INFO L290 TraceCheckUtils]: 7: Hoare triple {1093#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0; {1093#true} is VALID [2022-04-27 15:09:04,848 INFO L290 TraceCheckUtils]: 8: Hoare triple {1093#true} assume !(0 != ~p1~0); {1093#true} is VALID [2022-04-27 15:09:04,849 INFO L290 TraceCheckUtils]: 9: Hoare triple {1093#true} assume !(0 != ~p2~0); {1098#(= main_~p2~0 0)} is VALID [2022-04-27 15:09:04,849 INFO L290 TraceCheckUtils]: 10: Hoare triple {1098#(= main_~p2~0 0)} assume 0 != ~p3~0;~lk3~0 := 1; {1098#(= main_~p2~0 0)} is VALID [2022-04-27 15:09:04,849 INFO L290 TraceCheckUtils]: 11: Hoare triple {1098#(= main_~p2~0 0)} assume 0 != ~p4~0;~lk4~0 := 1; {1098#(= main_~p2~0 0)} is VALID [2022-04-27 15:09:04,851 INFO L290 TraceCheckUtils]: 12: Hoare triple {1098#(= main_~p2~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {1098#(= main_~p2~0 0)} is VALID [2022-04-27 15:09:04,851 INFO L290 TraceCheckUtils]: 13: Hoare triple {1098#(= main_~p2~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {1098#(= main_~p2~0 0)} is VALID [2022-04-27 15:09:04,852 INFO L290 TraceCheckUtils]: 14: Hoare triple {1098#(= main_~p2~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {1098#(= main_~p2~0 0)} is VALID [2022-04-27 15:09:04,852 INFO L290 TraceCheckUtils]: 15: Hoare triple {1098#(= main_~p2~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {1098#(= main_~p2~0 0)} is VALID [2022-04-27 15:09:04,853 INFO L290 TraceCheckUtils]: 16: Hoare triple {1098#(= main_~p2~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {1098#(= main_~p2~0 0)} is VALID [2022-04-27 15:09:04,853 INFO L290 TraceCheckUtils]: 17: Hoare triple {1098#(= main_~p2~0 0)} assume !(0 != ~p10~0); {1098#(= main_~p2~0 0)} is VALID [2022-04-27 15:09:04,854 INFO L290 TraceCheckUtils]: 18: Hoare triple {1098#(= main_~p2~0 0)} assume !(0 != ~p1~0); {1098#(= main_~p2~0 0)} is VALID [2022-04-27 15:09:04,854 INFO L290 TraceCheckUtils]: 19: Hoare triple {1098#(= main_~p2~0 0)} assume 0 != ~p2~0; {1094#false} is VALID [2022-04-27 15:09:04,854 INFO L290 TraceCheckUtils]: 20: Hoare triple {1094#false} assume 1 != ~lk2~0; {1094#false} is VALID [2022-04-27 15:09:04,854 INFO L290 TraceCheckUtils]: 21: Hoare triple {1094#false} assume !false; {1094#false} is VALID [2022-04-27 15:09:04,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:09:04,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:09:04,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927311885] [2022-04-27 15:09:04,855 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927311885] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:09:04,855 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:09:04,855 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:09:04,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531093442] [2022-04-27 15:09:04,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:09:04,856 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:09:04,856 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:09:04,856 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:09:04,872 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:09:04,872 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:09:04,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:09:04,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:09:04,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:09:04,873 INFO L87 Difference]: Start difference. First operand 74 states and 128 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:09:05,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:05,064 INFO L93 Difference]: Finished difference Result 202 states and 360 transitions. [2022-04-27 15:09:05,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:09:05,064 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:09:05,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:09:05,065 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:09:05,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 190 transitions. [2022-04-27 15:09:05,067 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:09:05,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 190 transitions. [2022-04-27 15:09:05,069 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 190 transitions. [2022-04-27 15:09:05,208 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 190 edges. 190 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:09:05,210 INFO L225 Difference]: With dead ends: 202 [2022-04-27 15:09:05,210 INFO L226 Difference]: Without dead ends: 137 [2022-04-27 15:09:05,211 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:09:05,212 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 163 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:09:05,212 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 79 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 15:09:05,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2022-04-27 15:09:05,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 135. [2022-04-27 15:09:05,219 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:09:05,220 INFO L82 GeneralOperation]: Start isEquivalent. First operand 137 states. Second operand has 135 states, 131 states have (on average 1.786259541984733) internal successors, (234), 131 states have internal predecessors, (234), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:05,220 INFO L74 IsIncluded]: Start isIncluded. First operand 137 states. Second operand has 135 states, 131 states have (on average 1.786259541984733) internal successors, (234), 131 states have internal predecessors, (234), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:05,221 INFO L87 Difference]: Start difference. First operand 137 states. Second operand has 135 states, 131 states have (on average 1.786259541984733) internal successors, (234), 131 states have internal predecessors, (234), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:05,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:05,225 INFO L93 Difference]: Finished difference Result 137 states and 238 transitions. [2022-04-27 15:09:05,225 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 238 transitions. [2022-04-27 15:09:05,226 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:09:05,226 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:09:05,226 INFO L74 IsIncluded]: Start isIncluded. First operand has 135 states, 131 states have (on average 1.786259541984733) internal successors, (234), 131 states have internal predecessors, (234), 2 states have call successors, (2), 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 137 states. [2022-04-27 15:09:05,227 INFO L87 Difference]: Start difference. First operand has 135 states, 131 states have (on average 1.786259541984733) internal successors, (234), 131 states have internal predecessors, (234), 2 states have call successors, (2), 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 137 states. [2022-04-27 15:09:05,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:05,231 INFO L93 Difference]: Finished difference Result 137 states and 238 transitions. [2022-04-27 15:09:05,232 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 238 transitions. [2022-04-27 15:09:05,232 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:09:05,232 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:09:05,232 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:09:05,232 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:09:05,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 131 states have (on average 1.786259541984733) internal successors, (234), 131 states have internal predecessors, (234), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:05,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 237 transitions. [2022-04-27 15:09:05,237 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 237 transitions. Word has length 22 [2022-04-27 15:09:05,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:09:05,237 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 237 transitions. [2022-04-27 15:09:05,237 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:09:05,238 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 237 transitions. [2022-04-27 15:09:05,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-27 15:09:05,238 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:09:05,238 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:09:05,238 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-27 15:09:05,238 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:09:05,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:09:05,239 INFO L85 PathProgramCache]: Analyzing trace with hash 1389230792, now seen corresponding path program 1 times [2022-04-27 15:09:05,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:09:05,239 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849852023] [2022-04-27 15:09:05,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:09:05,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:09:05,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:05,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:09:05,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:05,301 INFO L290 TraceCheckUtils]: 0: Hoare triple {1746#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {1740#true} is VALID [2022-04-27 15:09:05,301 INFO L290 TraceCheckUtils]: 1: Hoare triple {1740#true} assume true; {1740#true} is VALID [2022-04-27 15:09:05,301 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1740#true} {1740#true} #200#return; {1740#true} is VALID [2022-04-27 15:09:05,302 INFO L272 TraceCheckUtils]: 0: Hoare triple {1740#true} call ULTIMATE.init(); {1746#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:09:05,302 INFO L290 TraceCheckUtils]: 1: Hoare triple {1746#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {1740#true} is VALID [2022-04-27 15:09:05,302 INFO L290 TraceCheckUtils]: 2: Hoare triple {1740#true} assume true; {1740#true} is VALID [2022-04-27 15:09:05,302 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1740#true} {1740#true} #200#return; {1740#true} is VALID [2022-04-27 15:09:05,302 INFO L272 TraceCheckUtils]: 4: Hoare triple {1740#true} call #t~ret15 := main(); {1740#true} is VALID [2022-04-27 15:09:05,303 INFO L290 TraceCheckUtils]: 5: Hoare triple {1740#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;havoc ~cond~0; {1740#true} is VALID [2022-04-27 15:09:05,303 INFO L290 TraceCheckUtils]: 6: Hoare triple {1740#true} assume !false;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~cond~0 := #t~nondet14;havoc #t~nondet14; {1740#true} is VALID [2022-04-27 15:09:05,303 INFO L290 TraceCheckUtils]: 7: Hoare triple {1740#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0; {1740#true} is VALID [2022-04-27 15:09:05,303 INFO L290 TraceCheckUtils]: 8: Hoare triple {1740#true} assume !(0 != ~p1~0); {1740#true} is VALID [2022-04-27 15:09:05,304 INFO L290 TraceCheckUtils]: 9: Hoare triple {1740#true} assume 0 != ~p2~0;~lk2~0 := 1; {1745#(= main_~lk2~0 1)} is VALID [2022-04-27 15:09:05,304 INFO L290 TraceCheckUtils]: 10: Hoare triple {1745#(= main_~lk2~0 1)} assume 0 != ~p3~0;~lk3~0 := 1; {1745#(= main_~lk2~0 1)} is VALID [2022-04-27 15:09:05,304 INFO L290 TraceCheckUtils]: 11: Hoare triple {1745#(= main_~lk2~0 1)} assume 0 != ~p4~0;~lk4~0 := 1; {1745#(= main_~lk2~0 1)} is VALID [2022-04-27 15:09:05,305 INFO L290 TraceCheckUtils]: 12: Hoare triple {1745#(= main_~lk2~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {1745#(= main_~lk2~0 1)} is VALID [2022-04-27 15:09:05,305 INFO L290 TraceCheckUtils]: 13: Hoare triple {1745#(= main_~lk2~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {1745#(= main_~lk2~0 1)} is VALID [2022-04-27 15:09:05,306 INFO L290 TraceCheckUtils]: 14: Hoare triple {1745#(= main_~lk2~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {1745#(= main_~lk2~0 1)} is VALID [2022-04-27 15:09:05,306 INFO L290 TraceCheckUtils]: 15: Hoare triple {1745#(= main_~lk2~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {1745#(= main_~lk2~0 1)} is VALID [2022-04-27 15:09:05,307 INFO L290 TraceCheckUtils]: 16: Hoare triple {1745#(= main_~lk2~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {1745#(= main_~lk2~0 1)} is VALID [2022-04-27 15:09:05,307 INFO L290 TraceCheckUtils]: 17: Hoare triple {1745#(= main_~lk2~0 1)} assume !(0 != ~p10~0); {1745#(= main_~lk2~0 1)} is VALID [2022-04-27 15:09:05,307 INFO L290 TraceCheckUtils]: 18: Hoare triple {1745#(= main_~lk2~0 1)} assume !(0 != ~p1~0); {1745#(= main_~lk2~0 1)} is VALID [2022-04-27 15:09:05,308 INFO L290 TraceCheckUtils]: 19: Hoare triple {1745#(= main_~lk2~0 1)} assume 0 != ~p2~0; {1745#(= main_~lk2~0 1)} is VALID [2022-04-27 15:09:05,308 INFO L290 TraceCheckUtils]: 20: Hoare triple {1745#(= main_~lk2~0 1)} assume 1 != ~lk2~0; {1741#false} is VALID [2022-04-27 15:09:05,308 INFO L290 TraceCheckUtils]: 21: Hoare triple {1741#false} assume !false; {1741#false} is VALID [2022-04-27 15:09:05,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:09:05,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:09:05,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849852023] [2022-04-27 15:09:05,309 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849852023] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:09:05,309 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:09:05,309 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:09:05,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463866529] [2022-04-27 15:09:05,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:09:05,310 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:09:05,310 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:09:05,310 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:09:05,326 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:09:05,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:09:05,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:09:05,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:09:05,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:09:05,328 INFO L87 Difference]: Start difference. First operand 135 states and 237 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:09:05,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:05,500 INFO L93 Difference]: Finished difference Result 175 states and 307 transitions. [2022-04-27 15:09:05,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:09:05,501 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-27 15:09:05,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:09:05,501 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:09:05,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 124 transitions. [2022-04-27 15:09:05,503 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:09:05,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 124 transitions. [2022-04-27 15:09:05,505 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 124 transitions. [2022-04-27 15:09:05,623 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 124 edges. 124 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:09:05,626 INFO L225 Difference]: With dead ends: 175 [2022-04-27 15:09:05,626 INFO L226 Difference]: Without dead ends: 173 [2022-04-27 15:09:05,626 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:09:05,627 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 106 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:09:05,627 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 128 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 15:09:05,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2022-04-27 15:09:05,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 135. [2022-04-27 15:09:05,634 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:09:05,634 INFO L82 GeneralOperation]: Start isEquivalent. First operand 173 states. Second operand has 135 states, 131 states have (on average 1.7709923664122138) internal successors, (232), 131 states have internal predecessors, (232), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:05,635 INFO L74 IsIncluded]: Start isIncluded. First operand 173 states. Second operand has 135 states, 131 states have (on average 1.7709923664122138) internal successors, (232), 131 states have internal predecessors, (232), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:05,635 INFO L87 Difference]: Start difference. First operand 173 states. Second operand has 135 states, 131 states have (on average 1.7709923664122138) internal successors, (232), 131 states have internal predecessors, (232), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:05,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:05,640 INFO L93 Difference]: Finished difference Result 173 states and 304 transitions. [2022-04-27 15:09:05,640 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 304 transitions. [2022-04-27 15:09:05,640 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:09:05,640 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:09:05,641 INFO L74 IsIncluded]: Start isIncluded. First operand has 135 states, 131 states have (on average 1.7709923664122138) internal successors, (232), 131 states have internal predecessors, (232), 2 states have call successors, (2), 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 173 states. [2022-04-27 15:09:05,641 INFO L87 Difference]: Start difference. First operand has 135 states, 131 states have (on average 1.7709923664122138) internal successors, (232), 131 states have internal predecessors, (232), 2 states have call successors, (2), 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 173 states. [2022-04-27 15:09:05,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:05,646 INFO L93 Difference]: Finished difference Result 173 states and 304 transitions. [2022-04-27 15:09:05,646 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 304 transitions. [2022-04-27 15:09:05,647 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:09:05,647 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:09:05,647 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:09:05,647 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:09:05,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 131 states have (on average 1.7709923664122138) internal successors, (232), 131 states have internal predecessors, (232), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:05,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 235 transitions. [2022-04-27 15:09:05,651 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 235 transitions. Word has length 22 [2022-04-27 15:09:05,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:09:05,655 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 235 transitions. [2022-04-27 15:09:05,655 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:09:05,655 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 235 transitions. [2022-04-27 15:09:05,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-27 15:09:05,656 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:09:05,656 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:09:05,656 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-27 15:09:05,656 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:09:05,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:09:05,657 INFO L85 PathProgramCache]: Analyzing trace with hash -894421934, now seen corresponding path program 1 times [2022-04-27 15:09:05,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:09:05,657 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184556772] [2022-04-27 15:09:05,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:09:05,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:09:05,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:05,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:09:05,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:05,696 INFO L290 TraceCheckUtils]: 0: Hoare triple {2438#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {2432#true} is VALID [2022-04-27 15:09:05,696 INFO L290 TraceCheckUtils]: 1: Hoare triple {2432#true} assume true; {2432#true} is VALID [2022-04-27 15:09:05,696 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2432#true} {2432#true} #200#return; {2432#true} is VALID [2022-04-27 15:09:05,697 INFO L272 TraceCheckUtils]: 0: Hoare triple {2432#true} call ULTIMATE.init(); {2438#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:09:05,697 INFO L290 TraceCheckUtils]: 1: Hoare triple {2438#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {2432#true} is VALID [2022-04-27 15:09:05,697 INFO L290 TraceCheckUtils]: 2: Hoare triple {2432#true} assume true; {2432#true} is VALID [2022-04-27 15:09:05,697 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2432#true} {2432#true} #200#return; {2432#true} is VALID [2022-04-27 15:09:05,697 INFO L272 TraceCheckUtils]: 4: Hoare triple {2432#true} call #t~ret15 := main(); {2432#true} is VALID [2022-04-27 15:09:05,697 INFO L290 TraceCheckUtils]: 5: Hoare triple {2432#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;havoc ~cond~0; {2432#true} is VALID [2022-04-27 15:09:05,698 INFO L290 TraceCheckUtils]: 6: Hoare triple {2432#true} assume !false;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~cond~0 := #t~nondet14;havoc #t~nondet14; {2432#true} is VALID [2022-04-27 15:09:05,698 INFO L290 TraceCheckUtils]: 7: Hoare triple {2432#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0; {2432#true} is VALID [2022-04-27 15:09:05,698 INFO L290 TraceCheckUtils]: 8: Hoare triple {2432#true} assume !(0 != ~p1~0); {2432#true} is VALID [2022-04-27 15:09:05,698 INFO L290 TraceCheckUtils]: 9: Hoare triple {2432#true} assume !(0 != ~p2~0); {2432#true} is VALID [2022-04-27 15:09:05,698 INFO L290 TraceCheckUtils]: 10: Hoare triple {2432#true} assume 0 != ~p3~0;~lk3~0 := 1; {2437#(= main_~lk3~0 1)} is VALID [2022-04-27 15:09:05,699 INFO L290 TraceCheckUtils]: 11: Hoare triple {2437#(= main_~lk3~0 1)} assume 0 != ~p4~0;~lk4~0 := 1; {2437#(= main_~lk3~0 1)} is VALID [2022-04-27 15:09:05,699 INFO L290 TraceCheckUtils]: 12: Hoare triple {2437#(= main_~lk3~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {2437#(= main_~lk3~0 1)} is VALID [2022-04-27 15:09:05,700 INFO L290 TraceCheckUtils]: 13: Hoare triple {2437#(= main_~lk3~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {2437#(= main_~lk3~0 1)} is VALID [2022-04-27 15:09:05,700 INFO L290 TraceCheckUtils]: 14: Hoare triple {2437#(= main_~lk3~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {2437#(= main_~lk3~0 1)} is VALID [2022-04-27 15:09:05,700 INFO L290 TraceCheckUtils]: 15: Hoare triple {2437#(= main_~lk3~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {2437#(= main_~lk3~0 1)} is VALID [2022-04-27 15:09:05,701 INFO L290 TraceCheckUtils]: 16: Hoare triple {2437#(= main_~lk3~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {2437#(= main_~lk3~0 1)} is VALID [2022-04-27 15:09:05,701 INFO L290 TraceCheckUtils]: 17: Hoare triple {2437#(= main_~lk3~0 1)} assume !(0 != ~p10~0); {2437#(= main_~lk3~0 1)} is VALID [2022-04-27 15:09:05,701 INFO L290 TraceCheckUtils]: 18: Hoare triple {2437#(= main_~lk3~0 1)} assume !(0 != ~p1~0); {2437#(= main_~lk3~0 1)} is VALID [2022-04-27 15:09:05,702 INFO L290 TraceCheckUtils]: 19: Hoare triple {2437#(= main_~lk3~0 1)} assume !(0 != ~p2~0); {2437#(= main_~lk3~0 1)} is VALID [2022-04-27 15:09:05,702 INFO L290 TraceCheckUtils]: 20: Hoare triple {2437#(= main_~lk3~0 1)} assume 0 != ~p3~0; {2437#(= main_~lk3~0 1)} is VALID [2022-04-27 15:09:05,702 INFO L290 TraceCheckUtils]: 21: Hoare triple {2437#(= main_~lk3~0 1)} assume 1 != ~lk3~0; {2433#false} is VALID [2022-04-27 15:09:05,702 INFO L290 TraceCheckUtils]: 22: Hoare triple {2433#false} assume !false; {2433#false} is VALID [2022-04-27 15:09:05,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:09:05,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:09:05,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184556772] [2022-04-27 15:09:05,703 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184556772] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:09:05,703 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:09:05,703 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:09:05,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114583358] [2022-04-27 15:09:05,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:09:05,704 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:09:05,704 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:09:05,704 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:09:05,723 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:09:05,724 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:09:05,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:09:05,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:09:05,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:09:05,724 INFO L87 Difference]: Start difference. First operand 135 states and 235 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:09:05,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:05,894 INFO L93 Difference]: Finished difference Result 251 states and 443 transitions. [2022-04-27 15:09:05,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:09:05,894 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:09:05,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:09:05,895 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:09:05,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 123 transitions. [2022-04-27 15:09:05,896 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:09:05,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 123 transitions. [2022-04-27 15:09:05,898 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 123 transitions. [2022-04-27 15:09:05,998 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 123 edges. 123 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:09:06,002 INFO L225 Difference]: With dead ends: 251 [2022-04-27 15:09:06,003 INFO L226 Difference]: Without dead ends: 249 [2022-04-27 15:09:06,003 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:09:06,004 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 154 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:09:06,004 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 76 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 15:09:06,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2022-04-27 15:09:06,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 183. [2022-04-27 15:09:06,011 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:09:06,012 INFO L82 GeneralOperation]: Start isEquivalent. First operand 249 states. Second operand has 183 states, 179 states have (on average 1.7541899441340782) internal successors, (314), 179 states have internal predecessors, (314), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:06,012 INFO L74 IsIncluded]: Start isIncluded. First operand 249 states. Second operand has 183 states, 179 states have (on average 1.7541899441340782) internal successors, (314), 179 states have internal predecessors, (314), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:06,013 INFO L87 Difference]: Start difference. First operand 249 states. Second operand has 183 states, 179 states have (on average 1.7541899441340782) internal successors, (314), 179 states have internal predecessors, (314), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:06,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:06,020 INFO L93 Difference]: Finished difference Result 249 states and 438 transitions. [2022-04-27 15:09:06,020 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 438 transitions. [2022-04-27 15:09:06,020 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:09:06,021 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:09:06,021 INFO L74 IsIncluded]: Start isIncluded. First operand has 183 states, 179 states have (on average 1.7541899441340782) internal successors, (314), 179 states have internal predecessors, (314), 2 states have call successors, (2), 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 249 states. [2022-04-27 15:09:06,022 INFO L87 Difference]: Start difference. First operand has 183 states, 179 states have (on average 1.7541899441340782) internal successors, (314), 179 states have internal predecessors, (314), 2 states have call successors, (2), 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 249 states. [2022-04-27 15:09:06,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:06,029 INFO L93 Difference]: Finished difference Result 249 states and 438 transitions. [2022-04-27 15:09:06,029 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 438 transitions. [2022-04-27 15:09:06,030 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:09:06,030 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:09:06,030 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:09:06,030 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:09:06,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 179 states have (on average 1.7541899441340782) internal successors, (314), 179 states have internal predecessors, (314), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:06,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 317 transitions. [2022-04-27 15:09:06,036 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 317 transitions. Word has length 23 [2022-04-27 15:09:06,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:09:06,036 INFO L495 AbstractCegarLoop]: Abstraction has 183 states and 317 transitions. [2022-04-27 15:09:06,036 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:09:06,036 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 317 transitions. [2022-04-27 15:09:06,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-27 15:09:06,037 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:09:06,037 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:09:06,037 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-27 15:09:06,037 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:09:06,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:09:06,038 INFO L85 PathProgramCache]: Analyzing trace with hash -1481227948, now seen corresponding path program 1 times [2022-04-27 15:09:06,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:09:06,038 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872857865] [2022-04-27 15:09:06,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:09:06,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:09:06,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:06,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:09:06,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:06,085 INFO L290 TraceCheckUtils]: 0: Hoare triple {3408#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {3402#true} is VALID [2022-04-27 15:09:06,086 INFO L290 TraceCheckUtils]: 1: Hoare triple {3402#true} assume true; {3402#true} is VALID [2022-04-27 15:09:06,086 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3402#true} {3402#true} #200#return; {3402#true} is VALID [2022-04-27 15:09:06,088 INFO L272 TraceCheckUtils]: 0: Hoare triple {3402#true} call ULTIMATE.init(); {3408#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:09:06,088 INFO L290 TraceCheckUtils]: 1: Hoare triple {3408#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {3402#true} is VALID [2022-04-27 15:09:06,088 INFO L290 TraceCheckUtils]: 2: Hoare triple {3402#true} assume true; {3402#true} is VALID [2022-04-27 15:09:06,089 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3402#true} {3402#true} #200#return; {3402#true} is VALID [2022-04-27 15:09:06,089 INFO L272 TraceCheckUtils]: 4: Hoare triple {3402#true} call #t~ret15 := main(); {3402#true} is VALID [2022-04-27 15:09:06,089 INFO L290 TraceCheckUtils]: 5: Hoare triple {3402#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;havoc ~cond~0; {3402#true} is VALID [2022-04-27 15:09:06,089 INFO L290 TraceCheckUtils]: 6: Hoare triple {3402#true} assume !false;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~cond~0 := #t~nondet14;havoc #t~nondet14; {3402#true} is VALID [2022-04-27 15:09:06,089 INFO L290 TraceCheckUtils]: 7: Hoare triple {3402#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0; {3402#true} is VALID [2022-04-27 15:09:06,089 INFO L290 TraceCheckUtils]: 8: Hoare triple {3402#true} assume !(0 != ~p1~0); {3402#true} is VALID [2022-04-27 15:09:06,089 INFO L290 TraceCheckUtils]: 9: Hoare triple {3402#true} assume !(0 != ~p2~0); {3402#true} is VALID [2022-04-27 15:09:06,090 INFO L290 TraceCheckUtils]: 10: Hoare triple {3402#true} assume !(0 != ~p3~0); {3407#(= main_~p3~0 0)} is VALID [2022-04-27 15:09:06,090 INFO L290 TraceCheckUtils]: 11: Hoare triple {3407#(= main_~p3~0 0)} assume 0 != ~p4~0;~lk4~0 := 1; {3407#(= main_~p3~0 0)} is VALID [2022-04-27 15:09:06,090 INFO L290 TraceCheckUtils]: 12: Hoare triple {3407#(= main_~p3~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {3407#(= main_~p3~0 0)} is VALID [2022-04-27 15:09:06,091 INFO L290 TraceCheckUtils]: 13: Hoare triple {3407#(= main_~p3~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {3407#(= main_~p3~0 0)} is VALID [2022-04-27 15:09:06,091 INFO L290 TraceCheckUtils]: 14: Hoare triple {3407#(= main_~p3~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {3407#(= main_~p3~0 0)} is VALID [2022-04-27 15:09:06,091 INFO L290 TraceCheckUtils]: 15: Hoare triple {3407#(= main_~p3~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {3407#(= main_~p3~0 0)} is VALID [2022-04-27 15:09:06,093 INFO L290 TraceCheckUtils]: 16: Hoare triple {3407#(= main_~p3~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {3407#(= main_~p3~0 0)} is VALID [2022-04-27 15:09:06,094 INFO L290 TraceCheckUtils]: 17: Hoare triple {3407#(= main_~p3~0 0)} assume !(0 != ~p10~0); {3407#(= main_~p3~0 0)} is VALID [2022-04-27 15:09:06,094 INFO L290 TraceCheckUtils]: 18: Hoare triple {3407#(= main_~p3~0 0)} assume !(0 != ~p1~0); {3407#(= main_~p3~0 0)} is VALID [2022-04-27 15:09:06,094 INFO L290 TraceCheckUtils]: 19: Hoare triple {3407#(= main_~p3~0 0)} assume !(0 != ~p2~0); {3407#(= main_~p3~0 0)} is VALID [2022-04-27 15:09:06,102 INFO L290 TraceCheckUtils]: 20: Hoare triple {3407#(= main_~p3~0 0)} assume 0 != ~p3~0; {3403#false} is VALID [2022-04-27 15:09:06,102 INFO L290 TraceCheckUtils]: 21: Hoare triple {3403#false} assume 1 != ~lk3~0; {3403#false} is VALID [2022-04-27 15:09:06,102 INFO L290 TraceCheckUtils]: 22: Hoare triple {3403#false} assume !false; {3403#false} is VALID [2022-04-27 15:09:06,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:09:06,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:09:06,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872857865] [2022-04-27 15:09:06,103 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872857865] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:09:06,103 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:09:06,103 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:09:06,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786001122] [2022-04-27 15:09:06,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:09:06,104 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:09:06,104 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:09:06,104 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:09:06,120 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:09:06,121 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:09:06,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:09:06,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:09:06,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:09:06,121 INFO L87 Difference]: Start difference. First operand 183 states and 317 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:09:06,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:06,325 INFO L93 Difference]: Finished difference Result 431 states and 755 transitions. [2022-04-27 15:09:06,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:09:06,326 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:09:06,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:09:06,326 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:09:06,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 186 transitions. [2022-04-27 15:09:06,329 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:09:06,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 186 transitions. [2022-04-27 15:09:06,331 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 186 transitions. [2022-04-27 15:09:06,475 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 186 edges. 186 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:09:06,481 INFO L225 Difference]: With dead ends: 431 [2022-04-27 15:09:06,481 INFO L226 Difference]: Without dead ends: 257 [2022-04-27 15:09:06,485 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:09:06,488 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 136 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:09:06,488 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 99 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 15:09:06,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2022-04-27 15:09:06,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 255. [2022-04-27 15:09:06,497 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:09:06,498 INFO L82 GeneralOperation]: Start isEquivalent. First operand 257 states. Second operand has 255 states, 251 states have (on average 1.7370517928286853) internal successors, (436), 251 states have internal predecessors, (436), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:06,498 INFO L74 IsIncluded]: Start isIncluded. First operand 257 states. Second operand has 255 states, 251 states have (on average 1.7370517928286853) internal successors, (436), 251 states have internal predecessors, (436), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:06,499 INFO L87 Difference]: Start difference. First operand 257 states. Second operand has 255 states, 251 states have (on average 1.7370517928286853) internal successors, (436), 251 states have internal predecessors, (436), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:06,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:06,505 INFO L93 Difference]: Finished difference Result 257 states and 440 transitions. [2022-04-27 15:09:06,505 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 440 transitions. [2022-04-27 15:09:06,505 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:09:06,505 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:09:06,506 INFO L74 IsIncluded]: Start isIncluded. First operand has 255 states, 251 states have (on average 1.7370517928286853) internal successors, (436), 251 states have internal predecessors, (436), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 257 states. [2022-04-27 15:09:06,506 INFO L87 Difference]: Start difference. First operand has 255 states, 251 states have (on average 1.7370517928286853) internal successors, (436), 251 states have internal predecessors, (436), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 257 states. [2022-04-27 15:09:06,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:06,512 INFO L93 Difference]: Finished difference Result 257 states and 440 transitions. [2022-04-27 15:09:06,512 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 440 transitions. [2022-04-27 15:09:06,513 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:09:06,513 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:09:06,513 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:09:06,513 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:09:06,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 251 states have (on average 1.7370517928286853) internal successors, (436), 251 states have internal predecessors, (436), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:06,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 439 transitions. [2022-04-27 15:09:06,519 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 439 transitions. Word has length 23 [2022-04-27 15:09:06,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:09:06,519 INFO L495 AbstractCegarLoop]: Abstraction has 255 states and 439 transitions. [2022-04-27 15:09:06,520 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:09:06,520 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 439 transitions. [2022-04-27 15:09:06,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-27 15:09:06,520 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:09:06,520 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:09:06,520 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-27 15:09:06,521 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:09:06,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:09:06,521 INFO L85 PathProgramCache]: Analyzing trace with hash -1957062113, now seen corresponding path program 1 times [2022-04-27 15:09:06,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:09:06,521 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540747332] [2022-04-27 15:09:06,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:09:06,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:09:06,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:06,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:09:06,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:06,560 INFO L290 TraceCheckUtils]: 0: Hoare triple {4654#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {4648#true} is VALID [2022-04-27 15:09:06,560 INFO L290 TraceCheckUtils]: 1: Hoare triple {4648#true} assume true; {4648#true} is VALID [2022-04-27 15:09:06,560 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4648#true} {4648#true} #200#return; {4648#true} is VALID [2022-04-27 15:09:06,560 INFO L272 TraceCheckUtils]: 0: Hoare triple {4648#true} call ULTIMATE.init(); {4654#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:09:06,561 INFO L290 TraceCheckUtils]: 1: Hoare triple {4654#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {4648#true} is VALID [2022-04-27 15:09:06,561 INFO L290 TraceCheckUtils]: 2: Hoare triple {4648#true} assume true; {4648#true} is VALID [2022-04-27 15:09:06,561 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4648#true} {4648#true} #200#return; {4648#true} is VALID [2022-04-27 15:09:06,561 INFO L272 TraceCheckUtils]: 4: Hoare triple {4648#true} call #t~ret15 := main(); {4648#true} is VALID [2022-04-27 15:09:06,561 INFO L290 TraceCheckUtils]: 5: Hoare triple {4648#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;havoc ~cond~0; {4648#true} is VALID [2022-04-27 15:09:06,561 INFO L290 TraceCheckUtils]: 6: Hoare triple {4648#true} assume !false;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~cond~0 := #t~nondet14;havoc #t~nondet14; {4648#true} is VALID [2022-04-27 15:09:06,561 INFO L290 TraceCheckUtils]: 7: Hoare triple {4648#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0; {4648#true} is VALID [2022-04-27 15:09:06,561 INFO L290 TraceCheckUtils]: 8: Hoare triple {4648#true} assume !(0 != ~p1~0); {4648#true} is VALID [2022-04-27 15:09:06,562 INFO L290 TraceCheckUtils]: 9: Hoare triple {4648#true} assume !(0 != ~p2~0); {4648#true} is VALID [2022-04-27 15:09:06,562 INFO L290 TraceCheckUtils]: 10: Hoare triple {4648#true} assume 0 != ~p3~0;~lk3~0 := 1; {4653#(not (= main_~p3~0 0))} is VALID [2022-04-27 15:09:06,562 INFO L290 TraceCheckUtils]: 11: Hoare triple {4653#(not (= main_~p3~0 0))} assume 0 != ~p4~0;~lk4~0 := 1; {4653#(not (= main_~p3~0 0))} is VALID [2022-04-27 15:09:06,563 INFO L290 TraceCheckUtils]: 12: Hoare triple {4653#(not (= main_~p3~0 0))} assume 0 != ~p5~0;~lk5~0 := 1; {4653#(not (= main_~p3~0 0))} is VALID [2022-04-27 15:09:06,563 INFO L290 TraceCheckUtils]: 13: Hoare triple {4653#(not (= main_~p3~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {4653#(not (= main_~p3~0 0))} is VALID [2022-04-27 15:09:06,563 INFO L290 TraceCheckUtils]: 14: Hoare triple {4653#(not (= main_~p3~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {4653#(not (= main_~p3~0 0))} is VALID [2022-04-27 15:09:06,564 INFO L290 TraceCheckUtils]: 15: Hoare triple {4653#(not (= main_~p3~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {4653#(not (= main_~p3~0 0))} is VALID [2022-04-27 15:09:06,564 INFO L290 TraceCheckUtils]: 16: Hoare triple {4653#(not (= main_~p3~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {4653#(not (= main_~p3~0 0))} is VALID [2022-04-27 15:09:06,564 INFO L290 TraceCheckUtils]: 17: Hoare triple {4653#(not (= main_~p3~0 0))} assume !(0 != ~p10~0); {4653#(not (= main_~p3~0 0))} is VALID [2022-04-27 15:09:06,564 INFO L290 TraceCheckUtils]: 18: Hoare triple {4653#(not (= main_~p3~0 0))} assume !(0 != ~p1~0); {4653#(not (= main_~p3~0 0))} is VALID [2022-04-27 15:09:06,565 INFO L290 TraceCheckUtils]: 19: Hoare triple {4653#(not (= main_~p3~0 0))} assume !(0 != ~p2~0); {4653#(not (= main_~p3~0 0))} is VALID [2022-04-27 15:09:06,565 INFO L290 TraceCheckUtils]: 20: Hoare triple {4653#(not (= main_~p3~0 0))} assume !(0 != ~p3~0); {4649#false} is VALID [2022-04-27 15:09:06,565 INFO L290 TraceCheckUtils]: 21: Hoare triple {4649#false} assume 0 != ~p4~0; {4649#false} is VALID [2022-04-27 15:09:06,565 INFO L290 TraceCheckUtils]: 22: Hoare triple {4649#false} assume 1 != ~lk4~0; {4649#false} is VALID [2022-04-27 15:09:06,566 INFO L290 TraceCheckUtils]: 23: Hoare triple {4649#false} assume !false; {4649#false} is VALID [2022-04-27 15:09:06,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:09:06,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:09:06,566 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540747332] [2022-04-27 15:09:06,566 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540747332] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:09:06,566 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:09:06,566 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:09:06,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919075643] [2022-04-27 15:09:06,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:09:06,567 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:09:06,567 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:09:06,567 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:09:06,582 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:09:06,582 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:09:06,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:09:06,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:09:06,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:09:06,583 INFO L87 Difference]: Start difference. First operand 255 states and 439 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:09:06,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:06,763 INFO L93 Difference]: Finished difference Result 385 states and 661 transitions. [2022-04-27 15:09:06,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:09:06,763 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:09:06,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:09:06,764 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:09:06,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 181 transitions. [2022-04-27 15:09:06,765 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:09:06,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 181 transitions. [2022-04-27 15:09:06,767 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 181 transitions. [2022-04-27 15:09:06,910 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 181 edges. 181 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:09:06,915 INFO L225 Difference]: With dead ends: 385 [2022-04-27 15:09:06,915 INFO L226 Difference]: Without dead ends: 263 [2022-04-27 15:09:06,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:09:06,918 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 129 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:09:06,918 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 107 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 15:09:06,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2022-04-27 15:09:06,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 261. [2022-04-27 15:09:06,927 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:09:06,934 INFO L82 GeneralOperation]: Start isEquivalent. First operand 263 states. Second operand has 261 states, 257 states have (on average 1.7120622568093384) internal successors, (440), 257 states have internal predecessors, (440), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:06,937 INFO L74 IsIncluded]: Start isIncluded. First operand 263 states. Second operand has 261 states, 257 states have (on average 1.7120622568093384) internal successors, (440), 257 states have internal predecessors, (440), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:06,939 INFO L87 Difference]: Start difference. First operand 263 states. Second operand has 261 states, 257 states have (on average 1.7120622568093384) internal successors, (440), 257 states have internal predecessors, (440), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:06,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:06,944 INFO L93 Difference]: Finished difference Result 263 states and 444 transitions. [2022-04-27 15:09:06,944 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 444 transitions. [2022-04-27 15:09:06,945 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:09:06,945 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:09:06,945 INFO L74 IsIncluded]: Start isIncluded. First operand has 261 states, 257 states have (on average 1.7120622568093384) internal successors, (440), 257 states have internal predecessors, (440), 2 states have call successors, (2), 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 263 states. [2022-04-27 15:09:06,946 INFO L87 Difference]: Start difference. First operand has 261 states, 257 states have (on average 1.7120622568093384) internal successors, (440), 257 states have internal predecessors, (440), 2 states have call successors, (2), 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 263 states. [2022-04-27 15:09:06,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:06,951 INFO L93 Difference]: Finished difference Result 263 states and 444 transitions. [2022-04-27 15:09:06,952 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 444 transitions. [2022-04-27 15:09:06,952 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:09:06,952 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:09:06,952 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:09:06,952 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:09:06,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 257 states have (on average 1.7120622568093384) internal successors, (440), 257 states have internal predecessors, (440), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:06,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 443 transitions. [2022-04-27 15:09:06,958 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 443 transitions. Word has length 24 [2022-04-27 15:09:06,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:09:06,959 INFO L495 AbstractCegarLoop]: Abstraction has 261 states and 443 transitions. [2022-04-27 15:09:06,959 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:09:06,959 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 443 transitions. [2022-04-27 15:09:06,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-27 15:09:06,963 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:09:06,963 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:09:06,963 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-27 15:09:06,964 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:09:06,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:09:06,964 INFO L85 PathProgramCache]: Analyzing trace with hash 1326787933, now seen corresponding path program 1 times [2022-04-27 15:09:06,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:09:06,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919243948] [2022-04-27 15:09:06,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:09:06,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:09:06,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:06,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:09:07,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:07,004 INFO L290 TraceCheckUtils]: 0: Hoare triple {5872#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {5866#true} is VALID [2022-04-27 15:09:07,004 INFO L290 TraceCheckUtils]: 1: Hoare triple {5866#true} assume true; {5866#true} is VALID [2022-04-27 15:09:07,004 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5866#true} {5866#true} #200#return; {5866#true} is VALID [2022-04-27 15:09:07,005 INFO L272 TraceCheckUtils]: 0: Hoare triple {5866#true} call ULTIMATE.init(); {5872#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:09:07,005 INFO L290 TraceCheckUtils]: 1: Hoare triple {5872#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {5866#true} is VALID [2022-04-27 15:09:07,005 INFO L290 TraceCheckUtils]: 2: Hoare triple {5866#true} assume true; {5866#true} is VALID [2022-04-27 15:09:07,005 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5866#true} {5866#true} #200#return; {5866#true} is VALID [2022-04-27 15:09:07,005 INFO L272 TraceCheckUtils]: 4: Hoare triple {5866#true} call #t~ret15 := main(); {5866#true} is VALID [2022-04-27 15:09:07,005 INFO L290 TraceCheckUtils]: 5: Hoare triple {5866#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;havoc ~cond~0; {5866#true} is VALID [2022-04-27 15:09:07,006 INFO L290 TraceCheckUtils]: 6: Hoare triple {5866#true} assume !false;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~cond~0 := #t~nondet14;havoc #t~nondet14; {5866#true} is VALID [2022-04-27 15:09:07,006 INFO L290 TraceCheckUtils]: 7: Hoare triple {5866#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0; {5866#true} is VALID [2022-04-27 15:09:07,006 INFO L290 TraceCheckUtils]: 8: Hoare triple {5866#true} assume !(0 != ~p1~0); {5866#true} is VALID [2022-04-27 15:09:07,006 INFO L290 TraceCheckUtils]: 9: Hoare triple {5866#true} assume !(0 != ~p2~0); {5866#true} is VALID [2022-04-27 15:09:07,006 INFO L290 TraceCheckUtils]: 10: Hoare triple {5866#true} assume !(0 != ~p3~0); {5866#true} is VALID [2022-04-27 15:09:07,006 INFO L290 TraceCheckUtils]: 11: Hoare triple {5866#true} assume 0 != ~p4~0;~lk4~0 := 1; {5871#(= main_~lk4~0 1)} is VALID [2022-04-27 15:09:07,007 INFO L290 TraceCheckUtils]: 12: Hoare triple {5871#(= main_~lk4~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {5871#(= main_~lk4~0 1)} is VALID [2022-04-27 15:09:07,007 INFO L290 TraceCheckUtils]: 13: Hoare triple {5871#(= main_~lk4~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {5871#(= main_~lk4~0 1)} is VALID [2022-04-27 15:09:07,007 INFO L290 TraceCheckUtils]: 14: Hoare triple {5871#(= main_~lk4~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {5871#(= main_~lk4~0 1)} is VALID [2022-04-27 15:09:07,008 INFO L290 TraceCheckUtils]: 15: Hoare triple {5871#(= main_~lk4~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {5871#(= main_~lk4~0 1)} is VALID [2022-04-27 15:09:07,008 INFO L290 TraceCheckUtils]: 16: Hoare triple {5871#(= main_~lk4~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {5871#(= main_~lk4~0 1)} is VALID [2022-04-27 15:09:07,008 INFO L290 TraceCheckUtils]: 17: Hoare triple {5871#(= main_~lk4~0 1)} assume !(0 != ~p10~0); {5871#(= main_~lk4~0 1)} is VALID [2022-04-27 15:09:07,009 INFO L290 TraceCheckUtils]: 18: Hoare triple {5871#(= main_~lk4~0 1)} assume !(0 != ~p1~0); {5871#(= main_~lk4~0 1)} is VALID [2022-04-27 15:09:07,009 INFO L290 TraceCheckUtils]: 19: Hoare triple {5871#(= main_~lk4~0 1)} assume !(0 != ~p2~0); {5871#(= main_~lk4~0 1)} is VALID [2022-04-27 15:09:07,009 INFO L290 TraceCheckUtils]: 20: Hoare triple {5871#(= main_~lk4~0 1)} assume !(0 != ~p3~0); {5871#(= main_~lk4~0 1)} is VALID [2022-04-27 15:09:07,010 INFO L290 TraceCheckUtils]: 21: Hoare triple {5871#(= main_~lk4~0 1)} assume 0 != ~p4~0; {5871#(= main_~lk4~0 1)} is VALID [2022-04-27 15:09:07,010 INFO L290 TraceCheckUtils]: 22: Hoare triple {5871#(= main_~lk4~0 1)} assume 1 != ~lk4~0; {5867#false} is VALID [2022-04-27 15:09:07,010 INFO L290 TraceCheckUtils]: 23: Hoare triple {5867#false} assume !false; {5867#false} is VALID [2022-04-27 15:09:07,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:09:07,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:09:07,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919243948] [2022-04-27 15:09:07,010 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919243948] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:09:07,011 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:09:07,011 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:09:07,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016245409] [2022-04-27 15:09:07,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:09:07,011 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:09:07,011 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:09:07,011 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:09:07,028 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:09:07,029 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:09:07,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:09:07,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:09:07,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:09:07,029 INFO L87 Difference]: Start difference. First operand 261 states and 443 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:09:07,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:07,255 INFO L93 Difference]: Finished difference Result 477 states and 821 transitions. [2022-04-27 15:09:07,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:09:07,256 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:09:07,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:09:07,256 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:09:07,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 119 transitions. [2022-04-27 15:09:07,257 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:09:07,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 119 transitions. [2022-04-27 15:09:07,258 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 119 transitions. [2022-04-27 15:09:07,426 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 119 edges. 119 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:09:07,439 INFO L225 Difference]: With dead ends: 477 [2022-04-27 15:09:07,439 INFO L226 Difference]: Without dead ends: 475 [2022-04-27 15:09:07,440 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:09:07,442 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 147 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 15:09:07,442 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 75 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 15:09:07,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2022-04-27 15:09:07,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 361. [2022-04-27 15:09:07,453 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:09:07,453 INFO L82 GeneralOperation]: Start isEquivalent. First operand 475 states. Second operand has 361 states, 357 states have (on average 1.680672268907563) internal successors, (600), 357 states have internal predecessors, (600), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:07,454 INFO L74 IsIncluded]: Start isIncluded. First operand 475 states. Second operand has 361 states, 357 states have (on average 1.680672268907563) internal successors, (600), 357 states have internal predecessors, (600), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:07,455 INFO L87 Difference]: Start difference. First operand 475 states. Second operand has 361 states, 357 states have (on average 1.680672268907563) internal successors, (600), 357 states have internal predecessors, (600), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:07,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:07,468 INFO L93 Difference]: Finished difference Result 475 states and 812 transitions. [2022-04-27 15:09:07,468 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 812 transitions. [2022-04-27 15:09:07,469 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:09:07,469 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:09:07,470 INFO L74 IsIncluded]: Start isIncluded. First operand has 361 states, 357 states have (on average 1.680672268907563) internal successors, (600), 357 states have internal predecessors, (600), 2 states have call successors, (2), 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 475 states. [2022-04-27 15:09:07,470 INFO L87 Difference]: Start difference. First operand has 361 states, 357 states have (on average 1.680672268907563) internal successors, (600), 357 states have internal predecessors, (600), 2 states have call successors, (2), 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 475 states. [2022-04-27 15:09:07,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:07,484 INFO L93 Difference]: Finished difference Result 475 states and 812 transitions. [2022-04-27 15:09:07,484 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 812 transitions. [2022-04-27 15:09:07,485 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:09:07,485 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:09:07,485 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:09:07,485 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:09:07,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 357 states have (on average 1.680672268907563) internal successors, (600), 357 states have internal predecessors, (600), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:07,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 603 transitions. [2022-04-27 15:09:07,494 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 603 transitions. Word has length 24 [2022-04-27 15:09:07,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:09:07,494 INFO L495 AbstractCegarLoop]: Abstraction has 361 states and 603 transitions. [2022-04-27 15:09:07,494 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:09:07,495 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 603 transitions. [2022-04-27 15:09:07,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-27 15:09:07,495 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:09:07,495 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:09:07,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-27 15:09:07,495 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:09:07,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:09:07,496 INFO L85 PathProgramCache]: Analyzing trace with hash 739981919, now seen corresponding path program 1 times [2022-04-27 15:09:07,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:09:07,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027144514] [2022-04-27 15:09:07,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:09:07,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:09:07,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:07,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:09:07,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:07,552 INFO L290 TraceCheckUtils]: 0: Hoare triple {7710#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {7704#true} is VALID [2022-04-27 15:09:07,552 INFO L290 TraceCheckUtils]: 1: Hoare triple {7704#true} assume true; {7704#true} is VALID [2022-04-27 15:09:07,552 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7704#true} {7704#true} #200#return; {7704#true} is VALID [2022-04-27 15:09:07,553 INFO L272 TraceCheckUtils]: 0: Hoare triple {7704#true} call ULTIMATE.init(); {7710#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:09:07,553 INFO L290 TraceCheckUtils]: 1: Hoare triple {7710#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {7704#true} is VALID [2022-04-27 15:09:07,553 INFO L290 TraceCheckUtils]: 2: Hoare triple {7704#true} assume true; {7704#true} is VALID [2022-04-27 15:09:07,553 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7704#true} {7704#true} #200#return; {7704#true} is VALID [2022-04-27 15:09:07,553 INFO L272 TraceCheckUtils]: 4: Hoare triple {7704#true} call #t~ret15 := main(); {7704#true} is VALID [2022-04-27 15:09:07,553 INFO L290 TraceCheckUtils]: 5: Hoare triple {7704#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;havoc ~cond~0; {7704#true} is VALID [2022-04-27 15:09:07,553 INFO L290 TraceCheckUtils]: 6: Hoare triple {7704#true} assume !false;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~cond~0 := #t~nondet14;havoc #t~nondet14; {7704#true} is VALID [2022-04-27 15:09:07,553 INFO L290 TraceCheckUtils]: 7: Hoare triple {7704#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0; {7704#true} is VALID [2022-04-27 15:09:07,554 INFO L290 TraceCheckUtils]: 8: Hoare triple {7704#true} assume !(0 != ~p1~0); {7704#true} is VALID [2022-04-27 15:09:07,554 INFO L290 TraceCheckUtils]: 9: Hoare triple {7704#true} assume !(0 != ~p2~0); {7704#true} is VALID [2022-04-27 15:09:07,554 INFO L290 TraceCheckUtils]: 10: Hoare triple {7704#true} assume !(0 != ~p3~0); {7704#true} is VALID [2022-04-27 15:09:07,554 INFO L290 TraceCheckUtils]: 11: Hoare triple {7704#true} assume !(0 != ~p4~0); {7709#(= main_~p4~0 0)} is VALID [2022-04-27 15:09:07,555 INFO L290 TraceCheckUtils]: 12: Hoare triple {7709#(= main_~p4~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {7709#(= main_~p4~0 0)} is VALID [2022-04-27 15:09:07,555 INFO L290 TraceCheckUtils]: 13: Hoare triple {7709#(= main_~p4~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {7709#(= main_~p4~0 0)} is VALID [2022-04-27 15:09:07,555 INFO L290 TraceCheckUtils]: 14: Hoare triple {7709#(= main_~p4~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {7709#(= main_~p4~0 0)} is VALID [2022-04-27 15:09:07,556 INFO L290 TraceCheckUtils]: 15: Hoare triple {7709#(= main_~p4~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {7709#(= main_~p4~0 0)} is VALID [2022-04-27 15:09:07,557 INFO L290 TraceCheckUtils]: 16: Hoare triple {7709#(= main_~p4~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {7709#(= main_~p4~0 0)} is VALID [2022-04-27 15:09:07,558 INFO L290 TraceCheckUtils]: 17: Hoare triple {7709#(= main_~p4~0 0)} assume !(0 != ~p10~0); {7709#(= main_~p4~0 0)} is VALID [2022-04-27 15:09:07,558 INFO L290 TraceCheckUtils]: 18: Hoare triple {7709#(= main_~p4~0 0)} assume !(0 != ~p1~0); {7709#(= main_~p4~0 0)} is VALID [2022-04-27 15:09:07,558 INFO L290 TraceCheckUtils]: 19: Hoare triple {7709#(= main_~p4~0 0)} assume !(0 != ~p2~0); {7709#(= main_~p4~0 0)} is VALID [2022-04-27 15:09:07,559 INFO L290 TraceCheckUtils]: 20: Hoare triple {7709#(= main_~p4~0 0)} assume !(0 != ~p3~0); {7709#(= main_~p4~0 0)} is VALID [2022-04-27 15:09:07,559 INFO L290 TraceCheckUtils]: 21: Hoare triple {7709#(= main_~p4~0 0)} assume 0 != ~p4~0; {7705#false} is VALID [2022-04-27 15:09:07,559 INFO L290 TraceCheckUtils]: 22: Hoare triple {7705#false} assume 1 != ~lk4~0; {7705#false} is VALID [2022-04-27 15:09:07,559 INFO L290 TraceCheckUtils]: 23: Hoare triple {7705#false} assume !false; {7705#false} is VALID [2022-04-27 15:09:07,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:09:07,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:09:07,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027144514] [2022-04-27 15:09:07,560 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027144514] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:09:07,560 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:09:07,560 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:09:07,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536908565] [2022-04-27 15:09:07,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:09:07,561 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:09:07,561 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:09:07,561 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:09:07,577 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:09:07,577 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:09:07,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:09:07,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:09:07,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:09:07,577 INFO L87 Difference]: Start difference. First operand 361 states and 603 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:09:07,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:07,790 INFO L93 Difference]: Finished difference Result 845 states and 1421 transitions. [2022-04-27 15:09:07,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:09:07,790 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:09:07,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:09:07,790 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:09:07,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 183 transitions. [2022-04-27 15:09:07,792 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:09:07,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 183 transitions. [2022-04-27 15:09:07,793 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 183 transitions. [2022-04-27 15:09:07,928 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 183 edges. 183 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:09:07,942 INFO L225 Difference]: With dead ends: 845 [2022-04-27 15:09:07,942 INFO L226 Difference]: Without dead ends: 499 [2022-04-27 15:09:07,943 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:09:07,943 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 130 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:09:07,943 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 101 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 15:09:07,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2022-04-27 15:09:07,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 497. [2022-04-27 15:09:07,953 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:09:07,954 INFO L82 GeneralOperation]: Start isEquivalent. First operand 499 states. Second operand has 497 states, 493 states have (on average 1.6632860040567952) internal successors, (820), 493 states have internal predecessors, (820), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:07,955 INFO L74 IsIncluded]: Start isIncluded. First operand 499 states. Second operand has 497 states, 493 states have (on average 1.6632860040567952) internal successors, (820), 493 states have internal predecessors, (820), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:07,956 INFO L87 Difference]: Start difference. First operand 499 states. Second operand has 497 states, 493 states have (on average 1.6632860040567952) internal successors, (820), 493 states have internal predecessors, (820), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:07,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:07,969 INFO L93 Difference]: Finished difference Result 499 states and 824 transitions. [2022-04-27 15:09:07,969 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 824 transitions. [2022-04-27 15:09:07,970 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:09:07,970 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:09:07,971 INFO L74 IsIncluded]: Start isIncluded. First operand has 497 states, 493 states have (on average 1.6632860040567952) internal successors, (820), 493 states have internal predecessors, (820), 2 states have call successors, (2), 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 499 states. [2022-04-27 15:09:07,972 INFO L87 Difference]: Start difference. First operand has 497 states, 493 states have (on average 1.6632860040567952) internal successors, (820), 493 states have internal predecessors, (820), 2 states have call successors, (2), 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 499 states. [2022-04-27 15:09:07,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:07,986 INFO L93 Difference]: Finished difference Result 499 states and 824 transitions. [2022-04-27 15:09:07,986 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 824 transitions. [2022-04-27 15:09:07,987 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:09:07,987 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:09:07,987 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:09:07,987 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:09:07,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 497 states, 493 states have (on average 1.6632860040567952) internal successors, (820), 493 states have internal predecessors, (820), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:08,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 497 states and 823 transitions. [2022-04-27 15:09:08,003 INFO L78 Accepts]: Start accepts. Automaton has 497 states and 823 transitions. Word has length 24 [2022-04-27 15:09:08,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:09:08,003 INFO L495 AbstractCegarLoop]: Abstraction has 497 states and 823 transitions. [2022-04-27 15:09:08,003 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:09:08,003 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 823 transitions. [2022-04-27 15:09:08,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-27 15:09:08,004 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:09:08,004 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:09:08,004 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-27 15:09:08,004 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:09:08,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:09:08,004 INFO L85 PathProgramCache]: Analyzing trace with hash -1819032631, now seen corresponding path program 1 times [2022-04-27 15:09:08,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:09:08,005 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357736030] [2022-04-27 15:09:08,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:09:08,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:09:08,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:08,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:09:08,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:08,036 INFO L290 TraceCheckUtils]: 0: Hoare triple {10116#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {10110#true} is VALID [2022-04-27 15:09:08,036 INFO L290 TraceCheckUtils]: 1: Hoare triple {10110#true} assume true; {10110#true} is VALID [2022-04-27 15:09:08,036 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10110#true} {10110#true} #200#return; {10110#true} is VALID [2022-04-27 15:09:08,036 INFO L272 TraceCheckUtils]: 0: Hoare triple {10110#true} call ULTIMATE.init(); {10116#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:09:08,037 INFO L290 TraceCheckUtils]: 1: Hoare triple {10116#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {10110#true} is VALID [2022-04-27 15:09:08,037 INFO L290 TraceCheckUtils]: 2: Hoare triple {10110#true} assume true; {10110#true} is VALID [2022-04-27 15:09:08,037 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10110#true} {10110#true} #200#return; {10110#true} is VALID [2022-04-27 15:09:08,037 INFO L272 TraceCheckUtils]: 4: Hoare triple {10110#true} call #t~ret15 := main(); {10110#true} is VALID [2022-04-27 15:09:08,037 INFO L290 TraceCheckUtils]: 5: Hoare triple {10110#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;havoc ~cond~0; {10110#true} is VALID [2022-04-27 15:09:08,037 INFO L290 TraceCheckUtils]: 6: Hoare triple {10110#true} assume !false;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~cond~0 := #t~nondet14;havoc #t~nondet14; {10110#true} is VALID [2022-04-27 15:09:08,037 INFO L290 TraceCheckUtils]: 7: Hoare triple {10110#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0; {10110#true} is VALID [2022-04-27 15:09:08,037 INFO L290 TraceCheckUtils]: 8: Hoare triple {10110#true} assume !(0 != ~p1~0); {10110#true} is VALID [2022-04-27 15:09:08,037 INFO L290 TraceCheckUtils]: 9: Hoare triple {10110#true} assume !(0 != ~p2~0); {10110#true} is VALID [2022-04-27 15:09:08,037 INFO L290 TraceCheckUtils]: 10: Hoare triple {10110#true} assume !(0 != ~p3~0); {10110#true} is VALID [2022-04-27 15:09:08,038 INFO L290 TraceCheckUtils]: 11: Hoare triple {10110#true} assume 0 != ~p4~0;~lk4~0 := 1; {10115#(not (= main_~p4~0 0))} is VALID [2022-04-27 15:09:08,038 INFO L290 TraceCheckUtils]: 12: Hoare triple {10115#(not (= main_~p4~0 0))} assume 0 != ~p5~0;~lk5~0 := 1; {10115#(not (= main_~p4~0 0))} is VALID [2022-04-27 15:09:08,038 INFO L290 TraceCheckUtils]: 13: Hoare triple {10115#(not (= main_~p4~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {10115#(not (= main_~p4~0 0))} is VALID [2022-04-27 15:09:08,039 INFO L290 TraceCheckUtils]: 14: Hoare triple {10115#(not (= main_~p4~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {10115#(not (= main_~p4~0 0))} is VALID [2022-04-27 15:09:08,039 INFO L290 TraceCheckUtils]: 15: Hoare triple {10115#(not (= main_~p4~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {10115#(not (= main_~p4~0 0))} is VALID [2022-04-27 15:09:08,039 INFO L290 TraceCheckUtils]: 16: Hoare triple {10115#(not (= main_~p4~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {10115#(not (= main_~p4~0 0))} is VALID [2022-04-27 15:09:08,040 INFO L290 TraceCheckUtils]: 17: Hoare triple {10115#(not (= main_~p4~0 0))} assume !(0 != ~p10~0); {10115#(not (= main_~p4~0 0))} is VALID [2022-04-27 15:09:08,040 INFO L290 TraceCheckUtils]: 18: Hoare triple {10115#(not (= main_~p4~0 0))} assume !(0 != ~p1~0); {10115#(not (= main_~p4~0 0))} is VALID [2022-04-27 15:09:08,040 INFO L290 TraceCheckUtils]: 19: Hoare triple {10115#(not (= main_~p4~0 0))} assume !(0 != ~p2~0); {10115#(not (= main_~p4~0 0))} is VALID [2022-04-27 15:09:08,040 INFO L290 TraceCheckUtils]: 20: Hoare triple {10115#(not (= main_~p4~0 0))} assume !(0 != ~p3~0); {10115#(not (= main_~p4~0 0))} is VALID [2022-04-27 15:09:08,041 INFO L290 TraceCheckUtils]: 21: Hoare triple {10115#(not (= main_~p4~0 0))} assume !(0 != ~p4~0); {10111#false} is VALID [2022-04-27 15:09:08,041 INFO L290 TraceCheckUtils]: 22: Hoare triple {10111#false} assume 0 != ~p5~0; {10111#false} is VALID [2022-04-27 15:09:08,041 INFO L290 TraceCheckUtils]: 23: Hoare triple {10111#false} assume 1 != ~lk5~0; {10111#false} is VALID [2022-04-27 15:09:08,041 INFO L290 TraceCheckUtils]: 24: Hoare triple {10111#false} assume !false; {10111#false} is VALID [2022-04-27 15:09:08,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:09:08,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:09:08,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357736030] [2022-04-27 15:09:08,041 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357736030] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:09:08,042 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:09:08,042 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:09:08,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061830872] [2022-04-27 15:09:08,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:09:08,042 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-27 15:09:08,042 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:09:08,042 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:08,059 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:09:08,059 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:09:08,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:09:08,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:09:08,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:09:08,060 INFO L87 Difference]: Start difference. First operand 497 states and 823 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:08,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:08,253 INFO L93 Difference]: Finished difference Result 745 states and 1229 transitions. [2022-04-27 15:09:08,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:09:08,254 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-27 15:09:08,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:09:08,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:08,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 178 transitions. [2022-04-27 15:09:08,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:08,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 178 transitions. [2022-04-27 15:09:08,257 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 178 transitions. [2022-04-27 15:09:08,400 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 178 edges. 178 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:09:08,413 INFO L225 Difference]: With dead ends: 745 [2022-04-27 15:09:08,413 INFO L226 Difference]: Without dead ends: 507 [2022-04-27 15:09:08,414 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:09:08,414 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 128 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:09:08,415 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 104 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 15:09:08,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2022-04-27 15:09:08,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 505. [2022-04-27 15:09:08,426 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:09:08,427 INFO L82 GeneralOperation]: Start isEquivalent. First operand 507 states. Second operand has 505 states, 501 states have (on average 1.6367265469061876) internal successors, (820), 501 states have internal predecessors, (820), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:08,427 INFO L74 IsIncluded]: Start isIncluded. First operand 507 states. Second operand has 505 states, 501 states have (on average 1.6367265469061876) internal successors, (820), 501 states have internal predecessors, (820), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:08,428 INFO L87 Difference]: Start difference. First operand 507 states. Second operand has 505 states, 501 states have (on average 1.6367265469061876) internal successors, (820), 501 states have internal predecessors, (820), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:08,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:08,442 INFO L93 Difference]: Finished difference Result 507 states and 824 transitions. [2022-04-27 15:09:08,442 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 824 transitions. [2022-04-27 15:09:08,443 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:09:08,443 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:09:08,444 INFO L74 IsIncluded]: Start isIncluded. First operand has 505 states, 501 states have (on average 1.6367265469061876) internal successors, (820), 501 states have internal predecessors, (820), 2 states have call successors, (2), 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 507 states. [2022-04-27 15:09:08,445 INFO L87 Difference]: Start difference. First operand has 505 states, 501 states have (on average 1.6367265469061876) internal successors, (820), 501 states have internal predecessors, (820), 2 states have call successors, (2), 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 507 states. [2022-04-27 15:09:08,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:08,460 INFO L93 Difference]: Finished difference Result 507 states and 824 transitions. [2022-04-27 15:09:08,460 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 824 transitions. [2022-04-27 15:09:08,461 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:09:08,461 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:09:08,461 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:09:08,461 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:09:08,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 505 states, 501 states have (on average 1.6367265469061876) internal successors, (820), 501 states have internal predecessors, (820), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:08,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 823 transitions. [2022-04-27 15:09:08,476 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 823 transitions. Word has length 25 [2022-04-27 15:09:08,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:09:08,477 INFO L495 AbstractCegarLoop]: Abstraction has 505 states and 823 transitions. [2022-04-27 15:09:08,477 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:08,477 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 823 transitions. [2022-04-27 15:09:08,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-27 15:09:08,478 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:09:08,478 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:09:08,478 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-27 15:09:08,478 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:09:08,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:09:08,478 INFO L85 PathProgramCache]: Analyzing trace with hash 1464817415, now seen corresponding path program 1 times [2022-04-27 15:09:08,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:09:08,479 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309280940] [2022-04-27 15:09:08,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:09:08,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:09:08,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:08,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:09:08,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:08,550 INFO L290 TraceCheckUtils]: 0: Hoare triple {12446#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {12440#true} is VALID [2022-04-27 15:09:08,550 INFO L290 TraceCheckUtils]: 1: Hoare triple {12440#true} assume true; {12440#true} is VALID [2022-04-27 15:09:08,550 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12440#true} {12440#true} #200#return; {12440#true} is VALID [2022-04-27 15:09:08,551 INFO L272 TraceCheckUtils]: 0: Hoare triple {12440#true} call ULTIMATE.init(); {12446#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:09:08,551 INFO L290 TraceCheckUtils]: 1: Hoare triple {12446#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {12440#true} is VALID [2022-04-27 15:09:08,551 INFO L290 TraceCheckUtils]: 2: Hoare triple {12440#true} assume true; {12440#true} is VALID [2022-04-27 15:09:08,551 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12440#true} {12440#true} #200#return; {12440#true} is VALID [2022-04-27 15:09:08,551 INFO L272 TraceCheckUtils]: 4: Hoare triple {12440#true} call #t~ret15 := main(); {12440#true} is VALID [2022-04-27 15:09:08,551 INFO L290 TraceCheckUtils]: 5: Hoare triple {12440#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;havoc ~cond~0; {12440#true} is VALID [2022-04-27 15:09:08,551 INFO L290 TraceCheckUtils]: 6: Hoare triple {12440#true} assume !false;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~cond~0 := #t~nondet14;havoc #t~nondet14; {12440#true} is VALID [2022-04-27 15:09:08,551 INFO L290 TraceCheckUtils]: 7: Hoare triple {12440#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0; {12440#true} is VALID [2022-04-27 15:09:08,551 INFO L290 TraceCheckUtils]: 8: Hoare triple {12440#true} assume !(0 != ~p1~0); {12440#true} is VALID [2022-04-27 15:09:08,551 INFO L290 TraceCheckUtils]: 9: Hoare triple {12440#true} assume !(0 != ~p2~0); {12440#true} is VALID [2022-04-27 15:09:08,552 INFO L290 TraceCheckUtils]: 10: Hoare triple {12440#true} assume !(0 != ~p3~0); {12440#true} is VALID [2022-04-27 15:09:08,552 INFO L290 TraceCheckUtils]: 11: Hoare triple {12440#true} assume !(0 != ~p4~0); {12440#true} is VALID [2022-04-27 15:09:08,553 INFO L290 TraceCheckUtils]: 12: Hoare triple {12440#true} assume 0 != ~p5~0;~lk5~0 := 1; {12445#(= main_~lk5~0 1)} is VALID [2022-04-27 15:09:08,554 INFO L290 TraceCheckUtils]: 13: Hoare triple {12445#(= main_~lk5~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {12445#(= main_~lk5~0 1)} is VALID [2022-04-27 15:09:08,554 INFO L290 TraceCheckUtils]: 14: Hoare triple {12445#(= main_~lk5~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {12445#(= main_~lk5~0 1)} is VALID [2022-04-27 15:09:08,554 INFO L290 TraceCheckUtils]: 15: Hoare triple {12445#(= main_~lk5~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {12445#(= main_~lk5~0 1)} is VALID [2022-04-27 15:09:08,555 INFO L290 TraceCheckUtils]: 16: Hoare triple {12445#(= main_~lk5~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {12445#(= main_~lk5~0 1)} is VALID [2022-04-27 15:09:08,555 INFO L290 TraceCheckUtils]: 17: Hoare triple {12445#(= main_~lk5~0 1)} assume !(0 != ~p10~0); {12445#(= main_~lk5~0 1)} is VALID [2022-04-27 15:09:08,555 INFO L290 TraceCheckUtils]: 18: Hoare triple {12445#(= main_~lk5~0 1)} assume !(0 != ~p1~0); {12445#(= main_~lk5~0 1)} is VALID [2022-04-27 15:09:08,556 INFO L290 TraceCheckUtils]: 19: Hoare triple {12445#(= main_~lk5~0 1)} assume !(0 != ~p2~0); {12445#(= main_~lk5~0 1)} is VALID [2022-04-27 15:09:08,556 INFO L290 TraceCheckUtils]: 20: Hoare triple {12445#(= main_~lk5~0 1)} assume !(0 != ~p3~0); {12445#(= main_~lk5~0 1)} is VALID [2022-04-27 15:09:08,556 INFO L290 TraceCheckUtils]: 21: Hoare triple {12445#(= main_~lk5~0 1)} assume !(0 != ~p4~0); {12445#(= main_~lk5~0 1)} is VALID [2022-04-27 15:09:08,557 INFO L290 TraceCheckUtils]: 22: Hoare triple {12445#(= main_~lk5~0 1)} assume 0 != ~p5~0; {12445#(= main_~lk5~0 1)} is VALID [2022-04-27 15:09:08,557 INFO L290 TraceCheckUtils]: 23: Hoare triple {12445#(= main_~lk5~0 1)} assume 1 != ~lk5~0; {12441#false} is VALID [2022-04-27 15:09:08,557 INFO L290 TraceCheckUtils]: 24: Hoare triple {12441#false} assume !false; {12441#false} is VALID [2022-04-27 15:09:08,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:09:08,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:09:08,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309280940] [2022-04-27 15:09:08,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309280940] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:09:08,558 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:09:08,558 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:09:08,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937194158] [2022-04-27 15:09:08,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:09:08,559 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-27 15:09:08,559 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:09:08,559 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:08,574 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:09:08,574 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:09:08,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:09:08,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:09:08,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:09:08,575 INFO L87 Difference]: Start difference. First operand 505 states and 823 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:08,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:08,772 INFO L93 Difference]: Finished difference Result 909 states and 1505 transitions. [2022-04-27 15:09:08,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:09:08,772 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-27 15:09:08,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:09:08,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:08,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 115 transitions. [2022-04-27 15:09:08,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:08,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 115 transitions. [2022-04-27 15:09:08,775 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 115 transitions. [2022-04-27 15:09:08,865 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 115 edges. 115 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:09:08,905 INFO L225 Difference]: With dead ends: 909 [2022-04-27 15:09:08,905 INFO L226 Difference]: Without dead ends: 907 [2022-04-27 15:09:08,906 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:09:08,906 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 140 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:09:08,907 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 74 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 15:09:08,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 907 states. [2022-04-27 15:09:08,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 907 to 713. [2022-04-27 15:09:08,921 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:09:08,923 INFO L82 GeneralOperation]: Start isEquivalent. First operand 907 states. Second operand has 713 states, 709 states have (on average 1.5966149506346967) internal successors, (1132), 709 states have internal predecessors, (1132), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:08,924 INFO L74 IsIncluded]: Start isIncluded. First operand 907 states. Second operand has 713 states, 709 states have (on average 1.5966149506346967) internal successors, (1132), 709 states have internal predecessors, (1132), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:08,925 INFO L87 Difference]: Start difference. First operand 907 states. Second operand has 713 states, 709 states have (on average 1.5966149506346967) internal successors, (1132), 709 states have internal predecessors, (1132), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:08,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:08,962 INFO L93 Difference]: Finished difference Result 907 states and 1488 transitions. [2022-04-27 15:09:08,962 INFO L276 IsEmpty]: Start isEmpty. Operand 907 states and 1488 transitions. [2022-04-27 15:09:08,964 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:09:08,964 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:09:08,965 INFO L74 IsIncluded]: Start isIncluded. First operand has 713 states, 709 states have (on average 1.5966149506346967) internal successors, (1132), 709 states have internal predecessors, (1132), 2 states have call successors, (2), 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 907 states. [2022-04-27 15:09:08,966 INFO L87 Difference]: Start difference. First operand has 713 states, 709 states have (on average 1.5966149506346967) internal successors, (1132), 709 states have internal predecessors, (1132), 2 states have call successors, (2), 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 907 states. [2022-04-27 15:09:09,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:09,005 INFO L93 Difference]: Finished difference Result 907 states and 1488 transitions. [2022-04-27 15:09:09,005 INFO L276 IsEmpty]: Start isEmpty. Operand 907 states and 1488 transitions. [2022-04-27 15:09:09,006 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:09:09,006 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:09:09,007 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:09:09,007 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:09:09,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 713 states, 709 states have (on average 1.5966149506346967) internal successors, (1132), 709 states have internal predecessors, (1132), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:09,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 713 states to 713 states and 1135 transitions. [2022-04-27 15:09:09,033 INFO L78 Accepts]: Start accepts. Automaton has 713 states and 1135 transitions. Word has length 25 [2022-04-27 15:09:09,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:09:09,033 INFO L495 AbstractCegarLoop]: Abstraction has 713 states and 1135 transitions. [2022-04-27 15:09:09,033 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:09,033 INFO L276 IsEmpty]: Start isEmpty. Operand 713 states and 1135 transitions. [2022-04-27 15:09:09,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-27 15:09:09,034 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:09:09,035 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:09:09,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-27 15:09:09,035 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:09:09,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:09:09,035 INFO L85 PathProgramCache]: Analyzing trace with hash 878011401, now seen corresponding path program 1 times [2022-04-27 15:09:09,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:09:09,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008293260] [2022-04-27 15:09:09,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:09:09,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:09:09,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:09,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:09:09,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:09,080 INFO L290 TraceCheckUtils]: 0: Hoare triple {15956#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {15950#true} is VALID [2022-04-27 15:09:09,080 INFO L290 TraceCheckUtils]: 1: Hoare triple {15950#true} assume true; {15950#true} is VALID [2022-04-27 15:09:09,081 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {15950#true} {15950#true} #200#return; {15950#true} is VALID [2022-04-27 15:09:09,081 INFO L272 TraceCheckUtils]: 0: Hoare triple {15950#true} call ULTIMATE.init(); {15956#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:09:09,081 INFO L290 TraceCheckUtils]: 1: Hoare triple {15956#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {15950#true} is VALID [2022-04-27 15:09:09,083 INFO L290 TraceCheckUtils]: 2: Hoare triple {15950#true} assume true; {15950#true} is VALID [2022-04-27 15:09:09,083 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15950#true} {15950#true} #200#return; {15950#true} is VALID [2022-04-27 15:09:09,083 INFO L272 TraceCheckUtils]: 4: Hoare triple {15950#true} call #t~ret15 := main(); {15950#true} is VALID [2022-04-27 15:09:09,084 INFO L290 TraceCheckUtils]: 5: Hoare triple {15950#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;havoc ~cond~0; {15950#true} is VALID [2022-04-27 15:09:09,084 INFO L290 TraceCheckUtils]: 6: Hoare triple {15950#true} assume !false;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~cond~0 := #t~nondet14;havoc #t~nondet14; {15950#true} is VALID [2022-04-27 15:09:09,084 INFO L290 TraceCheckUtils]: 7: Hoare triple {15950#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0; {15950#true} is VALID [2022-04-27 15:09:09,084 INFO L290 TraceCheckUtils]: 8: Hoare triple {15950#true} assume !(0 != ~p1~0); {15950#true} is VALID [2022-04-27 15:09:09,084 INFO L290 TraceCheckUtils]: 9: Hoare triple {15950#true} assume !(0 != ~p2~0); {15950#true} is VALID [2022-04-27 15:09:09,084 INFO L290 TraceCheckUtils]: 10: Hoare triple {15950#true} assume !(0 != ~p3~0); {15950#true} is VALID [2022-04-27 15:09:09,084 INFO L290 TraceCheckUtils]: 11: Hoare triple {15950#true} assume !(0 != ~p4~0); {15950#true} is VALID [2022-04-27 15:09:09,084 INFO L290 TraceCheckUtils]: 12: Hoare triple {15950#true} assume !(0 != ~p5~0); {15955#(= main_~p5~0 0)} is VALID [2022-04-27 15:09:09,085 INFO L290 TraceCheckUtils]: 13: Hoare triple {15955#(= main_~p5~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {15955#(= main_~p5~0 0)} is VALID [2022-04-27 15:09:09,085 INFO L290 TraceCheckUtils]: 14: Hoare triple {15955#(= main_~p5~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {15955#(= main_~p5~0 0)} is VALID [2022-04-27 15:09:09,085 INFO L290 TraceCheckUtils]: 15: Hoare triple {15955#(= main_~p5~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {15955#(= main_~p5~0 0)} is VALID [2022-04-27 15:09:09,086 INFO L290 TraceCheckUtils]: 16: Hoare triple {15955#(= main_~p5~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {15955#(= main_~p5~0 0)} is VALID [2022-04-27 15:09:09,086 INFO L290 TraceCheckUtils]: 17: Hoare triple {15955#(= main_~p5~0 0)} assume !(0 != ~p10~0); {15955#(= main_~p5~0 0)} is VALID [2022-04-27 15:09:09,091 INFO L290 TraceCheckUtils]: 18: Hoare triple {15955#(= main_~p5~0 0)} assume !(0 != ~p1~0); {15955#(= main_~p5~0 0)} is VALID [2022-04-27 15:09:09,092 INFO L290 TraceCheckUtils]: 19: Hoare triple {15955#(= main_~p5~0 0)} assume !(0 != ~p2~0); {15955#(= main_~p5~0 0)} is VALID [2022-04-27 15:09:09,092 INFO L290 TraceCheckUtils]: 20: Hoare triple {15955#(= main_~p5~0 0)} assume !(0 != ~p3~0); {15955#(= main_~p5~0 0)} is VALID [2022-04-27 15:09:09,092 INFO L290 TraceCheckUtils]: 21: Hoare triple {15955#(= main_~p5~0 0)} assume !(0 != ~p4~0); {15955#(= main_~p5~0 0)} is VALID [2022-04-27 15:09:09,093 INFO L290 TraceCheckUtils]: 22: Hoare triple {15955#(= main_~p5~0 0)} assume 0 != ~p5~0; {15951#false} is VALID [2022-04-27 15:09:09,093 INFO L290 TraceCheckUtils]: 23: Hoare triple {15951#false} assume 1 != ~lk5~0; {15951#false} is VALID [2022-04-27 15:09:09,093 INFO L290 TraceCheckUtils]: 24: Hoare triple {15951#false} assume !false; {15951#false} is VALID [2022-04-27 15:09:09,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:09:09,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:09:09,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008293260] [2022-04-27 15:09:09,093 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008293260] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:09:09,093 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:09:09,093 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:09:09,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325924113] [2022-04-27 15:09:09,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:09:09,094 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-27 15:09:09,094 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:09:09,094 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:09,110 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:09:09,111 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:09:09,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:09:09,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:09:09,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:09:09,112 INFO L87 Difference]: Start difference. First operand 713 states and 1135 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:09,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:09,384 INFO L93 Difference]: Finished difference Result 1661 states and 2657 transitions. [2022-04-27 15:09:09,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:09:09,384 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-27 15:09:09,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:09:09,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:09,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 180 transitions. [2022-04-27 15:09:09,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:09,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 180 transitions. [2022-04-27 15:09:09,389 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 180 transitions. [2022-04-27 15:09:09,525 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 180 edges. 180 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:09:09,571 INFO L225 Difference]: With dead ends: 1661 [2022-04-27 15:09:09,572 INFO L226 Difference]: Without dead ends: 971 [2022-04-27 15:09:09,573 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:09:09,574 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 124 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:09:09,575 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 103 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 15:09:09,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 971 states. [2022-04-27 15:09:09,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 971 to 969. [2022-04-27 15:09:09,594 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:09:09,596 INFO L82 GeneralOperation]: Start isEquivalent. First operand 971 states. Second operand has 969 states, 965 states have (on average 1.5792746113989637) internal successors, (1524), 965 states have internal predecessors, (1524), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:09,597 INFO L74 IsIncluded]: Start isIncluded. First operand 971 states. Second operand has 969 states, 965 states have (on average 1.5792746113989637) internal successors, (1524), 965 states have internal predecessors, (1524), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:09,598 INFO L87 Difference]: Start difference. First operand 971 states. Second operand has 969 states, 965 states have (on average 1.5792746113989637) internal successors, (1524), 965 states have internal predecessors, (1524), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:09,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:09,642 INFO L93 Difference]: Finished difference Result 971 states and 1528 transitions. [2022-04-27 15:09:09,643 INFO L276 IsEmpty]: Start isEmpty. Operand 971 states and 1528 transitions. [2022-04-27 15:09:09,644 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:09:09,645 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:09:09,646 INFO L74 IsIncluded]: Start isIncluded. First operand has 969 states, 965 states have (on average 1.5792746113989637) internal successors, (1524), 965 states have internal predecessors, (1524), 2 states have call successors, (2), 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 971 states. [2022-04-27 15:09:09,648 INFO L87 Difference]: Start difference. First operand has 969 states, 965 states have (on average 1.5792746113989637) internal successors, (1524), 965 states have internal predecessors, (1524), 2 states have call successors, (2), 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 971 states. [2022-04-27 15:09:09,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:09,692 INFO L93 Difference]: Finished difference Result 971 states and 1528 transitions. [2022-04-27 15:09:09,692 INFO L276 IsEmpty]: Start isEmpty. Operand 971 states and 1528 transitions. [2022-04-27 15:09:09,693 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:09:09,694 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:09:09,694 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:09:09,694 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:09:09,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 969 states, 965 states have (on average 1.5792746113989637) internal successors, (1524), 965 states have internal predecessors, (1524), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:09,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 969 states to 969 states and 1527 transitions. [2022-04-27 15:09:09,740 INFO L78 Accepts]: Start accepts. Automaton has 969 states and 1527 transitions. Word has length 25 [2022-04-27 15:09:09,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:09:09,740 INFO L495 AbstractCegarLoop]: Abstraction has 969 states and 1527 transitions. [2022-04-27 15:09:09,740 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:09,741 INFO L276 IsEmpty]: Start isEmpty. Operand 969 states and 1527 transitions. [2022-04-27 15:09:09,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-27 15:09:09,742 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:09:09,742 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:09:09,742 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-27 15:09:09,743 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:09:09,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:09:09,743 INFO L85 PathProgramCache]: Analyzing trace with hash -1835085644, now seen corresponding path program 1 times [2022-04-27 15:09:09,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:09:09,743 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055640776] [2022-04-27 15:09:09,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:09:09,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:09:09,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:09,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:09:09,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:09,778 INFO L290 TraceCheckUtils]: 0: Hoare triple {20634#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {20628#true} is VALID [2022-04-27 15:09:09,779 INFO L290 TraceCheckUtils]: 1: Hoare triple {20628#true} assume true; {20628#true} is VALID [2022-04-27 15:09:09,779 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {20628#true} {20628#true} #200#return; {20628#true} is VALID [2022-04-27 15:09:09,779 INFO L272 TraceCheckUtils]: 0: Hoare triple {20628#true} call ULTIMATE.init(); {20634#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:09:09,779 INFO L290 TraceCheckUtils]: 1: Hoare triple {20634#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {20628#true} is VALID [2022-04-27 15:09:09,779 INFO L290 TraceCheckUtils]: 2: Hoare triple {20628#true} assume true; {20628#true} is VALID [2022-04-27 15:09:09,779 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20628#true} {20628#true} #200#return; {20628#true} is VALID [2022-04-27 15:09:09,780 INFO L272 TraceCheckUtils]: 4: Hoare triple {20628#true} call #t~ret15 := main(); {20628#true} is VALID [2022-04-27 15:09:09,780 INFO L290 TraceCheckUtils]: 5: Hoare triple {20628#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;havoc ~cond~0; {20628#true} is VALID [2022-04-27 15:09:09,780 INFO L290 TraceCheckUtils]: 6: Hoare triple {20628#true} assume !false;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~cond~0 := #t~nondet14;havoc #t~nondet14; {20628#true} is VALID [2022-04-27 15:09:09,780 INFO L290 TraceCheckUtils]: 7: Hoare triple {20628#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0; {20628#true} is VALID [2022-04-27 15:09:09,780 INFO L290 TraceCheckUtils]: 8: Hoare triple {20628#true} assume !(0 != ~p1~0); {20628#true} is VALID [2022-04-27 15:09:09,780 INFO L290 TraceCheckUtils]: 9: Hoare triple {20628#true} assume !(0 != ~p2~0); {20628#true} is VALID [2022-04-27 15:09:09,780 INFO L290 TraceCheckUtils]: 10: Hoare triple {20628#true} assume !(0 != ~p3~0); {20628#true} is VALID [2022-04-27 15:09:09,780 INFO L290 TraceCheckUtils]: 11: Hoare triple {20628#true} assume !(0 != ~p4~0); {20628#true} is VALID [2022-04-27 15:09:09,780 INFO L290 TraceCheckUtils]: 12: Hoare triple {20628#true} assume 0 != ~p5~0;~lk5~0 := 1; {20633#(not (= main_~p5~0 0))} is VALID [2022-04-27 15:09:09,781 INFO L290 TraceCheckUtils]: 13: Hoare triple {20633#(not (= main_~p5~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {20633#(not (= main_~p5~0 0))} is VALID [2022-04-27 15:09:09,781 INFO L290 TraceCheckUtils]: 14: Hoare triple {20633#(not (= main_~p5~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {20633#(not (= main_~p5~0 0))} is VALID [2022-04-27 15:09:09,781 INFO L290 TraceCheckUtils]: 15: Hoare triple {20633#(not (= main_~p5~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {20633#(not (= main_~p5~0 0))} is VALID [2022-04-27 15:09:09,782 INFO L290 TraceCheckUtils]: 16: Hoare triple {20633#(not (= main_~p5~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {20633#(not (= main_~p5~0 0))} is VALID [2022-04-27 15:09:09,782 INFO L290 TraceCheckUtils]: 17: Hoare triple {20633#(not (= main_~p5~0 0))} assume !(0 != ~p10~0); {20633#(not (= main_~p5~0 0))} is VALID [2022-04-27 15:09:09,782 INFO L290 TraceCheckUtils]: 18: Hoare triple {20633#(not (= main_~p5~0 0))} assume !(0 != ~p1~0); {20633#(not (= main_~p5~0 0))} is VALID [2022-04-27 15:09:09,783 INFO L290 TraceCheckUtils]: 19: Hoare triple {20633#(not (= main_~p5~0 0))} assume !(0 != ~p2~0); {20633#(not (= main_~p5~0 0))} is VALID [2022-04-27 15:09:09,783 INFO L290 TraceCheckUtils]: 20: Hoare triple {20633#(not (= main_~p5~0 0))} assume !(0 != ~p3~0); {20633#(not (= main_~p5~0 0))} is VALID [2022-04-27 15:09:09,783 INFO L290 TraceCheckUtils]: 21: Hoare triple {20633#(not (= main_~p5~0 0))} assume !(0 != ~p4~0); {20633#(not (= main_~p5~0 0))} is VALID [2022-04-27 15:09:09,784 INFO L290 TraceCheckUtils]: 22: Hoare triple {20633#(not (= main_~p5~0 0))} assume !(0 != ~p5~0); {20629#false} is VALID [2022-04-27 15:09:09,784 INFO L290 TraceCheckUtils]: 23: Hoare triple {20629#false} assume 0 != ~p6~0; {20629#false} is VALID [2022-04-27 15:09:09,784 INFO L290 TraceCheckUtils]: 24: Hoare triple {20629#false} assume 1 != ~lk6~0; {20629#false} is VALID [2022-04-27 15:09:09,784 INFO L290 TraceCheckUtils]: 25: Hoare triple {20629#false} assume !false; {20629#false} is VALID [2022-04-27 15:09:09,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:09:09,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:09:09,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055640776] [2022-04-27 15:09:09,785 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055640776] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:09:09,785 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:09:09,785 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:09:09,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917491201] [2022-04-27 15:09:09,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:09:09,789 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-27 15:09:09,789 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:09:09,789 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:09,805 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:09:09,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:09:09,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:09:09,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:09:09,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:09:09,806 INFO L87 Difference]: Start difference. First operand 969 states and 1527 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:10,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:10,061 INFO L93 Difference]: Finished difference Result 1453 states and 2281 transitions. [2022-04-27 15:09:10,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:09:10,061 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-27 15:09:10,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:09:10,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:10,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 175 transitions. [2022-04-27 15:09:10,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:10,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 175 transitions. [2022-04-27 15:09:10,065 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 175 transitions. [2022-04-27 15:09:10,195 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 175 edges. 175 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:09:10,246 INFO L225 Difference]: With dead ends: 1453 [2022-04-27 15:09:10,246 INFO L226 Difference]: Without dead ends: 987 [2022-04-27 15:09:10,247 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:09:10,248 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 127 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:09:10,248 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 101 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 15:09:10,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 987 states. [2022-04-27 15:09:10,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 987 to 985. [2022-04-27 15:09:10,270 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:09:10,272 INFO L82 GeneralOperation]: Start isEquivalent. First operand 987 states. Second operand has 985 states, 981 states have (on average 1.5535168195718654) internal successors, (1524), 981 states have internal predecessors, (1524), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:10,273 INFO L74 IsIncluded]: Start isIncluded. First operand 987 states. Second operand has 985 states, 981 states have (on average 1.5535168195718654) internal successors, (1524), 981 states have internal predecessors, (1524), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:10,274 INFO L87 Difference]: Start difference. First operand 987 states. Second operand has 985 states, 981 states have (on average 1.5535168195718654) internal successors, (1524), 981 states have internal predecessors, (1524), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:10,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:10,319 INFO L93 Difference]: Finished difference Result 987 states and 1528 transitions. [2022-04-27 15:09:10,319 INFO L276 IsEmpty]: Start isEmpty. Operand 987 states and 1528 transitions. [2022-04-27 15:09:10,321 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:09:10,321 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:09:10,323 INFO L74 IsIncluded]: Start isIncluded. First operand has 985 states, 981 states have (on average 1.5535168195718654) internal successors, (1524), 981 states have internal predecessors, (1524), 2 states have call successors, (2), 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 987 states. [2022-04-27 15:09:10,324 INFO L87 Difference]: Start difference. First operand has 985 states, 981 states have (on average 1.5535168195718654) internal successors, (1524), 981 states have internal predecessors, (1524), 2 states have call successors, (2), 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 987 states. [2022-04-27 15:09:10,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:10,370 INFO L93 Difference]: Finished difference Result 987 states and 1528 transitions. [2022-04-27 15:09:10,370 INFO L276 IsEmpty]: Start isEmpty. Operand 987 states and 1528 transitions. [2022-04-27 15:09:10,372 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:09:10,372 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:09:10,372 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:09:10,372 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:09:10,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 985 states, 981 states have (on average 1.5535168195718654) internal successors, (1524), 981 states have internal predecessors, (1524), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:10,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 985 states to 985 states and 1527 transitions. [2022-04-27 15:09:10,418 INFO L78 Accepts]: Start accepts. Automaton has 985 states and 1527 transitions. Word has length 26 [2022-04-27 15:09:10,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:09:10,419 INFO L495 AbstractCegarLoop]: Abstraction has 985 states and 1527 transitions. [2022-04-27 15:09:10,419 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:10,419 INFO L276 IsEmpty]: Start isEmpty. Operand 985 states and 1527 transitions. [2022-04-27 15:09:10,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-27 15:09:10,420 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:09:10,420 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:09:10,420 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-27 15:09:10,420 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:09:10,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:09:10,421 INFO L85 PathProgramCache]: Analyzing trace with hash 1448764402, now seen corresponding path program 1 times [2022-04-27 15:09:10,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:09:10,421 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818031323] [2022-04-27 15:09:10,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:09:10,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:09:10,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:10,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:09:10,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:10,470 INFO L290 TraceCheckUtils]: 0: Hoare triple {25152#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {25146#true} is VALID [2022-04-27 15:09:10,470 INFO L290 TraceCheckUtils]: 1: Hoare triple {25146#true} assume true; {25146#true} is VALID [2022-04-27 15:09:10,470 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25146#true} {25146#true} #200#return; {25146#true} is VALID [2022-04-27 15:09:10,470 INFO L272 TraceCheckUtils]: 0: Hoare triple {25146#true} call ULTIMATE.init(); {25152#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:09:10,471 INFO L290 TraceCheckUtils]: 1: Hoare triple {25152#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {25146#true} is VALID [2022-04-27 15:09:10,473 INFO L290 TraceCheckUtils]: 2: Hoare triple {25146#true} assume true; {25146#true} is VALID [2022-04-27 15:09:10,473 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25146#true} {25146#true} #200#return; {25146#true} is VALID [2022-04-27 15:09:10,473 INFO L272 TraceCheckUtils]: 4: Hoare triple {25146#true} call #t~ret15 := main(); {25146#true} is VALID [2022-04-27 15:09:10,473 INFO L290 TraceCheckUtils]: 5: Hoare triple {25146#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;havoc ~cond~0; {25146#true} is VALID [2022-04-27 15:09:10,473 INFO L290 TraceCheckUtils]: 6: Hoare triple {25146#true} assume !false;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~cond~0 := #t~nondet14;havoc #t~nondet14; {25146#true} is VALID [2022-04-27 15:09:10,473 INFO L290 TraceCheckUtils]: 7: Hoare triple {25146#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0; {25146#true} is VALID [2022-04-27 15:09:10,473 INFO L290 TraceCheckUtils]: 8: Hoare triple {25146#true} assume !(0 != ~p1~0); {25146#true} is VALID [2022-04-27 15:09:10,473 INFO L290 TraceCheckUtils]: 9: Hoare triple {25146#true} assume !(0 != ~p2~0); {25146#true} is VALID [2022-04-27 15:09:10,474 INFO L290 TraceCheckUtils]: 10: Hoare triple {25146#true} assume !(0 != ~p3~0); {25146#true} is VALID [2022-04-27 15:09:10,474 INFO L290 TraceCheckUtils]: 11: Hoare triple {25146#true} assume !(0 != ~p4~0); {25146#true} is VALID [2022-04-27 15:09:10,474 INFO L290 TraceCheckUtils]: 12: Hoare triple {25146#true} assume !(0 != ~p5~0); {25146#true} is VALID [2022-04-27 15:09:10,479 INFO L290 TraceCheckUtils]: 13: Hoare triple {25146#true} assume 0 != ~p6~0;~lk6~0 := 1; {25151#(= main_~lk6~0 1)} is VALID [2022-04-27 15:09:10,479 INFO L290 TraceCheckUtils]: 14: Hoare triple {25151#(= main_~lk6~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {25151#(= main_~lk6~0 1)} is VALID [2022-04-27 15:09:10,480 INFO L290 TraceCheckUtils]: 15: Hoare triple {25151#(= main_~lk6~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {25151#(= main_~lk6~0 1)} is VALID [2022-04-27 15:09:10,480 INFO L290 TraceCheckUtils]: 16: Hoare triple {25151#(= main_~lk6~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {25151#(= main_~lk6~0 1)} is VALID [2022-04-27 15:09:10,480 INFO L290 TraceCheckUtils]: 17: Hoare triple {25151#(= main_~lk6~0 1)} assume !(0 != ~p10~0); {25151#(= main_~lk6~0 1)} is VALID [2022-04-27 15:09:10,481 INFO L290 TraceCheckUtils]: 18: Hoare triple {25151#(= main_~lk6~0 1)} assume !(0 != ~p1~0); {25151#(= main_~lk6~0 1)} is VALID [2022-04-27 15:09:10,481 INFO L290 TraceCheckUtils]: 19: Hoare triple {25151#(= main_~lk6~0 1)} assume !(0 != ~p2~0); {25151#(= main_~lk6~0 1)} is VALID [2022-04-27 15:09:10,481 INFO L290 TraceCheckUtils]: 20: Hoare triple {25151#(= main_~lk6~0 1)} assume !(0 != ~p3~0); {25151#(= main_~lk6~0 1)} is VALID [2022-04-27 15:09:10,482 INFO L290 TraceCheckUtils]: 21: Hoare triple {25151#(= main_~lk6~0 1)} assume !(0 != ~p4~0); {25151#(= main_~lk6~0 1)} is VALID [2022-04-27 15:09:10,482 INFO L290 TraceCheckUtils]: 22: Hoare triple {25151#(= main_~lk6~0 1)} assume !(0 != ~p5~0); {25151#(= main_~lk6~0 1)} is VALID [2022-04-27 15:09:10,482 INFO L290 TraceCheckUtils]: 23: Hoare triple {25151#(= main_~lk6~0 1)} assume 0 != ~p6~0; {25151#(= main_~lk6~0 1)} is VALID [2022-04-27 15:09:10,483 INFO L290 TraceCheckUtils]: 24: Hoare triple {25151#(= main_~lk6~0 1)} assume 1 != ~lk6~0; {25147#false} is VALID [2022-04-27 15:09:10,483 INFO L290 TraceCheckUtils]: 25: Hoare triple {25147#false} assume !false; {25147#false} is VALID [2022-04-27 15:09:10,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:09:10,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:09:10,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818031323] [2022-04-27 15:09:10,483 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818031323] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:09:10,483 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:09:10,483 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:09:10,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372812365] [2022-04-27 15:09:10,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:09:10,484 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-27 15:09:10,484 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:09:10,484 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:10,501 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:09:10,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:09:10,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:09:10,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:09:10,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:09:10,502 INFO L87 Difference]: Start difference. First operand 985 states and 1527 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:10,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:10,776 INFO L93 Difference]: Finished difference Result 1741 states and 2745 transitions. [2022-04-27 15:09:10,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:09:10,776 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-27 15:09:10,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:09:10,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:10,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 111 transitions. [2022-04-27 15:09:10,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:10,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 111 transitions. [2022-04-27 15:09:10,780 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 111 transitions. [2022-04-27 15:09:10,860 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:09:11,002 INFO L225 Difference]: With dead ends: 1741 [2022-04-27 15:09:11,002 INFO L226 Difference]: Without dead ends: 1739 [2022-04-27 15:09:11,004 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:09:11,006 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 133 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:09:11,006 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 73 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 15:09:11,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1739 states. [2022-04-27 15:09:11,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1739 to 1417. [2022-04-27 15:09:11,036 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:09:11,038 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1739 states. Second operand has 1417 states, 1413 states have (on average 1.5088464260438783) internal successors, (2132), 1413 states have internal predecessors, (2132), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:11,041 INFO L74 IsIncluded]: Start isIncluded. First operand 1739 states. Second operand has 1417 states, 1413 states have (on average 1.5088464260438783) internal successors, (2132), 1413 states have internal predecessors, (2132), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:11,043 INFO L87 Difference]: Start difference. First operand 1739 states. Second operand has 1417 states, 1413 states have (on average 1.5088464260438783) internal successors, (2132), 1413 states have internal predecessors, (2132), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:11,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:11,168 INFO L93 Difference]: Finished difference Result 1739 states and 2712 transitions. [2022-04-27 15:09:11,168 INFO L276 IsEmpty]: Start isEmpty. Operand 1739 states and 2712 transitions. [2022-04-27 15:09:11,171 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:09:11,172 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:09:11,174 INFO L74 IsIncluded]: Start isIncluded. First operand has 1417 states, 1413 states have (on average 1.5088464260438783) internal successors, (2132), 1413 states have internal predecessors, (2132), 2 states have call successors, (2), 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 1739 states. [2022-04-27 15:09:11,176 INFO L87 Difference]: Start difference. First operand has 1417 states, 1413 states have (on average 1.5088464260438783) internal successors, (2132), 1413 states have internal predecessors, (2132), 2 states have call successors, (2), 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 1739 states. [2022-04-27 15:09:11,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:11,293 INFO L93 Difference]: Finished difference Result 1739 states and 2712 transitions. [2022-04-27 15:09:11,294 INFO L276 IsEmpty]: Start isEmpty. Operand 1739 states and 2712 transitions. [2022-04-27 15:09:11,297 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:09:11,297 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:09:11,297 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:09:11,297 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:09:11,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1417 states, 1413 states have (on average 1.5088464260438783) internal successors, (2132), 1413 states have internal predecessors, (2132), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:11,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1417 states to 1417 states and 2135 transitions. [2022-04-27 15:09:11,385 INFO L78 Accepts]: Start accepts. Automaton has 1417 states and 2135 transitions. Word has length 26 [2022-04-27 15:09:11,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:09:11,385 INFO L495 AbstractCegarLoop]: Abstraction has 1417 states and 2135 transitions. [2022-04-27 15:09:11,385 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:11,385 INFO L276 IsEmpty]: Start isEmpty. Operand 1417 states and 2135 transitions. [2022-04-27 15:09:11,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-27 15:09:11,387 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:09:11,387 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:09:11,388 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-27 15:09:11,388 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:09:11,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:09:11,388 INFO L85 PathProgramCache]: Analyzing trace with hash 861958388, now seen corresponding path program 1 times [2022-04-27 15:09:11,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:09:11,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799340118] [2022-04-27 15:09:11,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:09:11,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:09:11,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:11,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:09:11,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:11,434 INFO L290 TraceCheckUtils]: 0: Hoare triple {31910#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {31904#true} is VALID [2022-04-27 15:09:11,434 INFO L290 TraceCheckUtils]: 1: Hoare triple {31904#true} assume true; {31904#true} is VALID [2022-04-27 15:09:11,434 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {31904#true} {31904#true} #200#return; {31904#true} is VALID [2022-04-27 15:09:11,435 INFO L272 TraceCheckUtils]: 0: Hoare triple {31904#true} call ULTIMATE.init(); {31910#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:09:11,438 INFO L290 TraceCheckUtils]: 1: Hoare triple {31910#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {31904#true} is VALID [2022-04-27 15:09:11,438 INFO L290 TraceCheckUtils]: 2: Hoare triple {31904#true} assume true; {31904#true} is VALID [2022-04-27 15:09:11,438 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31904#true} {31904#true} #200#return; {31904#true} is VALID [2022-04-27 15:09:11,438 INFO L272 TraceCheckUtils]: 4: Hoare triple {31904#true} call #t~ret15 := main(); {31904#true} is VALID [2022-04-27 15:09:11,438 INFO L290 TraceCheckUtils]: 5: Hoare triple {31904#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;havoc ~cond~0; {31904#true} is VALID [2022-04-27 15:09:11,438 INFO L290 TraceCheckUtils]: 6: Hoare triple {31904#true} assume !false;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~cond~0 := #t~nondet14;havoc #t~nondet14; {31904#true} is VALID [2022-04-27 15:09:11,438 INFO L290 TraceCheckUtils]: 7: Hoare triple {31904#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0; {31904#true} is VALID [2022-04-27 15:09:11,439 INFO L290 TraceCheckUtils]: 8: Hoare triple {31904#true} assume !(0 != ~p1~0); {31904#true} is VALID [2022-04-27 15:09:11,439 INFO L290 TraceCheckUtils]: 9: Hoare triple {31904#true} assume !(0 != ~p2~0); {31904#true} is VALID [2022-04-27 15:09:11,439 INFO L290 TraceCheckUtils]: 10: Hoare triple {31904#true} assume !(0 != ~p3~0); {31904#true} is VALID [2022-04-27 15:09:11,439 INFO L290 TraceCheckUtils]: 11: Hoare triple {31904#true} assume !(0 != ~p4~0); {31904#true} is VALID [2022-04-27 15:09:11,439 INFO L290 TraceCheckUtils]: 12: Hoare triple {31904#true} assume !(0 != ~p5~0); {31904#true} is VALID [2022-04-27 15:09:11,439 INFO L290 TraceCheckUtils]: 13: Hoare triple {31904#true} assume !(0 != ~p6~0); {31909#(= main_~p6~0 0)} is VALID [2022-04-27 15:09:11,440 INFO L290 TraceCheckUtils]: 14: Hoare triple {31909#(= main_~p6~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {31909#(= main_~p6~0 0)} is VALID [2022-04-27 15:09:11,440 INFO L290 TraceCheckUtils]: 15: Hoare triple {31909#(= main_~p6~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {31909#(= main_~p6~0 0)} is VALID [2022-04-27 15:09:11,440 INFO L290 TraceCheckUtils]: 16: Hoare triple {31909#(= main_~p6~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {31909#(= main_~p6~0 0)} is VALID [2022-04-27 15:09:11,440 INFO L290 TraceCheckUtils]: 17: Hoare triple {31909#(= main_~p6~0 0)} assume !(0 != ~p10~0); {31909#(= main_~p6~0 0)} is VALID [2022-04-27 15:09:11,441 INFO L290 TraceCheckUtils]: 18: Hoare triple {31909#(= main_~p6~0 0)} assume !(0 != ~p1~0); {31909#(= main_~p6~0 0)} is VALID [2022-04-27 15:09:11,441 INFO L290 TraceCheckUtils]: 19: Hoare triple {31909#(= main_~p6~0 0)} assume !(0 != ~p2~0); {31909#(= main_~p6~0 0)} is VALID [2022-04-27 15:09:11,441 INFO L290 TraceCheckUtils]: 20: Hoare triple {31909#(= main_~p6~0 0)} assume !(0 != ~p3~0); {31909#(= main_~p6~0 0)} is VALID [2022-04-27 15:09:11,442 INFO L290 TraceCheckUtils]: 21: Hoare triple {31909#(= main_~p6~0 0)} assume !(0 != ~p4~0); {31909#(= main_~p6~0 0)} is VALID [2022-04-27 15:09:11,442 INFO L290 TraceCheckUtils]: 22: Hoare triple {31909#(= main_~p6~0 0)} assume !(0 != ~p5~0); {31909#(= main_~p6~0 0)} is VALID [2022-04-27 15:09:11,442 INFO L290 TraceCheckUtils]: 23: Hoare triple {31909#(= main_~p6~0 0)} assume 0 != ~p6~0; {31905#false} is VALID [2022-04-27 15:09:11,442 INFO L290 TraceCheckUtils]: 24: Hoare triple {31905#false} assume 1 != ~lk6~0; {31905#false} is VALID [2022-04-27 15:09:11,442 INFO L290 TraceCheckUtils]: 25: Hoare triple {31905#false} assume !false; {31905#false} is VALID [2022-04-27 15:09:11,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:09:11,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:09:11,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799340118] [2022-04-27 15:09:11,445 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799340118] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:09:11,445 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:09:11,445 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:09:11,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186680723] [2022-04-27 15:09:11,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:09:11,446 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-27 15:09:11,446 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:09:11,446 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:11,462 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:09:11,463 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:09:11,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:09:11,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:09:11,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:09:11,463 INFO L87 Difference]: Start difference. First operand 1417 states and 2135 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:11,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:11,935 INFO L93 Difference]: Finished difference Result 3277 states and 4953 transitions. [2022-04-27 15:09:11,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:09:11,935 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-27 15:09:11,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:09:11,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:11,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 177 transitions. [2022-04-27 15:09:11,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:11,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 177 transitions. [2022-04-27 15:09:11,938 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 177 transitions. [2022-04-27 15:09:12,055 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 177 edges. 177 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:09:12,211 INFO L225 Difference]: With dead ends: 3277 [2022-04-27 15:09:12,211 INFO L226 Difference]: Without dead ends: 1899 [2022-04-27 15:09:12,213 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:09:12,213 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 118 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:09:12,213 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 105 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 15:09:12,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1899 states. [2022-04-27 15:09:12,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1899 to 1897. [2022-04-27 15:09:12,248 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:09:12,250 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1899 states. Second operand has 1897 states, 1893 states have (on average 1.4896988906497624) internal successors, (2820), 1893 states have internal predecessors, (2820), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:12,252 INFO L74 IsIncluded]: Start isIncluded. First operand 1899 states. Second operand has 1897 states, 1893 states have (on average 1.4896988906497624) internal successors, (2820), 1893 states have internal predecessors, (2820), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:12,253 INFO L87 Difference]: Start difference. First operand 1899 states. Second operand has 1897 states, 1893 states have (on average 1.4896988906497624) internal successors, (2820), 1893 states have internal predecessors, (2820), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:12,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:12,387 INFO L93 Difference]: Finished difference Result 1899 states and 2824 transitions. [2022-04-27 15:09:12,387 INFO L276 IsEmpty]: Start isEmpty. Operand 1899 states and 2824 transitions. [2022-04-27 15:09:12,389 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:09:12,389 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:09:12,392 INFO L74 IsIncluded]: Start isIncluded. First operand has 1897 states, 1893 states have (on average 1.4896988906497624) internal successors, (2820), 1893 states have internal predecessors, (2820), 2 states have call successors, (2), 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 1899 states. [2022-04-27 15:09:12,394 INFO L87 Difference]: Start difference. First operand has 1897 states, 1893 states have (on average 1.4896988906497624) internal successors, (2820), 1893 states have internal predecessors, (2820), 2 states have call successors, (2), 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 1899 states. [2022-04-27 15:09:12,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:12,532 INFO L93 Difference]: Finished difference Result 1899 states and 2824 transitions. [2022-04-27 15:09:12,532 INFO L276 IsEmpty]: Start isEmpty. Operand 1899 states and 2824 transitions. [2022-04-27 15:09:12,534 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:09:12,535 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:09:12,535 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:09:12,535 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:09:12,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1897 states, 1893 states have (on average 1.4896988906497624) internal successors, (2820), 1893 states have internal predecessors, (2820), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:12,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1897 states to 1897 states and 2823 transitions. [2022-04-27 15:09:12,690 INFO L78 Accepts]: Start accepts. Automaton has 1897 states and 2823 transitions. Word has length 26 [2022-04-27 15:09:12,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:09:12,691 INFO L495 AbstractCegarLoop]: Abstraction has 1897 states and 2823 transitions. [2022-04-27 15:09:12,691 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:12,691 INFO L276 IsEmpty]: Start isEmpty. Operand 1897 states and 2823 transitions. [2022-04-27 15:09:12,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-27 15:09:12,693 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:09:12,693 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:09:12,693 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-27 15:09:12,693 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:09:12,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:09:12,694 INFO L85 PathProgramCache]: Analyzing trace with hash 1962238590, now seen corresponding path program 1 times [2022-04-27 15:09:12,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:09:12,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146821632] [2022-04-27 15:09:12,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:09:12,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:09:12,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:12,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:09:12,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:12,732 INFO L290 TraceCheckUtils]: 0: Hoare triple {41068#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {41062#true} is VALID [2022-04-27 15:09:12,732 INFO L290 TraceCheckUtils]: 1: Hoare triple {41062#true} assume true; {41062#true} is VALID [2022-04-27 15:09:12,732 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {41062#true} {41062#true} #200#return; {41062#true} is VALID [2022-04-27 15:09:12,732 INFO L272 TraceCheckUtils]: 0: Hoare triple {41062#true} call ULTIMATE.init(); {41068#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:09:12,732 INFO L290 TraceCheckUtils]: 1: Hoare triple {41068#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {41062#true} is VALID [2022-04-27 15:09:12,732 INFO L290 TraceCheckUtils]: 2: Hoare triple {41062#true} assume true; {41062#true} is VALID [2022-04-27 15:09:12,732 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41062#true} {41062#true} #200#return; {41062#true} is VALID [2022-04-27 15:09:12,732 INFO L272 TraceCheckUtils]: 4: Hoare triple {41062#true} call #t~ret15 := main(); {41062#true} is VALID [2022-04-27 15:09:12,733 INFO L290 TraceCheckUtils]: 5: Hoare triple {41062#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;havoc ~cond~0; {41062#true} is VALID [2022-04-27 15:09:12,733 INFO L290 TraceCheckUtils]: 6: Hoare triple {41062#true} assume !false;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~cond~0 := #t~nondet14;havoc #t~nondet14; {41062#true} is VALID [2022-04-27 15:09:12,733 INFO L290 TraceCheckUtils]: 7: Hoare triple {41062#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0; {41062#true} is VALID [2022-04-27 15:09:12,733 INFO L290 TraceCheckUtils]: 8: Hoare triple {41062#true} assume !(0 != ~p1~0); {41062#true} is VALID [2022-04-27 15:09:12,733 INFO L290 TraceCheckUtils]: 9: Hoare triple {41062#true} assume !(0 != ~p2~0); {41062#true} is VALID [2022-04-27 15:09:12,733 INFO L290 TraceCheckUtils]: 10: Hoare triple {41062#true} assume !(0 != ~p3~0); {41062#true} is VALID [2022-04-27 15:09:12,733 INFO L290 TraceCheckUtils]: 11: Hoare triple {41062#true} assume !(0 != ~p4~0); {41062#true} is VALID [2022-04-27 15:09:12,733 INFO L290 TraceCheckUtils]: 12: Hoare triple {41062#true} assume !(0 != ~p5~0); {41062#true} is VALID [2022-04-27 15:09:12,733 INFO L290 TraceCheckUtils]: 13: Hoare triple {41062#true} assume 0 != ~p6~0;~lk6~0 := 1; {41067#(not (= main_~p6~0 0))} is VALID [2022-04-27 15:09:12,734 INFO L290 TraceCheckUtils]: 14: Hoare triple {41067#(not (= main_~p6~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {41067#(not (= main_~p6~0 0))} is VALID [2022-04-27 15:09:12,734 INFO L290 TraceCheckUtils]: 15: Hoare triple {41067#(not (= main_~p6~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {41067#(not (= main_~p6~0 0))} is VALID [2022-04-27 15:09:12,734 INFO L290 TraceCheckUtils]: 16: Hoare triple {41067#(not (= main_~p6~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {41067#(not (= main_~p6~0 0))} is VALID [2022-04-27 15:09:12,735 INFO L290 TraceCheckUtils]: 17: Hoare triple {41067#(not (= main_~p6~0 0))} assume !(0 != ~p10~0); {41067#(not (= main_~p6~0 0))} is VALID [2022-04-27 15:09:12,735 INFO L290 TraceCheckUtils]: 18: Hoare triple {41067#(not (= main_~p6~0 0))} assume !(0 != ~p1~0); {41067#(not (= main_~p6~0 0))} is VALID [2022-04-27 15:09:12,735 INFO L290 TraceCheckUtils]: 19: Hoare triple {41067#(not (= main_~p6~0 0))} assume !(0 != ~p2~0); {41067#(not (= main_~p6~0 0))} is VALID [2022-04-27 15:09:12,736 INFO L290 TraceCheckUtils]: 20: Hoare triple {41067#(not (= main_~p6~0 0))} assume !(0 != ~p3~0); {41067#(not (= main_~p6~0 0))} is VALID [2022-04-27 15:09:12,737 INFO L290 TraceCheckUtils]: 21: Hoare triple {41067#(not (= main_~p6~0 0))} assume !(0 != ~p4~0); {41067#(not (= main_~p6~0 0))} is VALID [2022-04-27 15:09:12,737 INFO L290 TraceCheckUtils]: 22: Hoare triple {41067#(not (= main_~p6~0 0))} assume !(0 != ~p5~0); {41067#(not (= main_~p6~0 0))} is VALID [2022-04-27 15:09:12,737 INFO L290 TraceCheckUtils]: 23: Hoare triple {41067#(not (= main_~p6~0 0))} assume !(0 != ~p6~0); {41063#false} is VALID [2022-04-27 15:09:12,741 INFO L290 TraceCheckUtils]: 24: Hoare triple {41063#false} assume 0 != ~p7~0; {41063#false} is VALID [2022-04-27 15:09:12,741 INFO L290 TraceCheckUtils]: 25: Hoare triple {41063#false} assume 1 != ~lk7~0; {41063#false} is VALID [2022-04-27 15:09:12,741 INFO L290 TraceCheckUtils]: 26: Hoare triple {41063#false} assume !false; {41063#false} is VALID [2022-04-27 15:09:12,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:09:12,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:09:12,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146821632] [2022-04-27 15:09:12,742 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146821632] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:09:12,742 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:09:12,742 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:09:12,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127203832] [2022-04-27 15:09:12,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:09:12,743 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-04-27 15:09:12,743 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:09:12,743 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:12,760 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:09:12,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:09:12,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:09:12,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:09:12,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:09:12,760 INFO L87 Difference]: Start difference. First operand 1897 states and 2823 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:13,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:13,219 INFO L93 Difference]: Finished difference Result 2845 states and 4217 transitions. [2022-04-27 15:09:13,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:09:13,219 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-04-27 15:09:13,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:09:13,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:13,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 172 transitions. [2022-04-27 15:09:13,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:13,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 172 transitions. [2022-04-27 15:09:13,223 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 172 transitions. [2022-04-27 15:09:13,338 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 172 edges. 172 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:09:13,449 INFO L225 Difference]: With dead ends: 2845 [2022-04-27 15:09:13,449 INFO L226 Difference]: Without dead ends: 1931 [2022-04-27 15:09:13,450 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:09:13,451 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 126 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:09:13,451 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 98 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 15:09:13,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1931 states. [2022-04-27 15:09:13,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1931 to 1929. [2022-04-27 15:09:13,490 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:09:13,493 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1931 states. Second operand has 1929 states, 1925 states have (on average 1.464935064935065) internal successors, (2820), 1925 states have internal predecessors, (2820), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:13,495 INFO L74 IsIncluded]: Start isIncluded. First operand 1931 states. Second operand has 1929 states, 1925 states have (on average 1.464935064935065) internal successors, (2820), 1925 states have internal predecessors, (2820), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:13,496 INFO L87 Difference]: Start difference. First operand 1931 states. Second operand has 1929 states, 1925 states have (on average 1.464935064935065) internal successors, (2820), 1925 states have internal predecessors, (2820), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:13,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:13,624 INFO L93 Difference]: Finished difference Result 1931 states and 2824 transitions. [2022-04-27 15:09:13,624 INFO L276 IsEmpty]: Start isEmpty. Operand 1931 states and 2824 transitions. [2022-04-27 15:09:13,626 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:09:13,626 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:09:13,629 INFO L74 IsIncluded]: Start isIncluded. First operand has 1929 states, 1925 states have (on average 1.464935064935065) internal successors, (2820), 1925 states have internal predecessors, (2820), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1931 states. [2022-04-27 15:09:13,631 INFO L87 Difference]: Start difference. First operand has 1929 states, 1925 states have (on average 1.464935064935065) internal successors, (2820), 1925 states have internal predecessors, (2820), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 1931 states. [2022-04-27 15:09:13,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:13,772 INFO L93 Difference]: Finished difference Result 1931 states and 2824 transitions. [2022-04-27 15:09:13,772 INFO L276 IsEmpty]: Start isEmpty. Operand 1931 states and 2824 transitions. [2022-04-27 15:09:13,774 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:09:13,774 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:09:13,774 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:09:13,774 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:09:13,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1929 states, 1925 states have (on average 1.464935064935065) internal successors, (2820), 1925 states have internal predecessors, (2820), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:13,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1929 states to 1929 states and 2823 transitions. [2022-04-27 15:09:13,917 INFO L78 Accepts]: Start accepts. Automaton has 1929 states and 2823 transitions. Word has length 27 [2022-04-27 15:09:13,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:09:13,917 INFO L495 AbstractCegarLoop]: Abstraction has 1929 states and 2823 transitions. [2022-04-27 15:09:13,917 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:13,917 INFO L276 IsEmpty]: Start isEmpty. Operand 1929 states and 2823 transitions. [2022-04-27 15:09:13,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-27 15:09:13,918 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:09:13,919 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:09:13,919 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-04-27 15:09:13,919 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:09:13,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:09:13,919 INFO L85 PathProgramCache]: Analyzing trace with hash 951121340, now seen corresponding path program 1 times [2022-04-27 15:09:13,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:09:13,919 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513026904] [2022-04-27 15:09:13,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:09:13,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:09:13,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:13,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:09:13,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:13,955 INFO L290 TraceCheckUtils]: 0: Hoare triple {49890#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {49884#true} is VALID [2022-04-27 15:09:13,955 INFO L290 TraceCheckUtils]: 1: Hoare triple {49884#true} assume true; {49884#true} is VALID [2022-04-27 15:09:13,955 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {49884#true} {49884#true} #200#return; {49884#true} is VALID [2022-04-27 15:09:13,956 INFO L272 TraceCheckUtils]: 0: Hoare triple {49884#true} call ULTIMATE.init(); {49890#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:09:13,956 INFO L290 TraceCheckUtils]: 1: Hoare triple {49890#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {49884#true} is VALID [2022-04-27 15:09:13,956 INFO L290 TraceCheckUtils]: 2: Hoare triple {49884#true} assume true; {49884#true} is VALID [2022-04-27 15:09:13,956 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {49884#true} {49884#true} #200#return; {49884#true} is VALID [2022-04-27 15:09:13,956 INFO L272 TraceCheckUtils]: 4: Hoare triple {49884#true} call #t~ret15 := main(); {49884#true} is VALID [2022-04-27 15:09:13,956 INFO L290 TraceCheckUtils]: 5: Hoare triple {49884#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;havoc ~cond~0; {49884#true} is VALID [2022-04-27 15:09:13,956 INFO L290 TraceCheckUtils]: 6: Hoare triple {49884#true} assume !false;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~cond~0 := #t~nondet14;havoc #t~nondet14; {49884#true} is VALID [2022-04-27 15:09:13,956 INFO L290 TraceCheckUtils]: 7: Hoare triple {49884#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0; {49884#true} is VALID [2022-04-27 15:09:13,956 INFO L290 TraceCheckUtils]: 8: Hoare triple {49884#true} assume !(0 != ~p1~0); {49884#true} is VALID [2022-04-27 15:09:13,956 INFO L290 TraceCheckUtils]: 9: Hoare triple {49884#true} assume !(0 != ~p2~0); {49884#true} is VALID [2022-04-27 15:09:13,957 INFO L290 TraceCheckUtils]: 10: Hoare triple {49884#true} assume !(0 != ~p3~0); {49884#true} is VALID [2022-04-27 15:09:13,957 INFO L290 TraceCheckUtils]: 11: Hoare triple {49884#true} assume !(0 != ~p4~0); {49884#true} is VALID [2022-04-27 15:09:13,957 INFO L290 TraceCheckUtils]: 12: Hoare triple {49884#true} assume !(0 != ~p5~0); {49884#true} is VALID [2022-04-27 15:09:13,957 INFO L290 TraceCheckUtils]: 13: Hoare triple {49884#true} assume !(0 != ~p6~0); {49884#true} is VALID [2022-04-27 15:09:13,957 INFO L290 TraceCheckUtils]: 14: Hoare triple {49884#true} assume 0 != ~p7~0;~lk7~0 := 1; {49889#(= main_~lk7~0 1)} is VALID [2022-04-27 15:09:13,957 INFO L290 TraceCheckUtils]: 15: Hoare triple {49889#(= main_~lk7~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {49889#(= main_~lk7~0 1)} is VALID [2022-04-27 15:09:13,958 INFO L290 TraceCheckUtils]: 16: Hoare triple {49889#(= main_~lk7~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {49889#(= main_~lk7~0 1)} is VALID [2022-04-27 15:09:13,958 INFO L290 TraceCheckUtils]: 17: Hoare triple {49889#(= main_~lk7~0 1)} assume !(0 != ~p10~0); {49889#(= main_~lk7~0 1)} is VALID [2022-04-27 15:09:13,958 INFO L290 TraceCheckUtils]: 18: Hoare triple {49889#(= main_~lk7~0 1)} assume !(0 != ~p1~0); {49889#(= main_~lk7~0 1)} is VALID [2022-04-27 15:09:13,958 INFO L290 TraceCheckUtils]: 19: Hoare triple {49889#(= main_~lk7~0 1)} assume !(0 != ~p2~0); {49889#(= main_~lk7~0 1)} is VALID [2022-04-27 15:09:13,959 INFO L290 TraceCheckUtils]: 20: Hoare triple {49889#(= main_~lk7~0 1)} assume !(0 != ~p3~0); {49889#(= main_~lk7~0 1)} is VALID [2022-04-27 15:09:13,959 INFO L290 TraceCheckUtils]: 21: Hoare triple {49889#(= main_~lk7~0 1)} assume !(0 != ~p4~0); {49889#(= main_~lk7~0 1)} is VALID [2022-04-27 15:09:13,959 INFO L290 TraceCheckUtils]: 22: Hoare triple {49889#(= main_~lk7~0 1)} assume !(0 != ~p5~0); {49889#(= main_~lk7~0 1)} is VALID [2022-04-27 15:09:13,960 INFO L290 TraceCheckUtils]: 23: Hoare triple {49889#(= main_~lk7~0 1)} assume !(0 != ~p6~0); {49889#(= main_~lk7~0 1)} is VALID [2022-04-27 15:09:13,960 INFO L290 TraceCheckUtils]: 24: Hoare triple {49889#(= main_~lk7~0 1)} assume 0 != ~p7~0; {49889#(= main_~lk7~0 1)} is VALID [2022-04-27 15:09:13,960 INFO L290 TraceCheckUtils]: 25: Hoare triple {49889#(= main_~lk7~0 1)} assume 1 != ~lk7~0; {49885#false} is VALID [2022-04-27 15:09:13,960 INFO L290 TraceCheckUtils]: 26: Hoare triple {49885#false} assume !false; {49885#false} is VALID [2022-04-27 15:09:13,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:09:13,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:09:13,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513026904] [2022-04-27 15:09:13,961 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513026904] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:09:13,961 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:09:13,961 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:09:13,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906827518] [2022-04-27 15:09:13,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:09:13,961 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-04-27 15:09:13,962 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:09:13,962 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:13,980 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:09:13,980 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:09:13,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:09:13,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:09:13,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:09:13,981 INFO L87 Difference]: Start difference. First operand 1929 states and 2823 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:14,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:14,599 INFO L93 Difference]: Finished difference Result 3341 states and 4969 transitions. [2022-04-27 15:09:14,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:09:14,600 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-04-27 15:09:14,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:09:14,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:14,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 107 transitions. [2022-04-27 15:09:14,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:14,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 107 transitions. [2022-04-27 15:09:14,602 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 107 transitions. [2022-04-27 15:09:14,692 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 107 edges. 107 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:09:15,128 INFO L225 Difference]: With dead ends: 3341 [2022-04-27 15:09:15,128 INFO L226 Difference]: Without dead ends: 3339 [2022-04-27 15:09:15,129 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:09:15,131 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 126 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:09:15,131 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 72 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 15:09:15,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3339 states. [2022-04-27 15:09:15,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3339 to 2825. [2022-04-27 15:09:15,188 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:09:15,192 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3339 states. Second operand has 2825 states, 2821 states have (on average 1.4193548387096775) internal successors, (4004), 2821 states have internal predecessors, (4004), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:15,195 INFO L74 IsIncluded]: Start isIncluded. First operand 3339 states. Second operand has 2825 states, 2821 states have (on average 1.4193548387096775) internal successors, (4004), 2821 states have internal predecessors, (4004), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:15,197 INFO L87 Difference]: Start difference. First operand 3339 states. Second operand has 2825 states, 2821 states have (on average 1.4193548387096775) internal successors, (4004), 2821 states have internal predecessors, (4004), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:15,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:15,505 INFO L93 Difference]: Finished difference Result 3339 states and 4904 transitions. [2022-04-27 15:09:15,505 INFO L276 IsEmpty]: Start isEmpty. Operand 3339 states and 4904 transitions. [2022-04-27 15:09:15,509 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:09:15,509 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:09:15,512 INFO L74 IsIncluded]: Start isIncluded. First operand has 2825 states, 2821 states have (on average 1.4193548387096775) internal successors, (4004), 2821 states have internal predecessors, (4004), 2 states have call successors, (2), 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 3339 states. [2022-04-27 15:09:15,515 INFO L87 Difference]: Start difference. First operand has 2825 states, 2821 states have (on average 1.4193548387096775) internal successors, (4004), 2821 states have internal predecessors, (4004), 2 states have call successors, (2), 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 3339 states. [2022-04-27 15:09:15,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:15,958 INFO L93 Difference]: Finished difference Result 3339 states and 4904 transitions. [2022-04-27 15:09:15,958 INFO L276 IsEmpty]: Start isEmpty. Operand 3339 states and 4904 transitions. [2022-04-27 15:09:15,962 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:09:15,962 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:09:15,962 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:09:15,962 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:09:15,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2825 states, 2821 states have (on average 1.4193548387096775) internal successors, (4004), 2821 states have internal predecessors, (4004), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:16,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2825 states to 2825 states and 4007 transitions. [2022-04-27 15:09:16,257 INFO L78 Accepts]: Start accepts. Automaton has 2825 states and 4007 transitions. Word has length 27 [2022-04-27 15:09:16,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:09:16,257 INFO L495 AbstractCegarLoop]: Abstraction has 2825 states and 4007 transitions. [2022-04-27 15:09:16,257 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:16,257 INFO L276 IsEmpty]: Start isEmpty. Operand 2825 states and 4007 transitions. [2022-04-27 15:09:16,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-27 15:09:16,259 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:09:16,259 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:09:16,260 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-04-27 15:09:16,260 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:09:16,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:09:16,260 INFO L85 PathProgramCache]: Analyzing trace with hash 364315326, now seen corresponding path program 1 times [2022-04-27 15:09:16,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:09:16,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690119159] [2022-04-27 15:09:16,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:09:16,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:09:16,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:16,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:09:16,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:16,293 INFO L290 TraceCheckUtils]: 0: Hoare triple {62952#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {62946#true} is VALID [2022-04-27 15:09:16,293 INFO L290 TraceCheckUtils]: 1: Hoare triple {62946#true} assume true; {62946#true} is VALID [2022-04-27 15:09:16,293 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {62946#true} {62946#true} #200#return; {62946#true} is VALID [2022-04-27 15:09:16,294 INFO L272 TraceCheckUtils]: 0: Hoare triple {62946#true} call ULTIMATE.init(); {62952#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:09:16,294 INFO L290 TraceCheckUtils]: 1: Hoare triple {62952#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {62946#true} is VALID [2022-04-27 15:09:16,294 INFO L290 TraceCheckUtils]: 2: Hoare triple {62946#true} assume true; {62946#true} is VALID [2022-04-27 15:09:16,294 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {62946#true} {62946#true} #200#return; {62946#true} is VALID [2022-04-27 15:09:16,294 INFO L272 TraceCheckUtils]: 4: Hoare triple {62946#true} call #t~ret15 := main(); {62946#true} is VALID [2022-04-27 15:09:16,294 INFO L290 TraceCheckUtils]: 5: Hoare triple {62946#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;havoc ~cond~0; {62946#true} is VALID [2022-04-27 15:09:16,294 INFO L290 TraceCheckUtils]: 6: Hoare triple {62946#true} assume !false;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~cond~0 := #t~nondet14;havoc #t~nondet14; {62946#true} is VALID [2022-04-27 15:09:16,294 INFO L290 TraceCheckUtils]: 7: Hoare triple {62946#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0; {62946#true} is VALID [2022-04-27 15:09:16,295 INFO L290 TraceCheckUtils]: 8: Hoare triple {62946#true} assume !(0 != ~p1~0); {62946#true} is VALID [2022-04-27 15:09:16,295 INFO L290 TraceCheckUtils]: 9: Hoare triple {62946#true} assume !(0 != ~p2~0); {62946#true} is VALID [2022-04-27 15:09:16,295 INFO L290 TraceCheckUtils]: 10: Hoare triple {62946#true} assume !(0 != ~p3~0); {62946#true} is VALID [2022-04-27 15:09:16,297 INFO L290 TraceCheckUtils]: 11: Hoare triple {62946#true} assume !(0 != ~p4~0); {62946#true} is VALID [2022-04-27 15:09:16,297 INFO L290 TraceCheckUtils]: 12: Hoare triple {62946#true} assume !(0 != ~p5~0); {62946#true} is VALID [2022-04-27 15:09:16,297 INFO L290 TraceCheckUtils]: 13: Hoare triple {62946#true} assume !(0 != ~p6~0); {62946#true} is VALID [2022-04-27 15:09:16,297 INFO L290 TraceCheckUtils]: 14: Hoare triple {62946#true} assume !(0 != ~p7~0); {62951#(= main_~p7~0 0)} is VALID [2022-04-27 15:09:16,297 INFO L290 TraceCheckUtils]: 15: Hoare triple {62951#(= main_~p7~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {62951#(= main_~p7~0 0)} is VALID [2022-04-27 15:09:16,298 INFO L290 TraceCheckUtils]: 16: Hoare triple {62951#(= main_~p7~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {62951#(= main_~p7~0 0)} is VALID [2022-04-27 15:09:16,299 INFO L290 TraceCheckUtils]: 17: Hoare triple {62951#(= main_~p7~0 0)} assume !(0 != ~p10~0); {62951#(= main_~p7~0 0)} is VALID [2022-04-27 15:09:16,299 INFO L290 TraceCheckUtils]: 18: Hoare triple {62951#(= main_~p7~0 0)} assume !(0 != ~p1~0); {62951#(= main_~p7~0 0)} is VALID [2022-04-27 15:09:16,299 INFO L290 TraceCheckUtils]: 19: Hoare triple {62951#(= main_~p7~0 0)} assume !(0 != ~p2~0); {62951#(= main_~p7~0 0)} is VALID [2022-04-27 15:09:16,300 INFO L290 TraceCheckUtils]: 20: Hoare triple {62951#(= main_~p7~0 0)} assume !(0 != ~p3~0); {62951#(= main_~p7~0 0)} is VALID [2022-04-27 15:09:16,300 INFO L290 TraceCheckUtils]: 21: Hoare triple {62951#(= main_~p7~0 0)} assume !(0 != ~p4~0); {62951#(= main_~p7~0 0)} is VALID [2022-04-27 15:09:16,301 INFO L290 TraceCheckUtils]: 22: Hoare triple {62951#(= main_~p7~0 0)} assume !(0 != ~p5~0); {62951#(= main_~p7~0 0)} is VALID [2022-04-27 15:09:16,301 INFO L290 TraceCheckUtils]: 23: Hoare triple {62951#(= main_~p7~0 0)} assume !(0 != ~p6~0); {62951#(= main_~p7~0 0)} is VALID [2022-04-27 15:09:16,302 INFO L290 TraceCheckUtils]: 24: Hoare triple {62951#(= main_~p7~0 0)} assume 0 != ~p7~0; {62947#false} is VALID [2022-04-27 15:09:16,302 INFO L290 TraceCheckUtils]: 25: Hoare triple {62947#false} assume 1 != ~lk7~0; {62947#false} is VALID [2022-04-27 15:09:16,302 INFO L290 TraceCheckUtils]: 26: Hoare triple {62947#false} assume !false; {62947#false} is VALID [2022-04-27 15:09:16,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:09:16,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:09:16,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690119159] [2022-04-27 15:09:16,302 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690119159] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:09:16,302 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:09:16,302 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:09:16,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697402701] [2022-04-27 15:09:16,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:09:16,303 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-04-27 15:09:16,304 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:09:16,304 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:16,320 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:09:16,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:09:16,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:09:16,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:09:16,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:09:16,321 INFO L87 Difference]: Start difference. First operand 2825 states and 4007 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:17,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:17,876 INFO L93 Difference]: Finished difference Result 6477 states and 9193 transitions. [2022-04-27 15:09:17,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:09:17,877 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-04-27 15:09:17,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:09:17,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:17,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 174 transitions. [2022-04-27 15:09:17,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:17,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 174 transitions. [2022-04-27 15:09:17,879 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 174 transitions. [2022-04-27 15:09:17,987 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 174 edges. 174 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:09:18,393 INFO L225 Difference]: With dead ends: 6477 [2022-04-27 15:09:18,394 INFO L226 Difference]: Without dead ends: 3723 [2022-04-27 15:09:18,398 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:09:18,398 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 112 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:09:18,399 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 107 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 15:09:18,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3723 states. [2022-04-27 15:09:18,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3723 to 3721. [2022-04-27 15:09:18,492 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:09:18,496 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3723 states. Second operand has 3721 states, 3717 states have (on average 1.3957492601560397) internal successors, (5188), 3717 states have internal predecessors, (5188), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:18,498 INFO L74 IsIncluded]: Start isIncluded. First operand 3723 states. Second operand has 3721 states, 3717 states have (on average 1.3957492601560397) internal successors, (5188), 3717 states have internal predecessors, (5188), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:18,501 INFO L87 Difference]: Start difference. First operand 3723 states. Second operand has 3721 states, 3717 states have (on average 1.3957492601560397) internal successors, (5188), 3717 states have internal predecessors, (5188), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:18,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:18,956 INFO L93 Difference]: Finished difference Result 3723 states and 5192 transitions. [2022-04-27 15:09:18,956 INFO L276 IsEmpty]: Start isEmpty. Operand 3723 states and 5192 transitions. [2022-04-27 15:09:18,959 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:09:18,959 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:09:18,963 INFO L74 IsIncluded]: Start isIncluded. First operand has 3721 states, 3717 states have (on average 1.3957492601560397) internal successors, (5188), 3717 states have internal predecessors, (5188), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 3723 states. [2022-04-27 15:09:18,964 INFO L87 Difference]: Start difference. First operand has 3721 states, 3717 states have (on average 1.3957492601560397) internal successors, (5188), 3717 states have internal predecessors, (5188), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 3723 states. [2022-04-27 15:09:19,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:19,344 INFO L93 Difference]: Finished difference Result 3723 states and 5192 transitions. [2022-04-27 15:09:19,344 INFO L276 IsEmpty]: Start isEmpty. Operand 3723 states and 5192 transitions. [2022-04-27 15:09:19,348 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:09:19,348 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:09:19,348 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:09:19,348 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:09:19,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3721 states, 3717 states have (on average 1.3957492601560397) internal successors, (5188), 3717 states have internal predecessors, (5188), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:19,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3721 states to 3721 states and 5191 transitions. [2022-04-27 15:09:19,751 INFO L78 Accepts]: Start accepts. Automaton has 3721 states and 5191 transitions. Word has length 27 [2022-04-27 15:09:19,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:09:19,751 INFO L495 AbstractCegarLoop]: Abstraction has 3721 states and 5191 transitions. [2022-04-27 15:09:19,751 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:19,751 INFO L276 IsEmpty]: Start isEmpty. Operand 3721 states and 5191 transitions. [2022-04-27 15:09:19,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-27 15:09:19,753 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:09:19,753 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:09:19,754 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-04-27 15:09:19,754 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:09:19,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:09:19,754 INFO L85 PathProgramCache]: Analyzing trace with hash -579794103, now seen corresponding path program 1 times [2022-04-27 15:09:19,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:09:19,754 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561693364] [2022-04-27 15:09:19,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:09:19,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:09:19,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:19,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:09:19,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:19,790 INFO L290 TraceCheckUtils]: 0: Hoare triple {80942#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {80936#true} is VALID [2022-04-27 15:09:19,790 INFO L290 TraceCheckUtils]: 1: Hoare triple {80936#true} assume true; {80936#true} is VALID [2022-04-27 15:09:19,790 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {80936#true} {80936#true} #200#return; {80936#true} is VALID [2022-04-27 15:09:19,791 INFO L272 TraceCheckUtils]: 0: Hoare triple {80936#true} call ULTIMATE.init(); {80942#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:09:19,791 INFO L290 TraceCheckUtils]: 1: Hoare triple {80942#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {80936#true} is VALID [2022-04-27 15:09:19,791 INFO L290 TraceCheckUtils]: 2: Hoare triple {80936#true} assume true; {80936#true} is VALID [2022-04-27 15:09:19,791 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {80936#true} {80936#true} #200#return; {80936#true} is VALID [2022-04-27 15:09:19,791 INFO L272 TraceCheckUtils]: 4: Hoare triple {80936#true} call #t~ret15 := main(); {80936#true} is VALID [2022-04-27 15:09:19,791 INFO L290 TraceCheckUtils]: 5: Hoare triple {80936#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;havoc ~cond~0; {80936#true} is VALID [2022-04-27 15:09:19,791 INFO L290 TraceCheckUtils]: 6: Hoare triple {80936#true} assume !false;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~cond~0 := #t~nondet14;havoc #t~nondet14; {80936#true} is VALID [2022-04-27 15:09:19,791 INFO L290 TraceCheckUtils]: 7: Hoare triple {80936#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0; {80936#true} is VALID [2022-04-27 15:09:19,791 INFO L290 TraceCheckUtils]: 8: Hoare triple {80936#true} assume !(0 != ~p1~0); {80936#true} is VALID [2022-04-27 15:09:19,791 INFO L290 TraceCheckUtils]: 9: Hoare triple {80936#true} assume !(0 != ~p2~0); {80936#true} is VALID [2022-04-27 15:09:19,792 INFO L290 TraceCheckUtils]: 10: Hoare triple {80936#true} assume !(0 != ~p3~0); {80936#true} is VALID [2022-04-27 15:09:19,792 INFO L290 TraceCheckUtils]: 11: Hoare triple {80936#true} assume !(0 != ~p4~0); {80936#true} is VALID [2022-04-27 15:09:19,792 INFO L290 TraceCheckUtils]: 12: Hoare triple {80936#true} assume !(0 != ~p5~0); {80936#true} is VALID [2022-04-27 15:09:19,792 INFO L290 TraceCheckUtils]: 13: Hoare triple {80936#true} assume !(0 != ~p6~0); {80936#true} is VALID [2022-04-27 15:09:19,792 INFO L290 TraceCheckUtils]: 14: Hoare triple {80936#true} assume 0 != ~p7~0;~lk7~0 := 1; {80941#(not (= main_~p7~0 0))} is VALID [2022-04-27 15:09:19,792 INFO L290 TraceCheckUtils]: 15: Hoare triple {80941#(not (= main_~p7~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {80941#(not (= main_~p7~0 0))} is VALID [2022-04-27 15:09:19,793 INFO L290 TraceCheckUtils]: 16: Hoare triple {80941#(not (= main_~p7~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {80941#(not (= main_~p7~0 0))} is VALID [2022-04-27 15:09:19,793 INFO L290 TraceCheckUtils]: 17: Hoare triple {80941#(not (= main_~p7~0 0))} assume !(0 != ~p10~0); {80941#(not (= main_~p7~0 0))} is VALID [2022-04-27 15:09:19,793 INFO L290 TraceCheckUtils]: 18: Hoare triple {80941#(not (= main_~p7~0 0))} assume !(0 != ~p1~0); {80941#(not (= main_~p7~0 0))} is VALID [2022-04-27 15:09:19,793 INFO L290 TraceCheckUtils]: 19: Hoare triple {80941#(not (= main_~p7~0 0))} assume !(0 != ~p2~0); {80941#(not (= main_~p7~0 0))} is VALID [2022-04-27 15:09:19,794 INFO L290 TraceCheckUtils]: 20: Hoare triple {80941#(not (= main_~p7~0 0))} assume !(0 != ~p3~0); {80941#(not (= main_~p7~0 0))} is VALID [2022-04-27 15:09:19,794 INFO L290 TraceCheckUtils]: 21: Hoare triple {80941#(not (= main_~p7~0 0))} assume !(0 != ~p4~0); {80941#(not (= main_~p7~0 0))} is VALID [2022-04-27 15:09:19,794 INFO L290 TraceCheckUtils]: 22: Hoare triple {80941#(not (= main_~p7~0 0))} assume !(0 != ~p5~0); {80941#(not (= main_~p7~0 0))} is VALID [2022-04-27 15:09:19,795 INFO L290 TraceCheckUtils]: 23: Hoare triple {80941#(not (= main_~p7~0 0))} assume !(0 != ~p6~0); {80941#(not (= main_~p7~0 0))} is VALID [2022-04-27 15:09:19,795 INFO L290 TraceCheckUtils]: 24: Hoare triple {80941#(not (= main_~p7~0 0))} assume !(0 != ~p7~0); {80937#false} is VALID [2022-04-27 15:09:19,795 INFO L290 TraceCheckUtils]: 25: Hoare triple {80937#false} assume 0 != ~p8~0; {80937#false} is VALID [2022-04-27 15:09:19,795 INFO L290 TraceCheckUtils]: 26: Hoare triple {80937#false} assume 1 != ~lk8~0; {80937#false} is VALID [2022-04-27 15:09:19,795 INFO L290 TraceCheckUtils]: 27: Hoare triple {80937#false} assume !false; {80937#false} is VALID [2022-04-27 15:09:19,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:09:19,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:09:19,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561693364] [2022-04-27 15:09:19,796 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561693364] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:09:19,796 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:09:19,796 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:09:19,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909081645] [2022-04-27 15:09:19,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:09:19,796 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-04-27 15:09:19,796 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:09:19,796 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:19,814 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:09:19,814 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:09:19,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:09:19,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:09:19,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:09:19,814 INFO L87 Difference]: Start difference. First operand 3721 states and 5191 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:20,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:20,896 INFO L93 Difference]: Finished difference Result 5581 states and 7753 transitions. [2022-04-27 15:09:20,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:09:20,896 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-04-27 15:09:20,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:09:20,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:20,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 169 transitions. [2022-04-27 15:09:20,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:20,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 169 transitions. [2022-04-27 15:09:20,899 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 169 transitions. [2022-04-27 15:09:21,023 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 169 edges. 169 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:09:21,531 INFO L225 Difference]: With dead ends: 5581 [2022-04-27 15:09:21,531 INFO L226 Difference]: Without dead ends: 3787 [2022-04-27 15:09:21,533 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:09:21,534 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 125 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:09:21,534 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 95 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 15:09:21,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3787 states. [2022-04-27 15:09:21,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3787 to 3785. [2022-04-27 15:09:21,604 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:09:21,609 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3787 states. Second operand has 3785 states, 3781 states have (on average 1.37212377677863) internal successors, (5188), 3781 states have internal predecessors, (5188), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:21,612 INFO L74 IsIncluded]: Start isIncluded. First operand 3787 states. Second operand has 3785 states, 3781 states have (on average 1.37212377677863) internal successors, (5188), 3781 states have internal predecessors, (5188), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:21,614 INFO L87 Difference]: Start difference. First operand 3787 states. Second operand has 3785 states, 3781 states have (on average 1.37212377677863) internal successors, (5188), 3781 states have internal predecessors, (5188), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:22,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:22,032 INFO L93 Difference]: Finished difference Result 3787 states and 5192 transitions. [2022-04-27 15:09:22,032 INFO L276 IsEmpty]: Start isEmpty. Operand 3787 states and 5192 transitions. [2022-04-27 15:09:22,036 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:09:22,037 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:09:22,041 INFO L74 IsIncluded]: Start isIncluded. First operand has 3785 states, 3781 states have (on average 1.37212377677863) internal successors, (5188), 3781 states have internal predecessors, (5188), 2 states have call successors, (2), 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 3787 states. [2022-04-27 15:09:22,043 INFO L87 Difference]: Start difference. First operand has 3785 states, 3781 states have (on average 1.37212377677863) internal successors, (5188), 3781 states have internal predecessors, (5188), 2 states have call successors, (2), 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 3787 states. [2022-04-27 15:09:22,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:22,471 INFO L93 Difference]: Finished difference Result 3787 states and 5192 transitions. [2022-04-27 15:09:22,471 INFO L276 IsEmpty]: Start isEmpty. Operand 3787 states and 5192 transitions. [2022-04-27 15:09:22,475 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:09:22,475 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:09:22,475 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:09:22,475 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:09:22,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3785 states, 3781 states have (on average 1.37212377677863) internal successors, (5188), 3781 states have internal predecessors, (5188), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:22,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3785 states to 3785 states and 5191 transitions. [2022-04-27 15:09:22,957 INFO L78 Accepts]: Start accepts. Automaton has 3785 states and 5191 transitions. Word has length 28 [2022-04-27 15:09:22,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:09:22,958 INFO L495 AbstractCegarLoop]: Abstraction has 3785 states and 5191 transitions. [2022-04-27 15:09:22,958 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:22,958 INFO L276 IsEmpty]: Start isEmpty. Operand 3785 states and 5191 transitions. [2022-04-27 15:09:22,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-27 15:09:22,960 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:09:22,960 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:09:22,960 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-04-27 15:09:22,960 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:09:22,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:09:22,961 INFO L85 PathProgramCache]: Analyzing trace with hash -1590911353, now seen corresponding path program 1 times [2022-04-27 15:09:22,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:09:22,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496220293] [2022-04-27 15:09:22,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:09:22,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:09:22,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:22,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:09:22,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:22,997 INFO L290 TraceCheckUtils]: 0: Hoare triple {98228#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {98222#true} is VALID [2022-04-27 15:09:22,997 INFO L290 TraceCheckUtils]: 1: Hoare triple {98222#true} assume true; {98222#true} is VALID [2022-04-27 15:09:22,997 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {98222#true} {98222#true} #200#return; {98222#true} is VALID [2022-04-27 15:09:22,999 INFO L272 TraceCheckUtils]: 0: Hoare triple {98222#true} call ULTIMATE.init(); {98228#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:09:22,999 INFO L290 TraceCheckUtils]: 1: Hoare triple {98228#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {98222#true} is VALID [2022-04-27 15:09:22,999 INFO L290 TraceCheckUtils]: 2: Hoare triple {98222#true} assume true; {98222#true} is VALID [2022-04-27 15:09:22,999 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {98222#true} {98222#true} #200#return; {98222#true} is VALID [2022-04-27 15:09:22,999 INFO L272 TraceCheckUtils]: 4: Hoare triple {98222#true} call #t~ret15 := main(); {98222#true} is VALID [2022-04-27 15:09:23,000 INFO L290 TraceCheckUtils]: 5: Hoare triple {98222#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;havoc ~cond~0; {98222#true} is VALID [2022-04-27 15:09:23,000 INFO L290 TraceCheckUtils]: 6: Hoare triple {98222#true} assume !false;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~cond~0 := #t~nondet14;havoc #t~nondet14; {98222#true} is VALID [2022-04-27 15:09:23,000 INFO L290 TraceCheckUtils]: 7: Hoare triple {98222#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0; {98222#true} is VALID [2022-04-27 15:09:23,000 INFO L290 TraceCheckUtils]: 8: Hoare triple {98222#true} assume !(0 != ~p1~0); {98222#true} is VALID [2022-04-27 15:09:23,000 INFO L290 TraceCheckUtils]: 9: Hoare triple {98222#true} assume !(0 != ~p2~0); {98222#true} is VALID [2022-04-27 15:09:23,000 INFO L290 TraceCheckUtils]: 10: Hoare triple {98222#true} assume !(0 != ~p3~0); {98222#true} is VALID [2022-04-27 15:09:23,000 INFO L290 TraceCheckUtils]: 11: Hoare triple {98222#true} assume !(0 != ~p4~0); {98222#true} is VALID [2022-04-27 15:09:23,000 INFO L290 TraceCheckUtils]: 12: Hoare triple {98222#true} assume !(0 != ~p5~0); {98222#true} is VALID [2022-04-27 15:09:23,000 INFO L290 TraceCheckUtils]: 13: Hoare triple {98222#true} assume !(0 != ~p6~0); {98222#true} is VALID [2022-04-27 15:09:23,000 INFO L290 TraceCheckUtils]: 14: Hoare triple {98222#true} assume !(0 != ~p7~0); {98222#true} is VALID [2022-04-27 15:09:23,000 INFO L290 TraceCheckUtils]: 15: Hoare triple {98222#true} assume 0 != ~p8~0;~lk8~0 := 1; {98227#(= main_~lk8~0 1)} is VALID [2022-04-27 15:09:23,001 INFO L290 TraceCheckUtils]: 16: Hoare triple {98227#(= main_~lk8~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {98227#(= main_~lk8~0 1)} is VALID [2022-04-27 15:09:23,001 INFO L290 TraceCheckUtils]: 17: Hoare triple {98227#(= main_~lk8~0 1)} assume !(0 != ~p10~0); {98227#(= main_~lk8~0 1)} is VALID [2022-04-27 15:09:23,001 INFO L290 TraceCheckUtils]: 18: Hoare triple {98227#(= main_~lk8~0 1)} assume !(0 != ~p1~0); {98227#(= main_~lk8~0 1)} is VALID [2022-04-27 15:09:23,002 INFO L290 TraceCheckUtils]: 19: Hoare triple {98227#(= main_~lk8~0 1)} assume !(0 != ~p2~0); {98227#(= main_~lk8~0 1)} is VALID [2022-04-27 15:09:23,002 INFO L290 TraceCheckUtils]: 20: Hoare triple {98227#(= main_~lk8~0 1)} assume !(0 != ~p3~0); {98227#(= main_~lk8~0 1)} is VALID [2022-04-27 15:09:23,002 INFO L290 TraceCheckUtils]: 21: Hoare triple {98227#(= main_~lk8~0 1)} assume !(0 != ~p4~0); {98227#(= main_~lk8~0 1)} is VALID [2022-04-27 15:09:23,003 INFO L290 TraceCheckUtils]: 22: Hoare triple {98227#(= main_~lk8~0 1)} assume !(0 != ~p5~0); {98227#(= main_~lk8~0 1)} is VALID [2022-04-27 15:09:23,003 INFO L290 TraceCheckUtils]: 23: Hoare triple {98227#(= main_~lk8~0 1)} assume !(0 != ~p6~0); {98227#(= main_~lk8~0 1)} is VALID [2022-04-27 15:09:23,003 INFO L290 TraceCheckUtils]: 24: Hoare triple {98227#(= main_~lk8~0 1)} assume !(0 != ~p7~0); {98227#(= main_~lk8~0 1)} is VALID [2022-04-27 15:09:23,003 INFO L290 TraceCheckUtils]: 25: Hoare triple {98227#(= main_~lk8~0 1)} assume 0 != ~p8~0; {98227#(= main_~lk8~0 1)} is VALID [2022-04-27 15:09:23,004 INFO L290 TraceCheckUtils]: 26: Hoare triple {98227#(= main_~lk8~0 1)} assume 1 != ~lk8~0; {98223#false} is VALID [2022-04-27 15:09:23,004 INFO L290 TraceCheckUtils]: 27: Hoare triple {98223#false} assume !false; {98223#false} is VALID [2022-04-27 15:09:23,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:09:23,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:09:23,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496220293] [2022-04-27 15:09:23,005 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496220293] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:09:23,005 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:09:23,005 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:09:23,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498339952] [2022-04-27 15:09:23,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:09:23,006 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-04-27 15:09:23,006 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:09:23,006 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:23,025 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:09:23,025 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:09:23,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:09:23,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:09:23,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:09:23,026 INFO L87 Difference]: Start difference. First operand 3785 states and 5191 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:24,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:24,374 INFO L93 Difference]: Finished difference Result 6413 states and 8905 transitions. [2022-04-27 15:09:24,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:09:24,375 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-04-27 15:09:24,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:09:24,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:24,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 103 transitions. [2022-04-27 15:09:24,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:24,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 103 transitions. [2022-04-27 15:09:24,377 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 103 transitions. [2022-04-27 15:09:24,445 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:09:25,695 INFO L225 Difference]: With dead ends: 6413 [2022-04-27 15:09:25,696 INFO L226 Difference]: Without dead ends: 6411 [2022-04-27 15:09:25,697 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:09:25,697 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 119 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:09:25,697 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 71 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 15:09:25,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6411 states. [2022-04-27 15:09:25,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6411 to 5641. [2022-04-27 15:09:25,791 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:09:25,797 INFO L82 GeneralOperation]: Start isEquivalent. First operand 6411 states. Second operand has 5641 states, 5637 states have (on average 1.329075749512152) internal successors, (7492), 5637 states have internal predecessors, (7492), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:25,802 INFO L74 IsIncluded]: Start isIncluded. First operand 6411 states. Second operand has 5641 states, 5637 states have (on average 1.329075749512152) internal successors, (7492), 5637 states have internal predecessors, (7492), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:25,807 INFO L87 Difference]: Start difference. First operand 6411 states. Second operand has 5641 states, 5637 states have (on average 1.329075749512152) internal successors, (7492), 5637 states have internal predecessors, (7492), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:27,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:27,014 INFO L93 Difference]: Finished difference Result 6411 states and 8776 transitions. [2022-04-27 15:09:27,014 INFO L276 IsEmpty]: Start isEmpty. Operand 6411 states and 8776 transitions. [2022-04-27 15:09:27,020 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:09:27,020 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:09:27,025 INFO L74 IsIncluded]: Start isIncluded. First operand has 5641 states, 5637 states have (on average 1.329075749512152) internal successors, (7492), 5637 states have internal predecessors, (7492), 2 states have call successors, (2), 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 6411 states. [2022-04-27 15:09:27,028 INFO L87 Difference]: Start difference. First operand has 5641 states, 5637 states have (on average 1.329075749512152) internal successors, (7492), 5637 states have internal predecessors, (7492), 2 states have call successors, (2), 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 6411 states. [2022-04-27 15:09:28,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:28,246 INFO L93 Difference]: Finished difference Result 6411 states and 8776 transitions. [2022-04-27 15:09:28,246 INFO L276 IsEmpty]: Start isEmpty. Operand 6411 states and 8776 transitions. [2022-04-27 15:09:28,252 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:09:28,252 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:09:28,252 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:09:28,252 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:09:28,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5641 states, 5637 states have (on average 1.329075749512152) internal successors, (7492), 5637 states have internal predecessors, (7492), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:29,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5641 states to 5641 states and 7495 transitions. [2022-04-27 15:09:29,291 INFO L78 Accepts]: Start accepts. Automaton has 5641 states and 7495 transitions. Word has length 28 [2022-04-27 15:09:29,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:09:29,291 INFO L495 AbstractCegarLoop]: Abstraction has 5641 states and 7495 transitions. [2022-04-27 15:09:29,291 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:29,291 INFO L276 IsEmpty]: Start isEmpty. Operand 5641 states and 7495 transitions. [2022-04-27 15:09:29,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-27 15:09:29,294 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:09:29,294 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:09:29,294 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-04-27 15:09:29,294 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:09:29,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:09:29,294 INFO L85 PathProgramCache]: Analyzing trace with hash 2117249929, now seen corresponding path program 1 times [2022-04-27 15:09:29,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:09:29,295 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812554995] [2022-04-27 15:09:29,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:09:29,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:09:29,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:29,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:09:29,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:29,325 INFO L290 TraceCheckUtils]: 0: Hoare triple {123514#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {123508#true} is VALID [2022-04-27 15:09:29,325 INFO L290 TraceCheckUtils]: 1: Hoare triple {123508#true} assume true; {123508#true} is VALID [2022-04-27 15:09:29,325 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {123508#true} {123508#true} #200#return; {123508#true} is VALID [2022-04-27 15:09:29,325 INFO L272 TraceCheckUtils]: 0: Hoare triple {123508#true} call ULTIMATE.init(); {123514#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:09:29,326 INFO L290 TraceCheckUtils]: 1: Hoare triple {123514#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {123508#true} is VALID [2022-04-27 15:09:29,326 INFO L290 TraceCheckUtils]: 2: Hoare triple {123508#true} assume true; {123508#true} is VALID [2022-04-27 15:09:29,326 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {123508#true} {123508#true} #200#return; {123508#true} is VALID [2022-04-27 15:09:29,326 INFO L272 TraceCheckUtils]: 4: Hoare triple {123508#true} call #t~ret15 := main(); {123508#true} is VALID [2022-04-27 15:09:29,326 INFO L290 TraceCheckUtils]: 5: Hoare triple {123508#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;havoc ~cond~0; {123508#true} is VALID [2022-04-27 15:09:29,326 INFO L290 TraceCheckUtils]: 6: Hoare triple {123508#true} assume !false;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~cond~0 := #t~nondet14;havoc #t~nondet14; {123508#true} is VALID [2022-04-27 15:09:29,326 INFO L290 TraceCheckUtils]: 7: Hoare triple {123508#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0; {123508#true} is VALID [2022-04-27 15:09:29,326 INFO L290 TraceCheckUtils]: 8: Hoare triple {123508#true} assume !(0 != ~p1~0); {123508#true} is VALID [2022-04-27 15:09:29,326 INFO L290 TraceCheckUtils]: 9: Hoare triple {123508#true} assume !(0 != ~p2~0); {123508#true} is VALID [2022-04-27 15:09:29,326 INFO L290 TraceCheckUtils]: 10: Hoare triple {123508#true} assume !(0 != ~p3~0); {123508#true} is VALID [2022-04-27 15:09:29,326 INFO L290 TraceCheckUtils]: 11: Hoare triple {123508#true} assume !(0 != ~p4~0); {123508#true} is VALID [2022-04-27 15:09:29,326 INFO L290 TraceCheckUtils]: 12: Hoare triple {123508#true} assume !(0 != ~p5~0); {123508#true} is VALID [2022-04-27 15:09:29,327 INFO L290 TraceCheckUtils]: 13: Hoare triple {123508#true} assume !(0 != ~p6~0); {123508#true} is VALID [2022-04-27 15:09:29,327 INFO L290 TraceCheckUtils]: 14: Hoare triple {123508#true} assume !(0 != ~p7~0); {123508#true} is VALID [2022-04-27 15:09:29,327 INFO L290 TraceCheckUtils]: 15: Hoare triple {123508#true} assume !(0 != ~p8~0); {123513#(= main_~p8~0 0)} is VALID [2022-04-27 15:09:29,327 INFO L290 TraceCheckUtils]: 16: Hoare triple {123513#(= main_~p8~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {123513#(= main_~p8~0 0)} is VALID [2022-04-27 15:09:29,327 INFO L290 TraceCheckUtils]: 17: Hoare triple {123513#(= main_~p8~0 0)} assume !(0 != ~p10~0); {123513#(= main_~p8~0 0)} is VALID [2022-04-27 15:09:29,328 INFO L290 TraceCheckUtils]: 18: Hoare triple {123513#(= main_~p8~0 0)} assume !(0 != ~p1~0); {123513#(= main_~p8~0 0)} is VALID [2022-04-27 15:09:29,328 INFO L290 TraceCheckUtils]: 19: Hoare triple {123513#(= main_~p8~0 0)} assume !(0 != ~p2~0); {123513#(= main_~p8~0 0)} is VALID [2022-04-27 15:09:29,328 INFO L290 TraceCheckUtils]: 20: Hoare triple {123513#(= main_~p8~0 0)} assume !(0 != ~p3~0); {123513#(= main_~p8~0 0)} is VALID [2022-04-27 15:09:29,329 INFO L290 TraceCheckUtils]: 21: Hoare triple {123513#(= main_~p8~0 0)} assume !(0 != ~p4~0); {123513#(= main_~p8~0 0)} is VALID [2022-04-27 15:09:29,329 INFO L290 TraceCheckUtils]: 22: Hoare triple {123513#(= main_~p8~0 0)} assume !(0 != ~p5~0); {123513#(= main_~p8~0 0)} is VALID [2022-04-27 15:09:29,329 INFO L290 TraceCheckUtils]: 23: Hoare triple {123513#(= main_~p8~0 0)} assume !(0 != ~p6~0); {123513#(= main_~p8~0 0)} is VALID [2022-04-27 15:09:29,329 INFO L290 TraceCheckUtils]: 24: Hoare triple {123513#(= main_~p8~0 0)} assume !(0 != ~p7~0); {123513#(= main_~p8~0 0)} is VALID [2022-04-27 15:09:29,330 INFO L290 TraceCheckUtils]: 25: Hoare triple {123513#(= main_~p8~0 0)} assume 0 != ~p8~0; {123509#false} is VALID [2022-04-27 15:09:29,330 INFO L290 TraceCheckUtils]: 26: Hoare triple {123509#false} assume 1 != ~lk8~0; {123509#false} is VALID [2022-04-27 15:09:29,330 INFO L290 TraceCheckUtils]: 27: Hoare triple {123509#false} assume !false; {123509#false} is VALID [2022-04-27 15:09:29,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:09:29,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:09:29,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812554995] [2022-04-27 15:09:29,330 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812554995] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:09:29,330 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:09:29,330 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:09:29,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493665469] [2022-04-27 15:09:29,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:09:29,331 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-04-27 15:09:29,331 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:09:29,331 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:29,348 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:09:29,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:09:29,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:09:29,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:09:29,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:09:29,349 INFO L87 Difference]: Start difference. First operand 5641 states and 7495 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:34,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:34,212 INFO L93 Difference]: Finished difference Result 12813 states and 16969 transitions. [2022-04-27 15:09:34,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:09:34,212 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-04-27 15:09:34,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:09:34,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:34,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 171 transitions. [2022-04-27 15:09:34,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:34,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 171 transitions. [2022-04-27 15:09:34,215 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 171 transitions. [2022-04-27 15:09:34,347 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 171 edges. 171 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:09:36,014 INFO L225 Difference]: With dead ends: 12813 [2022-04-27 15:09:36,014 INFO L226 Difference]: Without dead ends: 7307 [2022-04-27 15:09:36,019 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:09:36,019 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 106 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:09:36,019 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 109 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 15:09:36,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7307 states. [2022-04-27 15:09:36,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7307 to 7305. [2022-04-27 15:09:36,147 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:09:36,155 INFO L82 GeneralOperation]: Start isEquivalent. First operand 7307 states. Second operand has 7305 states, 7301 states have (on average 1.297904396657992) internal successors, (9476), 7301 states have internal predecessors, (9476), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:36,163 INFO L74 IsIncluded]: Start isIncluded. First operand 7307 states. Second operand has 7305 states, 7301 states have (on average 1.297904396657992) internal successors, (9476), 7301 states have internal predecessors, (9476), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:36,172 INFO L87 Difference]: Start difference. First operand 7307 states. Second operand has 7305 states, 7301 states have (on average 1.297904396657992) internal successors, (9476), 7301 states have internal predecessors, (9476), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:37,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:37,603 INFO L93 Difference]: Finished difference Result 7307 states and 9480 transitions. [2022-04-27 15:09:37,603 INFO L276 IsEmpty]: Start isEmpty. Operand 7307 states and 9480 transitions. [2022-04-27 15:09:37,609 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:09:37,609 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:09:37,615 INFO L74 IsIncluded]: Start isIncluded. First operand has 7305 states, 7301 states have (on average 1.297904396657992) internal successors, (9476), 7301 states have internal predecessors, (9476), 2 states have call successors, (2), 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 7307 states. [2022-04-27 15:09:37,620 INFO L87 Difference]: Start difference. First operand has 7305 states, 7301 states have (on average 1.297904396657992) internal successors, (9476), 7301 states have internal predecessors, (9476), 2 states have call successors, (2), 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 7307 states. [2022-04-27 15:09:39,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:39,181 INFO L93 Difference]: Finished difference Result 7307 states and 9480 transitions. [2022-04-27 15:09:39,182 INFO L276 IsEmpty]: Start isEmpty. Operand 7307 states and 9480 transitions. [2022-04-27 15:09:39,188 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:09:39,189 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:09:39,189 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:09:39,189 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:09:39,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7305 states, 7301 states have (on average 1.297904396657992) internal successors, (9476), 7301 states have internal predecessors, (9476), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:40,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7305 states to 7305 states and 9479 transitions. [2022-04-27 15:09:40,873 INFO L78 Accepts]: Start accepts. Automaton has 7305 states and 9479 transitions. Word has length 28 [2022-04-27 15:09:40,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:09:40,873 INFO L495 AbstractCegarLoop]: Abstraction has 7305 states and 9479 transitions. [2022-04-27 15:09:40,873 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:40,873 INFO L276 IsEmpty]: Start isEmpty. Operand 7305 states and 9479 transitions. [2022-04-27 15:09:40,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-27 15:09:40,876 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:09:40,876 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:09:40,876 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-04-27 15:09:40,876 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:09:40,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:09:40,877 INFO L85 PathProgramCache]: Analyzing trace with hash -2073395917, now seen corresponding path program 1 times [2022-04-27 15:09:40,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:09:40,877 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137126763] [2022-04-27 15:09:40,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:09:40,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:09:40,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:40,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:09:40,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:40,917 INFO L290 TraceCheckUtils]: 0: Hoare triple {158912#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {158906#true} is VALID [2022-04-27 15:09:40,917 INFO L290 TraceCheckUtils]: 1: Hoare triple {158906#true} assume true; {158906#true} is VALID [2022-04-27 15:09:40,917 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {158906#true} {158906#true} #200#return; {158906#true} is VALID [2022-04-27 15:09:40,918 INFO L272 TraceCheckUtils]: 0: Hoare triple {158906#true} call ULTIMATE.init(); {158912#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:09:40,918 INFO L290 TraceCheckUtils]: 1: Hoare triple {158912#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {158906#true} is VALID [2022-04-27 15:09:40,918 INFO L290 TraceCheckUtils]: 2: Hoare triple {158906#true} assume true; {158906#true} is VALID [2022-04-27 15:09:40,918 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {158906#true} {158906#true} #200#return; {158906#true} is VALID [2022-04-27 15:09:40,918 INFO L272 TraceCheckUtils]: 4: Hoare triple {158906#true} call #t~ret15 := main(); {158906#true} is VALID [2022-04-27 15:09:40,918 INFO L290 TraceCheckUtils]: 5: Hoare triple {158906#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;havoc ~cond~0; {158906#true} is VALID [2022-04-27 15:09:40,918 INFO L290 TraceCheckUtils]: 6: Hoare triple {158906#true} assume !false;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~cond~0 := #t~nondet14;havoc #t~nondet14; {158906#true} is VALID [2022-04-27 15:09:40,918 INFO L290 TraceCheckUtils]: 7: Hoare triple {158906#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0; {158906#true} is VALID [2022-04-27 15:09:40,919 INFO L290 TraceCheckUtils]: 8: Hoare triple {158906#true} assume !(0 != ~p1~0); {158906#true} is VALID [2022-04-27 15:09:40,919 INFO L290 TraceCheckUtils]: 9: Hoare triple {158906#true} assume !(0 != ~p2~0); {158906#true} is VALID [2022-04-27 15:09:40,919 INFO L290 TraceCheckUtils]: 10: Hoare triple {158906#true} assume !(0 != ~p3~0); {158906#true} is VALID [2022-04-27 15:09:40,919 INFO L290 TraceCheckUtils]: 11: Hoare triple {158906#true} assume !(0 != ~p4~0); {158906#true} is VALID [2022-04-27 15:09:40,919 INFO L290 TraceCheckUtils]: 12: Hoare triple {158906#true} assume !(0 != ~p5~0); {158906#true} is VALID [2022-04-27 15:09:40,919 INFO L290 TraceCheckUtils]: 13: Hoare triple {158906#true} assume !(0 != ~p6~0); {158906#true} is VALID [2022-04-27 15:09:40,919 INFO L290 TraceCheckUtils]: 14: Hoare triple {158906#true} assume !(0 != ~p7~0); {158906#true} is VALID [2022-04-27 15:09:40,920 INFO L290 TraceCheckUtils]: 15: Hoare triple {158906#true} assume 0 != ~p8~0;~lk8~0 := 1; {158911#(not (= main_~p8~0 0))} is VALID [2022-04-27 15:09:40,920 INFO L290 TraceCheckUtils]: 16: Hoare triple {158911#(not (= main_~p8~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {158911#(not (= main_~p8~0 0))} is VALID [2022-04-27 15:09:40,920 INFO L290 TraceCheckUtils]: 17: Hoare triple {158911#(not (= main_~p8~0 0))} assume !(0 != ~p10~0); {158911#(not (= main_~p8~0 0))} is VALID [2022-04-27 15:09:40,921 INFO L290 TraceCheckUtils]: 18: Hoare triple {158911#(not (= main_~p8~0 0))} assume !(0 != ~p1~0); {158911#(not (= main_~p8~0 0))} is VALID [2022-04-27 15:09:40,921 INFO L290 TraceCheckUtils]: 19: Hoare triple {158911#(not (= main_~p8~0 0))} assume !(0 != ~p2~0); {158911#(not (= main_~p8~0 0))} is VALID [2022-04-27 15:09:40,921 INFO L290 TraceCheckUtils]: 20: Hoare triple {158911#(not (= main_~p8~0 0))} assume !(0 != ~p3~0); {158911#(not (= main_~p8~0 0))} is VALID [2022-04-27 15:09:40,921 INFO L290 TraceCheckUtils]: 21: Hoare triple {158911#(not (= main_~p8~0 0))} assume !(0 != ~p4~0); {158911#(not (= main_~p8~0 0))} is VALID [2022-04-27 15:09:40,922 INFO L290 TraceCheckUtils]: 22: Hoare triple {158911#(not (= main_~p8~0 0))} assume !(0 != ~p5~0); {158911#(not (= main_~p8~0 0))} is VALID [2022-04-27 15:09:40,922 INFO L290 TraceCheckUtils]: 23: Hoare triple {158911#(not (= main_~p8~0 0))} assume !(0 != ~p6~0); {158911#(not (= main_~p8~0 0))} is VALID [2022-04-27 15:09:40,922 INFO L290 TraceCheckUtils]: 24: Hoare triple {158911#(not (= main_~p8~0 0))} assume !(0 != ~p7~0); {158911#(not (= main_~p8~0 0))} is VALID [2022-04-27 15:09:40,923 INFO L290 TraceCheckUtils]: 25: Hoare triple {158911#(not (= main_~p8~0 0))} assume !(0 != ~p8~0); {158907#false} is VALID [2022-04-27 15:09:40,923 INFO L290 TraceCheckUtils]: 26: Hoare triple {158907#false} assume 0 != ~p9~0; {158907#false} is VALID [2022-04-27 15:09:40,923 INFO L290 TraceCheckUtils]: 27: Hoare triple {158907#false} assume 1 != ~lk9~0; {158907#false} is VALID [2022-04-27 15:09:40,923 INFO L290 TraceCheckUtils]: 28: Hoare triple {158907#false} assume !false; {158907#false} is VALID [2022-04-27 15:09:40,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:09:40,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:09:40,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137126763] [2022-04-27 15:09:40,923 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137126763] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:09:40,923 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:09:40,923 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:09:40,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124302865] [2022-04-27 15:09:40,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:09:40,924 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-04-27 15:09:40,924 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:09:40,924 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:40,949 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:09:40,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:09:40,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:09:40,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:09:40,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:09:40,950 INFO L87 Difference]: Start difference. First operand 7305 states and 9479 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:44,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:44,284 INFO L93 Difference]: Finished difference Result 10957 states and 14153 transitions. [2022-04-27 15:09:44,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:09:44,284 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-04-27 15:09:44,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:09:44,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:44,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 166 transitions. [2022-04-27 15:09:44,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:44,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 166 transitions. [2022-04-27 15:09:44,286 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 166 transitions. [2022-04-27 15:09:44,422 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 166 edges. 166 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:09:46,089 INFO L225 Difference]: With dead ends: 10957 [2022-04-27 15:09:46,089 INFO L226 Difference]: Without dead ends: 7435 [2022-04-27 15:09:46,092 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:09:46,092 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 124 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:09:46,092 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 92 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 15:09:46,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7435 states. [2022-04-27 15:09:46,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7435 to 7433. [2022-04-27 15:09:46,208 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:09:46,216 INFO L82 GeneralOperation]: Start isEquivalent. First operand 7435 states. Second operand has 7433 states, 7429 states have (on average 1.2755417956656347) internal successors, (9476), 7429 states have internal predecessors, (9476), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:46,224 INFO L74 IsIncluded]: Start isIncluded. First operand 7435 states. Second operand has 7433 states, 7429 states have (on average 1.2755417956656347) internal successors, (9476), 7429 states have internal predecessors, (9476), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:46,231 INFO L87 Difference]: Start difference. First operand 7435 states. Second operand has 7433 states, 7429 states have (on average 1.2755417956656347) internal successors, (9476), 7429 states have internal predecessors, (9476), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:47,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:47,875 INFO L93 Difference]: Finished difference Result 7435 states and 9480 transitions. [2022-04-27 15:09:47,875 INFO L276 IsEmpty]: Start isEmpty. Operand 7435 states and 9480 transitions. [2022-04-27 15:09:47,880 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:09:47,880 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:09:47,887 INFO L74 IsIncluded]: Start isIncluded. First operand has 7433 states, 7429 states have (on average 1.2755417956656347) internal successors, (9476), 7429 states have internal predecessors, (9476), 2 states have call successors, (2), 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 7435 states. [2022-04-27 15:09:47,893 INFO L87 Difference]: Start difference. First operand has 7433 states, 7429 states have (on average 1.2755417956656347) internal successors, (9476), 7429 states have internal predecessors, (9476), 2 states have call successors, (2), 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 7435 states. [2022-04-27 15:09:49,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:49,430 INFO L93 Difference]: Finished difference Result 7435 states and 9480 transitions. [2022-04-27 15:09:49,430 INFO L276 IsEmpty]: Start isEmpty. Operand 7435 states and 9480 transitions. [2022-04-27 15:09:49,436 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:09:49,436 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:09:49,436 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:09:49,436 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:09:49,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7433 states, 7429 states have (on average 1.2755417956656347) internal successors, (9476), 7429 states have internal predecessors, (9476), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:50,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7433 states to 7433 states and 9479 transitions. [2022-04-27 15:09:50,913 INFO L78 Accepts]: Start accepts. Automaton has 7433 states and 9479 transitions. Word has length 29 [2022-04-27 15:09:50,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:09:50,913 INFO L495 AbstractCegarLoop]: Abstraction has 7433 states and 9479 transitions. [2022-04-27 15:09:50,914 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:50,914 INFO L276 IsEmpty]: Start isEmpty. Operand 7433 states and 9479 transitions. [2022-04-27 15:09:50,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-27 15:09:50,917 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:09:50,917 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:09:50,917 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-04-27 15:09:50,917 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:09:50,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:09:50,918 INFO L85 PathProgramCache]: Analyzing trace with hash 1210454129, now seen corresponding path program 1 times [2022-04-27 15:09:50,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:09:50,919 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914434969] [2022-04-27 15:09:50,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:09:50,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:09:50,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:50,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:09:50,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:09:50,968 INFO L290 TraceCheckUtils]: 0: Hoare triple {192838#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {192832#true} is VALID [2022-04-27 15:09:50,969 INFO L290 TraceCheckUtils]: 1: Hoare triple {192832#true} assume true; {192832#true} is VALID [2022-04-27 15:09:50,969 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {192832#true} {192832#true} #200#return; {192832#true} is VALID [2022-04-27 15:09:50,969 INFO L272 TraceCheckUtils]: 0: Hoare triple {192832#true} call ULTIMATE.init(); {192838#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:09:50,969 INFO L290 TraceCheckUtils]: 1: Hoare triple {192838#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {192832#true} is VALID [2022-04-27 15:09:50,969 INFO L290 TraceCheckUtils]: 2: Hoare triple {192832#true} assume true; {192832#true} is VALID [2022-04-27 15:09:50,969 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {192832#true} {192832#true} #200#return; {192832#true} is VALID [2022-04-27 15:09:50,970 INFO L272 TraceCheckUtils]: 4: Hoare triple {192832#true} call #t~ret15 := main(); {192832#true} is VALID [2022-04-27 15:09:50,970 INFO L290 TraceCheckUtils]: 5: Hoare triple {192832#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;havoc ~cond~0; {192832#true} is VALID [2022-04-27 15:09:50,970 INFO L290 TraceCheckUtils]: 6: Hoare triple {192832#true} assume !false;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~cond~0 := #t~nondet14;havoc #t~nondet14; {192832#true} is VALID [2022-04-27 15:09:50,970 INFO L290 TraceCheckUtils]: 7: Hoare triple {192832#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0; {192832#true} is VALID [2022-04-27 15:09:50,970 INFO L290 TraceCheckUtils]: 8: Hoare triple {192832#true} assume !(0 != ~p1~0); {192832#true} is VALID [2022-04-27 15:09:50,970 INFO L290 TraceCheckUtils]: 9: Hoare triple {192832#true} assume !(0 != ~p2~0); {192832#true} is VALID [2022-04-27 15:09:50,970 INFO L290 TraceCheckUtils]: 10: Hoare triple {192832#true} assume !(0 != ~p3~0); {192832#true} is VALID [2022-04-27 15:09:50,970 INFO L290 TraceCheckUtils]: 11: Hoare triple {192832#true} assume !(0 != ~p4~0); {192832#true} is VALID [2022-04-27 15:09:50,970 INFO L290 TraceCheckUtils]: 12: Hoare triple {192832#true} assume !(0 != ~p5~0); {192832#true} is VALID [2022-04-27 15:09:50,970 INFO L290 TraceCheckUtils]: 13: Hoare triple {192832#true} assume !(0 != ~p6~0); {192832#true} is VALID [2022-04-27 15:09:50,970 INFO L290 TraceCheckUtils]: 14: Hoare triple {192832#true} assume !(0 != ~p7~0); {192832#true} is VALID [2022-04-27 15:09:50,970 INFO L290 TraceCheckUtils]: 15: Hoare triple {192832#true} assume !(0 != ~p8~0); {192832#true} is VALID [2022-04-27 15:09:50,971 INFO L290 TraceCheckUtils]: 16: Hoare triple {192832#true} assume 0 != ~p9~0;~lk9~0 := 1; {192837#(= main_~lk9~0 1)} is VALID [2022-04-27 15:09:50,971 INFO L290 TraceCheckUtils]: 17: Hoare triple {192837#(= main_~lk9~0 1)} assume !(0 != ~p10~0); {192837#(= main_~lk9~0 1)} is VALID [2022-04-27 15:09:50,971 INFO L290 TraceCheckUtils]: 18: Hoare triple {192837#(= main_~lk9~0 1)} assume !(0 != ~p1~0); {192837#(= main_~lk9~0 1)} is VALID [2022-04-27 15:09:50,972 INFO L290 TraceCheckUtils]: 19: Hoare triple {192837#(= main_~lk9~0 1)} assume !(0 != ~p2~0); {192837#(= main_~lk9~0 1)} is VALID [2022-04-27 15:09:50,972 INFO L290 TraceCheckUtils]: 20: Hoare triple {192837#(= main_~lk9~0 1)} assume !(0 != ~p3~0); {192837#(= main_~lk9~0 1)} is VALID [2022-04-27 15:09:50,972 INFO L290 TraceCheckUtils]: 21: Hoare triple {192837#(= main_~lk9~0 1)} assume !(0 != ~p4~0); {192837#(= main_~lk9~0 1)} is VALID [2022-04-27 15:09:50,972 INFO L290 TraceCheckUtils]: 22: Hoare triple {192837#(= main_~lk9~0 1)} assume !(0 != ~p5~0); {192837#(= main_~lk9~0 1)} is VALID [2022-04-27 15:09:50,973 INFO L290 TraceCheckUtils]: 23: Hoare triple {192837#(= main_~lk9~0 1)} assume !(0 != ~p6~0); {192837#(= main_~lk9~0 1)} is VALID [2022-04-27 15:09:50,973 INFO L290 TraceCheckUtils]: 24: Hoare triple {192837#(= main_~lk9~0 1)} assume !(0 != ~p7~0); {192837#(= main_~lk9~0 1)} is VALID [2022-04-27 15:09:50,973 INFO L290 TraceCheckUtils]: 25: Hoare triple {192837#(= main_~lk9~0 1)} assume !(0 != ~p8~0); {192837#(= main_~lk9~0 1)} is VALID [2022-04-27 15:09:50,974 INFO L290 TraceCheckUtils]: 26: Hoare triple {192837#(= main_~lk9~0 1)} assume 0 != ~p9~0; {192837#(= main_~lk9~0 1)} is VALID [2022-04-27 15:09:50,974 INFO L290 TraceCheckUtils]: 27: Hoare triple {192837#(= main_~lk9~0 1)} assume 1 != ~lk9~0; {192833#false} is VALID [2022-04-27 15:09:50,974 INFO L290 TraceCheckUtils]: 28: Hoare triple {192833#false} assume !false; {192833#false} is VALID [2022-04-27 15:09:50,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:09:50,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:09:50,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914434969] [2022-04-27 15:09:50,974 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914434969] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:09:50,975 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:09:50,975 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:09:50,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327357884] [2022-04-27 15:09:50,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:09:50,975 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-04-27 15:09:50,975 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:09:50,975 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:51,010 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:09:51,010 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:09:51,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:09:51,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:09:51,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:09:51,010 INFO L87 Difference]: Start difference. First operand 7433 states and 9479 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:55,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:09:55,654 INFO L93 Difference]: Finished difference Result 12301 states and 15753 transitions. [2022-04-27 15:09:55,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:09:55,654 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-04-27 15:09:55,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:09:55,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:55,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 99 transitions. [2022-04-27 15:09:55,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:09:55,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 99 transitions. [2022-04-27 15:09:55,656 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 99 transitions. [2022-04-27 15:09:55,736 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:00,128 INFO L225 Difference]: With dead ends: 12301 [2022-04-27 15:10:00,128 INFO L226 Difference]: Without dead ends: 12299 [2022-04-27 15:10:00,129 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:10:00,130 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 112 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:10:00,130 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 70 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 15:10:00,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12299 states. [2022-04-27 15:10:00,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12299 to 11273. [2022-04-27 15:10:00,284 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:10:00,298 INFO L82 GeneralOperation]: Start isEquivalent. First operand 12299 states. Second operand has 11273 states, 11269 states have (on average 1.2384417428343242) internal successors, (13956), 11269 states have internal predecessors, (13956), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:00,310 INFO L74 IsIncluded]: Start isIncluded. First operand 12299 states. Second operand has 11273 states, 11269 states have (on average 1.2384417428343242) internal successors, (13956), 11269 states have internal predecessors, (13956), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:00,323 INFO L87 Difference]: Start difference. First operand 12299 states. Second operand has 11273 states, 11269 states have (on average 1.2384417428343242) internal successors, (13956), 11269 states have internal predecessors, (13956), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:04,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:04,548 INFO L93 Difference]: Finished difference Result 12299 states and 15496 transitions. [2022-04-27 15:10:04,549 INFO L276 IsEmpty]: Start isEmpty. Operand 12299 states and 15496 transitions. [2022-04-27 15:10:04,561 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:04,561 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:04,575 INFO L74 IsIncluded]: Start isIncluded. First operand has 11273 states, 11269 states have (on average 1.2384417428343242) internal successors, (13956), 11269 states have internal predecessors, (13956), 2 states have call successors, (2), 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 12299 states. [2022-04-27 15:10:04,589 INFO L87 Difference]: Start difference. First operand has 11273 states, 11269 states have (on average 1.2384417428343242) internal successors, (13956), 11269 states have internal predecessors, (13956), 2 states have call successors, (2), 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 12299 states. [2022-04-27 15:10:09,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:09,150 INFO L93 Difference]: Finished difference Result 12299 states and 15496 transitions. [2022-04-27 15:10:09,150 INFO L276 IsEmpty]: Start isEmpty. Operand 12299 states and 15496 transitions. [2022-04-27 15:10:09,158 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:09,159 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:09,159 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:10:09,159 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:10:09,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11273 states, 11269 states have (on average 1.2384417428343242) internal successors, (13956), 11269 states have internal predecessors, (13956), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:12,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11273 states to 11273 states and 13959 transitions. [2022-04-27 15:10:12,289 INFO L78 Accepts]: Start accepts. Automaton has 11273 states and 13959 transitions. Word has length 29 [2022-04-27 15:10:12,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:10:12,289 INFO L495 AbstractCegarLoop]: Abstraction has 11273 states and 13959 transitions. [2022-04-27 15:10:12,289 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:12,289 INFO L276 IsEmpty]: Start isEmpty. Operand 11273 states and 13959 transitions. [2022-04-27 15:10:12,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-27 15:10:12,296 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:10:12,296 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:10:12,296 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-04-27 15:10:12,296 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:10:12,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:10:12,297 INFO L85 PathProgramCache]: Analyzing trace with hash 623648115, now seen corresponding path program 1 times [2022-04-27 15:10:12,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:10:12,297 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168894042] [2022-04-27 15:10:12,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:10:12,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:10:12,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:12,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:10:12,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:12,339 INFO L290 TraceCheckUtils]: 0: Hoare triple {241804#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {241798#true} is VALID [2022-04-27 15:10:12,339 INFO L290 TraceCheckUtils]: 1: Hoare triple {241798#true} assume true; {241798#true} is VALID [2022-04-27 15:10:12,340 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {241798#true} {241798#true} #200#return; {241798#true} is VALID [2022-04-27 15:10:12,340 INFO L272 TraceCheckUtils]: 0: Hoare triple {241798#true} call ULTIMATE.init(); {241804#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:10:12,340 INFO L290 TraceCheckUtils]: 1: Hoare triple {241804#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {241798#true} is VALID [2022-04-27 15:10:12,340 INFO L290 TraceCheckUtils]: 2: Hoare triple {241798#true} assume true; {241798#true} is VALID [2022-04-27 15:10:12,340 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {241798#true} {241798#true} #200#return; {241798#true} is VALID [2022-04-27 15:10:12,340 INFO L272 TraceCheckUtils]: 4: Hoare triple {241798#true} call #t~ret15 := main(); {241798#true} is VALID [2022-04-27 15:10:12,340 INFO L290 TraceCheckUtils]: 5: Hoare triple {241798#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;havoc ~cond~0; {241798#true} is VALID [2022-04-27 15:10:12,341 INFO L290 TraceCheckUtils]: 6: Hoare triple {241798#true} assume !false;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~cond~0 := #t~nondet14;havoc #t~nondet14; {241798#true} is VALID [2022-04-27 15:10:12,341 INFO L290 TraceCheckUtils]: 7: Hoare triple {241798#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0; {241798#true} is VALID [2022-04-27 15:10:12,341 INFO L290 TraceCheckUtils]: 8: Hoare triple {241798#true} assume !(0 != ~p1~0); {241798#true} is VALID [2022-04-27 15:10:12,341 INFO L290 TraceCheckUtils]: 9: Hoare triple {241798#true} assume !(0 != ~p2~0); {241798#true} is VALID [2022-04-27 15:10:12,341 INFO L290 TraceCheckUtils]: 10: Hoare triple {241798#true} assume !(0 != ~p3~0); {241798#true} is VALID [2022-04-27 15:10:12,341 INFO L290 TraceCheckUtils]: 11: Hoare triple {241798#true} assume !(0 != ~p4~0); {241798#true} is VALID [2022-04-27 15:10:12,341 INFO L290 TraceCheckUtils]: 12: Hoare triple {241798#true} assume !(0 != ~p5~0); {241798#true} is VALID [2022-04-27 15:10:12,341 INFO L290 TraceCheckUtils]: 13: Hoare triple {241798#true} assume !(0 != ~p6~0); {241798#true} is VALID [2022-04-27 15:10:12,341 INFO L290 TraceCheckUtils]: 14: Hoare triple {241798#true} assume !(0 != ~p7~0); {241798#true} is VALID [2022-04-27 15:10:12,341 INFO L290 TraceCheckUtils]: 15: Hoare triple {241798#true} assume !(0 != ~p8~0); {241798#true} is VALID [2022-04-27 15:10:12,342 INFO L290 TraceCheckUtils]: 16: Hoare triple {241798#true} assume !(0 != ~p9~0); {241803#(= main_~p9~0 0)} is VALID [2022-04-27 15:10:12,342 INFO L290 TraceCheckUtils]: 17: Hoare triple {241803#(= main_~p9~0 0)} assume !(0 != ~p10~0); {241803#(= main_~p9~0 0)} is VALID [2022-04-27 15:10:12,342 INFO L290 TraceCheckUtils]: 18: Hoare triple {241803#(= main_~p9~0 0)} assume !(0 != ~p1~0); {241803#(= main_~p9~0 0)} is VALID [2022-04-27 15:10:12,342 INFO L290 TraceCheckUtils]: 19: Hoare triple {241803#(= main_~p9~0 0)} assume !(0 != ~p2~0); {241803#(= main_~p9~0 0)} is VALID [2022-04-27 15:10:12,343 INFO L290 TraceCheckUtils]: 20: Hoare triple {241803#(= main_~p9~0 0)} assume !(0 != ~p3~0); {241803#(= main_~p9~0 0)} is VALID [2022-04-27 15:10:12,343 INFO L290 TraceCheckUtils]: 21: Hoare triple {241803#(= main_~p9~0 0)} assume !(0 != ~p4~0); {241803#(= main_~p9~0 0)} is VALID [2022-04-27 15:10:12,343 INFO L290 TraceCheckUtils]: 22: Hoare triple {241803#(= main_~p9~0 0)} assume !(0 != ~p5~0); {241803#(= main_~p9~0 0)} is VALID [2022-04-27 15:10:12,344 INFO L290 TraceCheckUtils]: 23: Hoare triple {241803#(= main_~p9~0 0)} assume !(0 != ~p6~0); {241803#(= main_~p9~0 0)} is VALID [2022-04-27 15:10:12,344 INFO L290 TraceCheckUtils]: 24: Hoare triple {241803#(= main_~p9~0 0)} assume !(0 != ~p7~0); {241803#(= main_~p9~0 0)} is VALID [2022-04-27 15:10:12,344 INFO L290 TraceCheckUtils]: 25: Hoare triple {241803#(= main_~p9~0 0)} assume !(0 != ~p8~0); {241803#(= main_~p9~0 0)} is VALID [2022-04-27 15:10:12,345 INFO L290 TraceCheckUtils]: 26: Hoare triple {241803#(= main_~p9~0 0)} assume 0 != ~p9~0; {241799#false} is VALID [2022-04-27 15:10:12,357 INFO L290 TraceCheckUtils]: 27: Hoare triple {241799#false} assume 1 != ~lk9~0; {241799#false} is VALID [2022-04-27 15:10:12,358 INFO L290 TraceCheckUtils]: 28: Hoare triple {241799#false} assume !false; {241799#false} is VALID [2022-04-27 15:10:12,358 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:12,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:10:12,358 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168894042] [2022-04-27 15:10:12,358 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168894042] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:10:12,358 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:10:12,358 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:10:12,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000067972] [2022-04-27 15:10:12,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:10:12,359 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-04-27 15:10:12,359 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:10:12,359 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:12,378 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:12,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:10:12,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:10:12,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:10:12,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:10:12,378 INFO L87 Difference]: Start difference. First operand 11273 states and 13959 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:32,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:32,138 INFO L93 Difference]: Finished difference Result 25357 states and 31113 transitions. [2022-04-27 15:10:32,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:10:32,138 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-04-27 15:10:32,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:10:32,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:32,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 168 transitions. [2022-04-27 15:10:32,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:32,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 168 transitions. [2022-04-27 15:10:32,140 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 168 transitions. [2022-04-27 15:10:32,240 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 168 edges. 168 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:38,499 INFO L225 Difference]: With dead ends: 25357 [2022-04-27 15:10:38,499 INFO L226 Difference]: Without dead ends: 14347 [2022-04-27 15:10:38,507 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:38,508 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 100 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:10:38,508 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 111 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 15:10:38,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14347 states. [2022-04-27 15:10:38,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14347 to 14345. [2022-04-27 15:10:38,773 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:10:38,787 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14347 states. Second operand has 14345 states, 14341 states have (on average 1.1962903563210376) internal successors, (17156), 14341 states have internal predecessors, (17156), 2 states have call successors, (2), 2 states have call predecessors, (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,800 INFO L74 IsIncluded]: Start isIncluded. First operand 14347 states. Second operand has 14345 states, 14341 states have (on average 1.1962903563210376) internal successors, (17156), 14341 states have internal predecessors, (17156), 2 states have call successors, (2), 2 states have call predecessors, (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,809 INFO L87 Difference]: Start difference. First operand 14347 states. Second operand has 14345 states, 14341 states have (on average 1.1962903563210376) internal successors, (17156), 14341 states have internal predecessors, (17156), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:44,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:44,317 INFO L93 Difference]: Finished difference Result 14347 states and 17160 transitions. [2022-04-27 15:10:44,317 INFO L276 IsEmpty]: Start isEmpty. Operand 14347 states and 17160 transitions. [2022-04-27 15:10:44,326 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:44,326 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:44,340 INFO L74 IsIncluded]: Start isIncluded. First operand has 14345 states, 14341 states have (on average 1.1962903563210376) internal successors, (17156), 14341 states have internal predecessors, (17156), 2 states have call successors, (2), 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 14347 states. [2022-04-27 15:10:44,352 INFO L87 Difference]: Start difference. First operand has 14345 states, 14341 states have (on average 1.1962903563210376) internal successors, (17156), 14341 states have internal predecessors, (17156), 2 states have call successors, (2), 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 14347 states. [2022-04-27 15:10:49,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:10:49,805 INFO L93 Difference]: Finished difference Result 14347 states and 17160 transitions. [2022-04-27 15:10:49,805 INFO L276 IsEmpty]: Start isEmpty. Operand 14347 states and 17160 transitions. [2022-04-27 15:10:49,813 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:10:49,813 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:10:49,813 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:10:49,813 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:10:49,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14345 states, 14341 states have (on average 1.1962903563210376) internal successors, (17156), 14341 states have internal predecessors, (17156), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:55,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14345 states to 14345 states and 17159 transitions. [2022-04-27 15:10:55,153 INFO L78 Accepts]: Start accepts. Automaton has 14345 states and 17159 transitions. Word has length 29 [2022-04-27 15:10:55,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:10:55,154 INFO L495 AbstractCegarLoop]: Abstraction has 14345 states and 17159 transitions. [2022-04-27 15:10:55,154 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:55,154 INFO L276 IsEmpty]: Start isEmpty. Operand 14345 states and 17159 transitions. [2022-04-27 15:10:55,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-27 15:10:55,161 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:10:55,161 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:10:55,162 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-04-27 15:10:55,162 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:10:55,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:10:55,162 INFO L85 PathProgramCache]: Analyzing trace with hash -1130411554, now seen corresponding path program 1 times [2022-04-27 15:10:55,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:10:55,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745836438] [2022-04-27 15:10:55,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:10:55,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:10:55,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:55,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:10:55,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:10:55,192 INFO L290 TraceCheckUtils]: 0: Hoare triple {311506#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {311500#true} is VALID [2022-04-27 15:10:55,192 INFO L290 TraceCheckUtils]: 1: Hoare triple {311500#true} assume true; {311500#true} is VALID [2022-04-27 15:10:55,192 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {311500#true} {311500#true} #200#return; {311500#true} is VALID [2022-04-27 15:10:55,193 INFO L272 TraceCheckUtils]: 0: Hoare triple {311500#true} call ULTIMATE.init(); {311506#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:10:55,193 INFO L290 TraceCheckUtils]: 1: Hoare triple {311506#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {311500#true} is VALID [2022-04-27 15:10:55,193 INFO L290 TraceCheckUtils]: 2: Hoare triple {311500#true} assume true; {311500#true} is VALID [2022-04-27 15:10:55,193 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {311500#true} {311500#true} #200#return; {311500#true} is VALID [2022-04-27 15:10:55,193 INFO L272 TraceCheckUtils]: 4: Hoare triple {311500#true} call #t~ret15 := main(); {311500#true} is VALID [2022-04-27 15:10:55,193 INFO L290 TraceCheckUtils]: 5: Hoare triple {311500#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;havoc ~cond~0; {311500#true} is VALID [2022-04-27 15:10:55,193 INFO L290 TraceCheckUtils]: 6: Hoare triple {311500#true} assume !false;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~cond~0 := #t~nondet14;havoc #t~nondet14; {311500#true} is VALID [2022-04-27 15:10:55,193 INFO L290 TraceCheckUtils]: 7: Hoare triple {311500#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0; {311500#true} is VALID [2022-04-27 15:10:55,194 INFO L290 TraceCheckUtils]: 8: Hoare triple {311500#true} assume !(0 != ~p1~0); {311500#true} is VALID [2022-04-27 15:10:55,194 INFO L290 TraceCheckUtils]: 9: Hoare triple {311500#true} assume !(0 != ~p2~0); {311500#true} is VALID [2022-04-27 15:10:55,194 INFO L290 TraceCheckUtils]: 10: Hoare triple {311500#true} assume !(0 != ~p3~0); {311500#true} is VALID [2022-04-27 15:10:55,194 INFO L290 TraceCheckUtils]: 11: Hoare triple {311500#true} assume !(0 != ~p4~0); {311500#true} is VALID [2022-04-27 15:10:55,194 INFO L290 TraceCheckUtils]: 12: Hoare triple {311500#true} assume !(0 != ~p5~0); {311500#true} is VALID [2022-04-27 15:10:55,194 INFO L290 TraceCheckUtils]: 13: Hoare triple {311500#true} assume !(0 != ~p6~0); {311500#true} is VALID [2022-04-27 15:10:55,194 INFO L290 TraceCheckUtils]: 14: Hoare triple {311500#true} assume !(0 != ~p7~0); {311500#true} is VALID [2022-04-27 15:10:55,194 INFO L290 TraceCheckUtils]: 15: Hoare triple {311500#true} assume !(0 != ~p8~0); {311500#true} is VALID [2022-04-27 15:10:55,194 INFO L290 TraceCheckUtils]: 16: Hoare triple {311500#true} assume 0 != ~p9~0;~lk9~0 := 1; {311505#(not (= main_~p9~0 0))} is VALID [2022-04-27 15:10:55,195 INFO L290 TraceCheckUtils]: 17: Hoare triple {311505#(not (= main_~p9~0 0))} assume !(0 != ~p10~0); {311505#(not (= main_~p9~0 0))} is VALID [2022-04-27 15:10:55,195 INFO L290 TraceCheckUtils]: 18: Hoare triple {311505#(not (= main_~p9~0 0))} assume !(0 != ~p1~0); {311505#(not (= main_~p9~0 0))} is VALID [2022-04-27 15:10:55,195 INFO L290 TraceCheckUtils]: 19: Hoare triple {311505#(not (= main_~p9~0 0))} assume !(0 != ~p2~0); {311505#(not (= main_~p9~0 0))} is VALID [2022-04-27 15:10:55,195 INFO L290 TraceCheckUtils]: 20: Hoare triple {311505#(not (= main_~p9~0 0))} assume !(0 != ~p3~0); {311505#(not (= main_~p9~0 0))} is VALID [2022-04-27 15:10:55,196 INFO L290 TraceCheckUtils]: 21: Hoare triple {311505#(not (= main_~p9~0 0))} assume !(0 != ~p4~0); {311505#(not (= main_~p9~0 0))} is VALID [2022-04-27 15:10:55,196 INFO L290 TraceCheckUtils]: 22: Hoare triple {311505#(not (= main_~p9~0 0))} assume !(0 != ~p5~0); {311505#(not (= main_~p9~0 0))} is VALID [2022-04-27 15:10:55,196 INFO L290 TraceCheckUtils]: 23: Hoare triple {311505#(not (= main_~p9~0 0))} assume !(0 != ~p6~0); {311505#(not (= main_~p9~0 0))} is VALID [2022-04-27 15:10:55,197 INFO L290 TraceCheckUtils]: 24: Hoare triple {311505#(not (= main_~p9~0 0))} assume !(0 != ~p7~0); {311505#(not (= main_~p9~0 0))} is VALID [2022-04-27 15:10:55,197 INFO L290 TraceCheckUtils]: 25: Hoare triple {311505#(not (= main_~p9~0 0))} assume !(0 != ~p8~0); {311505#(not (= main_~p9~0 0))} is VALID [2022-04-27 15:10:55,197 INFO L290 TraceCheckUtils]: 26: Hoare triple {311505#(not (= main_~p9~0 0))} assume !(0 != ~p9~0); {311501#false} is VALID [2022-04-27 15:10:55,197 INFO L290 TraceCheckUtils]: 27: Hoare triple {311501#false} assume 0 != ~p10~0; {311501#false} is VALID [2022-04-27 15:10:55,197 INFO L290 TraceCheckUtils]: 28: Hoare triple {311501#false} assume 1 != ~lk10~0; {311501#false} is VALID [2022-04-27 15:10:55,197 INFO L290 TraceCheckUtils]: 29: Hoare triple {311501#false} assume !false; {311501#false} is VALID [2022-04-27 15:10:55,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:10:55,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:10:55,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745836438] [2022-04-27 15:10:55,198 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745836438] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:10:55,198 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:10:55,198 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:10:55,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608446654] [2022-04-27 15:10:55,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:10:55,198 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-27 15:10:55,199 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:10:55,199 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:10:55,216 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:10:55,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:10:55,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:10:55,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:10:55,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:10:55,217 INFO L87 Difference]: Start difference. First operand 14345 states and 17159 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:11:06,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:11:06,563 INFO L93 Difference]: Finished difference Result 21517 states and 25609 transitions. [2022-04-27 15:11:06,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:11:06,563 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-27 15:11:06,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:11:06,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:11:06,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 163 transitions. [2022-04-27 15:11:06,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:11:06,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 163 transitions. [2022-04-27 15:11:06,565 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 163 transitions. [2022-04-27 15:11:06,662 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 163 edges. 163 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:11:12,727 INFO L225 Difference]: With dead ends: 21517 [2022-04-27 15:11:12,727 INFO L226 Difference]: Without dead ends: 14603 [2022-04-27 15:11:12,732 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:11:12,733 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 123 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:11:12,733 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 89 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 15:11:12,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14603 states. [2022-04-27 15:11:12,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14603 to 14601. [2022-04-27 15:11:12,924 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:11:12,973 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14603 states. Second operand has 14601 states, 14597 states have (on average 1.175309995204494) internal successors, (17156), 14597 states have internal predecessors, (17156), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:11:12,983 INFO L74 IsIncluded]: Start isIncluded. First operand 14603 states. Second operand has 14601 states, 14597 states have (on average 1.175309995204494) internal successors, (17156), 14597 states have internal predecessors, (17156), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:11:12,991 INFO L87 Difference]: Start difference. First operand 14603 states. Second operand has 14601 states, 14597 states have (on average 1.175309995204494) internal successors, (17156), 14597 states have internal predecessors, (17156), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:11:18,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:11:18,783 INFO L93 Difference]: Finished difference Result 14603 states and 17160 transitions. [2022-04-27 15:11:18,784 INFO L276 IsEmpty]: Start isEmpty. Operand 14603 states and 17160 transitions. [2022-04-27 15:11:18,792 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:11:18,793 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:11:18,801 INFO L74 IsIncluded]: Start isIncluded. First operand has 14601 states, 14597 states have (on average 1.175309995204494) internal successors, (17156), 14597 states have internal predecessors, (17156), 2 states have call successors, (2), 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 14603 states. [2022-04-27 15:11:18,810 INFO L87 Difference]: Start difference. First operand has 14601 states, 14597 states have (on average 1.175309995204494) internal successors, (17156), 14597 states have internal predecessors, (17156), 2 states have call successors, (2), 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 14603 states. [2022-04-27 15:11:24,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:11:24,517 INFO L93 Difference]: Finished difference Result 14603 states and 17160 transitions. [2022-04-27 15:11:24,517 INFO L276 IsEmpty]: Start isEmpty. Operand 14603 states and 17160 transitions. [2022-04-27 15:11:24,526 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:11:24,526 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:11:24,526 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:11:24,526 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:11:24,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14601 states, 14597 states have (on average 1.175309995204494) internal successors, (17156), 14597 states have internal predecessors, (17156), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:11:29,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14601 states to 14601 states and 17159 transitions. [2022-04-27 15:11:29,799 INFO L78 Accepts]: Start accepts. Automaton has 14601 states and 17159 transitions. Word has length 30 [2022-04-27 15:11:29,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:11:29,799 INFO L495 AbstractCegarLoop]: Abstraction has 14601 states and 17159 transitions. [2022-04-27 15:11:29,799 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:11:29,799 INFO L276 IsEmpty]: Start isEmpty. Operand 14601 states and 17159 transitions. [2022-04-27 15:11:29,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-27 15:11:29,805 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:11:29,805 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:11:29,805 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-04-27 15:11:29,805 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:11:29,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:11:29,806 INFO L85 PathProgramCache]: Analyzing trace with hash -2141528804, now seen corresponding path program 1 times [2022-04-27 15:11:29,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:11:29,806 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677200032] [2022-04-27 15:11:29,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:11:29,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:11:29,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:11:29,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:11:29,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:11:29,843 INFO L290 TraceCheckUtils]: 0: Hoare triple {378136#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {378130#true} is VALID [2022-04-27 15:11:29,843 INFO L290 TraceCheckUtils]: 1: Hoare triple {378130#true} assume true; {378130#true} is VALID [2022-04-27 15:11:29,843 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {378130#true} {378130#true} #200#return; {378130#true} is VALID [2022-04-27 15:11:29,844 INFO L272 TraceCheckUtils]: 0: Hoare triple {378130#true} call ULTIMATE.init(); {378136#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:11:29,844 INFO L290 TraceCheckUtils]: 1: Hoare triple {378136#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {378130#true} is VALID [2022-04-27 15:11:29,844 INFO L290 TraceCheckUtils]: 2: Hoare triple {378130#true} assume true; {378130#true} is VALID [2022-04-27 15:11:29,844 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {378130#true} {378130#true} #200#return; {378130#true} is VALID [2022-04-27 15:11:29,844 INFO L272 TraceCheckUtils]: 4: Hoare triple {378130#true} call #t~ret15 := main(); {378130#true} is VALID [2022-04-27 15:11:29,844 INFO L290 TraceCheckUtils]: 5: Hoare triple {378130#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;havoc ~cond~0; {378130#true} is VALID [2022-04-27 15:11:29,844 INFO L290 TraceCheckUtils]: 6: Hoare triple {378130#true} assume !false;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~cond~0 := #t~nondet14;havoc #t~nondet14; {378130#true} is VALID [2022-04-27 15:11:29,844 INFO L290 TraceCheckUtils]: 7: Hoare triple {378130#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0; {378130#true} is VALID [2022-04-27 15:11:29,844 INFO L290 TraceCheckUtils]: 8: Hoare triple {378130#true} assume !(0 != ~p1~0); {378130#true} is VALID [2022-04-27 15:11:29,844 INFO L290 TraceCheckUtils]: 9: Hoare triple {378130#true} assume !(0 != ~p2~0); {378130#true} is VALID [2022-04-27 15:11:29,845 INFO L290 TraceCheckUtils]: 10: Hoare triple {378130#true} assume !(0 != ~p3~0); {378130#true} is VALID [2022-04-27 15:11:29,845 INFO L290 TraceCheckUtils]: 11: Hoare triple {378130#true} assume !(0 != ~p4~0); {378130#true} is VALID [2022-04-27 15:11:29,845 INFO L290 TraceCheckUtils]: 12: Hoare triple {378130#true} assume !(0 != ~p5~0); {378130#true} is VALID [2022-04-27 15:11:29,845 INFO L290 TraceCheckUtils]: 13: Hoare triple {378130#true} assume !(0 != ~p6~0); {378130#true} is VALID [2022-04-27 15:11:29,845 INFO L290 TraceCheckUtils]: 14: Hoare triple {378130#true} assume !(0 != ~p7~0); {378130#true} is VALID [2022-04-27 15:11:29,845 INFO L290 TraceCheckUtils]: 15: Hoare triple {378130#true} assume !(0 != ~p8~0); {378130#true} is VALID [2022-04-27 15:11:29,845 INFO L290 TraceCheckUtils]: 16: Hoare triple {378130#true} assume !(0 != ~p9~0); {378130#true} is VALID [2022-04-27 15:11:29,845 INFO L290 TraceCheckUtils]: 17: Hoare triple {378130#true} assume !(0 != ~p10~0); {378135#(= main_~p10~0 0)} is VALID [2022-04-27 15:11:29,846 INFO L290 TraceCheckUtils]: 18: Hoare triple {378135#(= main_~p10~0 0)} assume !(0 != ~p1~0); {378135#(= main_~p10~0 0)} is VALID [2022-04-27 15:11:29,846 INFO L290 TraceCheckUtils]: 19: Hoare triple {378135#(= main_~p10~0 0)} assume !(0 != ~p2~0); {378135#(= main_~p10~0 0)} is VALID [2022-04-27 15:11:29,846 INFO L290 TraceCheckUtils]: 20: Hoare triple {378135#(= main_~p10~0 0)} assume !(0 != ~p3~0); {378135#(= main_~p10~0 0)} is VALID [2022-04-27 15:11:29,846 INFO L290 TraceCheckUtils]: 21: Hoare triple {378135#(= main_~p10~0 0)} assume !(0 != ~p4~0); {378135#(= main_~p10~0 0)} is VALID [2022-04-27 15:11:29,847 INFO L290 TraceCheckUtils]: 22: Hoare triple {378135#(= main_~p10~0 0)} assume !(0 != ~p5~0); {378135#(= main_~p10~0 0)} is VALID [2022-04-27 15:11:29,847 INFO L290 TraceCheckUtils]: 23: Hoare triple {378135#(= main_~p10~0 0)} assume !(0 != ~p6~0); {378135#(= main_~p10~0 0)} is VALID [2022-04-27 15:11:29,847 INFO L290 TraceCheckUtils]: 24: Hoare triple {378135#(= main_~p10~0 0)} assume !(0 != ~p7~0); {378135#(= main_~p10~0 0)} is VALID [2022-04-27 15:11:29,848 INFO L290 TraceCheckUtils]: 25: Hoare triple {378135#(= main_~p10~0 0)} assume !(0 != ~p8~0); {378135#(= main_~p10~0 0)} is VALID [2022-04-27 15:11:29,848 INFO L290 TraceCheckUtils]: 26: Hoare triple {378135#(= main_~p10~0 0)} assume !(0 != ~p9~0); {378135#(= main_~p10~0 0)} is VALID [2022-04-27 15:11:29,848 INFO L290 TraceCheckUtils]: 27: Hoare triple {378135#(= main_~p10~0 0)} assume 0 != ~p10~0; {378131#false} is VALID [2022-04-27 15:11:29,848 INFO L290 TraceCheckUtils]: 28: Hoare triple {378131#false} assume 1 != ~lk10~0; {378131#false} is VALID [2022-04-27 15:11:29,848 INFO L290 TraceCheckUtils]: 29: Hoare triple {378131#false} assume !false; {378131#false} is VALID [2022-04-27 15:11:29,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:11:29,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:11:29,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677200032] [2022-04-27 15:11:29,849 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677200032] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:11:29,849 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:11:29,849 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:11:29,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993999797] [2022-04-27 15:11:29,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:11:29,849 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-27 15:11:29,850 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:11:29,850 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:11:29,867 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:11:29,867 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:11:29,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:11:29,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:11:29,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:11:29,868 INFO L87 Difference]: Start difference. First operand 14601 states and 17159 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:13:10,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:13:10,658 INFO L93 Difference]: Finished difference Result 42251 states and 48392 transitions. [2022-04-27 15:13:10,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:13:10,659 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-27 15:13:10,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:13:10,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:13:10,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 165 transitions. [2022-04-27 15:13:10,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:13:10,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 165 transitions. [2022-04-27 15:13:10,660 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 165 transitions. [2022-04-27 15:13:10,776 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 165 edges. 165 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:13:17,381 INFO L225 Difference]: With dead ends: 42251 [2022-04-27 15:13:17,381 INFO L226 Difference]: Without dead ends: 14601 [2022-04-27 15:13:17,400 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:13:17,401 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 122 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:13:17,401 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 86 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 15:13:17,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14601 states. [2022-04-27 15:13:17,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14601 to 14601. [2022-04-27 15:13:17,653 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:13:17,669 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14601 states. Second operand has 14601 states, 14597 states have (on average 1.1051585942316915) internal successors, (16132), 14597 states have internal predecessors, (16132), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:13:17,683 INFO L74 IsIncluded]: Start isIncluded. First operand 14601 states. Second operand has 14601 states, 14597 states have (on average 1.1051585942316915) internal successors, (16132), 14597 states have internal predecessors, (16132), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:13:17,697 INFO L87 Difference]: Start difference. First operand 14601 states. Second operand has 14601 states, 14597 states have (on average 1.1051585942316915) internal successors, (16132), 14597 states have internal predecessors, (16132), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:13:23,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:13:23,474 INFO L93 Difference]: Finished difference Result 14601 states and 16135 transitions. [2022-04-27 15:13:23,474 INFO L276 IsEmpty]: Start isEmpty. Operand 14601 states and 16135 transitions. [2022-04-27 15:13:23,483 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:13:23,483 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:13:23,494 INFO L74 IsIncluded]: Start isIncluded. First operand has 14601 states, 14597 states have (on average 1.1051585942316915) internal successors, (16132), 14597 states have internal predecessors, (16132), 2 states have call successors, (2), 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 14601 states. [2022-04-27 15:13:23,504 INFO L87 Difference]: Start difference. First operand has 14601 states, 14597 states have (on average 1.1051585942316915) internal successors, (16132), 14597 states have internal predecessors, (16132), 2 states have call successors, (2), 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 14601 states. [2022-04-27 15:13:29,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:13:29,101 INFO L93 Difference]: Finished difference Result 14601 states and 16135 transitions. [2022-04-27 15:13:29,101 INFO L276 IsEmpty]: Start isEmpty. Operand 14601 states and 16135 transitions. [2022-04-27 15:13:29,109 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:13:29,109 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:13:29,109 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:13:29,109 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:13:29,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14601 states, 14597 states have (on average 1.1051585942316915) internal successors, (16132), 14597 states have internal predecessors, (16132), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:13:34,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14601 states to 14601 states and 16135 transitions. [2022-04-27 15:13:34,496 INFO L78 Accepts]: Start accepts. Automaton has 14601 states and 16135 transitions. Word has length 30 [2022-04-27 15:13:34,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:13:34,496 INFO L495 AbstractCegarLoop]: Abstraction has 14601 states and 16135 transitions. [2022-04-27 15:13:34,496 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:13:34,496 INFO L276 IsEmpty]: Start isEmpty. Operand 14601 states and 16135 transitions. [2022-04-27 15:13:34,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-27 15:13:34,504 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:13:34,504 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:13:34,504 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-04-27 15:13:34,504 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:13:34,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:13:34,505 INFO L85 PathProgramCache]: Analyzing trace with hash -1554722790, now seen corresponding path program 1 times [2022-04-27 15:13:34,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:13:34,505 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916654444] [2022-04-27 15:13:34,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:13:34,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:13:34,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:13:34,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:13:34,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:13:34,531 INFO L290 TraceCheckUtils]: 0: Hoare triple {466263#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {466257#true} is VALID [2022-04-27 15:13:34,531 INFO L290 TraceCheckUtils]: 1: Hoare triple {466257#true} assume true; {466257#true} is VALID [2022-04-27 15:13:34,531 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {466257#true} {466257#true} #200#return; {466257#true} is VALID [2022-04-27 15:13:34,532 INFO L272 TraceCheckUtils]: 0: Hoare triple {466257#true} call ULTIMATE.init(); {466263#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:13:34,532 INFO L290 TraceCheckUtils]: 1: Hoare triple {466263#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {466257#true} is VALID [2022-04-27 15:13:34,532 INFO L290 TraceCheckUtils]: 2: Hoare triple {466257#true} assume true; {466257#true} is VALID [2022-04-27 15:13:34,532 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {466257#true} {466257#true} #200#return; {466257#true} is VALID [2022-04-27 15:13:34,532 INFO L272 TraceCheckUtils]: 4: Hoare triple {466257#true} call #t~ret15 := main(); {466257#true} is VALID [2022-04-27 15:13:34,532 INFO L290 TraceCheckUtils]: 5: Hoare triple {466257#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;havoc ~cond~0; {466257#true} is VALID [2022-04-27 15:13:34,532 INFO L290 TraceCheckUtils]: 6: Hoare triple {466257#true} assume !false;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~cond~0 := #t~nondet14;havoc #t~nondet14; {466257#true} is VALID [2022-04-27 15:13:34,532 INFO L290 TraceCheckUtils]: 7: Hoare triple {466257#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0; {466257#true} is VALID [2022-04-27 15:13:34,532 INFO L290 TraceCheckUtils]: 8: Hoare triple {466257#true} assume !(0 != ~p1~0); {466257#true} is VALID [2022-04-27 15:13:34,532 INFO L290 TraceCheckUtils]: 9: Hoare triple {466257#true} assume !(0 != ~p2~0); {466257#true} is VALID [2022-04-27 15:13:34,532 INFO L290 TraceCheckUtils]: 10: Hoare triple {466257#true} assume !(0 != ~p3~0); {466257#true} is VALID [2022-04-27 15:13:34,532 INFO L290 TraceCheckUtils]: 11: Hoare triple {466257#true} assume !(0 != ~p4~0); {466257#true} is VALID [2022-04-27 15:13:34,533 INFO L290 TraceCheckUtils]: 12: Hoare triple {466257#true} assume !(0 != ~p5~0); {466257#true} is VALID [2022-04-27 15:13:34,533 INFO L290 TraceCheckUtils]: 13: Hoare triple {466257#true} assume !(0 != ~p6~0); {466257#true} is VALID [2022-04-27 15:13:34,533 INFO L290 TraceCheckUtils]: 14: Hoare triple {466257#true} assume !(0 != ~p7~0); {466257#true} is VALID [2022-04-27 15:13:34,533 INFO L290 TraceCheckUtils]: 15: Hoare triple {466257#true} assume !(0 != ~p8~0); {466257#true} is VALID [2022-04-27 15:13:34,533 INFO L290 TraceCheckUtils]: 16: Hoare triple {466257#true} assume !(0 != ~p9~0); {466257#true} is VALID [2022-04-27 15:13:34,533 INFO L290 TraceCheckUtils]: 17: Hoare triple {466257#true} assume 0 != ~p10~0;~lk10~0 := 1; {466262#(= main_~lk10~0 1)} is VALID [2022-04-27 15:13:34,533 INFO L290 TraceCheckUtils]: 18: Hoare triple {466262#(= main_~lk10~0 1)} assume !(0 != ~p1~0); {466262#(= main_~lk10~0 1)} is VALID [2022-04-27 15:13:34,534 INFO L290 TraceCheckUtils]: 19: Hoare triple {466262#(= main_~lk10~0 1)} assume !(0 != ~p2~0); {466262#(= main_~lk10~0 1)} is VALID [2022-04-27 15:13:34,534 INFO L290 TraceCheckUtils]: 20: Hoare triple {466262#(= main_~lk10~0 1)} assume !(0 != ~p3~0); {466262#(= main_~lk10~0 1)} is VALID [2022-04-27 15:13:34,534 INFO L290 TraceCheckUtils]: 21: Hoare triple {466262#(= main_~lk10~0 1)} assume !(0 != ~p4~0); {466262#(= main_~lk10~0 1)} is VALID [2022-04-27 15:13:34,534 INFO L290 TraceCheckUtils]: 22: Hoare triple {466262#(= main_~lk10~0 1)} assume !(0 != ~p5~0); {466262#(= main_~lk10~0 1)} is VALID [2022-04-27 15:13:34,535 INFO L290 TraceCheckUtils]: 23: Hoare triple {466262#(= main_~lk10~0 1)} assume !(0 != ~p6~0); {466262#(= main_~lk10~0 1)} is VALID [2022-04-27 15:13:34,535 INFO L290 TraceCheckUtils]: 24: Hoare triple {466262#(= main_~lk10~0 1)} assume !(0 != ~p7~0); {466262#(= main_~lk10~0 1)} is VALID [2022-04-27 15:13:34,535 INFO L290 TraceCheckUtils]: 25: Hoare triple {466262#(= main_~lk10~0 1)} assume !(0 != ~p8~0); {466262#(= main_~lk10~0 1)} is VALID [2022-04-27 15:13:34,536 INFO L290 TraceCheckUtils]: 26: Hoare triple {466262#(= main_~lk10~0 1)} assume !(0 != ~p9~0); {466262#(= main_~lk10~0 1)} is VALID [2022-04-27 15:13:34,536 INFO L290 TraceCheckUtils]: 27: Hoare triple {466262#(= main_~lk10~0 1)} assume 0 != ~p10~0; {466262#(= main_~lk10~0 1)} is VALID [2022-04-27 15:13:34,536 INFO L290 TraceCheckUtils]: 28: Hoare triple {466262#(= main_~lk10~0 1)} assume 1 != ~lk10~0; {466258#false} is VALID [2022-04-27 15:13:34,536 INFO L290 TraceCheckUtils]: 29: Hoare triple {466258#false} assume !false; {466258#false} is VALID [2022-04-27 15:13:34,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:13:34,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:13:34,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916654444] [2022-04-27 15:13:34,537 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916654444] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:13:34,537 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:13:34,537 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 15:13:34,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355510617] [2022-04-27 15:13:34,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:13:34,537 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-27 15:13:34,537 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:13:34,538 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:13:34,558 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:13:34,558 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 15:13:34,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:13:34,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 15:13:34,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 15:13:34,559 INFO L87 Difference]: Start difference. First operand 14601 states and 16135 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:13:40,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:13:40,261 INFO L93 Difference]: Finished difference Result 14601 states and 16135 transitions. [2022-04-27 15:13:40,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 15:13:40,262 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-27 15:13:40,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:13:40,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:13:40,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 58 transitions. [2022-04-27 15:13:40,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:13:40,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 58 transitions. [2022-04-27 15:13:40,263 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 58 transitions. [2022-04-27 15:13:40,306 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:13:40,306 INFO L225 Difference]: With dead ends: 14601 [2022-04-27 15:13:40,306 INFO L226 Difference]: Without dead ends: 0 [2022-04-27 15:13:40,316 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:13:40,316 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 68 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:13:40,316 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 62 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 15:13:40,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-27 15:13:40,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-27 15:13:40,317 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:13:40,317 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:13:40,317 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:13:40,317 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:13:40,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:13:40,317 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 15:13:40,317 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 15:13:40,317 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:13:40,318 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:13:40,318 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:13:40,318 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:13:40,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:13:40,318 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 15:13:40,318 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 15:13:40,318 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:13:40,318 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:13:40,318 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:13:40,318 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:13:40,318 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:13:40,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-27 15:13:40,319 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 30 [2022-04-27 15:13:40,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:13:40,319 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-27 15:13:40,319 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:13:40,319 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 15:13:40,319 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:13:40,321 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 15:13:40,322 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-04-27 15:13:40,323 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-27 15:15:50,280 WARN L232 SmtUtils]: Spent 2.17m on a formula simplification that was a NOOP. DAG size: 2613 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2022-04-27 15:15:50,333 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 3) no Hoare annotation was computed. [2022-04-27 15:15:50,333 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 3) no Hoare annotation was computed. [2022-04-27 15:15:50,333 INFO L899 garLoopResultBuilder]: For program point reach_errorFINAL(line 3) no Hoare annotation was computed. [2022-04-27 15:15:50,334 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-27 15:15:50,334 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:15:50,334 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-27 15:15:50,334 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-27 15:15:50,334 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-27 15:15:50,334 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-27 15:15:50,334 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-27 15:15:50,334 INFO L899 garLoopResultBuilder]: For program point L126(line 126) no Hoare annotation was computed. [2022-04-27 15:15:50,335 INFO L899 garLoopResultBuilder]: For program point mainEXIT(lines 6 165) no Hoare annotation was computed. [2022-04-27 15:15:50,335 INFO L899 garLoopResultBuilder]: For program point L151(line 151) no Hoare annotation was computed. [2022-04-27 15:15:50,335 INFO L899 garLoopResultBuilder]: For program point L110-1(lines 41 160) no Hoare annotation was computed. [2022-04-27 15:15:50,335 INFO L899 garLoopResultBuilder]: For program point L135-1(lines 41 160) no Hoare annotation was computed. [2022-04-27 15:15:50,335 INFO L899 garLoopResultBuilder]: For program point L111(line 111) no Hoare annotation was computed. [2022-04-27 15:15:50,335 INFO L899 garLoopResultBuilder]: For program point L136(line 136) no Hoare annotation was computed. [2022-04-27 15:15:50,335 INFO L902 garLoopResultBuilder]: At program point L161(lines 7 165) the Hoare annotation is: true [2022-04-27 15:15:50,335 INFO L899 garLoopResultBuilder]: For program point L120-1(lines 41 160) no Hoare annotation was computed. [2022-04-27 15:15:50,335 INFO L899 garLoopResultBuilder]: For program point L145-1(lines 41 160) no Hoare annotation was computed. [2022-04-27 15:15:50,335 INFO L899 garLoopResultBuilder]: For program point mainFINAL(lines 6 165) no Hoare annotation was computed. [2022-04-27 15:15:50,335 INFO L899 garLoopResultBuilder]: For program point L104-1(lines 41 160) no Hoare annotation was computed. [2022-04-27 15:15:50,336 INFO L899 garLoopResultBuilder]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 163) no Hoare annotation was computed. [2022-04-27 15:15:50,336 INFO L899 garLoopResultBuilder]: For program point L96-1(lines 41 160) no Hoare annotation was computed. [2022-04-27 15:15:50,336 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 6 165) the Hoare annotation is: true [2022-04-27 15:15:50,336 INFO L899 garLoopResultBuilder]: For program point L121(line 121) no Hoare annotation was computed. [2022-04-27 15:15:50,336 INFO L899 garLoopResultBuilder]: For program point L88-1(lines 41 160) no Hoare annotation was computed. [2022-04-27 15:15:50,336 INFO L899 garLoopResultBuilder]: For program point L146(line 146) no Hoare annotation was computed. [2022-04-27 15:15:50,336 INFO L899 garLoopResultBuilder]: For program point L80-1(lines 41 160) no Hoare annotation was computed. [2022-04-27 15:15:50,336 INFO L899 garLoopResultBuilder]: For program point L72-1(lines 41 160) no Hoare annotation was computed. [2022-04-27 15:15:50,336 INFO L899 garLoopResultBuilder]: For program point L130-1(lines 41 160) no Hoare annotation was computed. [2022-04-27 15:15:50,336 INFO L902 garLoopResultBuilder]: At program point L155-1(lines 41 160) the Hoare annotation is: true [2022-04-27 15:15:50,336 INFO L899 garLoopResultBuilder]: For program point L131(line 131) no Hoare annotation was computed. [2022-04-27 15:15:50,336 INFO L899 garLoopResultBuilder]: For program point L156(line 156) no Hoare annotation was computed. [2022-04-27 15:15:50,336 INFO L895 garLoopResultBuilder]: At program point L156-1(lines 7 165) the Hoare annotation is: false [2022-04-27 15:15:50,336 INFO L899 garLoopResultBuilder]: For program point L115-1(lines 41 160) no Hoare annotation was computed. [2022-04-27 15:15:50,336 INFO L899 garLoopResultBuilder]: For program point L140-1(lines 41 160) no Hoare annotation was computed. [2022-04-27 15:15:50,336 INFO L899 garLoopResultBuilder]: For program point L116(line 116) no Hoare annotation was computed. [2022-04-27 15:15:50,337 INFO L899 garLoopResultBuilder]: For program point L141(line 141) no Hoare annotation was computed. [2022-04-27 15:15:50,337 INFO L899 garLoopResultBuilder]: For program point L100-1(lines 41 160) no Hoare annotation was computed. [2022-04-27 15:15:50,337 INFO L899 garLoopResultBuilder]: For program point L125-1(lines 41 160) no Hoare annotation was computed. [2022-04-27 15:15:50,337 INFO L899 garLoopResultBuilder]: For program point L92-1(lines 41 160) no Hoare annotation was computed. [2022-04-27 15:15:50,337 INFO L899 garLoopResultBuilder]: For program point L150-1(lines 41 160) no Hoare annotation was computed. [2022-04-27 15:15:50,337 INFO L899 garLoopResultBuilder]: For program point L84-1(lines 41 160) no Hoare annotation was computed. [2022-04-27 15:15:50,337 INFO L899 garLoopResultBuilder]: For program point L43(lines 43 45) no Hoare annotation was computed. [2022-04-27 15:15:50,337 INFO L899 garLoopResultBuilder]: For program point L76-1(lines 41 160) no Hoare annotation was computed. [2022-04-27 15:15:50,337 INFO L899 garLoopResultBuilder]: For program point L68(lines 68 70) no Hoare annotation was computed. [2022-04-27 15:15:50,337 INFO L899 garLoopResultBuilder]: For program point L68-2(lines 41 160) no Hoare annotation was computed. [2022-04-27 15:15:50,340 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, 1, 1, 1, 1, 1, 1] [2022-04-27 15:15:50,342 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 15:15:50,346 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-27 15:15:50,346 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 15:15:50,347 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-27 15:15:50,347 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 15:15:50,347 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 15:15:50,347 WARN L170 areAnnotationChecker]: L43 has no Hoare annotation [2022-04-27 15:15:50,347 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-27 15:15:50,347 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 15:15:50,347 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 15:15:50,347 WARN L170 areAnnotationChecker]: L43 has no Hoare annotation [2022-04-27 15:15:50,347 WARN L170 areAnnotationChecker]: L43 has no Hoare annotation [2022-04-27 15:15:50,347 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 15:15:50,347 WARN L170 areAnnotationChecker]: L68 has no Hoare annotation [2022-04-27 15:15:50,347 WARN L170 areAnnotationChecker]: L68 has no Hoare annotation [2022-04-27 15:15:50,347 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-27 15:15:50,347 WARN L170 areAnnotationChecker]: L68-2 has no Hoare annotation [2022-04-27 15:15:50,347 WARN L170 areAnnotationChecker]: L68-2 has no Hoare annotation [2022-04-27 15:15:50,347 WARN L170 areAnnotationChecker]: L72-1 has no Hoare annotation [2022-04-27 15:15:50,348 WARN L170 areAnnotationChecker]: L72-1 has no Hoare annotation [2022-04-27 15:15:50,348 WARN L170 areAnnotationChecker]: L76-1 has no Hoare annotation [2022-04-27 15:15:50,348 WARN L170 areAnnotationChecker]: L76-1 has no Hoare annotation [2022-04-27 15:15:50,348 WARN L170 areAnnotationChecker]: L80-1 has no Hoare annotation [2022-04-27 15:15:50,348 WARN L170 areAnnotationChecker]: L80-1 has no Hoare annotation [2022-04-27 15:15:50,348 WARN L170 areAnnotationChecker]: L84-1 has no Hoare annotation [2022-04-27 15:15:50,349 WARN L170 areAnnotationChecker]: L84-1 has no Hoare annotation [2022-04-27 15:15:50,349 WARN L170 areAnnotationChecker]: L88-1 has no Hoare annotation [2022-04-27 15:15:50,349 WARN L170 areAnnotationChecker]: L88-1 has no Hoare annotation [2022-04-27 15:15:50,349 WARN L170 areAnnotationChecker]: L92-1 has no Hoare annotation [2022-04-27 15:15:50,349 WARN L170 areAnnotationChecker]: L92-1 has no Hoare annotation [2022-04-27 15:15:50,349 WARN L170 areAnnotationChecker]: L96-1 has no Hoare annotation [2022-04-27 15:15:50,349 WARN L170 areAnnotationChecker]: L96-1 has no Hoare annotation [2022-04-27 15:15:50,349 WARN L170 areAnnotationChecker]: L100-1 has no Hoare annotation [2022-04-27 15:15:50,349 WARN L170 areAnnotationChecker]: L100-1 has no Hoare annotation [2022-04-27 15:15:50,349 WARN L170 areAnnotationChecker]: L104-1 has no Hoare annotation [2022-04-27 15:15:50,349 WARN L170 areAnnotationChecker]: L104-1 has no Hoare annotation [2022-04-27 15:15:50,349 WARN L170 areAnnotationChecker]: L111 has no Hoare annotation [2022-04-27 15:15:50,349 WARN L170 areAnnotationChecker]: L111 has no Hoare annotation [2022-04-27 15:15:50,349 WARN L170 areAnnotationChecker]: L110-1 has no Hoare annotation [2022-04-27 15:15:50,349 WARN L170 areAnnotationChecker]: L110-1 has no Hoare annotation [2022-04-27 15:15:50,350 WARN L170 areAnnotationChecker]: mainErr0ASSERT_VIOLATIONERROR_FUNCTION has no Hoare annotation [2022-04-27 15:15:50,350 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 15:15:50,350 WARN L170 areAnnotationChecker]: L116 has no Hoare annotation [2022-04-27 15:15:50,350 WARN L170 areAnnotationChecker]: L116 has no Hoare annotation [2022-04-27 15:15:50,350 WARN L170 areAnnotationChecker]: L115-1 has no Hoare annotation [2022-04-27 15:15:50,350 WARN L170 areAnnotationChecker]: L115-1 has no Hoare annotation [2022-04-27 15:15:50,350 WARN L170 areAnnotationChecker]: L121 has no Hoare annotation [2022-04-27 15:15:50,350 WARN L170 areAnnotationChecker]: L121 has no Hoare annotation [2022-04-27 15:15:50,350 WARN L170 areAnnotationChecker]: L120-1 has no Hoare annotation [2022-04-27 15:15:50,350 WARN L170 areAnnotationChecker]: L120-1 has no Hoare annotation [2022-04-27 15:15:50,350 WARN L170 areAnnotationChecker]: L126 has no Hoare annotation [2022-04-27 15:15:50,350 WARN L170 areAnnotationChecker]: L126 has no Hoare annotation [2022-04-27 15:15:50,350 WARN L170 areAnnotationChecker]: L125-1 has no Hoare annotation [2022-04-27 15:15:50,350 WARN L170 areAnnotationChecker]: L125-1 has no Hoare annotation [2022-04-27 15:15:50,350 WARN L170 areAnnotationChecker]: L131 has no Hoare annotation [2022-04-27 15:15:50,350 WARN L170 areAnnotationChecker]: L131 has no Hoare annotation [2022-04-27 15:15:50,350 WARN L170 areAnnotationChecker]: L130-1 has no Hoare annotation [2022-04-27 15:15:50,350 WARN L170 areAnnotationChecker]: L130-1 has no Hoare annotation [2022-04-27 15:15:50,350 WARN L170 areAnnotationChecker]: L136 has no Hoare annotation [2022-04-27 15:15:50,350 WARN L170 areAnnotationChecker]: L136 has no Hoare annotation [2022-04-27 15:15:50,350 WARN L170 areAnnotationChecker]: L135-1 has no Hoare annotation [2022-04-27 15:15:50,350 WARN L170 areAnnotationChecker]: L135-1 has no Hoare annotation [2022-04-27 15:15:50,350 WARN L170 areAnnotationChecker]: L141 has no Hoare annotation [2022-04-27 15:15:50,350 WARN L170 areAnnotationChecker]: L141 has no Hoare annotation [2022-04-27 15:15:50,351 WARN L170 areAnnotationChecker]: L140-1 has no Hoare annotation [2022-04-27 15:15:50,351 WARN L170 areAnnotationChecker]: L140-1 has no Hoare annotation [2022-04-27 15:15:50,351 WARN L170 areAnnotationChecker]: L146 has no Hoare annotation [2022-04-27 15:15:50,351 WARN L170 areAnnotationChecker]: L146 has no Hoare annotation [2022-04-27 15:15:50,351 WARN L170 areAnnotationChecker]: L145-1 has no Hoare annotation [2022-04-27 15:15:50,351 WARN L170 areAnnotationChecker]: L145-1 has no Hoare annotation [2022-04-27 15:15:50,351 WARN L170 areAnnotationChecker]: L151 has no Hoare annotation [2022-04-27 15:15:50,351 WARN L170 areAnnotationChecker]: L151 has no Hoare annotation [2022-04-27 15:15:50,351 WARN L170 areAnnotationChecker]: L150-1 has no Hoare annotation [2022-04-27 15:15:50,351 WARN L170 areAnnotationChecker]: L150-1 has no Hoare annotation [2022-04-27 15:15:50,351 WARN L170 areAnnotationChecker]: L156 has no Hoare annotation [2022-04-27 15:15:50,351 WARN L170 areAnnotationChecker]: L156 has no Hoare annotation [2022-04-27 15:15:50,351 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:15:50,358 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 03:15:50 BoogieIcfgContainer [2022-04-27 15:15:50,358 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 15:15:50,359 INFO L158 Benchmark]: Toolchain (without parser) took 408370.73ms. Allocated memory was 202.4MB in the beginning and 587.2MB in the end (delta: 384.8MB). Free memory was 143.6MB in the beginning and 347.6MB in the end (delta: -203.9MB). Peak memory consumption was 425.6MB. Max. memory is 8.0GB. [2022-04-27 15:15:50,359 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 202.4MB. Free memory is still 159.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 15:15:50,360 INFO L158 Benchmark]: CACSL2BoogieTranslator took 240.45ms. Allocated memory was 202.4MB in the beginning and 282.1MB in the end (delta: 79.7MB). Free memory was 143.4MB in the beginning and 250.9MB in the end (delta: -107.4MB). Peak memory consumption was 12.8MB. Max. memory is 8.0GB. [2022-04-27 15:15:50,360 INFO L158 Benchmark]: Boogie Preprocessor took 30.93ms. Allocated memory is still 282.1MB. Free memory was 250.9MB in the beginning and 249.3MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-27 15:15:50,362 INFO L158 Benchmark]: RCFGBuilder took 353.54ms. Allocated memory is still 282.1MB. Free memory was 249.3MB in the beginning and 234.6MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2022-04-27 15:15:50,362 INFO L158 Benchmark]: TraceAbstraction took 407741.09ms. Allocated memory was 282.1MB in the beginning and 587.2MB in the end (delta: 305.1MB). Free memory was 234.1MB in the beginning and 347.6MB in the end (delta: -113.5MB). Peak memory consumption was 436.1MB. Max. memory is 8.0GB. [2022-04-27 15:15:50,370 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.33ms. Allocated memory is still 202.4MB. Free memory is still 159.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 240.45ms. Allocated memory was 202.4MB in the beginning and 282.1MB in the end (delta: 79.7MB). Free memory was 143.4MB in the beginning and 250.9MB in the end (delta: -107.4MB). Peak memory consumption was 12.8MB. Max. memory is 8.0GB. * Boogie Preprocessor took 30.93ms. Allocated memory is still 282.1MB. Free memory was 250.9MB in the beginning and 249.3MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 353.54ms. Allocated memory is still 282.1MB. Free memory was 249.3MB in the beginning and 234.6MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * TraceAbstraction took 407741.09ms. Allocated memory was 282.1MB in the beginning and 587.2MB in the end (delta: 305.1MB). Free memory was 234.1MB in the beginning and 347.6MB in the end (delta: -113.5MB). Peak memory consumption was 436.1MB. 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: 163]: 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, 48 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 407.7s, OverallIterations: 28, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 192.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 130.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3551 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3551 mSDsluCounter, 2584 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 198 mSDsCounter, 66 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1653 IncrementalHoareTripleChecker+Invalid, 1719 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 66 mSolverCounterUnsat, 2386 mSDtfsCounter, 1653 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 195 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=14601occurred in iteration=26, InterpolantAutomatonStates: 112, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 82.3s AutomataMinimizationTime, 28 MinimizatonAttempts, 3100 StatesRemovedByMinimization, 26 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 1034 NumberOfFragments, 13 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 130.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 721 NumberOfCodeBlocks, 721 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 693 ConstructedInterpolants, 0 QuantifiedInterpolants, 1521 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 28 InterpolantComputations, 28 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: 0 - InvariantResult [Line: 41]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2022-04-27 15:15:50,396 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...