./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-3.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-3.i -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 642101326caa2098c0a839a00c9bcfc0200d095adff71c7c8d2e655beccf37a7 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 03:41:56,344 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 03:41:56,406 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 03:41:56,412 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 03:41:56,413 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 03:41:56,446 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 03:41:56,447 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 03:41:56,448 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 03:41:56,448 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 03:41:56,449 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 03:41:56,451 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 03:41:56,451 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 03:41:56,452 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 03:41:56,452 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 03:41:56,452 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 03:41:56,453 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 03:41:56,453 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 03:41:56,457 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 03:41:56,457 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 03:41:56,458 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 03:41:56,458 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 03:41:56,458 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 03:41:56,459 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 03:41:56,460 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 03:41:56,460 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 03:41:56,460 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 03:41:56,461 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 03:41:56,461 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 03:41:56,461 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 03:41:56,461 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 03:41:56,462 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 03:41:56,463 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 03:41:56,463 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 03:41:56,463 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 03:41:56,464 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 03:41:56,464 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 03:41:56,464 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 03:41:56,465 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 03:41:56,465 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 03:41:56,465 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 03:41:56,466 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 03:41:56,466 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 03:41:56,466 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 -> 642101326caa2098c0a839a00c9bcfc0200d095adff71c7c8d2e655beccf37a7 [2024-11-10 03:41:56,714 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 03:41:56,743 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 03:41:56,747 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 03:41:56,749 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 03:41:56,749 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 03:41:56,750 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-3.i [2024-11-10 03:41:58,289 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 03:41:58,511 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 03:41:58,512 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-3.i [2024-11-10 03:41:58,521 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d2573510d/c759686b8c4040b38b6d50d470063f2c/FLAGf4b1205a5 [2024-11-10 03:41:58,537 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d2573510d/c759686b8c4040b38b6d50d470063f2c [2024-11-10 03:41:58,539 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 03:41:58,540 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 03:41:58,542 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 03:41:58,542 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 03:41:58,547 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 03:41:58,550 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:41:58" (1/1) ... [2024-11-10 03:41:58,552 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f6d73d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:41:58, skipping insertion in model container [2024-11-10 03:41:58,552 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:41:58" (1/1) ... [2024-11-10 03:41:58,584 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 03:41:58,784 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-3.i[912,925] [2024-11-10 03:41:58,858 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 03:41:58,877 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 03:41:58,893 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-3.i[912,925] [2024-11-10 03:41:58,932 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 03:41:58,958 INFO L204 MainTranslator]: Completed translation [2024-11-10 03:41:58,961 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:41:58 WrapperNode [2024-11-10 03:41:58,961 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 03:41:58,963 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 03:41:58,963 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 03:41:58,963 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 03:41:58,970 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:41:58" (1/1) ... [2024-11-10 03:41:58,995 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:41:58" (1/1) ... [2024-11-10 03:41:59,030 INFO L138 Inliner]: procedures = 26, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 147 [2024-11-10 03:41:59,031 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 03:41:59,031 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 03:41:59,032 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 03:41:59,032 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 03:41:59,045 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:41:58" (1/1) ... [2024-11-10 03:41:59,046 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:41:58" (1/1) ... [2024-11-10 03:41:59,049 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:41:58" (1/1) ... [2024-11-10 03:41:59,071 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-11-10 03:41:59,072 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:41:58" (1/1) ... [2024-11-10 03:41:59,072 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:41:58" (1/1) ... [2024-11-10 03:41:59,087 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:41:58" (1/1) ... [2024-11-10 03:41:59,088 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:41:58" (1/1) ... [2024-11-10 03:41:59,095 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:41:58" (1/1) ... [2024-11-10 03:41:59,097 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:41:58" (1/1) ... [2024-11-10 03:41:59,109 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 03:41:59,110 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 03:41:59,110 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 03:41:59,110 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 03:41:59,111 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:41:58" (1/1) ... [2024-11-10 03:41:59,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 03:41:59,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 03:41:59,152 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-11-10 03:41:59,156 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-11-10 03:41:59,243 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 03:41:59,243 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 03:41:59,243 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 03:41:59,243 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 03:41:59,243 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 03:41:59,243 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 03:41:59,338 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 03:41:59,340 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 03:41:59,692 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L117: havoc property_#t~bitwise13#1;havoc property_#t~short14#1; [2024-11-10 03:41:59,736 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-11-10 03:41:59,736 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 03:41:59,766 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 03:41:59,766 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 03:41:59,767 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:41:59 BoogieIcfgContainer [2024-11-10 03:41:59,767 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 03:41:59,769 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 03:41:59,769 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 03:41:59,773 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 03:41:59,773 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 03:41:58" (1/3) ... [2024-11-10 03:41:59,774 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e68d26a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:41:59, skipping insertion in model container [2024-11-10 03:41:59,774 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:41:58" (2/3) ... [2024-11-10 03:41:59,775 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e68d26a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:41:59, skipping insertion in model container [2024-11-10 03:41:59,775 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:41:59" (3/3) ... [2024-11-10 03:41:59,776 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_normal_file-3.i [2024-11-10 03:41:59,790 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 03:41:59,791 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 03:41:59,848 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 03:41:59,854 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;@25054050, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 03:41:59,854 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 03:41:59,858 INFO L276 IsEmpty]: Start isEmpty. Operand has 74 states, 56 states have (on average 1.4821428571428572) internal successors, (83), 57 states have internal predecessors, (83), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-10 03:41:59,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-10 03:41:59,868 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:41:59,869 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 03:41:59,869 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:41:59,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:41:59,876 INFO L85 PathProgramCache]: Analyzing trace with hash -1534971193, now seen corresponding path program 1 times [2024-11-10 03:41:59,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:41:59,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717789519] [2024-11-10 03:41:59,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:41:59,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:42:00,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:42:00,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 03:42:00,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:42:00,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 03:42:00,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:42:00,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 03:42:00,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:42:00,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 03:42:00,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:42:00,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 03:42:00,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:42:00,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 03:42:00,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:42:00,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 03:42:00,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:42:00,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 03:42:00,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:42:00,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 03:42:00,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:42:00,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 03:42:00,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:42:00,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 03:42:00,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:42:00,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 03:42:00,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:42:00,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 03:42:00,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:42:00,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 03:42:00,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:42:00,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 03:42:00,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:42:00,286 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-10 03:42:00,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 03:42:00,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717789519] [2024-11-10 03:42:00,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717789519] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:42:00,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:42:00,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 03:42:00,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019229054] [2024-11-10 03:42:00,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:42:00,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 03:42:00,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 03:42:00,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 03:42:00,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 03:42:00,328 INFO L87 Difference]: Start difference. First operand has 74 states, 56 states have (on average 1.4821428571428572) internal successors, (83), 57 states have internal predecessors, (83), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-10 03:42:00,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:42:00,360 INFO L93 Difference]: Finished difference Result 140 states and 234 transitions. [2024-11-10 03:42:00,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 03:42:00,363 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 107 [2024-11-10 03:42:00,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:42:00,373 INFO L225 Difference]: With dead ends: 140 [2024-11-10 03:42:00,373 INFO L226 Difference]: Without dead ends: 69 [2024-11-10 03:42:00,376 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 03:42:00,379 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 03:42:00,381 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 102 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 03:42:00,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-11-10 03:42:00,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2024-11-10 03:42:00,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 52 states have (on average 1.4230769230769231) internal successors, (74), 52 states have internal predecessors, (74), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-10 03:42:00,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 104 transitions. [2024-11-10 03:42:00,476 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 104 transitions. Word has length 107 [2024-11-10 03:42:00,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:42:00,478 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 104 transitions. [2024-11-10 03:42:00,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-10 03:42:00,479 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 104 transitions. [2024-11-10 03:42:00,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-10 03:42:00,485 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:42:00,486 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 03:42:00,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 03:42:00,486 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:42:00,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:42:00,487 INFO L85 PathProgramCache]: Analyzing trace with hash -1048743034, now seen corresponding path program 1 times [2024-11-10 03:42:00,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:42:00,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973701547] [2024-11-10 03:42:00,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:42:00,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:42:00,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:42:00,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 03:42:00,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:42:00,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 03:42:00,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:42:00,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 03:42:00,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:42:00,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 03:42:00,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:42:00,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 03:42:00,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:42:00,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 03:42:00,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:42:00,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 03:42:00,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:42:00,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 03:42:00,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:42:00,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 03:42:00,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:42:00,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 03:42:00,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:42:00,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 03:42:00,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:42:00,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 03:42:00,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:42:00,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 03:42:01,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:42:01,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 03:42:01,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:42:01,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 03:42:01,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:42:01,031 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-10 03:42:01,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 03:42:01,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973701547] [2024-11-10 03:42:01,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973701547] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:42:01,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:42:01,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 03:42:01,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244962447] [2024-11-10 03:42:01,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:42:01,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 03:42:01,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 03:42:01,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 03:42:01,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 03:42:01,040 INFO L87 Difference]: Start difference. First operand 69 states and 104 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-10 03:42:01,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:42:01,128 INFO L93 Difference]: Finished difference Result 201 states and 306 transitions. [2024-11-10 03:42:01,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 03:42:01,129 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 107 [2024-11-10 03:42:01,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:42:01,135 INFO L225 Difference]: With dead ends: 201 [2024-11-10 03:42:01,136 INFO L226 Difference]: Without dead ends: 135 [2024-11-10 03:42:01,137 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 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-11-10 03:42:01,139 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 62 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 03:42:01,139 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 202 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 03:42:01,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-11-10 03:42:01,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 132. [2024-11-10 03:42:01,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 99 states have (on average 1.404040404040404) internal successors, (139), 99 states have internal predecessors, (139), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-10 03:42:01,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 199 transitions. [2024-11-10 03:42:01,171 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 199 transitions. Word has length 107 [2024-11-10 03:42:01,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:42:01,172 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 199 transitions. [2024-11-10 03:42:01,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-10 03:42:01,175 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 199 transitions. [2024-11-10 03:42:01,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-10 03:42:01,177 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:42:01,177 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 03:42:01,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 03:42:01,178 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:42:01,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:42:01,178 INFO L85 PathProgramCache]: Analyzing trace with hash -235237029, now seen corresponding path program 1 times [2024-11-10 03:42:01,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:42:01,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196275306] [2024-11-10 03:42:01,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:42:01,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:42:01,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:42:01,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 03:42:01,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:42:01,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 03:42:01,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:42:01,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 03:42:01,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:42:01,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 03:42:01,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:42:01,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 03:42:01,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:42:01,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 03:42:01,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:42:01,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 03:42:01,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:42:01,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 03:42:01,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:42:01,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 03:42:01,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:42:01,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 03:42:01,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:42:01,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 03:42:01,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:42:01,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 03:42:01,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:42:01,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 03:42:01,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:42:01,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 03:42:01,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:42:01,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 03:42:01,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:42:01,340 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-10 03:42:01,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 03:42:01,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196275306] [2024-11-10 03:42:01,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196275306] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:42:01,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:42:01,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 03:42:01,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855887596] [2024-11-10 03:42:01,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:42:01,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 03:42:01,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 03:42:01,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 03:42:01,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 03:42:01,348 INFO L87 Difference]: Start difference. First operand 132 states and 199 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-10 03:42:01,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:42:01,427 INFO L93 Difference]: Finished difference Result 328 states and 493 transitions. [2024-11-10 03:42:01,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 03:42:01,428 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 108 [2024-11-10 03:42:01,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:42:01,430 INFO L225 Difference]: With dead ends: 328 [2024-11-10 03:42:01,430 INFO L226 Difference]: Without dead ends: 199 [2024-11-10 03:42:01,431 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 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-11-10 03:42:01,432 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 45 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 03:42:01,433 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 219 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 03:42:01,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2024-11-10 03:42:01,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 150. [2024-11-10 03:42:01,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 117 states have (on average 1.4102564102564104) internal successors, (165), 117 states have internal predecessors, (165), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-10 03:42:01,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 225 transitions. [2024-11-10 03:42:01,469 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 225 transitions. Word has length 108 [2024-11-10 03:42:01,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:42:01,472 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 225 transitions. [2024-11-10 03:42:01,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-10 03:42:01,473 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 225 transitions. [2024-11-10 03:42:01,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-10 03:42:01,475 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:42:01,475 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 03:42:01,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 03:42:01,476 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:42:01,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:42:01,476 INFO L85 PathProgramCache]: Analyzing trace with hash -458972550, now seen corresponding path program 1 times [2024-11-10 03:42:01,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:42:01,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463964447] [2024-11-10 03:42:01,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:42:01,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:42:01,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:42:01,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 03:42:01,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:42:01,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 03:42:01,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:42:01,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 03:42:01,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:42:01,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 03:42:01,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:42:01,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 03:42:01,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:42:01,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 03:42:01,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:42:01,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 03:42:01,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:42:01,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 03:42:01,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:42:01,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 03:42:01,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:42:01,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 03:42:01,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:42:01,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 03:42:01,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:42:01,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 03:42:01,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:42:01,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 03:42:01,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:42:01,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 03:42:01,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:42:01,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 03:42:01,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:42:01,791 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-10 03:42:01,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 03:42:01,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463964447] [2024-11-10 03:42:01,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463964447] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:42:01,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:42:01,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 03:42:01,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90902975] [2024-11-10 03:42:01,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:42:01,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 03:42:01,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 03:42:01,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 03:42:01,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 03:42:01,795 INFO L87 Difference]: Start difference. First operand 150 states and 225 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-10 03:42:01,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:42:01,898 INFO L93 Difference]: Finished difference Result 436 states and 659 transitions. [2024-11-10 03:42:01,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 03:42:01,899 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 108 [2024-11-10 03:42:01,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:42:01,901 INFO L225 Difference]: With dead ends: 436 [2024-11-10 03:42:01,902 INFO L226 Difference]: Without dead ends: 289 [2024-11-10 03:42:01,905 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 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-11-10 03:42:01,910 INFO L432 NwaCegarLoop]: 179 mSDtfsCounter, 88 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 03:42:01,911 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 261 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 03:42:01,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2024-11-10 03:42:01,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 286. [2024-11-10 03:42:01,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 221 states have (on average 1.3981900452488687) internal successors, (309), 221 states have internal predecessors, (309), 60 states have call successors, (60), 4 states have call predecessors, (60), 4 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-10 03:42:01,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 429 transitions. [2024-11-10 03:42:01,957 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 429 transitions. Word has length 108 [2024-11-10 03:42:01,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:42:01,958 INFO L471 AbstractCegarLoop]: Abstraction has 286 states and 429 transitions. [2024-11-10 03:42:01,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-10 03:42:01,960 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 429 transitions. [2024-11-10 03:42:01,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-10 03:42:01,961 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:42:01,965 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 03:42:01,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 03:42:01,965 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:42:01,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:42:01,966 INFO L85 PathProgramCache]: Analyzing trace with hash 822252610, now seen corresponding path program 1 times [2024-11-10 03:42:01,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:42:01,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706251058] [2024-11-10 03:42:01,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:42:01,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:42:02,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:42:02,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 03:42:02,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:42:02,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 03:42:02,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:42:02,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 03:42:02,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:42:02,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 03:42:02,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:42:02,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 03:42:02,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:42:02,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 03:42:02,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:42:02,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 03:42:02,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:42:02,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 03:42:02,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:42:02,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 03:42:02,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:42:02,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 03:42:02,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:42:02,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 03:42:02,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:42:02,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 03:42:02,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:42:02,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 03:42:02,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:42:02,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 03:42:02,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:42:02,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 03:42:02,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:42:02,300 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-10 03:42:02,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 03:42:02,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706251058] [2024-11-10 03:42:02,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706251058] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:42:02,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:42:02,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 03:42:02,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910974682] [2024-11-10 03:42:02,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:42:02,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 03:42:02,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 03:42:02,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 03:42:02,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-10 03:42:02,308 INFO L87 Difference]: Start difference. First operand 286 states and 429 transitions. Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-10 03:42:02,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:42:02,539 INFO L93 Difference]: Finished difference Result 716 states and 1077 transitions. [2024-11-10 03:42:02,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 03:42:02,540 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 109 [2024-11-10 03:42:02,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:42:02,548 INFO L225 Difference]: With dead ends: 716 [2024-11-10 03:42:02,548 INFO L226 Difference]: Without dead ends: 573 [2024-11-10 03:42:02,549 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-10 03:42:02,550 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 119 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 03:42:02,553 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 312 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 03:42:02,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2024-11-10 03:42:02,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 564. [2024-11-10 03:42:02,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 564 states, 435 states have (on average 1.4045977011494253) internal successors, (611), 435 states have internal predecessors, (611), 120 states have call successors, (120), 8 states have call predecessors, (120), 8 states have return successors, (120), 120 states have call predecessors, (120), 120 states have call successors, (120) [2024-11-10 03:42:02,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 851 transitions. [2024-11-10 03:42:02,613 INFO L78 Accepts]: Start accepts. Automaton has 564 states and 851 transitions. Word has length 109 [2024-11-10 03:42:02,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:42:02,614 INFO L471 AbstractCegarLoop]: Abstraction has 564 states and 851 transitions. [2024-11-10 03:42:02,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-10 03:42:02,614 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 851 transitions. [2024-11-10 03:42:02,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-10 03:42:02,615 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:42:02,616 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 03:42:02,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 03:42:02,616 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:42:02,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:42:02,617 INFO L85 PathProgramCache]: Analyzing trace with hash -882694174, now seen corresponding path program 1 times [2024-11-10 03:42:02,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:42:02,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553655089] [2024-11-10 03:42:02,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:42:02,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:42:02,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:42:03,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 03:42:03,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:42:03,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 03:42:03,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:42:03,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 03:42:03,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:42:03,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 03:42:03,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:42:03,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 03:42:03,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:42:03,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 03:42:03,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:42:03,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 03:42:03,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:42:03,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 03:42:03,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:42:03,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 03:42:03,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:42:03,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 03:42:03,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:42:03,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 03:42:03,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:42:03,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 03:42:03,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:42:03,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 03:42:03,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:42:03,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 03:42:03,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:42:03,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 03:42:03,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:42:03,680 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-11-10 03:42:03,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 03:42:03,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553655089] [2024-11-10 03:42:03,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553655089] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:42:03,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:42:03,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 03:42:03,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932228324] [2024-11-10 03:42:03,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:42:03,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 03:42:03,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 03:42:03,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 03:42:03,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-10 03:42:03,682 INFO L87 Difference]: Start difference. First operand 564 states and 851 transitions. Second operand has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 1 states have call successors, (15), 1 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-10 03:42:04,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:42:04,558 INFO L93 Difference]: Finished difference Result 1731 states and 2517 transitions. [2024-11-10 03:42:04,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-10 03:42:04,559 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 1 states have call successors, (15), 1 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) Word has length 109 [2024-11-10 03:42:04,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:42:04,566 INFO L225 Difference]: With dead ends: 1731 [2024-11-10 03:42:04,567 INFO L226 Difference]: Without dead ends: 1170 [2024-11-10 03:42:04,570 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=107, Invalid=235, Unknown=0, NotChecked=0, Total=342 [2024-11-10 03:42:04,571 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 265 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 03:42:04,572 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [271 Valid, 336 Invalid, 323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 03:42:04,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1170 states. [2024-11-10 03:42:04,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1170 to 704. [2024-11-10 03:42:04,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 704 states, 567 states have (on average 1.4197530864197532) internal successors, (805), 567 states have internal predecessors, (805), 120 states have call successors, (120), 16 states have call predecessors, (120), 16 states have return successors, (120), 120 states have call predecessors, (120), 120 states have call successors, (120) [2024-11-10 03:42:04,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 704 states to 704 states and 1045 transitions. [2024-11-10 03:42:04,666 INFO L78 Accepts]: Start accepts. Automaton has 704 states and 1045 transitions. Word has length 109 [2024-11-10 03:42:04,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:42:04,666 INFO L471 AbstractCegarLoop]: Abstraction has 704 states and 1045 transitions. [2024-11-10 03:42:04,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 1 states have call successors, (15), 1 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-10 03:42:04,667 INFO L276 IsEmpty]: Start isEmpty. Operand 704 states and 1045 transitions. [2024-11-10 03:42:04,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-10 03:42:04,668 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:42:04,668 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 03:42:04,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 03:42:04,669 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:42:04,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:42:04,669 INFO L85 PathProgramCache]: Analyzing trace with hash -1879766527, now seen corresponding path program 1 times [2024-11-10 03:42:04,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:42:04,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290550852] [2024-11-10 03:42:04,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:42:04,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:42:04,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:42:04,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 03:42:04,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:42:04,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 03:42:04,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:42:04,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 03:42:04,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:42:04,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 03:42:04,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:42:04,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 03:42:04,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:42:04,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 03:42:04,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:42:04,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 03:42:04,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:42:04,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 03:42:04,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:42:04,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 03:42:04,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:42:04,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 03:42:04,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:42:04,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 03:42:04,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:42:04,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 03:42:04,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:42:04,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 03:42:04,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:42:04,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 03:42:04,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:42:04,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 03:42:04,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:42:04,867 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-10 03:42:04,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 03:42:04,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290550852] [2024-11-10 03:42:04,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290550852] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:42:04,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:42:04,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 03:42:04,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169044842] [2024-11-10 03:42:04,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:42:04,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 03:42:04,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 03:42:04,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 03:42:04,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 03:42:04,869 INFO L87 Difference]: Start difference. First operand 704 states and 1045 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-10 03:42:05,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:42:05,033 INFO L93 Difference]: Finished difference Result 1712 states and 2541 transitions. [2024-11-10 03:42:05,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 03:42:05,034 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 109 [2024-11-10 03:42:05,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:42:05,040 INFO L225 Difference]: With dead ends: 1712 [2024-11-10 03:42:05,041 INFO L226 Difference]: Without dead ends: 1011 [2024-11-10 03:42:05,043 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 33 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-11-10 03:42:05,044 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 63 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 03:42:05,044 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 212 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 03:42:05,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1011 states. [2024-11-10 03:42:05,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1011 to 1008. [2024-11-10 03:42:05,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1008 states, 803 states have (on average 1.405977584059776) internal successors, (1129), 803 states have internal predecessors, (1129), 180 states have call successors, (180), 24 states have call predecessors, (180), 24 states have return successors, (180), 180 states have call predecessors, (180), 180 states have call successors, (180) [2024-11-10 03:42:05,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1008 states to 1008 states and 1489 transitions. [2024-11-10 03:42:05,156 INFO L78 Accepts]: Start accepts. Automaton has 1008 states and 1489 transitions. Word has length 109 [2024-11-10 03:42:05,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:42:05,156 INFO L471 AbstractCegarLoop]: Abstraction has 1008 states and 1489 transitions. [2024-11-10 03:42:05,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-10 03:42:05,157 INFO L276 IsEmpty]: Start isEmpty. Operand 1008 states and 1489 transitions. [2024-11-10 03:42:05,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-10 03:42:05,158 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:42:05,159 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 03:42:05,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 03:42:05,159 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:42:05,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:42:05,160 INFO L85 PathProgramCache]: Analyzing trace with hash -22203007, now seen corresponding path program 1 times [2024-11-10 03:42:05,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:42:05,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447171673] [2024-11-10 03:42:05,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:42:05,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:42:05,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:42:05,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 03:42:05,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:42:05,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 03:42:05,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:42:05,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 03:42:05,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:42:05,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 03:42:05,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:42:05,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 03:42:05,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:42:05,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 03:42:05,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:42:05,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 03:42:05,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:42:05,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 03:42:05,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:42:05,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 03:42:05,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:42:05,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 03:42:05,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:42:05,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 03:42:05,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:42:05,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 03:42:05,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:42:05,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 03:42:05,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:42:05,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 03:42:05,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:42:05,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 03:42:05,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:42:05,455 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-10 03:42:05,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 03:42:05,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447171673] [2024-11-10 03:42:05,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447171673] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:42:05,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:42:05,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 03:42:05,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619021744] [2024-11-10 03:42:05,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:42:05,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 03:42:05,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 03:42:05,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 03:42:05,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-10 03:42:05,457 INFO L87 Difference]: Start difference. First operand 1008 states and 1489 transitions. Second operand has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-10 03:42:06,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:42:06,034 INFO L93 Difference]: Finished difference Result 1898 states and 2803 transitions. [2024-11-10 03:42:06,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 03:42:06,034 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 110 [2024-11-10 03:42:06,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:42:06,044 INFO L225 Difference]: With dead ends: 1898 [2024-11-10 03:42:06,045 INFO L226 Difference]: Without dead ends: 1644 [2024-11-10 03:42:06,047 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2024-11-10 03:42:06,048 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 286 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 379 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 03:42:06,049 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [286 Valid, 395 Invalid, 379 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 03:42:06,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1644 states. [2024-11-10 03:42:06,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1644 to 1490. [2024-11-10 03:42:06,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1490 states, 1183 states have (on average 1.404902789518174) internal successors, (1662), 1183 states have internal predecessors, (1662), 270 states have call successors, (270), 36 states have call predecessors, (270), 36 states have return successors, (270), 270 states have call predecessors, (270), 270 states have call successors, (270) [2024-11-10 03:42:06,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1490 states to 1490 states and 2202 transitions. [2024-11-10 03:42:06,290 INFO L78 Accepts]: Start accepts. Automaton has 1490 states and 2202 transitions. Word has length 110 [2024-11-10 03:42:06,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:42:06,290 INFO L471 AbstractCegarLoop]: Abstraction has 1490 states and 2202 transitions. [2024-11-10 03:42:06,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-10 03:42:06,291 INFO L276 IsEmpty]: Start isEmpty. Operand 1490 states and 2202 transitions. [2024-11-10 03:42:06,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-10 03:42:06,294 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:42:06,294 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 03:42:06,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 03:42:06,294 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:42:06,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:42:06,295 INFO L85 PathProgramCache]: Analyzing trace with hash 180580122, now seen corresponding path program 1 times [2024-11-10 03:42:06,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:42:06,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036796430] [2024-11-10 03:42:06,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:42:06,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:42:06,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:42:06,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 03:42:06,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:42:06,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 03:42:06,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:42:06,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 03:42:06,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:42:06,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 03:42:06,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:42:06,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 03:42:06,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:42:06,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 03:42:06,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:42:06,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 03:42:06,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:42:06,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 03:42:06,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:42:06,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 03:42:06,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:42:06,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 03:42:06,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:42:06,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 03:42:06,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:42:06,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 03:42:06,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:42:06,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 03:42:06,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:42:06,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 03:42:06,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:42:06,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 03:42:06,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:42:06,573 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-10 03:42:06,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 03:42:06,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036796430] [2024-11-10 03:42:06,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036796430] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:42:06,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:42:06,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 03:42:06,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636213723] [2024-11-10 03:42:06,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:42:06,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 03:42:06,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 03:42:06,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 03:42:06,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 03:42:06,576 INFO L87 Difference]: Start difference. First operand 1490 states and 2202 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-10 03:42:06,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:42:06,960 INFO L93 Difference]: Finished difference Result 2624 states and 3876 transitions. [2024-11-10 03:42:06,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 03:42:06,961 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 110 [2024-11-10 03:42:06,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:42:06,971 INFO L225 Difference]: With dead ends: 2624 [2024-11-10 03:42:06,971 INFO L226 Difference]: Without dead ends: 1872 [2024-11-10 03:42:06,974 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-10 03:42:06,975 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 188 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 03:42:06,975 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 375 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 03:42:06,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1872 states. [2024-11-10 03:42:07,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1872 to 1610. [2024-11-10 03:42:07,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1610 states, 1303 states have (on average 1.4167306216423639) internal successors, (1846), 1303 states have internal predecessors, (1846), 270 states have call successors, (270), 36 states have call predecessors, (270), 36 states have return successors, (270), 270 states have call predecessors, (270), 270 states have call successors, (270) [2024-11-10 03:42:07,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1610 states to 1610 states and 2386 transitions. [2024-11-10 03:42:07,158 INFO L78 Accepts]: Start accepts. Automaton has 1610 states and 2386 transitions. Word has length 110 [2024-11-10 03:42:07,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:42:07,159 INFO L471 AbstractCegarLoop]: Abstraction has 1610 states and 2386 transitions. [2024-11-10 03:42:07,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-10 03:42:07,159 INFO L276 IsEmpty]: Start isEmpty. Operand 1610 states and 2386 transitions. [2024-11-10 03:42:07,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-10 03:42:07,161 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:42:07,161 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 03:42:07,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 03:42:07,161 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:42:07,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:42:07,162 INFO L85 PathProgramCache]: Analyzing trace with hash 809172951, now seen corresponding path program 1 times [2024-11-10 03:42:07,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:42:07,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433922856] [2024-11-10 03:42:07,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:42:07,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:42:07,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:42:07,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 03:42:07,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:42:07,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 03:42:07,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:42:07,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 03:42:07,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:42:07,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 03:42:07,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:42:07,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 03:42:07,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:42:07,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 03:42:07,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:42:07,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 03:42:07,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:42:07,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 03:42:07,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:42:07,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 03:42:07,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:42:07,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 03:42:07,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:42:07,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 03:42:07,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:42:07,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 03:42:07,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:42:07,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 03:42:07,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:42:07,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 03:42:07,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:42:07,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 03:42:07,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:42:07,988 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 87 proven. 21 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-10 03:42:07,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 03:42:07,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433922856] [2024-11-10 03:42:07,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433922856] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 03:42:07,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [819493794] [2024-11-10 03:42:07,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:42:07,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 03:42:07,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 03:42:07,992 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-11-10 03:42:07,994 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-11-10 03:42:08,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:42:08,192 INFO L255 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-10 03:42:08,203 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 03:42:08,674 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 287 proven. 21 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2024-11-10 03:42:08,674 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 03:42:09,650 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 87 proven. 30 refuted. 0 times theorem prover too weak. 303 trivial. 0 not checked. [2024-11-10 03:42:09,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [819493794] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 03:42:09,651 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 03:42:09,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 12, 12] total 25 [2024-11-10 03:42:09,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399726527] [2024-11-10 03:42:09,652 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 03:42:09,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-10 03:42:09,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 03:42:09,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-10 03:42:09,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=446, Unknown=0, NotChecked=0, Total=600 [2024-11-10 03:42:09,654 INFO L87 Difference]: Start difference. First operand 1610 states and 2386 transitions. Second operand has 25 states, 25 states have (on average 3.64) internal successors, (91), 25 states have internal predecessors, (91), 6 states have call successors, (31), 3 states have call predecessors, (31), 9 states have return successors, (32), 9 states have call predecessors, (32), 6 states have call successors, (32) [2024-11-10 03:42:10,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:42:10,923 INFO L93 Difference]: Finished difference Result 3034 states and 4352 transitions. [2024-11-10 03:42:10,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-10 03:42:10,924 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 3.64) internal successors, (91), 25 states have internal predecessors, (91), 6 states have call successors, (31), 3 states have call predecessors, (31), 9 states have return successors, (32), 9 states have call predecessors, (32), 6 states have call successors, (32) Word has length 110 [2024-11-10 03:42:10,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:42:10,934 INFO L225 Difference]: With dead ends: 3034 [2024-11-10 03:42:10,934 INFO L226 Difference]: Without dead ends: 1841 [2024-11-10 03:42:10,938 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 238 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 417 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=611, Invalid=1369, Unknown=0, NotChecked=0, Total=1980 [2024-11-10 03:42:10,939 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 283 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 424 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 504 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 03:42:10,940 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [283 Valid, 369 Invalid, 504 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 424 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 03:42:10,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1841 states. [2024-11-10 03:42:11,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1841 to 1292. [2024-11-10 03:42:11,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1292 states, 1025 states have (on average 1.3570731707317074) internal successors, (1391), 1025 states have internal predecessors, (1391), 210 states have call successors, (210), 56 states have call predecessors, (210), 56 states have return successors, (210), 210 states have call predecessors, (210), 210 states have call successors, (210) [2024-11-10 03:42:11,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1292 states to 1292 states and 1811 transitions. [2024-11-10 03:42:11,137 INFO L78 Accepts]: Start accepts. Automaton has 1292 states and 1811 transitions. Word has length 110 [2024-11-10 03:42:11,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:42:11,137 INFO L471 AbstractCegarLoop]: Abstraction has 1292 states and 1811 transitions. [2024-11-10 03:42:11,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 3.64) internal successors, (91), 25 states have internal predecessors, (91), 6 states have call successors, (31), 3 states have call predecessors, (31), 9 states have return successors, (32), 9 states have call predecessors, (32), 6 states have call successors, (32) [2024-11-10 03:42:11,138 INFO L276 IsEmpty]: Start isEmpty. Operand 1292 states and 1811 transitions. [2024-11-10 03:42:11,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-10 03:42:11,139 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:42:11,140 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 03:42:11,159 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-10 03:42:11,343 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-10 03:42:11,344 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:42:11,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:42:11,345 INFO L85 PathProgramCache]: Analyzing trace with hash -1942018671, now seen corresponding path program 1 times [2024-11-10 03:42:11,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:42:11,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14456393] [2024-11-10 03:42:11,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:42:11,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:42:11,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:42:11,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 03:42:11,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:42:11,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 03:42:11,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:42:11,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 03:42:11,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:42:11,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 03:42:11,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:42:11,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 03:42:11,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:42:11,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 03:42:11,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:42:11,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 03:42:11,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:42:11,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 03:42:11,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:42:11,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 03:42:11,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:42:11,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 03:42:11,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:42:11,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 03:42:11,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:42:11,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 03:42:11,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:42:11,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 03:42:11,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:42:11,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 03:42:11,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:42:11,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 03:42:11,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:42:11,730 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-10 03:42:11,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 03:42:11,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14456393] [2024-11-10 03:42:11,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14456393] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:42:11,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:42:11,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 03:42:11,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737701807] [2024-11-10 03:42:11,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:42:11,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 03:42:11,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 03:42:11,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 03:42:11,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-10 03:42:11,733 INFO L87 Difference]: Start difference. First operand 1292 states and 1811 transitions. Second operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-10 03:42:12,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:42:12,298 INFO L93 Difference]: Finished difference Result 2601 states and 3640 transitions. [2024-11-10 03:42:12,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 03:42:12,299 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 110 [2024-11-10 03:42:12,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:42:12,308 INFO L225 Difference]: With dead ends: 2601 [2024-11-10 03:42:12,308 INFO L226 Difference]: Without dead ends: 1312 [2024-11-10 03:42:12,312 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2024-11-10 03:42:12,313 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 308 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 03:42:12,313 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [308 Valid, 458 Invalid, 386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 262 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 03:42:12,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1312 states. [2024-11-10 03:42:12,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1312 to 1296. [2024-11-10 03:42:12,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1296 states, 1029 states have (on average 1.3537414965986394) internal successors, (1393), 1029 states have internal predecessors, (1393), 210 states have call successors, (210), 56 states have call predecessors, (210), 56 states have return successors, (210), 210 states have call predecessors, (210), 210 states have call successors, (210) [2024-11-10 03:42:12,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1296 states to 1296 states and 1813 transitions. [2024-11-10 03:42:12,501 INFO L78 Accepts]: Start accepts. Automaton has 1296 states and 1813 transitions. Word has length 110 [2024-11-10 03:42:12,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:42:12,502 INFO L471 AbstractCegarLoop]: Abstraction has 1296 states and 1813 transitions. [2024-11-10 03:42:12,502 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 8 states have internal predecessors, (38), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-10 03:42:12,502 INFO L276 IsEmpty]: Start isEmpty. Operand 1296 states and 1813 transitions. [2024-11-10 03:42:12,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-10 03:42:12,504 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:42:12,504 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 03:42:12,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-10 03:42:12,504 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:42:12,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:42:12,505 INFO L85 PathProgramCache]: Analyzing trace with hash -1818017953, now seen corresponding path program 1 times [2024-11-10 03:42:12,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:42:12,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919690294] [2024-11-10 03:42:12,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:42:12,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:42:12,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:42:12,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 03:42:12,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:42:12,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 03:42:12,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:42:12,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 03:42:12,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:42:12,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 03:42:12,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:42:12,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 03:42:12,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:42:12,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 03:42:12,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:42:12,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 03:42:12,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:42:12,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 03:42:12,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:42:12,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 03:42:12,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:42:12,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 03:42:12,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:42:12,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 03:42:12,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:42:12,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 03:42:12,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:42:12,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 03:42:12,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:42:12,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 03:42:12,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:42:12,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-10 03:42:12,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:42:12,954 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-10 03:42:12,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 03:42:12,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919690294] [2024-11-10 03:42:12,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919690294] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:42:12,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:42:12,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 03:42:12,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895701855] [2024-11-10 03:42:12,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:42:12,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 03:42:12,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 03:42:12,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 03:42:12,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-10 03:42:12,957 INFO L87 Difference]: Start difference. First operand 1296 states and 1813 transitions. Second operand has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-10 03:42:14,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:42:14,526 INFO L93 Difference]: Finished difference Result 2358 states and 3285 transitions. [2024-11-10 03:42:14,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-10 03:42:14,527 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 111 [2024-11-10 03:42:14,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:42:14,539 INFO L225 Difference]: With dead ends: 2358 [2024-11-10 03:42:14,540 INFO L226 Difference]: Without dead ends: 1649 [2024-11-10 03:42:14,543 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=121, Invalid=259, Unknown=0, NotChecked=0, Total=380 [2024-11-10 03:42:14,544 INFO L432 NwaCegarLoop]: 254 mSDtfsCounter, 359 mSDsluCounter, 857 mSDsCounter, 0 mSdLazyCounter, 791 mSolverCounterSat, 138 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 359 SdHoareTripleChecker+Valid, 1111 SdHoareTripleChecker+Invalid, 929 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 791 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-10 03:42:14,544 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [359 Valid, 1111 Invalid, 929 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 791 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-10 03:42:14,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1649 states. [2024-11-10 03:42:14,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1649 to 1394. [2024-11-10 03:42:14,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1394 states, 1108 states have (on average 1.3546931407942238) internal successors, (1501), 1108 states have internal predecessors, (1501), 225 states have call successors, (225), 60 states have call predecessors, (225), 60 states have return successors, (225), 225 states have call predecessors, (225), 225 states have call successors, (225) [2024-11-10 03:42:14,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1394 states to 1394 states and 1951 transitions. [2024-11-10 03:42:14,751 INFO L78 Accepts]: Start accepts. Automaton has 1394 states and 1951 transitions. Word has length 111 [2024-11-10 03:42:14,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:42:14,752 INFO L471 AbstractCegarLoop]: Abstraction has 1394 states and 1951 transitions. [2024-11-10 03:42:14,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-10 03:42:14,752 INFO L276 IsEmpty]: Start isEmpty. Operand 1394 states and 1951 transitions. [2024-11-10 03:42:14,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-10 03:42:14,754 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:42:14,754 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 03:42:14,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-10 03:42:14,754 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:42:14,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:42:14,755 INFO L85 PathProgramCache]: Analyzing trace with hash -1033745348, now seen corresponding path program 1 times [2024-11-10 03:42:14,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:42:14,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453868901] [2024-11-10 03:42:14,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:42:14,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:42:14,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 03:42:14,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [920555068] [2024-11-10 03:42:14,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:42:14,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 03:42:14,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 03:42:14,805 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-11-10 03:42:14,806 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-11-10 03:42:14,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 03:42:14,946 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 03:42:14,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 03:42:15,075 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 03:42:15,075 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 03:42:15,076 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-10 03:42:15,098 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-11-10 03:42:15,283 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,SelfDestructingSolverStorable12 [2024-11-10 03:42:15,287 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 03:42:15,356 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 03:42:15,360 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 03:42:15 BoogieIcfgContainer [2024-11-10 03:42:15,361 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 03:42:15,362 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 03:42:15,362 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 03:42:15,362 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 03:42:15,363 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:41:59" (3/4) ... [2024-11-10 03:42:15,365 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 03:42:15,367 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 03:42:15,367 INFO L158 Benchmark]: Toolchain (without parser) took 16826.72ms. Allocated memory was 159.4MB in the beginning and 465.6MB in the end (delta: 306.2MB). Free memory was 87.2MB in the beginning and 360.2MB in the end (delta: -273.0MB). Peak memory consumption was 34.1MB. Max. memory is 16.1GB. [2024-11-10 03:42:15,367 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 159.4MB. Free memory is still 109.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 03:42:15,368 INFO L158 Benchmark]: CACSL2BoogieTranslator took 420.15ms. Allocated memory is still 159.4MB. Free memory was 87.0MB in the beginning and 70.8MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-10 03:42:15,368 INFO L158 Benchmark]: Boogie Procedure Inliner took 68.25ms. Allocated memory is still 159.4MB. Free memory was 70.8MB in the beginning and 67.0MB in the end (delta: 3.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 03:42:15,368 INFO L158 Benchmark]: Boogie Preprocessor took 77.76ms. Allocated memory is still 159.4MB. Free memory was 67.0MB in the beginning and 62.0MB in the end (delta: 4.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 03:42:15,370 INFO L158 Benchmark]: IcfgBuilder took 657.06ms. Allocated memory was 159.4MB in the beginning and 218.1MB in the end (delta: 58.7MB). Free memory was 62.0MB in the beginning and 168.3MB in the end (delta: -106.3MB). Peak memory consumption was 13.2MB. Max. memory is 16.1GB. [2024-11-10 03:42:15,370 INFO L158 Benchmark]: TraceAbstraction took 15592.02ms. Allocated memory was 218.1MB in the beginning and 465.6MB in the end (delta: 247.5MB). Free memory was 167.2MB in the beginning and 360.2MB in the end (delta: -193.0MB). Peak memory consumption was 54.5MB. Max. memory is 16.1GB. [2024-11-10 03:42:15,371 INFO L158 Benchmark]: Witness Printer took 4.60ms. Allocated memory is still 465.6MB. Free memory is still 360.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 03:42:15,372 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24ms. Allocated memory is still 159.4MB. Free memory is still 109.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 420.15ms. Allocated memory is still 159.4MB. Free memory was 87.0MB in the beginning and 70.8MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 68.25ms. Allocated memory is still 159.4MB. Free memory was 70.8MB in the beginning and 67.0MB in the end (delta: 3.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 77.76ms. Allocated memory is still 159.4MB. Free memory was 67.0MB in the beginning and 62.0MB in the end (delta: 4.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * IcfgBuilder took 657.06ms. Allocated memory was 159.4MB in the beginning and 218.1MB in the end (delta: 58.7MB). Free memory was 62.0MB in the beginning and 168.3MB in the end (delta: -106.3MB). Peak memory consumption was 13.2MB. Max. memory is 16.1GB. * TraceAbstraction took 15592.02ms. Allocated memory was 218.1MB in the beginning and 465.6MB in the end (delta: 247.5MB). Free memory was 167.2MB in the beginning and 360.2MB in the end (delta: -193.0MB). Peak memory consumption was 54.5MB. Max. memory is 16.1GB. * Witness Printer took 4.60ms. Allocated memory is still 465.6MB. Free memory is still 360.2MB. There was no memory consumed. Max. memory is 16.1GB. * 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 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 117, overapproximation of bitwiseOr at line 80. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = -64; [L23] unsigned char var_1_3 = 1; [L24] signed char var_1_5 = -32; [L25] unsigned short int var_1_6 = 256; [L26] unsigned long int var_1_10 = 256; [L27] double var_1_12 = 8.2; [L28] signed char var_1_13 = 16; [L29] signed char var_1_14 = 10; [L30] double var_1_15 = 199.125; [L31] double var_1_16 = 9.4; [L32] double var_1_17 = 9999999999999.6; [L33] unsigned char var_1_20 = 32; [L34] unsigned char var_1_21 = 128; [L35] unsigned char var_1_22 = 64; [L36] unsigned long int var_1_23 = 64; [L37] unsigned long int last_1_var_1_10 = 256; [L38] unsigned char last_1_var_1_20 = 32; VAL [isInitial=0, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=1, var_1_5=-32, var_1_6=256] [L121] isInitial = 1 [L122] FCALL initially() [L123] COND TRUE 1 [L124] CALL updateLastVariables() [L113] last_1_var_1_10 = var_1_10 [L114] last_1_var_1_20 = var_1_20 VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=1, var_1_5=-32, var_1_6=256] [L124] RET updateLastVariables() [L125] CALL updateVariables() [L88] var_1_3 = __VERIFIER_nondet_uchar() [L89] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_5=-32, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_5=-32, var_1_6=256] [L89] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_5=-32, var_1_6=256] [L90] CALL assume_abort_if_not(var_1_3 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=-32, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=-32, var_1_6=256] [L90] RET assume_abort_if_not(var_1_3 <= 1) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=-32, var_1_6=256] [L91] var_1_5 = __VERIFIER_nondet_char() [L92] CALL assume_abort_if_not(var_1_5 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=-127, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=-127, var_1_6=256] [L92] RET assume_abort_if_not(var_1_5 >= -127) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=-127, var_1_6=256] [L93] CALL assume_abort_if_not(var_1_5 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=-127, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=-127, var_1_6=256] [L93] RET assume_abort_if_not(var_1_5 <= 126) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=16, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=-127, var_1_6=256] [L94] var_1_13 = __VERIFIER_nondet_char() [L95] CALL assume_abort_if_not(var_1_13 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=-127, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=-127, var_1_6=256] [L95] RET assume_abort_if_not(var_1_13 >= -1) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=-127, var_1_6=256] [L96] CALL assume_abort_if_not(var_1_13 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=-127, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=-127, var_1_6=256] [L96] RET assume_abort_if_not(var_1_13 <= 127) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=10, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=-127, var_1_6=256] [L97] var_1_14 = __VERIFIER_nondet_char() [L98] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=-127, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=-127, var_1_6=256] [L98] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=-127, var_1_6=256] [L99] CALL assume_abort_if_not(var_1_14 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=-127, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=-127, var_1_6=256] [L99] RET assume_abort_if_not(var_1_14 <= 127) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_15=1593/8, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=-127, var_1_6=256] [L100] var_1_15 = __VERIFIER_nondet_double() [L101] CALL assume_abort_if_not((var_1_15 >= -922337.2036854776000e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=-127, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=-127, var_1_6=256] [L101] RET assume_abort_if_not((var_1_15 >= -922337.2036854776000e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=-127, var_1_6=256] [L102] CALL assume_abort_if_not(var_1_15 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=-127, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=-127, var_1_6=256] [L102] RET assume_abort_if_not(var_1_15 != 0.0F) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_16=47/5, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=-127, var_1_6=256] [L103] var_1_16 = __VERIFIER_nondet_double() [L104] CALL assume_abort_if_not((var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=-127, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=-127, var_1_6=256] [L104] RET assume_abort_if_not((var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=128, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=-127, var_1_6=256] [L105] var_1_21 = __VERIFIER_nondet_uchar() [L106] CALL assume_abort_if_not(var_1_21 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=-127, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=-127, var_1_6=256] [L106] RET assume_abort_if_not(var_1_21 >= 127) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=-127, var_1_6=256] [L107] CALL assume_abort_if_not(var_1_21 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=-127, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=-127, var_1_6=256] [L107] RET assume_abort_if_not(var_1_21 <= 254) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=64, var_1_23=64, var_1_3=0, var_1_5=-127, var_1_6=256] [L108] var_1_22 = __VERIFIER_nondet_uchar() [L109] CALL assume_abort_if_not(var_1_22 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_23=64, var_1_3=0, var_1_5=-127, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_23=64, var_1_3=0, var_1_5=-127, var_1_6=256] [L109] RET assume_abort_if_not(var_1_22 >= 0) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_23=64, var_1_3=0, var_1_5=-127, var_1_6=256] [L110] CALL assume_abort_if_not(var_1_22 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=127, var_1_23=64, var_1_3=0, var_1_5=-127, var_1_6=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=127, var_1_23=64, var_1_3=0, var_1_5=-127, var_1_6=256] [L110] RET assume_abort_if_not(var_1_22 <= 127) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=127, var_1_23=64, var_1_3=0, var_1_5=-127, var_1_6=256] [L125] RET updateVariables() [L126] CALL step() [L42] COND FALSE !(\read(var_1_3)) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=127, var_1_23=64, var_1_3=0, var_1_5=-127, var_1_6=256] [L47] signed long int stepLocal_2 = var_1_5 * var_1_13; VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, stepLocal_2=-16129, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=32, var_1_21=127, var_1_22=127, var_1_23=64, var_1_3=0, var_1_5=-127, var_1_6=256] [L48] COND TRUE stepLocal_2 > last_1_var_1_10 [L49] var_1_20 = ((((((((var_1_21 - var_1_14)) > ((var_1_22 + 8))) ? ((var_1_21 - var_1_14)) : ((var_1_22 + 8)))) < 0 ) ? -(((((var_1_21 - var_1_14)) > ((var_1_22 + 8))) ? ((var_1_21 - var_1_14)) : ((var_1_22 + 8)))) : (((((var_1_21 - var_1_14)) > ((var_1_22 + 8))) ? ((var_1_21 - var_1_14)) : ((var_1_22 + 8)))))) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=135, var_1_21=127, var_1_22=127, var_1_23=64, var_1_3=0, var_1_5=-127, var_1_6=256] [L51] COND TRUE (((((var_1_14 - var_1_20)) < (var_1_5)) ? ((var_1_14 - var_1_20)) : (var_1_5))) < var_1_20 VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=135, var_1_21=127, var_1_22=127, var_1_23=64, var_1_3=0, var_1_5=-127, var_1_6=256] [L52] COND FALSE !(\read(var_1_3)) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=135, var_1_21=127, var_1_22=127, var_1_23=64, var_1_3=0, var_1_5=-127, var_1_6=256] [L56] unsigned char stepLocal_1 = var_1_17 <= var_1_17; VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, stepLocal_1=0, var_1_10=256, var_1_12=41/5, var_1_13=127, var_1_14=127, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=135, var_1_21=127, var_1_22=127, var_1_23=64, var_1_3=0, var_1_5=-127, var_1_6=256] [L57] COND FALSE !(stepLocal_1 || var_1_3) [L62] var_1_12 = var_1_16 VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=127, var_1_14=127, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=135, var_1_21=127, var_1_22=127, var_1_23=64, var_1_3=0, var_1_5=-127, var_1_6=256] [L64] COND FALSE !(99999.8f < var_1_17) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=127, var_1_14=127, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=135, var_1_21=127, var_1_22=127, var_1_23=64, var_1_3=0, var_1_5=-127, var_1_6=256] [L75] COND FALSE !((var_1_17 + var_1_12) <= var_1_17) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=127, var_1_14=127, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=135, var_1_21=127, var_1_22=127, var_1_23=64, var_1_3=0, var_1_5=-127, var_1_6=256] [L80] EXPR var_1_6 ^ var_1_20 VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=127, var_1_14=127, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=135, var_1_21=127, var_1_22=127, var_1_23=64, var_1_3=0, var_1_5=-127, var_1_6=256] [L80] unsigned long int stepLocal_0 = (var_1_6 ^ var_1_20) + var_1_23; [L81] COND FALSE !(var_1_20 <= stepLocal_0) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=127, var_1_14=127, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=135, var_1_21=127, var_1_22=127, var_1_23=64, var_1_3=0, var_1_5=-127, var_1_6=256] [L126] RET step() [L127] CALL, EXPR property() [L117] EXPR (((99999.8f < var_1_17) ? ((! var_1_3) ? ((var_1_17 >= (var_1_17 / 2.5f)) ? (var_1_3 ? (var_1_1 == ((signed char) var_1_5)) : (var_1_1 == ((signed char) var_1_5))) : 1) : 1) : 1) && (var_1_3 ? (((last_1_var_1_10 + (var_1_5 + last_1_var_1_20)) >= last_1_var_1_20) ? (var_1_6 == ((unsigned short int) last_1_var_1_20)) : 1) : 1)) && ((var_1_20 <= ((var_1_6 ^ var_1_20) + var_1_23)) ? ((var_1_12 == var_1_12) ? (var_1_10 == ((unsigned long int) 0u)) : 1) : 1) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=127, var_1_14=127, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=135, var_1_21=127, var_1_22=127, var_1_23=64, var_1_3=0, var_1_5=-127, var_1_6=256] [L117-L118] return (((((((99999.8f < var_1_17) ? ((! var_1_3) ? ((var_1_17 >= (var_1_17 / 2.5f)) ? (var_1_3 ? (var_1_1 == ((signed char) var_1_5)) : (var_1_1 == ((signed char) var_1_5))) : 1) : 1) : 1) && (var_1_3 ? (((last_1_var_1_10 + (var_1_5 + last_1_var_1_20)) >= last_1_var_1_20) ? (var_1_6 == ((unsigned short int) last_1_var_1_20)) : 1) : 1)) && ((var_1_20 <= ((var_1_6 ^ var_1_20) + var_1_23)) ? ((var_1_12 == var_1_12) ? (var_1_10 == ((unsigned long int) 0u)) : 1) : 1)) && (((var_1_17 <= var_1_17) || var_1_3) ? (((var_1_17 / var_1_15) > 25.25) ? (var_1_12 == ((double) 128.5)) : 1) : (var_1_12 == ((double) var_1_16)))) && (((((((var_1_14 - var_1_20)) < (var_1_5)) ? ((var_1_14 - var_1_20)) : (var_1_5))) < var_1_20) ? (var_1_3 ? (var_1_17 == ((double) 128.1)) : 1) : 1)) && (((var_1_5 * var_1_13) > last_1_var_1_10) ? (var_1_20 == ((unsigned char) ((((((((var_1_21 - var_1_14)) > ((var_1_22 + 8))) ? ((var_1_21 - var_1_14)) : ((var_1_22 + 8)))) < 0 ) ? -(((((var_1_21 - var_1_14)) > ((var_1_22 + 8))) ? ((var_1_21 - var_1_14)) : ((var_1_22 + 8)))) : (((((var_1_21 - var_1_14)) > ((var_1_22 + 8))) ? ((var_1_21 - var_1_14)) : ((var_1_22 + 8)))))))) : 1)) && (((var_1_17 + var_1_12) <= var_1_17) ? ((var_1_6 >= var_1_6) ? (var_1_23 == ((unsigned long int) var_1_20)) : 1) : 1) ; [L127] RET, EXPR property() [L127] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=127, var_1_14=127, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=135, var_1_21=127, var_1_22=127, var_1_23=64, var_1_3=0, var_1_5=-127, var_1_6=256] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=256, last_1_var_1_20=32, var_1_10=256, var_1_12=2, var_1_13=127, var_1_14=127, var_1_16=2, var_1_17=49999999999998/5, var_1_1=-64, var_1_20=135, var_1_21=127, var_1_22=127, var_1_23=64, var_1_3=0, var_1_5=-127, var_1_6=256] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 74 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 15.5s, OverallIterations: 13, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2072 SdHoareTripleChecker+Valid, 3.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2066 mSDsluCounter, 4352 SdHoareTripleChecker+Invalid, 2.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2844 mSDsCounter, 595 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2360 IncrementalHoareTripleChecker+Invalid, 2955 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 595 mSolverCounterUnsat, 1508 mSDtfsCounter, 2360 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 730 GetRequests, 615 SyntacticMatches, 1 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 525 ImplicationChecksByTransitivity, 2.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1610occurred in iteration=9, InterpolantAutomatonStates: 91, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.4s AutomataMinimizationTime, 12 MinimizatonAttempts, 1769 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 6.1s InterpolantComputationTime, 1640 NumberOfCodeBlocks, 1640 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 1514 ConstructedInterpolants, 0 QuantifiedInterpolants, 5809 SizeOfPredicates, 7 NumberOfNonLiveVariables, 259 ConjunctsInSsa, 18 ConjunctsInUnsatCore, 14 InterpolantComputations, 11 PerfectInterpolantSequences, 5808/5880 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-10 03:42:15,422 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-3.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.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 642101326caa2098c0a839a00c9bcfc0200d095adff71c7c8d2e655beccf37a7 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 03:42:17,741 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 03:42:17,834 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-10 03:42:17,840 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 03:42:17,842 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 03:42:17,871 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 03:42:17,875 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 03:42:17,876 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 03:42:17,877 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 03:42:17,878 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 03:42:17,878 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 03:42:17,879 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 03:42:17,879 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 03:42:17,880 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 03:42:17,881 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 03:42:17,882 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 03:42:17,882 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 03:42:17,882 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 03:42:17,883 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 03:42:17,883 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 03:42:17,887 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 03:42:17,887 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 03:42:17,888 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 03:42:17,888 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 03:42:17,888 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 03:42:17,888 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 03:42:17,888 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 03:42:17,889 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 03:42:17,889 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 03:42:17,889 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 03:42:17,889 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 03:42:17,889 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 03:42:17,890 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 03:42:17,890 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 03:42:17,890 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 03:42:17,890 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 03:42:17,890 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 03:42:17,891 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 03:42:17,891 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 03:42:17,893 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 03:42:17,893 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 03:42:17,893 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 03:42:17,893 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 03:42:17,894 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 03:42:17,894 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 -> 642101326caa2098c0a839a00c9bcfc0200d095adff71c7c8d2e655beccf37a7 [2024-11-10 03:42:18,221 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 03:42:18,249 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 03:42:18,254 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 03:42:18,255 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 03:42:18,255 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 03:42:18,257 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-3.i [2024-11-10 03:42:19,828 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 03:42:20,068 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 03:42:20,069 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-3.i [2024-11-10 03:42:20,084 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98a62b55f/a113cf1bbd8d4f45b7b3a663b26c32c7/FLAG2678ab7b0 [2024-11-10 03:42:20,099 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98a62b55f/a113cf1bbd8d4f45b7b3a663b26c32c7 [2024-11-10 03:42:20,104 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 03:42:20,106 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 03:42:20,107 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 03:42:20,107 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 03:42:20,114 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 03:42:20,115 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:42:20" (1/1) ... [2024-11-10 03:42:20,116 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@403ce02a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:42:20, skipping insertion in model container [2024-11-10 03:42:20,117 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:42:20" (1/1) ... [2024-11-10 03:42:20,155 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 03:42:20,349 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-3.i[912,925] [2024-11-10 03:42:20,417 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 03:42:20,441 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 03:42:20,455 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-3.i[912,925] [2024-11-10 03:42:20,492 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 03:42:20,513 INFO L204 MainTranslator]: Completed translation [2024-11-10 03:42:20,514 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:42:20 WrapperNode [2024-11-10 03:42:20,514 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 03:42:20,515 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 03:42:20,515 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 03:42:20,516 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 03:42:20,533 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:42:20" (1/1) ... [2024-11-10 03:42:20,550 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:42:20" (1/1) ... [2024-11-10 03:42:20,584 INFO L138 Inliner]: procedures = 27, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 118 [2024-11-10 03:42:20,584 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 03:42:20,590 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 03:42:20,590 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 03:42:20,590 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 03:42:20,608 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:42:20" (1/1) ... [2024-11-10 03:42:20,608 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:42:20" (1/1) ... [2024-11-10 03:42:20,611 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:42:20" (1/1) ... [2024-11-10 03:42:20,631 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-11-10 03:42:20,633 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:42:20" (1/1) ... [2024-11-10 03:42:20,633 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:42:20" (1/1) ... [2024-11-10 03:42:20,642 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:42:20" (1/1) ... [2024-11-10 03:42:20,643 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:42:20" (1/1) ... [2024-11-10 03:42:20,644 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:42:20" (1/1) ... [2024-11-10 03:42:20,646 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:42:20" (1/1) ... [2024-11-10 03:42:20,649 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 03:42:20,650 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 03:42:20,650 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 03:42:20,650 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 03:42:20,651 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:42:20" (1/1) ... [2024-11-10 03:42:20,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 03:42:20,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 03:42:20,690 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-11-10 03:42:20,693 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-11-10 03:42:20,739 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 03:42:20,739 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-10 03:42:20,739 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 03:42:20,740 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 03:42:20,740 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 03:42:20,740 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 03:42:20,820 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 03:42:20,823 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 03:42:36,510 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-10 03:42:36,511 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 03:42:36,530 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 03:42:36,531 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 03:42:36,531 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:42:36 BoogieIcfgContainer [2024-11-10 03:42:36,532 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 03:42:36,534 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 03:42:36,534 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 03:42:36,537 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 03:42:36,538 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 03:42:20" (1/3) ... [2024-11-10 03:42:36,539 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c68ae33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:42:36, skipping insertion in model container [2024-11-10 03:42:36,539 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:42:20" (2/3) ... [2024-11-10 03:42:36,539 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c68ae33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:42:36, skipping insertion in model container [2024-11-10 03:42:36,539 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:42:36" (3/3) ... [2024-11-10 03:42:36,541 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_normal_file-3.i [2024-11-10 03:42:36,554 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 03:42:36,554 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 03:42:36,615 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 03:42:36,626 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;@5e45641c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 03:42:36,626 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 03:42:36,632 INFO L276 IsEmpty]: Start isEmpty. Operand has 63 states, 45 states have (on average 1.4444444444444444) internal successors, (65), 46 states have internal predecessors, (65), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-10 03:42:36,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-10 03:42:36,647 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:42:36,647 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 03:42:36,649 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:42:36,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:42:36,656 INFO L85 PathProgramCache]: Analyzing trace with hash -2090833946, now seen corresponding path program 1 times [2024-11-10 03:42:36,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 03:42:36,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [47087175] [2024-11-10 03:42:36,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:42:36,668 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 03:42:36,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 03:42:36,671 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 03:42:36,672 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-10 03:42:37,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:42:37,714 INFO L255 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-10 03:42:37,725 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 03:42:37,769 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 208 proven. 0 refuted. 0 times theorem prover too weak. 212 trivial. 0 not checked. [2024-11-10 03:42:37,770 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 03:42:37,771 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 03:42:37,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [47087175] [2024-11-10 03:42:37,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [47087175] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:42:37,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:42:37,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 03:42:37,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920930820] [2024-11-10 03:42:37,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:42:37,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 03:42:37,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 03:42:37,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 03:42:37,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 03:42:37,812 INFO L87 Difference]: Start difference. First operand has 63 states, 45 states have (on average 1.4444444444444444) internal successors, (65), 46 states have internal predecessors, (65), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-10 03:42:37,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:42:37,844 INFO L93 Difference]: Finished difference Result 118 states and 198 transitions. [2024-11-10 03:42:37,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 03:42:37,847 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 104 [2024-11-10 03:42:37,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:42:37,852 INFO L225 Difference]: With dead ends: 118 [2024-11-10 03:42:37,853 INFO L226 Difference]: Without dead ends: 58 [2024-11-10 03:42:37,855 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 03:42:37,859 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 03:42:37,859 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 03:42:37,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-11-10 03:42:37,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2024-11-10 03:42:37,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 41 states have (on average 1.3658536585365855) internal successors, (56), 41 states have internal predecessors, (56), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-10 03:42:37,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 86 transitions. [2024-11-10 03:42:37,898 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 86 transitions. Word has length 104 [2024-11-10 03:42:37,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:42:37,899 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 86 transitions. [2024-11-10 03:42:37,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-10 03:42:37,899 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 86 transitions. [2024-11-10 03:42:37,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-10 03:42:37,902 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:42:37,902 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 03:42:37,934 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-10 03:42:38,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 03:42:38,107 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:42:38,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:42:38,108 INFO L85 PathProgramCache]: Analyzing trace with hash -1387268217, now seen corresponding path program 1 times [2024-11-10 03:42:38,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 03:42:38,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [525672514] [2024-11-10 03:42:38,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:42:38,109 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 03:42:38,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 03:42:38,111 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 03:42:38,112 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-10 03:42:39,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:42:39,074 INFO L255 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 03:42:39,084 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 03:42:41,895 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-10 03:42:41,895 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 03:42:41,896 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 03:42:41,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [525672514] [2024-11-10 03:42:41,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [525672514] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:42:41,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:42:41,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 03:42:41,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043519097] [2024-11-10 03:42:41,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:42:41,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 03:42:41,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 03:42:41,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 03:42:41,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 03:42:41,902 INFO L87 Difference]: Start difference. First operand 58 states and 86 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-10 03:42:46,322 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.18s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 03:42:50,326 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 03:42:54,586 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.26s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 03:42:58,601 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 03:43:02,927 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.21s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 03:43:07,239 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.31s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 03:43:10,869 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.57s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 03:43:12,685 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.82s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 03:43:19,219 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.31s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 03:43:23,240 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []