/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/locks/test_locks_15-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 08:17:48,207 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 08:17:48,209 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 08:17:48,245 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 08:17:48,245 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 08:17:48,246 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 08:17:48,251 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 08:17:48,256 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 08:17:48,257 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 08:17:48,261 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 08:17:48,262 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 08:17:48,264 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 08:17:48,264 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 08:17:48,266 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 08:17:48,267 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 08:17:48,269 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 08:17:48,270 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 08:17:48,270 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 08:17:48,272 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 08:17:48,277 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 08:17:48,279 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 08:17:48,284 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 08:17:48,285 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 08:17:48,286 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 08:17:48,287 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 08:17:48,294 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 08:17:48,294 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 08:17:48,294 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 08:17:48,295 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 08:17:48,296 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 08:17:48,297 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 08:17:48,297 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 08:17:48,298 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 08:17:48,299 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 08:17:48,299 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 08:17:48,300 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 08:17:48,300 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 08:17:48,301 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 08:17:48,301 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 08:17:48,301 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 08:17:48,302 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 08:17:48,303 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 08:17:48,304 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-28 08:17:48,318 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 08:17:48,318 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 08:17:48,319 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 08:17:48,319 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-28 08:17:48,320 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 08:17:48,320 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-28 08:17:48,320 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 08:17:48,320 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 08:17:48,320 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 08:17:48,321 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 08:17:48,321 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-28 08:17:48,321 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 08:17:48,321 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 08:17:48,321 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 08:17:48,321 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 08:17:48,322 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 08:17:48,322 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 08:17:48,322 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 08:17:48,322 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 08:17:48,322 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 08:17:48,322 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 08:17:48,322 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 08:17:48,322 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 08:17:48,322 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 08:17:48,323 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-28 08:17:48,323 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-28 08:17:48,573 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 08:17:48,597 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 08:17:48,599 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 08:17:48,600 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 08:17:48,601 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 08:17:48,602 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_15-1.c [2022-04-28 08:17:48,667 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af7d0604f/64f485980e554241ad67f06270b55e39/FLAG5ad32cc50 [2022-04-28 08:17:49,076 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 08:17:49,077 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_15-1.c [2022-04-28 08:17:49,083 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af7d0604f/64f485980e554241ad67f06270b55e39/FLAG5ad32cc50 [2022-04-28 08:17:49,485 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af7d0604f/64f485980e554241ad67f06270b55e39 [2022-04-28 08:17:49,488 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 08:17:49,490 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 08:17:49,492 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 08:17:49,493 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 08:17:49,496 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 08:17:49,497 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 08:17:49" (1/1) ... [2022-04-28 08:17:49,498 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@785878ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:17:49, skipping insertion in model container [2022-04-28 08:17:49,498 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 08:17:49" (1/1) ... [2022-04-28 08:17:49,504 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 08:17:49,532 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 08:17:49,740 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_15-1.c[5654,5667] [2022-04-28 08:17:49,744 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 08:17:49,751 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 08:17:49,776 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_15-1.c[5654,5667] [2022-04-28 08:17:49,777 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 08:17:49,788 INFO L208 MainTranslator]: Completed translation [2022-04-28 08:17:49,788 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:17:49 WrapperNode [2022-04-28 08:17:49,789 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 08:17:49,790 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 08:17:49,790 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 08:17:49,790 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 08:17:49,798 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:17:49" (1/1) ... [2022-04-28 08:17:49,798 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:17:49" (1/1) ... [2022-04-28 08:17:49,804 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:17:49" (1/1) ... [2022-04-28 08:17:49,804 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:17:49" (1/1) ... [2022-04-28 08:17:49,812 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:17:49" (1/1) ... [2022-04-28 08:17:49,821 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:17:49" (1/1) ... [2022-04-28 08:17:49,822 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:17:49" (1/1) ... [2022-04-28 08:17:49,824 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 08:17:49,825 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 08:17:49,825 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 08:17:49,825 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 08:17:49,826 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:17:49" (1/1) ... [2022-04-28 08:17:49,836 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 08:17:49,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 08:17:49,855 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-28 08:17:49,862 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-28 08:17:49,884 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 08:17:49,884 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 08:17:49,884 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 08:17:49,884 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 08:17:49,884 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 08:17:49,884 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 08:17:49,885 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 08:17:49,885 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 08:17:49,885 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-28 08:17:49,885 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 08:17:49,885 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 08:17:49,885 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 08:17:49,885 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 08:17:49,885 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 08:17:49,885 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 08:17:49,886 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 08:17:49,948 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 08:17:49,949 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 08:17:50,274 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 08:17:50,281 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 08:17:50,282 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 08:17:50,283 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 08:17:50 BoogieIcfgContainer [2022-04-28 08:17:50,283 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 08:17:50,285 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 08:17:50,285 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 08:17:50,288 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 08:17:50,288 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 08:17:49" (1/3) ... [2022-04-28 08:17:50,289 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c878715 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 08:17:50, skipping insertion in model container [2022-04-28 08:17:50,289 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 08:17:49" (2/3) ... [2022-04-28 08:17:50,289 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c878715 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 08:17:50, skipping insertion in model container [2022-04-28 08:17:50,290 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 08:17:50" (3/3) ... [2022-04-28 08:17:50,291 INFO L111 eAbstractionObserver]: Analyzing ICFG test_locks_15-1.c [2022-04-28 08:17:50,303 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 08:17:50,304 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 08:17:50,358 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 08:17:50,366 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@5781bcf7, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@f8ac968 [2022-04-28 08:17:50,366 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 08:17:50,382 INFO L276 IsEmpty]: Start isEmpty. Operand has 60 states, 54 states have (on average 1.9074074074074074) internal successors, (103), 55 states have internal predecessors, (103), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 08:17:50,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-28 08:17:50,392 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:17:50,392 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:17:50,393 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:17:50,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:17:50,401 INFO L85 PathProgramCache]: Analyzing trace with hash 208658311, now seen corresponding path program 1 times [2022-04-28 08:17:50,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:17:50,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1362382928] [2022-04-28 08:17:50,419 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:17:50,420 INFO L85 PathProgramCache]: Analyzing trace with hash 208658311, now seen corresponding path program 2 times [2022-04-28 08:17:50,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:17:50,423 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927526284] [2022-04-28 08:17:50,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:17:50,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:17:50,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:17:50,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:17:50,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:17:50,765 INFO L290 TraceCheckUtils]: 0: Hoare triple {69#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {63#true} is VALID [2022-04-28 08:17:50,766 INFO L290 TraceCheckUtils]: 1: Hoare triple {63#true} assume true; {63#true} is VALID [2022-04-28 08:17:50,766 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {63#true} {63#true} #285#return; {63#true} is VALID [2022-04-28 08:17:50,768 INFO L272 TraceCheckUtils]: 0: Hoare triple {63#true} call ULTIMATE.init(); {69#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:17:50,769 INFO L290 TraceCheckUtils]: 1: Hoare triple {69#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {63#true} is VALID [2022-04-28 08:17:50,769 INFO L290 TraceCheckUtils]: 2: Hoare triple {63#true} assume true; {63#true} is VALID [2022-04-28 08:17:50,770 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {63#true} {63#true} #285#return; {63#true} is VALID [2022-04-28 08:17:50,770 INFO L272 TraceCheckUtils]: 4: Hoare triple {63#true} call #t~ret20 := main(); {63#true} is VALID [2022-04-28 08:17:50,771 INFO L290 TraceCheckUtils]: 5: Hoare triple {63#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~p15~0 := #t~nondet18;havoc #t~nondet18;havoc ~lk15~0;havoc ~cond~0; {63#true} is VALID [2022-04-28 08:17:50,772 INFO L290 TraceCheckUtils]: 6: Hoare triple {63#true} assume !false;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;~cond~0 := #t~nondet19;havoc #t~nondet19; {63#true} is VALID [2022-04-28 08:17:50,772 INFO L290 TraceCheckUtils]: 7: Hoare triple {63#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0;~lk15~0 := 0; {63#true} is VALID [2022-04-28 08:17:50,773 INFO L290 TraceCheckUtils]: 8: Hoare triple {63#true} assume 0 != ~p1~0;~lk1~0 := 1; {68#(= main_~lk1~0 1)} is VALID [2022-04-28 08:17:50,774 INFO L290 TraceCheckUtils]: 9: Hoare triple {68#(= main_~lk1~0 1)} assume !(0 != ~p2~0); {68#(= main_~lk1~0 1)} is VALID [2022-04-28 08:17:50,775 INFO L290 TraceCheckUtils]: 10: Hoare triple {68#(= main_~lk1~0 1)} assume 0 != ~p3~0;~lk3~0 := 1; {68#(= main_~lk1~0 1)} is VALID [2022-04-28 08:17:50,776 INFO L290 TraceCheckUtils]: 11: Hoare triple {68#(= main_~lk1~0 1)} assume 0 != ~p4~0;~lk4~0 := 1; {68#(= main_~lk1~0 1)} is VALID [2022-04-28 08:17:50,777 INFO L290 TraceCheckUtils]: 12: Hoare triple {68#(= main_~lk1~0 1)} assume 0 != ~p5~0;~lk5~0 := 1; {68#(= main_~lk1~0 1)} is VALID [2022-04-28 08:17:50,779 INFO L290 TraceCheckUtils]: 13: Hoare triple {68#(= main_~lk1~0 1)} assume 0 != ~p6~0;~lk6~0 := 1; {68#(= main_~lk1~0 1)} is VALID [2022-04-28 08:17:50,780 INFO L290 TraceCheckUtils]: 14: Hoare triple {68#(= main_~lk1~0 1)} assume 0 != ~p7~0;~lk7~0 := 1; {68#(= main_~lk1~0 1)} is VALID [2022-04-28 08:17:50,781 INFO L290 TraceCheckUtils]: 15: Hoare triple {68#(= main_~lk1~0 1)} assume 0 != ~p8~0;~lk8~0 := 1; {68#(= main_~lk1~0 1)} is VALID [2022-04-28 08:17:50,781 INFO L290 TraceCheckUtils]: 16: Hoare triple {68#(= main_~lk1~0 1)} assume 0 != ~p9~0;~lk9~0 := 1; {68#(= main_~lk1~0 1)} is VALID [2022-04-28 08:17:50,782 INFO L290 TraceCheckUtils]: 17: Hoare triple {68#(= main_~lk1~0 1)} assume !(0 != ~p10~0); {68#(= main_~lk1~0 1)} is VALID [2022-04-28 08:17:50,784 INFO L290 TraceCheckUtils]: 18: Hoare triple {68#(= main_~lk1~0 1)} assume 0 != ~p11~0;~lk11~0 := 1; {68#(= main_~lk1~0 1)} is VALID [2022-04-28 08:17:50,786 INFO L290 TraceCheckUtils]: 19: Hoare triple {68#(= main_~lk1~0 1)} assume 0 != ~p12~0;~lk12~0 := 1; {68#(= main_~lk1~0 1)} is VALID [2022-04-28 08:17:50,786 INFO L290 TraceCheckUtils]: 20: Hoare triple {68#(= main_~lk1~0 1)} assume 0 != ~p13~0;~lk13~0 := 1; {68#(= main_~lk1~0 1)} is VALID [2022-04-28 08:17:50,791 INFO L290 TraceCheckUtils]: 21: Hoare triple {68#(= main_~lk1~0 1)} assume 0 != ~p14~0;~lk14~0 := 1; {68#(= main_~lk1~0 1)} is VALID [2022-04-28 08:17:50,792 INFO L290 TraceCheckUtils]: 22: Hoare triple {68#(= main_~lk1~0 1)} assume 0 != ~p15~0;~lk15~0 := 1; {68#(= main_~lk1~0 1)} is VALID [2022-04-28 08:17:50,793 INFO L290 TraceCheckUtils]: 23: Hoare triple {68#(= main_~lk1~0 1)} assume 0 != ~p1~0; {68#(= main_~lk1~0 1)} is VALID [2022-04-28 08:17:50,793 INFO L290 TraceCheckUtils]: 24: Hoare triple {68#(= main_~lk1~0 1)} assume 1 != ~lk1~0; {64#false} is VALID [2022-04-28 08:17:50,794 INFO L290 TraceCheckUtils]: 25: Hoare triple {64#false} assume !false; {64#false} is VALID [2022-04-28 08:17:50,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 08:17:50,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:17:50,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927526284] [2022-04-28 08:17:50,796 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927526284] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:17:50,796 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:17:50,796 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:17:50,798 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:17:50,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1362382928] [2022-04-28 08:17:50,799 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1362382928] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:17:50,799 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:17:50,800 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:17:50,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492284561] [2022-04-28 08:17:50,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:17:50,807 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-28 08:17:50,809 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:17:50,812 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:17:50,850 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:17:50,850 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:17:50,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:17:50,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:17:50,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:17:50,878 INFO L87 Difference]: Start difference. First operand has 60 states, 54 states have (on average 1.9074074074074074) internal successors, (103), 55 states have internal predecessors, (103), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:17:51,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:17:51,351 INFO L93 Difference]: Finished difference Result 118 states and 211 transitions. [2022-04-28 08:17:51,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:17:51,352 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-28 08:17:51,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:17:51,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:17:51,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 211 transitions. [2022-04-28 08:17:51,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:17:51,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 211 transitions. [2022-04-28 08:17:51,373 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 211 transitions. [2022-04-28 08:17:51,577 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 211 edges. 211 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:17:51,593 INFO L225 Difference]: With dead ends: 118 [2022-04-28 08:17:51,593 INFO L226 Difference]: Without dead ends: 103 [2022-04-28 08:17:51,596 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:17:51,598 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 260 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 08:17:51,599 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [260 Valid, 118 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 08:17:51,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-04-28 08:17:51,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 71. [2022-04-28 08:17:51,632 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:17:51,634 INFO L82 GeneralOperation]: Start isEquivalent. First operand 103 states. Second operand has 71 states, 67 states have (on average 1.8955223880597014) internal successors, (127), 67 states have internal predecessors, (127), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:17:51,635 INFO L74 IsIncluded]: Start isIncluded. First operand 103 states. Second operand has 71 states, 67 states have (on average 1.8955223880597014) internal successors, (127), 67 states have internal predecessors, (127), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:17:51,635 INFO L87 Difference]: Start difference. First operand 103 states. Second operand has 71 states, 67 states have (on average 1.8955223880597014) internal successors, (127), 67 states have internal predecessors, (127), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:17:51,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:17:51,642 INFO L93 Difference]: Finished difference Result 103 states and 189 transitions. [2022-04-28 08:17:51,642 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 189 transitions. [2022-04-28 08:17:51,643 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:17:51,643 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:17:51,644 INFO L74 IsIncluded]: Start isIncluded. First operand has 71 states, 67 states have (on average 1.8955223880597014) internal successors, (127), 67 states have internal predecessors, (127), 2 states have call successors, (2), 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 103 states. [2022-04-28 08:17:51,644 INFO L87 Difference]: Start difference. First operand has 71 states, 67 states have (on average 1.8955223880597014) internal successors, (127), 67 states have internal predecessors, (127), 2 states have call successors, (2), 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 103 states. [2022-04-28 08:17:51,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:17:51,651 INFO L93 Difference]: Finished difference Result 103 states and 189 transitions. [2022-04-28 08:17:51,651 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 189 transitions. [2022-04-28 08:17:51,652 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:17:51,652 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:17:51,652 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:17:51,653 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:17:51,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 67 states have (on average 1.8955223880597014) internal successors, (127), 67 states have internal predecessors, (127), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:17:51,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 130 transitions. [2022-04-28 08:17:51,658 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 130 transitions. Word has length 26 [2022-04-28 08:17:51,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:17:51,659 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 130 transitions. [2022-04-28 08:17:51,659 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:17:51,659 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 71 states and 130 transitions. [2022-04-28 08:17:51,819 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 130 edges. 130 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:17:51,819 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 130 transitions. [2022-04-28 08:17:51,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-28 08:17:51,826 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:17:51,826 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:17:51,826 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 08:17:51,827 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:17:51,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:17:51,828 INFO L85 PathProgramCache]: Analyzing trace with hash 208665503, now seen corresponding path program 1 times [2022-04-28 08:17:51,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:17:51,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [908374164] [2022-04-28 08:17:51,829 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:17:51,829 INFO L85 PathProgramCache]: Analyzing trace with hash 208665503, now seen corresponding path program 2 times [2022-04-28 08:17:51,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:17:51,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241514846] [2022-04-28 08:17:51,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:17:51,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:17:51,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:17:51,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:17:51,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:17:51,932 INFO L290 TraceCheckUtils]: 0: Hoare triple {665#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {659#true} is VALID [2022-04-28 08:17:51,932 INFO L290 TraceCheckUtils]: 1: Hoare triple {659#true} assume true; {659#true} is VALID [2022-04-28 08:17:51,932 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {659#true} {659#true} #285#return; {659#true} is VALID [2022-04-28 08:17:51,933 INFO L272 TraceCheckUtils]: 0: Hoare triple {659#true} call ULTIMATE.init(); {665#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:17:51,933 INFO L290 TraceCheckUtils]: 1: Hoare triple {665#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {659#true} is VALID [2022-04-28 08:17:51,933 INFO L290 TraceCheckUtils]: 2: Hoare triple {659#true} assume true; {659#true} is VALID [2022-04-28 08:17:51,934 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {659#true} {659#true} #285#return; {659#true} is VALID [2022-04-28 08:17:51,934 INFO L272 TraceCheckUtils]: 4: Hoare triple {659#true} call #t~ret20 := main(); {659#true} is VALID [2022-04-28 08:17:51,934 INFO L290 TraceCheckUtils]: 5: Hoare triple {659#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~p15~0 := #t~nondet18;havoc #t~nondet18;havoc ~lk15~0;havoc ~cond~0; {659#true} is VALID [2022-04-28 08:17:51,934 INFO L290 TraceCheckUtils]: 6: Hoare triple {659#true} assume !false;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;~cond~0 := #t~nondet19;havoc #t~nondet19; {659#true} is VALID [2022-04-28 08:17:51,934 INFO L290 TraceCheckUtils]: 7: Hoare triple {659#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0;~lk15~0 := 0; {659#true} is VALID [2022-04-28 08:17:51,935 INFO L290 TraceCheckUtils]: 8: Hoare triple {659#true} assume 0 != ~p1~0;~lk1~0 := 1; {664#(not (= main_~p1~0 0))} is VALID [2022-04-28 08:17:51,935 INFO L290 TraceCheckUtils]: 9: Hoare triple {664#(not (= main_~p1~0 0))} assume !(0 != ~p2~0); {664#(not (= main_~p1~0 0))} is VALID [2022-04-28 08:17:51,936 INFO L290 TraceCheckUtils]: 10: Hoare triple {664#(not (= main_~p1~0 0))} assume 0 != ~p3~0;~lk3~0 := 1; {664#(not (= main_~p1~0 0))} is VALID [2022-04-28 08:17:51,936 INFO L290 TraceCheckUtils]: 11: Hoare triple {664#(not (= main_~p1~0 0))} assume 0 != ~p4~0;~lk4~0 := 1; {664#(not (= main_~p1~0 0))} is VALID [2022-04-28 08:17:51,937 INFO L290 TraceCheckUtils]: 12: Hoare triple {664#(not (= main_~p1~0 0))} assume 0 != ~p5~0;~lk5~0 := 1; {664#(not (= main_~p1~0 0))} is VALID [2022-04-28 08:17:51,937 INFO L290 TraceCheckUtils]: 13: Hoare triple {664#(not (= main_~p1~0 0))} assume 0 != ~p6~0;~lk6~0 := 1; {664#(not (= main_~p1~0 0))} is VALID [2022-04-28 08:17:51,937 INFO L290 TraceCheckUtils]: 14: Hoare triple {664#(not (= main_~p1~0 0))} assume 0 != ~p7~0;~lk7~0 := 1; {664#(not (= main_~p1~0 0))} is VALID [2022-04-28 08:17:51,938 INFO L290 TraceCheckUtils]: 15: Hoare triple {664#(not (= main_~p1~0 0))} assume 0 != ~p8~0;~lk8~0 := 1; {664#(not (= main_~p1~0 0))} is VALID [2022-04-28 08:17:51,938 INFO L290 TraceCheckUtils]: 16: Hoare triple {664#(not (= main_~p1~0 0))} assume 0 != ~p9~0;~lk9~0 := 1; {664#(not (= main_~p1~0 0))} is VALID [2022-04-28 08:17:51,939 INFO L290 TraceCheckUtils]: 17: Hoare triple {664#(not (= main_~p1~0 0))} assume !(0 != ~p10~0); {664#(not (= main_~p1~0 0))} is VALID [2022-04-28 08:17:51,939 INFO L290 TraceCheckUtils]: 18: Hoare triple {664#(not (= main_~p1~0 0))} assume 0 != ~p11~0;~lk11~0 := 1; {664#(not (= main_~p1~0 0))} is VALID [2022-04-28 08:17:51,939 INFO L290 TraceCheckUtils]: 19: Hoare triple {664#(not (= main_~p1~0 0))} assume 0 != ~p12~0;~lk12~0 := 1; {664#(not (= main_~p1~0 0))} is VALID [2022-04-28 08:17:51,940 INFO L290 TraceCheckUtils]: 20: Hoare triple {664#(not (= main_~p1~0 0))} assume 0 != ~p13~0;~lk13~0 := 1; {664#(not (= main_~p1~0 0))} is VALID [2022-04-28 08:17:51,940 INFO L290 TraceCheckUtils]: 21: Hoare triple {664#(not (= main_~p1~0 0))} assume 0 != ~p14~0;~lk14~0 := 1; {664#(not (= main_~p1~0 0))} is VALID [2022-04-28 08:17:51,941 INFO L290 TraceCheckUtils]: 22: Hoare triple {664#(not (= main_~p1~0 0))} assume 0 != ~p15~0;~lk15~0 := 1; {664#(not (= main_~p1~0 0))} is VALID [2022-04-28 08:17:51,941 INFO L290 TraceCheckUtils]: 23: Hoare triple {664#(not (= main_~p1~0 0))} assume !(0 != ~p1~0); {660#false} is VALID [2022-04-28 08:17:51,941 INFO L290 TraceCheckUtils]: 24: Hoare triple {660#false} assume !(0 != ~p2~0); {660#false} is VALID [2022-04-28 08:17:51,942 INFO L290 TraceCheckUtils]: 25: Hoare triple {660#false} assume !false; {660#false} is VALID [2022-04-28 08:17:51,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 08:17:51,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:17:51,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241514846] [2022-04-28 08:17:51,943 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241514846] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:17:51,943 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:17:51,943 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:17:51,943 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:17:51,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [908374164] [2022-04-28 08:17:51,943 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [908374164] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:17:51,944 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:17:51,944 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:17:51,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060942807] [2022-04-28 08:17:51,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:17:51,945 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-28 08:17:51,945 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:17:51,945 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:17:51,964 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:17:51,964 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:17:51,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:17:51,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:17:51,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:17:51,965 INFO L87 Difference]: Start difference. First operand 71 states and 130 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:17:52,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:17:52,285 INFO L93 Difference]: Finished difference Result 169 states and 315 transitions. [2022-04-28 08:17:52,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:17:52,285 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-28 08:17:52,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:17:52,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:17:52,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 283 transitions. [2022-04-28 08:17:52,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:17:52,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 283 transitions. [2022-04-28 08:17:52,295 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 283 transitions. [2022-04-28 08:17:52,518 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 283 edges. 283 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:17:52,521 INFO L225 Difference]: With dead ends: 169 [2022-04-28 08:17:52,521 INFO L226 Difference]: Without dead ends: 104 [2022-04-28 08:17:52,521 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:17:52,522 INFO L413 NwaCegarLoop]: 156 mSDtfsCounter, 200 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 08:17:52,523 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 163 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 08:17:52,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-04-28 08:17:52,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 102. [2022-04-28 08:17:52,537 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:17:52,538 INFO L82 GeneralOperation]: Start isEquivalent. First operand 104 states. Second operand has 102 states, 98 states have (on average 1.8877551020408163) internal successors, (185), 98 states have internal predecessors, (185), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:17:52,538 INFO L74 IsIncluded]: Start isIncluded. First operand 104 states. Second operand has 102 states, 98 states have (on average 1.8877551020408163) internal successors, (185), 98 states have internal predecessors, (185), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:17:52,538 INFO L87 Difference]: Start difference. First operand 104 states. Second operand has 102 states, 98 states have (on average 1.8877551020408163) internal successors, (185), 98 states have internal predecessors, (185), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:17:52,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:17:52,543 INFO L93 Difference]: Finished difference Result 104 states and 189 transitions. [2022-04-28 08:17:52,543 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 189 transitions. [2022-04-28 08:17:52,543 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:17:52,543 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:17:52,544 INFO L74 IsIncluded]: Start isIncluded. First operand has 102 states, 98 states have (on average 1.8877551020408163) internal successors, (185), 98 states have internal predecessors, (185), 2 states have call successors, (2), 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 104 states. [2022-04-28 08:17:52,544 INFO L87 Difference]: Start difference. First operand has 102 states, 98 states have (on average 1.8877551020408163) internal successors, (185), 98 states have internal predecessors, (185), 2 states have call successors, (2), 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 104 states. [2022-04-28 08:17:52,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:17:52,548 INFO L93 Difference]: Finished difference Result 104 states and 189 transitions. [2022-04-28 08:17:52,548 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 189 transitions. [2022-04-28 08:17:52,549 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:17:52,549 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:17:52,549 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:17:52,549 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:17:52,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 98 states have (on average 1.8877551020408163) internal successors, (185), 98 states have internal predecessors, (185), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:17:52,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 188 transitions. [2022-04-28 08:17:52,553 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 188 transitions. Word has length 26 [2022-04-28 08:17:52,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:17:52,554 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 188 transitions. [2022-04-28 08:17:52,554 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:17:52,554 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 102 states and 188 transitions. [2022-04-28 08:17:52,735 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 188 edges. 188 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:17:52,736 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 188 transitions. [2022-04-28 08:17:52,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-28 08:17:52,741 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:17:52,741 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:17:52,746 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 08:17:52,747 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:17:52,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:17:52,748 INFO L85 PathProgramCache]: Analyzing trace with hash -1785486395, now seen corresponding path program 1 times [2022-04-28 08:17:52,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:17:52,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [107298922] [2022-04-28 08:17:52,749 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:17:52,749 INFO L85 PathProgramCache]: Analyzing trace with hash -1785486395, now seen corresponding path program 2 times [2022-04-28 08:17:52,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:17:52,749 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129989161] [2022-04-28 08:17:52,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:17:52,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:17:52,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:17:52,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 08:17:52,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 08:17:52,859 INFO L290 TraceCheckUtils]: 0: Hoare triple {1427#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {1421#true} is VALID [2022-04-28 08:17:52,859 INFO L290 TraceCheckUtils]: 1: Hoare triple {1421#true} assume true; {1421#true} is VALID [2022-04-28 08:17:52,860 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1421#true} {1421#true} #285#return; {1421#true} is VALID [2022-04-28 08:17:52,861 INFO L272 TraceCheckUtils]: 0: Hoare triple {1421#true} call ULTIMATE.init(); {1427#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 08:17:52,861 INFO L290 TraceCheckUtils]: 1: Hoare triple {1427#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {1421#true} is VALID [2022-04-28 08:17:52,861 INFO L290 TraceCheckUtils]: 2: Hoare triple {1421#true} assume true; {1421#true} is VALID [2022-04-28 08:17:52,861 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1421#true} {1421#true} #285#return; {1421#true} is VALID [2022-04-28 08:17:52,861 INFO L272 TraceCheckUtils]: 4: Hoare triple {1421#true} call #t~ret20 := main(); {1421#true} is VALID [2022-04-28 08:17:52,862 INFO L290 TraceCheckUtils]: 5: Hoare triple {1421#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~p1~0 := #t~nondet4;havoc #t~nondet4;havoc ~lk1~0;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~p2~0 := #t~nondet5;havoc #t~nondet5;havoc ~lk2~0;assume -2147483648 <= #t~nondet6 && #t~nondet6 <= 2147483647;~p3~0 := #t~nondet6;havoc #t~nondet6;havoc ~lk3~0;assume -2147483648 <= #t~nondet7 && #t~nondet7 <= 2147483647;~p4~0 := #t~nondet7;havoc #t~nondet7;havoc ~lk4~0;assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647;~p5~0 := #t~nondet8;havoc #t~nondet8;havoc ~lk5~0;assume -2147483648 <= #t~nondet9 && #t~nondet9 <= 2147483647;~p6~0 := #t~nondet9;havoc #t~nondet9;havoc ~lk6~0;assume -2147483648 <= #t~nondet10 && #t~nondet10 <= 2147483647;~p7~0 := #t~nondet10;havoc #t~nondet10;havoc ~lk7~0;assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647;~p8~0 := #t~nondet11;havoc #t~nondet11;havoc ~lk8~0;assume -2147483648 <= #t~nondet12 && #t~nondet12 <= 2147483647;~p9~0 := #t~nondet12;havoc #t~nondet12;havoc ~lk9~0;assume -2147483648 <= #t~nondet13 && #t~nondet13 <= 2147483647;~p10~0 := #t~nondet13;havoc #t~nondet13;havoc ~lk10~0;assume -2147483648 <= #t~nondet14 && #t~nondet14 <= 2147483647;~p11~0 := #t~nondet14;havoc #t~nondet14;havoc ~lk11~0;assume -2147483648 <= #t~nondet15 && #t~nondet15 <= 2147483647;~p12~0 := #t~nondet15;havoc #t~nondet15;havoc ~lk12~0;assume -2147483648 <= #t~nondet16 && #t~nondet16 <= 2147483647;~p13~0 := #t~nondet16;havoc #t~nondet16;havoc ~lk13~0;assume -2147483648 <= #t~nondet17 && #t~nondet17 <= 2147483647;~p14~0 := #t~nondet17;havoc #t~nondet17;havoc ~lk14~0;assume -2147483648 <= #t~nondet18 && #t~nondet18 <= 2147483647;~p15~0 := #t~nondet18;havoc #t~nondet18;havoc ~lk15~0;havoc ~cond~0; {1421#true} is VALID [2022-04-28 08:17:52,862 INFO L290 TraceCheckUtils]: 6: Hoare triple {1421#true} assume !false;assume -2147483648 <= #t~nondet19 && #t~nondet19 <= 2147483647;~cond~0 := #t~nondet19;havoc #t~nondet19; {1421#true} is VALID [2022-04-28 08:17:52,862 INFO L290 TraceCheckUtils]: 7: Hoare triple {1421#true} assume !(0 == ~cond~0);~lk1~0 := 0;~lk2~0 := 0;~lk3~0 := 0;~lk4~0 := 0;~lk5~0 := 0;~lk6~0 := 0;~lk7~0 := 0;~lk8~0 := 0;~lk9~0 := 0;~lk10~0 := 0;~lk11~0 := 0;~lk12~0 := 0;~lk13~0 := 0;~lk14~0 := 0;~lk15~0 := 0; {1421#true} is VALID [2022-04-28 08:17:52,863 INFO L290 TraceCheckUtils]: 8: Hoare triple {1421#true} assume !(0 != ~p1~0); {1426#(= main_~p1~0 0)} is VALID [2022-04-28 08:17:52,864 INFO L290 TraceCheckUtils]: 9: Hoare triple {1426#(= main_~p1~0 0)} assume !(0 != ~p2~0); {1426#(= main_~p1~0 0)} is VALID [2022-04-28 08:17:52,864 INFO L290 TraceCheckUtils]: 10: Hoare triple {1426#(= main_~p1~0 0)} assume 0 != ~p3~0;~lk3~0 := 1; {1426#(= main_~p1~0 0)} is VALID [2022-04-28 08:17:52,864 INFO L290 TraceCheckUtils]: 11: Hoare triple {1426#(= main_~p1~0 0)} assume 0 != ~p4~0;~lk4~0 := 1; {1426#(= main_~p1~0 0)} is VALID [2022-04-28 08:17:52,865 INFO L290 TraceCheckUtils]: 12: Hoare triple {1426#(= main_~p1~0 0)} assume 0 != ~p5~0;~lk5~0 := 1; {1426#(= main_~p1~0 0)} is VALID [2022-04-28 08:17:52,868 INFO L290 TraceCheckUtils]: 13: Hoare triple {1426#(= main_~p1~0 0)} assume 0 != ~p6~0;~lk6~0 := 1; {1426#(= main_~p1~0 0)} is VALID [2022-04-28 08:17:52,868 INFO L290 TraceCheckUtils]: 14: Hoare triple {1426#(= main_~p1~0 0)} assume 0 != ~p7~0;~lk7~0 := 1; {1426#(= main_~p1~0 0)} is VALID [2022-04-28 08:17:52,869 INFO L290 TraceCheckUtils]: 15: Hoare triple {1426#(= main_~p1~0 0)} assume 0 != ~p8~0;~lk8~0 := 1; {1426#(= main_~p1~0 0)} is VALID [2022-04-28 08:17:52,869 INFO L290 TraceCheckUtils]: 16: Hoare triple {1426#(= main_~p1~0 0)} assume 0 != ~p9~0;~lk9~0 := 1; {1426#(= main_~p1~0 0)} is VALID [2022-04-28 08:17:52,870 INFO L290 TraceCheckUtils]: 17: Hoare triple {1426#(= main_~p1~0 0)} assume !(0 != ~p10~0); {1426#(= main_~p1~0 0)} is VALID [2022-04-28 08:17:52,870 INFO L290 TraceCheckUtils]: 18: Hoare triple {1426#(= main_~p1~0 0)} assume 0 != ~p11~0;~lk11~0 := 1; {1426#(= main_~p1~0 0)} is VALID [2022-04-28 08:17:52,871 INFO L290 TraceCheckUtils]: 19: Hoare triple {1426#(= main_~p1~0 0)} assume 0 != ~p12~0;~lk12~0 := 1; {1426#(= main_~p1~0 0)} is VALID [2022-04-28 08:17:52,871 INFO L290 TraceCheckUtils]: 20: Hoare triple {1426#(= main_~p1~0 0)} assume 0 != ~p13~0;~lk13~0 := 1; {1426#(= main_~p1~0 0)} is VALID [2022-04-28 08:17:52,872 INFO L290 TraceCheckUtils]: 21: Hoare triple {1426#(= main_~p1~0 0)} assume 0 != ~p14~0;~lk14~0 := 1; {1426#(= main_~p1~0 0)} is VALID [2022-04-28 08:17:52,872 INFO L290 TraceCheckUtils]: 22: Hoare triple {1426#(= main_~p1~0 0)} assume 0 != ~p15~0;~lk15~0 := 1; {1426#(= main_~p1~0 0)} is VALID [2022-04-28 08:17:52,872 INFO L290 TraceCheckUtils]: 23: Hoare triple {1426#(= main_~p1~0 0)} assume 0 != ~p1~0; {1422#false} is VALID [2022-04-28 08:17:52,873 INFO L290 TraceCheckUtils]: 24: Hoare triple {1422#false} assume 1 != ~lk1~0; {1422#false} is VALID [2022-04-28 08:17:52,873 INFO L290 TraceCheckUtils]: 25: Hoare triple {1422#false} assume !false; {1422#false} is VALID [2022-04-28 08:17:52,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 08:17:52,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 08:17:52,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129989161] [2022-04-28 08:17:52,874 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129989161] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:17:52,874 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:17:52,874 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:17:52,875 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 08:17:52,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [107298922] [2022-04-28 08:17:52,875 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [107298922] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 08:17:52,875 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 08:17:52,875 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 08:17:52,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025947324] [2022-04-28 08:17:52,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 08:17:52,876 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-28 08:17:52,876 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 08:17:52,876 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:17:52,895 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:17:52,895 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 08:17:52,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 08:17:52,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 08:17:52,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 08:17:52,897 INFO L87 Difference]: Start difference. First operand 102 states and 188 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:17:53,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:17:53,209 INFO L93 Difference]: Finished difference Result 156 states and 283 transitions. [2022-04-28 08:17:53,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 08:17:53,209 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-28 08:17:53,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 08:17:53,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:17:53,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 279 transitions. [2022-04-28 08:17:53,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:17:53,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 279 transitions. [2022-04-28 08:17:53,217 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 279 transitions. [2022-04-28 08:17:53,434 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 279 edges. 279 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:17:53,437 INFO L225 Difference]: With dead ends: 156 [2022-04-28 08:17:53,437 INFO L226 Difference]: Without dead ends: 106 [2022-04-28 08:17:53,438 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-28 08:17:53,441 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 224 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 08:17:53,443 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 134 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 08:17:53,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-04-28 08:17:53,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 104. [2022-04-28 08:17:53,467 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 08:17:53,467 INFO L82 GeneralOperation]: Start isEquivalent. First operand 106 states. Second operand has 104 states, 100 states have (on average 1.85) internal successors, (185), 100 states have internal predecessors, (185), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:17:53,468 INFO L74 IsIncluded]: Start isIncluded. First operand 106 states. Second operand has 104 states, 100 states have (on average 1.85) internal successors, (185), 100 states have internal predecessors, (185), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:17:53,468 INFO L87 Difference]: Start difference. First operand 106 states. Second operand has 104 states, 100 states have (on average 1.85) internal successors, (185), 100 states have internal predecessors, (185), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:17:53,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:17:53,471 INFO L93 Difference]: Finished difference Result 106 states and 189 transitions. [2022-04-28 08:17:53,472 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 189 transitions. [2022-04-28 08:17:53,472 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:17:53,472 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:17:53,472 INFO L74 IsIncluded]: Start isIncluded. First operand has 104 states, 100 states have (on average 1.85) internal successors, (185), 100 states have internal predecessors, (185), 2 states have call successors, (2), 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 106 states. [2022-04-28 08:17:53,473 INFO L87 Difference]: Start difference. First operand has 104 states, 100 states have (on average 1.85) internal successors, (185), 100 states have internal predecessors, (185), 2 states have call successors, (2), 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 106 states. [2022-04-28 08:17:53,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 08:17:53,477 INFO L93 Difference]: Finished difference Result 106 states and 189 transitions. [2022-04-28 08:17:53,477 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 189 transitions. [2022-04-28 08:17:53,477 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 08:17:53,477 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 08:17:53,477 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 08:17:53,477 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 08:17:53,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 100 states have (on average 1.85) internal successors, (185), 100 states have internal predecessors, (185), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:17:53,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 188 transitions. [2022-04-28 08:17:53,481 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 188 transitions. Word has length 26 [2022-04-28 08:17:53,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 08:17:53,481 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 188 transitions. [2022-04-28 08:17:53,482 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 08:17:53,482 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 104 states and 188 transitions. [2022-04-28 08:17:53,662 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 188 edges. 188 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 08:17:53,662 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 188 transitions. [2022-04-28 08:17:53,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-28 08:17:53,662 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 08:17:53,663 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 08:17:53,663 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-28 08:17:53,663 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 08:17:53,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 08:17:53,664 INFO L85 PathProgramCache]: Analyzing trace with hash -1785479203, now seen corresponding path program 1 times [2022-04-28 08:17:53,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 08:17:53,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1054825286] [2022-04-28 08:17:53,664 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 08:17:53,664 INFO L85 PathProgramCache]: Analyzing trace with hash -1785479203, now seen corresponding path program 2 times [2022-04-28 08:17:53,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 08:17:53,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340179558] [2022-04-28 08:17:53,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 08:17:53,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 08:17:53,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 08:17:53,741 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 08:17:53,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 08:17:53,792 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 08:17:53,793 INFO L130 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found a feasible trace [2022-04-28 08:17:53,793 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-04-28 08:17:53,795 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-28 08:17:53,797 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-28 08:17:53,800 INFO L356 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2] [2022-04-28 08:17:53,803 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-28 08:17:53,817 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-28 08:17:53,817 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2022-04-28 08:17:53,817 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-28 08:17:53,817 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-28 08:17:53,817 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2022-04-28 08:17:53,817 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-28 08:17:53,817 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-28 08:17:53,817 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-28 08:17:53,817 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-28 08:17:53,817 WARN L170 areAnnotationChecker]: L225-1 has no Hoare annotation [2022-04-28 08:17:53,817 WARN L170 areAnnotationChecker]: L225-1 has no Hoare annotation [2022-04-28 08:17:53,817 WARN L170 areAnnotationChecker]: L225-1 has no Hoare annotation [2022-04-28 08:17:53,817 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-28 08:17:53,818 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-28 08:17:53,818 WARN L170 areAnnotationChecker]: L231 has no Hoare annotation [2022-04-28 08:17:53,818 WARN L170 areAnnotationChecker]: L58 has no Hoare annotation [2022-04-28 08:17:53,818 WARN L170 areAnnotationChecker]: L58 has no Hoare annotation [2022-04-28 08:17:53,818 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-28 08:17:53,818 WARN L170 areAnnotationChecker]: L93 has no Hoare annotation [2022-04-28 08:17:53,818 WARN L170 areAnnotationChecker]: L93 has no Hoare annotation [2022-04-28 08:17:53,818 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-28 08:17:53,818 WARN L170 areAnnotationChecker]: L93-2 has no Hoare annotation [2022-04-28 08:17:53,818 WARN L170 areAnnotationChecker]: L93-2 has no Hoare annotation [2022-04-28 08:17:53,818 WARN L170 areAnnotationChecker]: L97-1 has no Hoare annotation [2022-04-28 08:17:53,818 WARN L170 areAnnotationChecker]: L97-1 has no Hoare annotation [2022-04-28 08:17:53,818 WARN L170 areAnnotationChecker]: L101-1 has no Hoare annotation [2022-04-28 08:17:53,818 WARN L170 areAnnotationChecker]: L101-1 has no Hoare annotation [2022-04-28 08:17:53,818 WARN L170 areAnnotationChecker]: L105-1 has no Hoare annotation [2022-04-28 08:17:53,818 WARN L170 areAnnotationChecker]: L105-1 has no Hoare annotation [2022-04-28 08:17:53,819 WARN L170 areAnnotationChecker]: L109-1 has no Hoare annotation [2022-04-28 08:17:53,819 WARN L170 areAnnotationChecker]: L109-1 has no Hoare annotation [2022-04-28 08:17:53,819 WARN L170 areAnnotationChecker]: L113-1 has no Hoare annotation [2022-04-28 08:17:53,819 WARN L170 areAnnotationChecker]: L113-1 has no Hoare annotation [2022-04-28 08:17:53,819 WARN L170 areAnnotationChecker]: L117-1 has no Hoare annotation [2022-04-28 08:17:53,819 WARN L170 areAnnotationChecker]: L117-1 has no Hoare annotation [2022-04-28 08:17:53,819 WARN L170 areAnnotationChecker]: L121-1 has no Hoare annotation [2022-04-28 08:17:53,819 WARN L170 areAnnotationChecker]: L121-1 has no Hoare annotation [2022-04-28 08:17:53,819 WARN L170 areAnnotationChecker]: L125-1 has no Hoare annotation [2022-04-28 08:17:53,819 WARN L170 areAnnotationChecker]: L125-1 has no Hoare annotation [2022-04-28 08:17:53,819 WARN L170 areAnnotationChecker]: L129-1 has no Hoare annotation [2022-04-28 08:17:53,819 WARN L170 areAnnotationChecker]: L129-1 has no Hoare annotation [2022-04-28 08:17:53,819 WARN L170 areAnnotationChecker]: L133-1 has no Hoare annotation [2022-04-28 08:17:53,819 WARN L170 areAnnotationChecker]: L133-1 has no Hoare annotation [2022-04-28 08:17:53,819 WARN L170 areAnnotationChecker]: L137-1 has no Hoare annotation [2022-04-28 08:17:53,819 WARN L170 areAnnotationChecker]: L137-1 has no Hoare annotation [2022-04-28 08:17:53,819 WARN L170 areAnnotationChecker]: L141-1 has no Hoare annotation [2022-04-28 08:17:53,820 WARN L170 areAnnotationChecker]: L141-1 has no Hoare annotation [2022-04-28 08:17:53,820 WARN L170 areAnnotationChecker]: L145-1 has no Hoare annotation [2022-04-28 08:17:53,820 WARN L170 areAnnotationChecker]: L145-1 has no Hoare annotation [2022-04-28 08:17:53,820 WARN L170 areAnnotationChecker]: L149-1 has no Hoare annotation [2022-04-28 08:17:53,820 WARN L170 areAnnotationChecker]: L149-1 has no Hoare annotation [2022-04-28 08:17:53,820 WARN L170 areAnnotationChecker]: L156 has no Hoare annotation [2022-04-28 08:17:53,820 WARN L170 areAnnotationChecker]: L156 has no Hoare annotation [2022-04-28 08:17:53,820 WARN L170 areAnnotationChecker]: L155-1 has no Hoare annotation [2022-04-28 08:17:53,820 WARN L170 areAnnotationChecker]: L155-1 has no Hoare annotation [2022-04-28 08:17:53,820 WARN L170 areAnnotationChecker]: L226-1 has no Hoare annotation [2022-04-28 08:17:53,820 WARN L170 areAnnotationChecker]: L226-1 has no Hoare annotation [2022-04-28 08:17:53,820 WARN L170 areAnnotationChecker]: L161 has no Hoare annotation [2022-04-28 08:17:53,820 WARN L170 areAnnotationChecker]: L161 has no Hoare annotation [2022-04-28 08:17:53,820 WARN L170 areAnnotationChecker]: L160 has no Hoare annotation [2022-04-28 08:17:53,820 WARN L170 areAnnotationChecker]: L160 has no Hoare annotation [2022-04-28 08:17:53,820 WARN L170 areAnnotationChecker]: L166 has no Hoare annotation [2022-04-28 08:17:53,820 WARN L170 areAnnotationChecker]: L166 has no Hoare annotation [2022-04-28 08:17:53,821 WARN L170 areAnnotationChecker]: L165-1 has no Hoare annotation [2022-04-28 08:17:53,821 WARN L170 areAnnotationChecker]: L165-1 has no Hoare annotation [2022-04-28 08:17:53,821 WARN L170 areAnnotationChecker]: L171 has no Hoare annotation [2022-04-28 08:17:53,821 WARN L170 areAnnotationChecker]: L171 has no Hoare annotation [2022-04-28 08:17:53,821 WARN L170 areAnnotationChecker]: L170-1 has no Hoare annotation [2022-04-28 08:17:53,821 WARN L170 areAnnotationChecker]: L170-1 has no Hoare annotation [2022-04-28 08:17:53,821 WARN L170 areAnnotationChecker]: L176 has no Hoare annotation [2022-04-28 08:17:53,821 WARN L170 areAnnotationChecker]: L176 has no Hoare annotation [2022-04-28 08:17:53,821 WARN L170 areAnnotationChecker]: L175-1 has no Hoare annotation [2022-04-28 08:17:53,821 WARN L170 areAnnotationChecker]: L175-1 has no Hoare annotation [2022-04-28 08:17:53,821 WARN L170 areAnnotationChecker]: L181 has no Hoare annotation [2022-04-28 08:17:53,821 WARN L170 areAnnotationChecker]: L181 has no Hoare annotation [2022-04-28 08:17:53,821 WARN L170 areAnnotationChecker]: L180-1 has no Hoare annotation [2022-04-28 08:17:53,821 WARN L170 areAnnotationChecker]: L180-1 has no Hoare annotation [2022-04-28 08:17:53,821 WARN L170 areAnnotationChecker]: L186 has no Hoare annotation [2022-04-28 08:17:53,821 WARN L170 areAnnotationChecker]: L186 has no Hoare annotation [2022-04-28 08:17:53,822 WARN L170 areAnnotationChecker]: L185-1 has no Hoare annotation [2022-04-28 08:17:53,822 WARN L170 areAnnotationChecker]: L185-1 has no Hoare annotation [2022-04-28 08:17:53,822 WARN L170 areAnnotationChecker]: L191 has no Hoare annotation [2022-04-28 08:17:53,822 WARN L170 areAnnotationChecker]: L191 has no Hoare annotation [2022-04-28 08:17:53,822 WARN L170 areAnnotationChecker]: L190-1 has no Hoare annotation [2022-04-28 08:17:53,822 WARN L170 areAnnotationChecker]: L190-1 has no Hoare annotation [2022-04-28 08:17:53,822 WARN L170 areAnnotationChecker]: L196 has no Hoare annotation [2022-04-28 08:17:53,822 WARN L170 areAnnotationChecker]: L196 has no Hoare annotation [2022-04-28 08:17:53,822 WARN L170 areAnnotationChecker]: L195-1 has no Hoare annotation [2022-04-28 08:17:53,822 WARN L170 areAnnotationChecker]: L195-1 has no Hoare annotation [2022-04-28 08:17:53,822 WARN L170 areAnnotationChecker]: L201 has no Hoare annotation [2022-04-28 08:17:53,822 WARN L170 areAnnotationChecker]: L201 has no Hoare annotation [2022-04-28 08:17:53,822 WARN L170 areAnnotationChecker]: L200-1 has no Hoare annotation [2022-04-28 08:17:53,822 WARN L170 areAnnotationChecker]: L200-1 has no Hoare annotation [2022-04-28 08:17:53,822 WARN L170 areAnnotationChecker]: L206 has no Hoare annotation [2022-04-28 08:17:53,822 WARN L170 areAnnotationChecker]: L206 has no Hoare annotation [2022-04-28 08:17:53,822 WARN L170 areAnnotationChecker]: L205-1 has no Hoare annotation [2022-04-28 08:17:53,823 WARN L170 areAnnotationChecker]: L205-1 has no Hoare annotation [2022-04-28 08:17:53,823 WARN L170 areAnnotationChecker]: L211 has no Hoare annotation [2022-04-28 08:17:53,823 WARN L170 areAnnotationChecker]: L211 has no Hoare annotation [2022-04-28 08:17:53,823 WARN L170 areAnnotationChecker]: L210-1 has no Hoare annotation [2022-04-28 08:17:53,823 WARN L170 areAnnotationChecker]: L210-1 has no Hoare annotation [2022-04-28 08:17:53,823 WARN L170 areAnnotationChecker]: L216 has no Hoare annotation [2022-04-28 08:17:53,823 WARN L170 areAnnotationChecker]: L216 has no Hoare annotation [2022-04-28 08:17:53,823 WARN L170 areAnnotationChecker]: L215-1 has no Hoare annotation [2022-04-28 08:17:53,823 WARN L170 areAnnotationChecker]: L215-1 has no Hoare annotation [2022-04-28 08:17:53,823 WARN L170 areAnnotationChecker]: L221 has no Hoare annotation [2022-04-28 08:17:53,823 WARN L170 areAnnotationChecker]: L221 has no Hoare annotation [2022-04-28 08:17:53,823 WARN L170 areAnnotationChecker]: L220 has no Hoare annotation [2022-04-28 08:17:53,823 WARN L170 areAnnotationChecker]: L220 has no Hoare annotation [2022-04-28 08:17:53,823 WARN L170 areAnnotationChecker]: L226 has no Hoare annotation [2022-04-28 08:17:53,823 WARN L170 areAnnotationChecker]: L226 has no Hoare annotation [2022-04-28 08:17:53,823 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-28 08:17:53,825 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 08:17:53 BoogieIcfgContainer [2022-04-28 08:17:53,826 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-28 08:17:53,827 INFO L158 Benchmark]: Toolchain (without parser) took 4337.25ms. Allocated memory was 198.2MB in the beginning and 245.4MB in the end (delta: 47.2MB). Free memory was 144.6MB in the beginning and 115.0MB in the end (delta: 29.6MB). Peak memory consumption was 76.5MB. Max. memory is 8.0GB. [2022-04-28 08:17:53,827 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 198.2MB. Free memory was 160.7MB in the beginning and 160.6MB in the end (delta: 89.7kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 08:17:53,827 INFO L158 Benchmark]: CACSL2BoogieTranslator took 296.72ms. Allocated memory was 198.2MB in the beginning and 245.4MB in the end (delta: 47.2MB). Free memory was 144.3MB in the beginning and 218.1MB in the end (delta: -73.7MB). Peak memory consumption was 10.9MB. Max. memory is 8.0GB. [2022-04-28 08:17:53,828 INFO L158 Benchmark]: Boogie Preprocessor took 34.95ms. Allocated memory is still 245.4MB. Free memory was 218.1MB in the beginning and 216.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-28 08:17:53,829 INFO L158 Benchmark]: RCFGBuilder took 458.27ms. Allocated memory is still 245.4MB. Free memory was 216.0MB in the beginning and 199.1MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2022-04-28 08:17:53,830 INFO L158 Benchmark]: TraceAbstraction took 3540.71ms. Allocated memory is still 245.4MB. Free memory was 198.6MB in the beginning and 115.0MB in the end (delta: 83.5MB). Peak memory consumption was 84.5MB. Max. memory is 8.0GB. [2022-04-28 08:17:53,832 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.12ms. Allocated memory is still 198.2MB. Free memory was 160.7MB in the beginning and 160.6MB in the end (delta: 89.7kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 296.72ms. Allocated memory was 198.2MB in the beginning and 245.4MB in the end (delta: 47.2MB). Free memory was 144.3MB in the beginning and 218.1MB in the end (delta: -73.7MB). Peak memory consumption was 10.9MB. Max. memory is 8.0GB. * Boogie Preprocessor took 34.95ms. Allocated memory is still 245.4MB. Free memory was 218.1MB in the beginning and 216.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 458.27ms. Allocated memory is still 245.4MB. Free memory was 216.0MB in the beginning and 199.1MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * TraceAbstraction took 3540.71ms. Allocated memory is still 245.4MB. Free memory was 198.6MB in the beginning and 115.0MB in the end (delta: 83.5MB). Peak memory consumption was 84.5MB. 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 - CounterExampleResult [Line: 233]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L8] int p1 = __VERIFIER_nondet_int(); [L9] int lk1; [L11] int p2 = __VERIFIER_nondet_int(); [L12] int lk2; [L14] int p3 = __VERIFIER_nondet_int(); [L15] int lk3; [L17] int p4 = __VERIFIER_nondet_int(); [L18] int lk4; [L20] int p5 = __VERIFIER_nondet_int(); [L21] int lk5; [L23] int p6 = __VERIFIER_nondet_int(); [L24] int lk6; [L26] int p7 = __VERIFIER_nondet_int(); [L27] int lk7; [L29] int p8 = __VERIFIER_nondet_int(); [L30] int lk8; [L32] int p9 = __VERIFIER_nondet_int(); [L33] int lk9; [L35] int p10 = __VERIFIER_nondet_int(); [L36] int lk10; [L38] int p11 = __VERIFIER_nondet_int(); [L39] int lk11; [L41] int p12 = __VERIFIER_nondet_int(); [L42] int lk12; [L44] int p13 = __VERIFIER_nondet_int(); [L45] int lk13; [L47] int p14 = __VERIFIER_nondet_int(); [L48] int lk14; [L50] int p15 = __VERIFIER_nondet_int(); [L51] int lk15; [L54] int cond; [L56] COND TRUE 1 [L57] cond = __VERIFIER_nondet_int() [L58] COND FALSE !(cond == 0) [L61] lk1 = 0 [L63] lk2 = 0 [L65] lk3 = 0 [L67] lk4 = 0 [L69] lk5 = 0 [L71] lk6 = 0 [L73] lk7 = 0 [L75] lk8 = 0 [L77] lk9 = 0 [L79] lk10 = 0 [L81] lk11 = 0 [L83] lk12 = 0 [L85] lk13 = 0 [L87] lk14 = 0 [L89] lk15 = 0 [L93] COND FALSE !(p1 != 0) [L97] COND FALSE !(p2 != 0) [L101] COND TRUE p3 != 0 [L102] lk3 = 1 [L105] COND TRUE p4 != 0 [L106] lk4 = 1 [L109] COND TRUE p5 != 0 [L110] lk5 = 1 [L113] COND TRUE p6 != 0 [L114] lk6 = 1 [L117] COND TRUE p7 != 0 [L118] lk7 = 1 [L121] COND TRUE p8 != 0 [L122] lk8 = 1 [L125] COND TRUE p9 != 0 [L126] lk9 = 1 [L129] COND FALSE !(p10 != 0) [L133] COND TRUE p11 != 0 [L134] lk11 = 1 [L137] COND TRUE p12 != 0 [L138] lk12 = 1 [L141] COND TRUE p13 != 0 [L142] lk13 = 1 [L145] COND TRUE p14 != 0 [L146] lk14 = 1 [L149] COND TRUE p15 != 0 [L150] lk15 = 1 [L155] COND FALSE !(p1 != 0) [L160] COND FALSE !(p2 != 0) [L233] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 63 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.5s, OverallIterations: 4, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 684 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 684 mSDsluCounter, 415 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 23 mSDsCounter, 7 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 290 IncrementalHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7 mSolverCounterUnsat, 392 mSDtfsCounter, 290 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=104occurred in iteration=3, InterpolantAutomatonStates: 12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 36 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: No data available, 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 RESULT: Ultimate proved your program to be incorrect! [2022-04-28 08:17:53,859 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...