./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops-crafted-1/iftelse.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops-crafted-1/iftelse.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a98f1431f10d7e60a67a648eec648b7f5eb5616fa0d511e794bbda916609379b --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 02:04:06,388 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 02:04:06,446 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 02:04:06,450 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 02:04:06,451 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 02:04:06,481 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 02:04:06,481 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 02:04:06,482 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 02:04:06,482 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 02:04:06,482 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 02:04:06,483 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 02:04:06,483 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 02:04:06,496 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 02:04:06,496 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 02:04:06,496 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 02:04:06,496 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 02:04:06,497 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 02:04:06,497 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 02:04:06,497 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 02:04:06,497 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 02:04:06,497 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 02:04:06,500 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 02:04:06,500 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 02:04:06,501 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 02:04:06,501 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 02:04:06,501 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 02:04:06,501 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 02:04:06,501 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 02:04:06,502 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 02:04:06,502 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 02:04:06,504 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 02:04:06,504 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 02:04:06,505 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 02:04:06,505 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 02:04:06,505 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 02:04:06,505 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 02:04:06,505 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 02:04:06,505 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 02:04:06,505 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 02:04:06,505 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 02:04:06,506 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 02:04:06,506 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 02:04:06,507 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a98f1431f10d7e60a67a648eec648b7f5eb5616fa0d511e794bbda916609379b [2024-10-14 02:04:06,698 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 02:04:06,716 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 02:04:06,719 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 02:04:06,719 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 02:04:06,720 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 02:04:06,721 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops-crafted-1/iftelse.c [2024-10-14 02:04:07,894 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 02:04:08,035 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 02:04:08,036 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops-crafted-1/iftelse.c [2024-10-14 02:04:08,042 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aa20b182c/9a5f82db946441a6a4fd62f69bdfd370/FLAG1e6abda71 [2024-10-14 02:04:08,459 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aa20b182c/9a5f82db946441a6a4fd62f69bdfd370 [2024-10-14 02:04:08,461 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 02:04:08,462 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 02:04:08,463 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 02:04:08,464 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 02:04:08,467 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 02:04:08,468 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 02:04:08" (1/1) ... [2024-10-14 02:04:08,481 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@743eb07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:04:08, skipping insertion in model container [2024-10-14 02:04:08,481 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 02:04:08" (1/1) ... [2024-10-14 02:04:08,497 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 02:04:08,624 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops-crafted-1/iftelse.c[406,419] [2024-10-14 02:04:08,645 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 02:04:08,655 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 02:04:08,667 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops-crafted-1/iftelse.c[406,419] [2024-10-14 02:04:08,672 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 02:04:08,686 INFO L204 MainTranslator]: Completed translation [2024-10-14 02:04:08,686 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:04:08 WrapperNode [2024-10-14 02:04:08,686 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 02:04:08,687 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 02:04:08,688 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 02:04:08,688 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 02:04:08,693 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:04:08" (1/1) ... [2024-10-14 02:04:08,700 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:04:08" (1/1) ... [2024-10-14 02:04:08,714 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 41 [2024-10-14 02:04:08,715 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 02:04:08,716 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 02:04:08,716 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 02:04:08,717 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 02:04:08,725 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:04:08" (1/1) ... [2024-10-14 02:04:08,725 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:04:08" (1/1) ... [2024-10-14 02:04:08,727 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:04:08" (1/1) ... [2024-10-14 02:04:08,737 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-14 02:04:08,737 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:04:08" (1/1) ... [2024-10-14 02:04:08,737 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:04:08" (1/1) ... [2024-10-14 02:04:08,739 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:04:08" (1/1) ... [2024-10-14 02:04:08,741 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:04:08" (1/1) ... [2024-10-14 02:04:08,742 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:04:08" (1/1) ... [2024-10-14 02:04:08,743 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:04:08" (1/1) ... [2024-10-14 02:04:08,744 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 02:04:08,745 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 02:04:08,745 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 02:04:08,745 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 02:04:08,745 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:04:08" (1/1) ... [2024-10-14 02:04:08,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 02:04:08,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 02:04:08,777 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 02:04:08,783 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 02:04:08,826 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 02:04:08,826 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 02:04:08,827 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 02:04:08,827 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 02:04:08,875 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 02:04:08,877 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 02:04:08,995 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-10-14 02:04:08,996 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 02:04:09,015 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 02:04:09,016 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 02:04:09,016 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 02:04:09 BoogieIcfgContainer [2024-10-14 02:04:09,016 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 02:04:09,018 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 02:04:09,018 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 02:04:09,022 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 02:04:09,022 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 02:04:08" (1/3) ... [2024-10-14 02:04:09,022 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48a0aabf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 02:04:09, skipping insertion in model container [2024-10-14 02:04:09,023 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:04:08" (2/3) ... [2024-10-14 02:04:09,023 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48a0aabf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 02:04:09, skipping insertion in model container [2024-10-14 02:04:09,023 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 02:04:09" (3/3) ... [2024-10-14 02:04:09,024 INFO L112 eAbstractionObserver]: Analyzing ICFG iftelse.c [2024-10-14 02:04:09,040 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 02:04:09,040 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 02:04:09,082 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 02:04:09,087 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@5c221249, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 02:04:09,087 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 02:04:09,090 INFO L276 IsEmpty]: Start isEmpty. Operand has 12 states, 10 states have (on average 1.7) internal successors, (17), 11 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 02:04:09,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-14 02:04:09,095 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:04:09,095 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:04:09,096 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:04:09,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:04:09,100 INFO L85 PathProgramCache]: Analyzing trace with hash 721581727, now seen corresponding path program 1 times [2024-10-14 02:04:09,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:04:09,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134357588] [2024-10-14 02:04:09,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:04:09,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:04:09,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:04:09,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 02:04:09,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:04:09,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134357588] [2024-10-14 02:04:09,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134357588] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:04:09,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:04:09,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 02:04:09,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008170501] [2024-10-14 02:04:09,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:04:09,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 02:04:09,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:04:09,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 02:04:09,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 02:04:09,783 INFO L87 Difference]: Start difference. First operand has 12 states, 10 states have (on average 1.7) internal successors, (17), 11 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 02:04:09,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:04:09,926 INFO L93 Difference]: Finished difference Result 28 states and 44 transitions. [2024-10-14 02:04:09,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 02:04:09,928 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-10-14 02:04:09,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:04:09,933 INFO L225 Difference]: With dead ends: 28 [2024-10-14 02:04:09,934 INFO L226 Difference]: Without dead ends: 15 [2024-10-14 02:04:09,936 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-14 02:04:09,940 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 4 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 02:04:09,941 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 33 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 02:04:09,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2024-10-14 02:04:09,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 13. [2024-10-14 02:04:09,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 02:04:09,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 16 transitions. [2024-10-14 02:04:09,965 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 16 transitions. Word has length 7 [2024-10-14 02:04:09,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:04:09,967 INFO L471 AbstractCegarLoop]: Abstraction has 13 states and 16 transitions. [2024-10-14 02:04:09,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 02:04:09,967 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 16 transitions. [2024-10-14 02:04:09,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-14 02:04:09,968 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:04:09,968 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2024-10-14 02:04:09,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 02:04:09,968 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:04:09,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:04:09,969 INFO L85 PathProgramCache]: Analyzing trace with hash 690706510, now seen corresponding path program 1 times [2024-10-14 02:04:09,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:04:09,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699496541] [2024-10-14 02:04:09,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:04:09,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:04:09,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:04:10,002 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 02:04:10,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:04:10,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699496541] [2024-10-14 02:04:10,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699496541] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:04:10,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:04:10,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 02:04:10,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215779322] [2024-10-14 02:04:10,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:04:10,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 02:04:10,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:04:10,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 02:04:10,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 02:04:10,007 INFO L87 Difference]: Start difference. First operand 13 states and 16 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 02:04:10,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:04:10,018 INFO L93 Difference]: Finished difference Result 21 states and 26 transitions. [2024-10-14 02:04:10,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 02:04:10,019 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-10-14 02:04:10,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:04:10,019 INFO L225 Difference]: With dead ends: 21 [2024-10-14 02:04:10,019 INFO L226 Difference]: Without dead ends: 13 [2024-10-14 02:04:10,020 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 02:04:10,021 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 0 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 02:04:10,021 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 16 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 02:04:10,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2024-10-14 02:04:10,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2024-10-14 02:04:10,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 02:04:10,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2024-10-14 02:04:10,026 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 10 [2024-10-14 02:04:10,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:04:10,026 INFO L471 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2024-10-14 02:04:10,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 02:04:10,026 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2024-10-14 02:04:10,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-14 02:04:10,027 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:04:10,028 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-10-14 02:04:10,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 02:04:10,028 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:04:10,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:04:10,029 INFO L85 PathProgramCache]: Analyzing trace with hash -451900104, now seen corresponding path program 1 times [2024-10-14 02:04:10,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:04:10,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034492895] [2024-10-14 02:04:10,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:04:10,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:04:10,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:04:10,153 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 02:04:10,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:04:10,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034492895] [2024-10-14 02:04:10,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034492895] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 02:04:10,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1270465164] [2024-10-14 02:04:10,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:04:10,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 02:04:10,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 02:04:10,157 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 02:04:10,158 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-14 02:04:10,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:04:10,208 INFO L255 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-14 02:04:10,211 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 02:04:10,248 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 02:04:10,249 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 02:04:10,286 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 02:04:10,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1270465164] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 02:04:10,286 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 02:04:10,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 4] total 8 [2024-10-14 02:04:10,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903306165] [2024-10-14 02:04:10,287 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 02:04:10,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 02:04:10,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:04:10,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 02:04:10,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-10-14 02:04:10,288 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 02:04:10,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:04:10,326 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2024-10-14 02:04:10,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 02:04:10,327 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-10-14 02:04:10,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:04:10,328 INFO L225 Difference]: With dead ends: 36 [2024-10-14 02:04:10,328 INFO L226 Difference]: Without dead ends: 29 [2024-10-14 02:04:10,329 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-10-14 02:04:10,330 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 20 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 02:04:10,331 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 33 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 02:04:10,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-10-14 02:04:10,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 18. [2024-10-14 02:04:10,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 02:04:10,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2024-10-14 02:04:10,337 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 12 [2024-10-14 02:04:10,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:04:10,337 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2024-10-14 02:04:10,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 02:04:10,337 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2024-10-14 02:04:10,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-14 02:04:10,338 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:04:10,338 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:04:10,352 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-14 02:04:10,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 02:04:10,543 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:04:10,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:04:10,543 INFO L85 PathProgramCache]: Analyzing trace with hash -451840522, now seen corresponding path program 1 times [2024-10-14 02:04:10,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:04:10,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853086274] [2024-10-14 02:04:10,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:04:10,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:04:10,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:04:10,776 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 02:04:10,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:04:10,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853086274] [2024-10-14 02:04:10,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853086274] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 02:04:10,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [861522593] [2024-10-14 02:04:10,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:04:10,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 02:04:10,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 02:04:10,781 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 02:04:10,782 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-14 02:04:10,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:04:10,821 INFO L255 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-14 02:04:10,822 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 02:04:10,965 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 02:04:10,965 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 02:04:11,070 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 02:04:11,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [861522593] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 02:04:11,070 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 02:04:11,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2024-10-14 02:04:11,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465883172] [2024-10-14 02:04:11,071 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 02:04:11,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-14 02:04:11,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:04:11,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-14 02:04:11,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2024-10-14 02:04:11,072 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 02:04:11,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:04:11,759 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2024-10-14 02:04:11,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-14 02:04:11,759 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-10-14 02:04:11,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:04:11,760 INFO L225 Difference]: With dead ends: 39 [2024-10-14 02:04:11,760 INFO L226 Difference]: Without dead ends: 37 [2024-10-14 02:04:11,760 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2024-10-14 02:04:11,761 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 20 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-14 02:04:11,761 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 37 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-14 02:04:11,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-10-14 02:04:11,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 33. [2024-10-14 02:04:11,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.09375) internal successors, (35), 32 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 02:04:11,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2024-10-14 02:04:11,770 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 12 [2024-10-14 02:04:11,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:04:11,770 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2024-10-14 02:04:11,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 02:04:11,770 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2024-10-14 02:04:11,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-14 02:04:11,771 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:04:11,771 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1] [2024-10-14 02:04:11,784 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-14 02:04:11,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2024-10-14 02:04:11,976 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:04:11,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:04:11,976 INFO L85 PathProgramCache]: Analyzing trace with hash -67204031, now seen corresponding path program 2 times [2024-10-14 02:04:11,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:04:11,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075969945] [2024-10-14 02:04:11,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:04:11,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:04:11,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:04:12,231 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 02:04:12,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:04:12,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075969945] [2024-10-14 02:04:12,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075969945] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 02:04:12,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [170879694] [2024-10-14 02:04:12,232 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-14 02:04:12,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 02:04:12,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 02:04:12,234 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 02:04:12,236 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-14 02:04:12,276 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-14 02:04:12,276 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 02:04:12,279 INFO L255 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-14 02:04:12,280 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 02:04:12,427 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 02:04:12,428 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 02:04:12,891 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 02:04:12,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [170879694] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 02:04:12,891 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 02:04:12,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 11] total 20 [2024-10-14 02:04:12,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985442540] [2024-10-14 02:04:12,892 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 02:04:12,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-10-14 02:04:12,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:04:12,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-10-14 02:04:12,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=280, Unknown=0, NotChecked=0, Total=380 [2024-10-14 02:04:12,893 INFO L87 Difference]: Start difference. First operand 33 states and 35 transitions. Second operand has 20 states, 20 states have (on average 1.8) internal successors, (36), 20 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 02:04:27,935 WARN L286 SmtUtils]: Spent 7.65s on a formula simplification. DAG size of input: 50 DAG size of output: 45 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-10-14 02:04:39,861 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.51s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 02:04:55,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:04:55,604 INFO L93 Difference]: Finished difference Result 56 states and 58 transitions. [2024-10-14 02:04:55,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-10-14 02:04:55,605 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.8) internal successors, (36), 20 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-10-14 02:04:55,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:04:55,607 INFO L225 Difference]: With dead ends: 56 [2024-10-14 02:04:55,607 INFO L226 Difference]: Without dead ends: 54 [2024-10-14 02:04:55,607 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 40.2s TimeCoverageRelationStatistics Valid=337, Invalid=785, Unknown=0, NotChecked=0, Total=1122 [2024-10-14 02:04:55,608 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 96 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-10-14 02:04:55,608 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 66 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-10-14 02:04:55,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-10-14 02:04:55,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 48. [2024-10-14 02:04:55,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 47 states have (on average 1.0638297872340425) internal successors, (50), 47 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 02:04:55,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 50 transitions. [2024-10-14 02:04:55,615 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 50 transitions. Word has length 17 [2024-10-14 02:04:55,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:04:55,615 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 50 transitions. [2024-10-14 02:04:55,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.8) internal successors, (36), 20 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 02:04:55,615 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 50 transitions. [2024-10-14 02:04:55,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-14 02:04:55,616 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:04:55,616 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 3, 3, 1, 1, 1, 1] [2024-10-14 02:04:55,628 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-14 02:04:55,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 02:04:55,820 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:04:55,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:04:55,820 INFO L85 PathProgramCache]: Analyzing trace with hash -1999550542, now seen corresponding path program 3 times [2024-10-14 02:04:55,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:04:55,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416854093] [2024-10-14 02:04:55,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:04:55,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:04:55,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:04:56,246 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 02:04:56,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:04:56,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416854093] [2024-10-14 02:04:56,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416854093] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 02:04:56,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [390062928] [2024-10-14 02:04:56,247 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-14 02:04:56,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 02:04:56,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 02:04:56,249 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 02:04:56,250 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-14 02:04:57,762 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-10-14 02:04:57,762 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 02:04:57,763 INFO L255 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-10-14 02:04:57,768 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 02:05:03,365 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 14 proven. 43 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-14 02:05:03,366 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 02:05:42,239 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 5 proven. 52 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-10-14 02:05:42,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [390062928] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 02:05:42,239 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 02:05:42,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15, 15] total 40 [2024-10-14 02:05:42,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126993022] [2024-10-14 02:05:42,240 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 02:05:42,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2024-10-14 02:05:42,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:05:42,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2024-10-14 02:05:42,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=262, Invalid=1295, Unknown=3, NotChecked=0, Total=1560 [2024-10-14 02:05:42,245 INFO L87 Difference]: Start difference. First operand 48 states and 50 transitions. Second operand has 40 states, 40 states have (on average 1.975) internal successors, (79), 40 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)